Items where Author is "Bérczi, Kristóf"

Article

Bérczi, Kristóf and Bérczi-Kovács, Erika R. and Boros, Endre and Gedefa, Fekadu Tolessa and Kamiyama, Naoyuki and Kavitha, Telikepalli and Kobayashi, Yusuke and Makino, Kazuhisa (2024) Envy-free relaxations for goods, chores, and mixed items. Theoretical Computer Science, 1002. p. 114596. ISSN 03043975

Bérczi, Kristóf and Mendoza-Cadena, Lydia Mirabel and Varga, Kitti Katalin (2023) Inverse optimization problems with multiple weight functions. DISCRETE APPLIED MATHEMATICS, 327. pp. 134-147. ISSN 0166-218X

Bérczi, Kristóf and Hoang, Hung P. and Tóthmérész, Lilla (2023) On approximating the rank of graph divisors. DISCRETE MATHEMATICS, 346 (9). ISSN 0012-365X

Bérczi, Kristóf and Csáji, Gergely and Király, Tamás (2023) On the Complexity of Packing Rainbow Spanning Trees. DISCRETE MATHEMATICS, 346 (4). pp. 1-8. ISSN 0012-365X (print); 1872-681X (online)

Bérczi, Kristóf and Bérczi-Kovács, Erika and Szögi, Evelin (2023) A dual approach for dynamic pricing in multidemand markets. SIAM JOURNAL ON DISCRETE MATHEMATICS, 37 (3). pp. 1771-1787. ISSN 0895-4801

Bérczi, Kristóf and Mnich, Matthias and Vincze, Roland (2022) A 3/2-Approximation for the Metric Many-Visits Path TSP. SIAM JOURNAL ON DISCRETE MATHEMATICS, 36 (4). pp. 2995-3030. ISSN 0895-4801

Bérczi, Kristóf and Király, Tamás and Yamaguchi, Yutaro and Yokoi, Yu (2022) Approximation by lexicographically maximal solutions in matching and matroid intersection problems. THEORETICAL COMPUTER SCIENCE, 910. pp. 48-53. ISSN 0304-3975

Bérczi, Kristóf and Schwarcz, Tamás Bence (2022) Rainbow and monochromatic circuits and cocircuits in binary matroids. DISCRETE MATHEMATICS, 345 (6). ISSN 0012-365X

Bérczi, Kristóf and Boros, Endre and Cepek, Ondrej and Kucera, Petr and Makino, Kazuhisa (2021) Approximating minimum representations of key Horn functions. SIAM JOURNAL ON COMPUTING. ISSN 0097-5397 (print); 1095-7111 (online) (Submitted)

Bérczi, Kristóf and Boros, Endre and Cepek, Ondrej and Elbassioni, Khaled and Kucera, Petr and Makino, Kazuhisa (2021) Generating clause sequences of a CNF formula. THEORETICAL COMPUTER SCIENCE, 856 (8). pp. 68-74. ISSN 0304-3975

Bérczi, Kristóf and Boros, Endre and Čepek, Ondřej and Elbassioni, Khaled and Kučera, Petr (2021) Generating clause sequences of a CNF formula. THEORETICAL COMPUTER SCIENCE, 856. pp. 68-74. ISSN 0304-3975

Bérczi, Kristóf and Schwarcz, Tamás and Yamaguchi, Yutaro (2021) List colouring of two matroids through reduction to partition matroids. SIAM JOURNAL ON DISCRETE MATHEMATICS. ISSN 0895-4801 (In Press)

Bérczi, Kristóf and Kakimura, Naonori and Kobayashi, Yusuke (2021) MARKET PRICING FOR MATROID RANK VALUATIONS\ast. SIAM JOURNAL ON DISCRETE MATHEMATICS, 35 (4). pp. 2662-2678. ISSN 0895-4801

Bérczi, Kristóf and Kakimura, Naonori and Kobayashi, Yusuke (2021) Market Pricing for Matroid Rank Valuations. SIAM JOURNAL ON DISCRETE MATHEMATICS. ISSN 0895-4801 (In Press)

Tóbiás, Roland and Bérczi, Kristóf and Szabó, Csaba and Császár, Attila Géza (2021) autoECART: Automatic energy conservation analysis of rovibronic transitions. Journal of Quantitative Spectroscopy and Radiative Transfer. ISSN 0022-4073

Bérczi, Kristóf and Schwarcz, Tamás (2020) Complexity of packing common bases in matroids. MATHEMATICAL PROGRAMMING. ISSN 0025-5610

