Kristóf Bérczi

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 93

Top Venues

CoRR

SIAM J. Discret. Math.

Discret. Appl. Math.

Math. Program.

Publications

Kristóf Bérczi, Tamás Király, Daniel P. Szabo
Multiway Cuts with a Choice of Representatives. MFCS (2024)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR (2024)
Kristóf Bérczi, Tamás Schwarcz
Partitioning into common independent sets via relaxing strongly base orderability. J. Comb. Theory, Ser. A 202 (2024)
Kristóf Bérczi, Tamás Schwarcz
Exchange Distance of Basis Pairs in Split Matroids. SIAM J. Discret. Math. 38 (1) (2024)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. 1002 (2024)
Kristóf Bérczi, Endre Boros, Kazuhisa Makino
Hypergraph Horn Functions. SIAM J. Discret. Math. 38 (2) (2024)
Kristóf Bérczi, Tamás Király, Simon Omlor
Scheduling with non-renewable resources: minimizing the sum of completion times. J. Sched. 27 (2) (2024)
Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
Reconfiguration of Basis Pairs in Regular Matroids. STOC (2024)
Yuhang Bai, Kristóf Bérczi, Gergely Kál Csáji, Tamás Schwarcz
Approximating maximum-size properly colored forests. CoRR (2024)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
Splitting-Off in Hypergraphs. ICALP (2024)
Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
Weighted exchange distance of basis pairs. Discret. Appl. Math. 349 (2024)
Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga
Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective. LATIN (2) (2024)
Kristóf Bérczi, Tamás Király, Daniel P. Szabo
Multiway Cuts with a Choice of Representatives. CoRR (2024)
Mihály Bárász, Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Minimum Rank Oracle. CoRR (2024)
Kristóf Bérczi, Endre Boros, Kazuhisa Makino
Matroid Horn functions. J. Comb. Theory, Ser. A 203 (2024)
Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
Finding Spanning Trees with Perfect Matchings. CoRR (2024)
Kristóf Bérczi, Gergely Csáji, Tamás Király
Manipulating the outcome of stable marriage and roommates problems. Games Econ. Behav. 147 (2024)
Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga
Newton-type algorithms for inverse optimization II: weighted span objective. CoRR (2023)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Evelin Szögi
A Dual Approach for Dynamic Pricing in Multidemand Markets. SIAM J. Discret. Math. 37 (3) (2023)
Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga
Inverse optimization problems with multiple weight functions. Discret. Appl. Math. 327 (2023)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. CoRR (2023)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. 37 (2) (2023)
Kristóf Bérczi, Laura Codazzi, Julian Golak, Alexander Grigoriev
Envy-free dynamic pricing schemes. CoRR (2023)
Kristóf Bérczi, Endre Boros, Kazuhisa Makino
Matroid Horn functions. CoRR (2023)
Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
Reconfiguration of basis pairs in regular matroids. CoRR (2023)
Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész
On approximating the rank of graph divisors. Discret. Math. 346 (9) (2023)
Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga
-norm objectives. CoRR (2023)
Kristóf Bérczi, Tamás Schwarcz
Partitioning into common independent sets via relaxing strongly base orderability. CoRR (2023)
Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
Hypergraph characterization of split matroids. J. Comb. Theory, Ser. A 194 (2023)
Kristóf Bérczi, Endre Boros, Kazuhisa Makino
Hypergraph Horn functions. CoRR (2023)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai
Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. 180 (2023)
Kristóf Bérczi, Gergely Csáji, Tamás Király
On the complexity of packing rainbow spanning trees. Discret. Math. 346 (4) (2023)
Kristóf Bérczi, Tamás Schwarcz
Exchange distance of basis pairs in split matroids. CoRR (2022)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Unique key Horn functions. Theor. Comput. Sci. 922 (2022)
Kristóf Bérczi, Gergely Csáji, Tamás Király
Manipulating the outcome of stable matching and roommates problems. CoRR (2022)
Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
Weighted exchange distance of basis pairs. CoRR (2022)
Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
Hypergraph characterization of split matroids. CoRR (2022)
Kristóf Bérczi, Tamás Schwarcz
Rainbow and monochromatic circuits and cocircuits in binary matroids. Discret. Math. 345 (6) (2022)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. 51 (1) (2022)
Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész
On approximating the rank of graph divisors. CoRR (2022)
Kristóf Bérczi, Matthias Mnich, Roland Vincze
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems. CoRR (2022)
Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga
Inverse optimization problems with multiple weight functions. CoRR (2022)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Restricted Oracles. CoRR (2022)
Kristóf Bérczi, Alexander Göke, Lydia Mirabel Mendoza Cadena, Matthias Mnich
Resolving Infeasibility of Linear Systems: A Parameterized Approach. CoRR (2022)
Kristóf Bérczi, Matthias Mnich, Roland Vincze
A 3/2-Approximation for the Metric Many-Visits Path TSP. SIAM J. Discret. Math. 36 (4) (2022)
Kristóf Bérczi, Gergely Csáji, Tamás Király
On the complexity of packing rainbow spanning trees. CoRR (2022)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Approximation by lexicographically maximal solutions in matching and matroid intersection problems. Theor. Comput. Sci. 910 (2022)
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
Market Pricing for Matroid Rank Valuations. SIAM J. Discret. Math. 35 (4) (2021)
Kristóf Bérczi, Tamás Schwarcz
Complexity of packing common bases in matroids. Math. Program. 188 (1) (2021)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Evelin Szögi
A dual approach for dynamic pricing in multi-demand markets. CoRR (2021)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
Generating clause sequences of a CNF formula. Theor. Comput. Sci. 856 (2021)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR (2021)
Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
List Coloring of Two Matroids through Reduction to Partition Matroids. SIAM J. Discret. Math. 35 (3) (2021)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Unique key Horn functions. CoRR (2020)
Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR (2020)
Kristóf Bérczi, Tamás Király, Simon Omlor
Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. ISCO (2020)
Kristóf Bérczi, Tamás Schwarcz
Rainbow and monochromatic circuits and cuts in binary matroids. CoRR (2020)
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
Market Pricing for Matroid Rank Valuations. CoRR (2020)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
Generating clause sequences of a CNF formula. CoRR (2020)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
A tight $\sqrt{2}$-approximation for linear 3-cut. Math. Program. 184 (1) (2020)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
Improving the integrality gap for multiway cut. Math. Program. 183 (1) (2020)
Kristóf Bérczi, Matthias Mnich, Roland Vincze
A 3/2-Approximation for the Metric Many-visits Path TSP. CoRR (2020)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Approximating minimum representations of key Horn functions. ISAIM (2020)
Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
Market Pricing for Matroid Rank Valuations. ISAAC (2020)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Beating the 2-approximation factor for global bicut. Math. Program. 177 (1-2) (2019)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
Improving the Integrality Gap for Multiway Cut. IPCO (2019)
Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. CoRR (2019)
Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
List colouring of two matroids through reduction to partition matroids. CoRR (2019)
Kristóf Bérczi, Tamás Schwarcz
Complexity of packing common bases in matroids. CoRR (2019)
Kristóf Bérczi, Tamás Király, Simon Omlor
Scheduling with Non-Renewable Resources: Minimizing the Sum of Completion Times. CoRR (2019)
Kristóf Bérczi, Zoltán Király, Changshuo Liu, István Miklós
Packing tree degree sequences. Informatica (Slovenia) 43 (1) (2019)
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
Making Bipartite Graphs DM-Irreducible. SIAM J. Discret. Math. 32 (1) (2018)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
Improving the Integrality Gap for Multiway Cut. CoRR (2018)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
A tight -approximation for Linear 3-Cut. SODA (2018)
Kristóf Bérczi, Alpár Jüttner, Marco Laumanns, Jácint Szabó
Arrival time dependent routing policies in public transport. Discret. Appl. Math. 251 (2018)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. Math. Oper. Res. 43 (3) (2018)
Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
Approximating minimum representations of key Horn functions. CoRR (2018)
Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap
Blocking optimal structures. Discret. Math. 341 (7) (2018)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs. Math. Oper. Res. 43 (3) (2018)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. Math. Oper. Res. 43 (3) (2018)
Kristóf Bérczi, Yusuke Kobayashi
The Directed Disjoint Shortest Paths Problem. ESA (2017)
Kristóf Bérczi, Yusuke Kobayashi
An algorithm for identifying cycle-plus-triangles graphs. Discret. Appl. Math. 226 (2017)
Jose Yallouz, János Tapolcai, Attila Körösi, Kristóf Bérczi, László Gyimóthi, Ariel Orda
Packing strictly-shortest paths in a tree for QoS-aware routing. Networking (2017)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM (2017)
Kristóf Bérczi, Attila Joó
King-Serf Duo by Monochromatic Paths in k-Edge-Coloured Tournaments. Electron. J. Comb. 24 (1) (2017)
Kristóf Bérczi, Erika R. Bérczi-Kovács
Directed hypergraphs and Horn minimization. Inf. Process. Lett. 128 (2017)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs. CoRR (2016)
Kristóf Bérczi, Tamás Király, Yusuke Kobayashi
Covering Intersecting Bi-set Families under Matroid Constraints. SIAM J. Discret. Math. 30 (3) (2016)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Global and fixed-terminal cuts in digraphs. CoRR (2016)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. CoRR (2016)
Kristóf Bérczi, András Frank
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. CoRR (2016)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
A Note on $\mathtt{V}$-free 2-matchings. Electron. J. Comb. 23 (4) (2016)
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
Making Bipartite Graphs DM-irreducible. CoRR (2016)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
A note on $\mathtt{V}$-free $2$-matchings. CoRR (2015)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
Regular graphs are antimagic. CoRR (2015)
Kristóf Bérczi, Attila Bernáth, Máté Vizer
Regular Graphs are Antimagic. Electron. J. Comb. 22 (3) (2015)
Kristóf Bérczi, Yusuke Kobayashi
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach. J. Comb. Theory, Ser. B 102 (3) (2012)
Zsolt Lakatos, Lajos Bajzik, Tamas Karasz, Kristóf Bérczi, Erika R. Kovács, László A. Végh
ILP based diverse path routing with node inclusion. ICUMT (2011)
Kristóf Bérczi, László A. Végh
-Matchings in Degree-Bounded Graphs. IPCO (2010)
Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph. Inf. Process. Lett. 109 (23-24) (2009)

Kristóf Bérczi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kristóf Bérczi