A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph. - Kristóf Bérczi; Satoru Fujishige; Naoyuki Kamiyama (Inf. Process. Lett., 2009)

Restricted b-Matchings in Degree-Bounded Graphs. - Kristóf Bérczi; László A. Végh (IPCO, 2010)

ILP based diverse path routing with node inclusion. - Zsolt Lakatos; Lajos Bajzik; Tamás Kárász; Kristóf Bérczi; Erika R. Kovács; László A. Végh (ICUMT, 2011)

An algorithm for (n-3)-connectivity augmentation problem: Jump system approach. - Kristóf Bérczi; Yusuke Kobayashi 001 (J. Comb. Theory B, 2012)

Regular Graphs are Antimagic. - Kristóf Bérczi; Attila Bernáth; Máté Vizer (Electron. J. Comb., 2015)

A Note on $ mathtt{V}$-free 2-matchings. - Kristóf Bérczi; Attila Bernáth; Máté Vizer (Electron. J. Comb., 2016)

Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs. - Kristóf Bérczi; András Frank (CoRR, 2016)

Covering Intersecting Bi-set Families under Matroid Constraints. - Kristóf Bérczi; Tamás Király; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2016)

Global and Fixed-Terminal Cuts in Digraphs. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (APPROX-RANDOM, 2017)

The Directed Disjoint Shortest Paths Problem. - Kristóf Bérczi; Yusuke Kobayashi 001 (ESA, 2017)

Packing strictly-shortest paths in a tree for QoS-aware routing. - Jose Yallouz; János Tapolcai; Attila Körösi; Kristóf Bérczi; László Gyimóthi; Ariel Orda (Networking, 2017)

King-Serf Duo by Monochromatic Paths in k-Edge-Coloured Tournaments. - Kristóf Bérczi; Attila Joó (Electron. J. Comb., 2017)

An algorithm for identifying cycle-plus-triangles graphs. - Kristóf Bérczi; Yusuke Kobayashi 001 (Discret. Appl. Math., 2017)

Directed hypergraphs and Horn minimization. - Kristóf Bérczi; Erika R. Bérczi-Kovács (Inf. Process. Lett., 2017)

A tight -approximation for Linear 3-Cut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan (SODA, 2018)

Arrival time dependent routing policies in public transport. - Kristóf Bérczi; Alpár Jüttner; Marco Laumanns; Jácint Szabó (Discret. Appl. Math., 2018)

Blocking optimal structures. - Kristóf Bérczi; Attila Bernáth; Tamás Király; Gyula Pap (Discret. Math., 2018)

Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. - Kristóf Bérczi; András Frank (Math. Oper. Res., 2018)

Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. - Kristóf Bérczi; András Frank (Math. Oper. Res., 2018)

Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs. - Kristóf Bérczi; András Frank (Math. Oper. Res., 2018)

Making Bipartite Graphs DM-Irreducible. - Kristóf Bérczi; Satoru Iwata 001; Jun Kato 003; Yutaro Yamaguchi 001 (SIAM J. Discret. Math., 2018)

Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. - Kristóf Bérczi; André Berger; Matthias Mnich; Roland Vincze (CoRR, 2019)

List colouring of two matroids through reduction to partition matroids. - Kristóf Bérczi; Tamás Schwarcz; Yutaro Yamaguchi 001 (CoRR, 2019)

Packing tree degree sequences. - Kristóf Bérczi; Zoltán Király; Changshuo Liu; István Miklós (Informatica (Slovenia), 2019)

Beating the 2-approximation factor for global bicut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (Math. Program., 2019)

Rainbow and monochromatic circuits and cuts in binary matroids. - Kristóf Bérczi; Tamás Schwarcz (CoRR, 2020)

Improving the integrality gap for multiway cut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan (Math. Program., 2020)

A tight $ sqrt{2}$-approximation for linear 3-cut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan (Math. Program., 2020)

A dual approach for dynamic pricing in multi-demand markets. - Kristóf Bérczi; Erika R. Bérczi-Kovács; Evelin Szögi (CoRR, 2021)

Complexity of packing common bases in matroids. - Kristóf Bérczi; Tamás Schwarcz (Math. Program., 2021)

Market Pricing for Matroid Rank Valuations. - Kristóf Bérczi; Naonori Kakimura; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2021)

List Coloring of Two Matroids through Reduction to Partition Matroids. - Kristóf Bérczi; Tamás Schwarcz; Yutaro Yamaguchi 001 (SIAM J. Discret. Math., 2021)

Generating clause sequences of a CNF formula. - Kristóf Bérczi; Endre Boros; Ondrej Cepek; Khaled M. Elbassioni; Petr Kucera; Kazuhisa Makino (Theor. Comput. Sci., 2021)

Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems. - Kristóf Bérczi; Matthias Mnich; Roland Vincze (CoRR, 2022)

Manipulating the outcome of stable matching and roommates problems. - Kristóf Bérczi; Gergely Kál Csáji; Tamás Király (CoRR, 2022)

Resolving Infeasibility of Linear Systems: A Parameterized Approach. - Kristóf Bérczi; Alexander Göke; Lydia Mirabel Mendoza Cadena; Matthias Mnich (CoRR, 2022)

Rainbow and monochromatic circuits and cocircuits in binary matroids. - Kristóf Bérczi; Tamás Schwarcz (Discret. Math., 2022)

Approximating Minimum Representations of Key Horn Functions. - Kristóf Bérczi; Endre Boros; Ondrej Cepek; Petr Kucera; Kazuhisa Makino (SIAM J. Comput., 2022)

Unique key Horn functions. - Kristóf Bérczi; Endre Boros; Ondrej Cepek; Petr Kucera; Kazuhisa Makino (Theor. Comput. Sci., 2022)