Bérczi, Kristóf and Chandrasekaran, Karthekeyan and Király, Tamás and Madan, Vivek (2020) Improving the integrality gap for multiway cut. MATHEMATICAL PROGRAMMING. ISSN 0025-5610

Bérczi, Kristóf and Király, Zoltán and Liu, Changshuo and Miklós, István (2020) Packing tree degree sequences. GRAPHS AND COMBINATORICS. pp. 1-7. ISSN 0911-0119 (print); 1435-5914 (online)

Bérczi, Kristóf and Király, Tamás and Omlor, S. (2020) Scheduling with non-renewable resources: Minimizing the sum of completion times. LECTURE NOTES IN COMPUTER SCIENCE, 12176. pp. 167-178. ISSN 0302-9743

Bérczi, Kristóf and Chandrasekaran, Karthekeyan and Király, Tamás and Lee, E. and Xu, C. (2019) Beating the 2-approximation factor for Global Bicut. MATHEMATICAL PROGRAMMING. ISSN 0025-5610

Bérczi, Kristóf and Chandrasekaran, Karthekeyan and Király, Tamás and Madan, Vivek (2019) A tight sqrt(2)-approximation for linear 3-cut. MATHEMATICAL PROGRAMMING. ISSN 0025-5610

Bérczi, Kristóf and Jüttner, Alpár and Laumanns, Marco and Szabó, Jácint (2018) Arrival time dependent routing policies in public transport. Discrete Applied Mathematics. pp. 1-10. ISSN 0166-218X

Bérczi, Kristóf and Frank, András (2018) Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. MATHEMATICS OF OPERATIONS RESEARCH, 43 (3). pp. 726-753. ISSN 0364-765X

Bérczi, Kristóf and Jüttner, Alpár and Laumanns, Marco and Szabó, Jácint (2017) Stochastic Route Planning in Public Transport. TRANSPORTATION RESEARCH PROCEDIA. pp. 1-8. ISSN 2352-1465

Bérczi, Kristóf and Király, Tamás and Kobayashi, Yosuke (2016) Covering Intersecting Bi-set Families under Matroid Constraints. SIAM JOURNAL ON DISCRETE MATHEMATICS, 30 (3). pp. 1758-1774. ISSN 0895-4801

Bérczi, Kristóf and Bernáth, Attila and Vizer, Máté (2016) A note on V-free 2-matchings. ELECTRONIC JOURNAL OF COMBINATORICS, 23 (4). P4.27. ISSN 1097-1440

Bérczi, Kristóf and Bernáth, Attila and Vizer, Máté (2015) Regular graphs are antimagic. The Electronic Journal of Combinatorics, 22 (3). #P3.34. ISSN 1077-8926

Book Section

Bérczi, Kristóf and Király, Tamás and Omlor, Simon (2020) Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. In: Combinatorial Optimization. ISCO 2020. Springer.

Bajzik, L. and Bernáth, Attila and Bérczi, Kristóf and Jordán, Tibor and Jüttner, Alpár and Király, Tamás and Kovács, Erika and Végh, László (2011) Worst case bin packing for OTN electrical layer networks dimensioning. In: 13th International Conference on Transparent Optical Networks, ICTON 2011. IEEE, New York, pp. 43-49. ISBN 9781457708800

Monograph

Bérczi, Kristóf and Mnich, Matthias and Vincze, Roland (2020) A 3/2-Approximation for the Metric Many-visits Path TSP. Technical Report. UNSPECIFIED.

Bérczi, Kristóf and Bérczi-Kovács, Erika Renáta and Boros, Endre and Gedefa, Fekadu Tolessa and Kamiyama, Naoyuki and Telikepalli, Kavitha and Kobayashi, Yusuke and Makino, Kazuhisa (2020) Envy-free Relaxations for Goods, Chores, and Mixed Items. Technical Report. UNSPECIFIED.

Bérczi, Kristóf and Boros, Endre and Cepek, Ondrej and Kucera, Petr and Makino, Kazuhisa (2020) Unique key Horn functions. Technical Report. UNSPECIFIED.

Bérczi, Kristóf and Berger, André and Mnich, Matthias and Vincze, Roland (2019) Degree-bounded generalized polymatroids and approximating the metric many-visits TSP. Technical Report. UNSPECIFIED.

Conference or Workshop Item

Bérczi, Kristóf and Király, Tamás and Kobayashi, Yusuke (2015) Algorithmic aspects of covering supermodular functions under matroid constraints. In: 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2-5 June 2015, Fukuoka, Japán.