Approximation by lexicographically maximal solutions in matching and matroid intersection problems. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (Theor. Comput. Sci., 2022)

A 3/2-Approximation for the Metric Many-Visits Path TSP. - Kristóf Bérczi; Matthias Mnich; Roland Vincze (SIAM J. Discret. Math., 2022)

Envy-free dynamic pricing schemes. - Kristóf Bérczi; Laura Codazzi; Julian Golak; Alexander Grigoriev (CoRR, 2023)

Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and 𝓁∞-norm objectives. - Kristóf Bérczi; Lydia Mirabel Mendoza Cadena; Kitti Varga (CoRR, 2023)

Newton-type algorithms for inverse optimization II: weighted span objective. - Kristóf Bérczi; Lydia Mirabel Mendoza Cadena; Kitti Varga (CoRR, 2023)

Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Shubhang Kulkarni (CoRR, 2023)

Inverse optimization problems with multiple weight functions. - Kristóf Bérczi; Lydia Mirabel Mendoza Cadena; Kitti Varga (Discret. Appl. Math., 2023)

Analyzing Residual Random Greedy for monotone submodular maximization. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Aditya Pillai (Inf. Process. Lett., 2023)

Hypergraph characterization of split matroids. - Kristóf Bérczi; Tamás Király; Tamás Schwarcz; Yutaro Yamaguchi 001; Yu Yokoi (J. Comb. Theory A, 2023)

On the complexity of packing rainbow spanning trees. - Kristóf Bérczi; Gergely Kál Csáji; Tamás Király (Discret. Math., 2023)

Matroid Intersection under Restricted Oracles. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (SIAM J. Discret. Math., 2023)

On approximating the rank of graph divisors. - Kristóf Bérczi; Hung P. Hoang 001; Lilla Tóthmérész (Discret. Math., 2023)

A Dual Approach for Dynamic Pricing in Multidemand Markets. - Kristóf Bérczi; Erika R. Bérczi-Kovács; Evelin Szögi (SIAM J. Discret. Math., 2023)

Approximating Maximum-Size Properly Colored Forests. - Yuhang Bai; Kristóf Bérczi; Gergely Csáji; Tamás Schwarcz (ESA, 2024)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Shubhang Kulkarni (ESA, 2024)

Splitting-Off in Hypergraphs. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Shubhang Kulkarni (ICALP, 2024)

Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective. - Kristóf Bérczi; Lydia Mirabel Mendoza Cadena; Kitti Varga (LATIN (2), 2024)

Multiway Cuts with a Choice of Representatives. - Kristóf Bérczi; Tamás Király; Daniel P. Szabo (MFCS, 2024)

Reconfiguration of Basis Pairs in Regular Matroids. - Kristóf Bérczi; Bence Mátravölgyi; Tamás Schwarcz (STOC, 2024)

Matroid Intersection under Minimum Rank Oracle. - Mihály Bárász; Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2024)

Cyclic ordering of split matroids. - Kristóf Bérczi; Áron Jánosik; Bence Mátravölgyi (CoRR, 2024)

Rainbow Arborescence Conjecture. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2024)

Weighted exchange distance of basis pairs. - Kristóf Bérczi; Bence Mátravölgyi; Tamás Schwarcz (Discret. Appl. Math., 2024)

Manipulating the outcome of stable marriage and roommates problems. - Kristóf Bérczi; Gergely Csáji; Tamás Király (Games Econ. Behav., 2024)

Hypergraph Horn Functions. - Kristóf Bérczi; Endre Boros; Kazuhisa Makino (SIAM J. Discret. Math., 2024)

Envy-free relaxations for goods, chores, and mixed items. - Kristóf Bérczi; Erika R. Bérczi-Kovács; Endre Boros; Fekadu Tolessa Gedefa; Naoyuki Kamiyama; Telikepalli Kavitha; Yusuke Kobayashi 001; Kazuhisa Makino (Theor. Comput. Sci., 2024)

Partitioning into common independent sets via relaxing strongly base orderability. - Kristóf Bérczi; Tamás Schwarcz (J. Comb. Theory A, 2024)

Exchange Distance of Basis Pairs in Split Matroids. - Kristóf Bérczi; Tamás Schwarcz (SIAM J. Discret. Math., 2024)

Matroid Horn functions. - Kristóf Bérczi; Endre Boros; Kazuhisa Makino (J. Comb. Theory A, 2024)

Scheduling with non-renewable resources: minimizing the sum of completion times. - Kristóf Bérczi; Tamás Király; Simon Omlor (J. Sched., 2024)

Matroid Secretary via Labeling Schemes. - Kristóf Bérczi; Vasilis Livanos; José A. Soto; Victor Verdugo (IPCO, 2025)

Matroid Products via Submodular Coupling. - Kristóf Bérczi; Boglárka Gehér; András Imolay; László Lovász 001; Balázs Maga; Tamás Schwarcz (STOC, 2025)

Finding spanning trees with perfect matchings. - Kristóf Bérczi; Tamás Király; Yusuke Kobayashi 001; Yutaro Yamaguchi 001; Yu Yokoi (Discret. Appl. Math., 2025)

Approximating Submodular Matroid-Constrained Partitioning. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Daniel P. Szabo (CoRR, 2025)

Inverse matroid optimization under subset constraints. - Kristóf Bérczi; Lydia Mirabel Mendoza Cadena; José A. Soto (CoRR, 2025)

Interaction between skew-representability, tensor products, extension properties, and rank inequalities. - Kristóf Bérczi; Boglárka Gehér; András Imolay; László Lovász 001; Carles Padró; Tamás Schwarcz (CoRR, 2025)