Kristóf Bérczi

129 papers A* 5A 3B 6C 1Misc 1Journal 110Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Approximating maximum-size properly colored forests. Eur. J. Comb. Yuhang Bai, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz
2026	J	`jnl`	Approximating submodular matroid-constrained partitioning. Theor. Comput. Sci. Kristóf Bérczi, Tamás Király, Daniel P. Szabo, Karthekeyan Chandrasekaran
2026	J	`jnl`	Cycle matroids of graphings: From convergence to duality. J. Comb. Theory B Kristóf Bérczi, Márton Borbényi, László Lovász, László Márton Tóth
2026	J	`jnl`	Cyclic Ordering of Split Matroids. Electron. J. Comb. Kristóf Bérczi, Áron Jánosik, Bence Mátravölgyi
2026	A*	`conf`	Interaction Between Skew-representability, Tensor Products, Extension Properties, and Rank Inequalities. SODA Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Carles Padró, Tamás Schwarcz
2026	J	`jnl`	Monotonic Decompositions of Submodular Set Functions. SIAM J. Discret. Math. Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Tamás Schwarcz
2026	J	`jnl`	Multiway cuts with a choice of representatives. Discret. Appl. Math. Kristóf Bérczi, Tamás Király, Daniel P. Szabo
2026	J	`jnl`	Quotient-Convergence of Submodular Setfunctions. Comb. Kristóf Bérczi, Márton Borbényi, László Lovász, László Márton Tóth
2026	J	`jnl`	Reconfiguration of basis pairs in regular matroids. J. Comb. Theory B Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
2026	J	`jnl`	Splitting-off in hypergraphs. J. Comb. Theory B Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2025	J	`jnl`	A note on embracing exchange sequences in oriented matroids. CoRR Kristóf Bérczi, Benedek Nádor
2025	J	`jnl`	Approximating Submodular Matroid-Constrained Partitioning. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Daniel P. Szabo
2025	J	`jnl`	Approximating maximum properly colored forests via degree bounded independent sets. CoRR Yuhang Bai, Kristóf Bérczi, Johanna K. Siemelink
2025	J	`jnl`	Envy-Free Dynamic Pricing Schemes. Oper. Res. Kristóf Bérczi, Laura Codazzi, Julian Golak, Alexander Grigoriev
2025	J	`jnl`	Finding spanning trees with perfect matchings. Discret. Appl. Math. Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
2025	J	`jnl`	Fixed-parameter tractability and hardness for Steiner rooted and locally connected orientations. CoRR Kristóf Bérczi, Florian Hörsch, András Imolay, Tamás Schwarcz
2025	J	`jnl`	Free-order secretary for two-sided independence systems. CoRR Kristóf Bérczi, Vasilis Livanos, José A. Soto, Victor Verdugo
2025	J	`jnl`	Interaction between skew-representability, tensor products, extension properties, and rank inequalities. CoRR Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Carles Padró, Tamás Schwarcz
2025	J	`jnl`	Inverse matroid optimization under subset constraints. CoRR Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, José A. Soto
2025	A*	`conf`	Matroid Products via Submodular Coupling. STOC Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Balázs Maga, Tamás Schwarcz
2025	B	`conf`	Matroid Secretary via Labeling Schemes. IPCO Kristóf Bérczi, Vasilis Livanos, José A. Soto, Victor Verdugo
2025	J	`jnl`	Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and ℓ Optim. Lett. Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
2025	J	`jnl`	{s,t}-Separating Principal Partition Sequence of Submodular Functions. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Daniel P. Szabo
2024	A	`conf`	Approximating Maximum-Size Properly Colored Forests. ESA Yuhang Bai, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz
2024	J	`jnl`	Approximating maximum-size properly colored forests. CoRR Yuhang Bai, Kristóf Bérczi, Gergely Kál Csáji, Tamás Schwarcz
2024	J	`jnl`	Cyclic ordering of split matroids. CoRR Kristóf Bérczi, Áron Jánosik, Bence Mátravölgyi
2024	J	`jnl`	Envy-free relaxations for goods, chores, and mixed items. Theor. Comput. Sci. Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2024	J	`jnl`	Exchange Distance of Basis Pairs in Split Matroids. SIAM J. Discret. Math. Kristóf Bérczi, Tamás Schwarcz
2024	J	`jnl`	Finding Spanning Trees with Perfect Matchings. CoRR Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
2024	A	`conf`	Hypergraph Connectivity Augmentation in Strongly Polynomial Time. ESA Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2024	J	`jnl`	Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2024	J	`jnl`	Hypergraph Horn Functions. SIAM J. Discret. Math. Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2024	J	`jnl`	Manipulating the outcome of stable marriage and roommates problems. Games Econ. Behav. Kristóf Bérczi, Gergely Csáji, Tamás Király
2024	J	`jnl`	Matroid Horn functions. J. Comb. Theory A Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2024	J	`jnl`	Matroid Intersection under Minimum Rank Oracle. CoRR Mihály Bárász, Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2024	J	`jnl`	Matroid Secretary via Labeling Schemes. CoRR Kristóf Bérczi, Vasilis Livanos, José A. Soto, Victor Verdugo
2024	J	`jnl`	Matroid products via submodular coupling. CoRR Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Balázs Maga, Tamás Schwarcz
2024	B	`conf`	Multiway Cuts with a Choice of Representatives. MFCS Kristóf Bérczi, Tamás Király, Daniel P. Szabo
2024	J	`jnl`	Multiway Cuts with a Choice of Representatives. CoRR Kristóf Bérczi, Tamás Király, Daniel P. Szabo
2024	—	`conf`	Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective. LATIN (2) Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
2024	J	`jnl`	Partitioning into common independent sets via relaxing strongly base orderability. J. Comb. Theory A Kristóf Bérczi, Tamás Schwarcz
2024	J	`jnl`	Rainbow Arborescence Conjecture. CoRR Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2024	A*	`conf`	Reconfiguration of Basis Pairs in Regular Matroids. STOC Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
2024	J	`jnl`	Scheduling with non-renewable resources: minimizing the sum of completion times. J. Sched. Kristóf Bérczi, Tamás Király, Simon Omlor
2024	A*	`conf`	Splitting-Off in Hypergraphs. ICALP Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2024	J	`jnl`	Weighted exchange distance of basis pairs. Discret. Appl. Math. Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
2023	J	`jnl`	A Dual Approach for Dynamic Pricing in Multidemand Markets. SIAM J. Discret. Math. Kristóf Bérczi, Erika R. Bérczi-Kovács, Evelin Szögi
2023	J	`jnl`	Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai
2023	J	`jnl`	Envy-free dynamic pricing schemes. CoRR Kristóf Bérczi, Laura Codazzi, Julian Golak, Alexander Grigoriev
2023	J	`jnl`	Hypergraph Horn functions. CoRR Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2023	J	`jnl`	Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
2023	J	`jnl`	Hypergraph characterization of split matroids. J. Comb. Theory A Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
2023	J	`jnl`	Inverse optimization problems with multiple weight functions. Discret. Appl. Math. Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
2023	J	`jnl`	Matroid Horn functions. CoRR Kristóf Bérczi, Endre Boros, Kazuhisa Makino
2023	J	`jnl`	Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2023	J	`jnl`	Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and 𝓁 CoRR Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
2023	J	`jnl`	Newton-type algorithms for inverse optimization II: weighted span objective. CoRR Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
2023	J	`jnl`	On approximating the rank of graph divisors. Discret. Math. Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész
2023	J	`jnl`	On the complexity of packing rainbow spanning trees. Discret. Math. Kristóf Bérczi, Gergely Kál Csáji, Tamás Király
2023	J	`jnl`	Partitioning into common independent sets via relaxing strongly base orderability. CoRR Kristóf Bérczi, Tamás Schwarcz
2023	J	`jnl`	Reconfiguration of basis pairs in regular matroids. CoRR Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
2022	J	`jnl`	A 3/2-Approximation for the Metric Many-Visits Path TSP. SIAM J. Discret. Math. Kristóf Bérczi, Matthias Mnich, Roland Vincze
2022	J	`jnl`	Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2022	J	`jnl`	Approximation by lexicographically maximal solutions in matching and matroid intersection problems. Theor. Comput. Sci. Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2022	J	`jnl`	Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems. CoRR Kristóf Bérczi, Matthias Mnich, Roland Vincze
2022	J	`jnl`	Exchange distance of basis pairs in split matroids. CoRR Kristóf Bérczi, Tamás Schwarcz
2022	J	`jnl`	Hypergraph characterization of split matroids. CoRR Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
2022	J	`jnl`	Inverse optimization problems with multiple weight functions. CoRR Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
2022	J	`jnl`	Manipulating the outcome of stable matching and roommates problems. CoRR Kristóf Bérczi, Gergely Kál Csáji, Tamás Király
2022	J	`jnl`	Matroid Intersection under Restricted Oracles. CoRR Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2022	J	`jnl`	On approximating the rank of graph divisors. CoRR Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész
2022	J	`jnl`	On the complexity of packing rainbow spanning trees. CoRR Kristóf Bérczi, Gergely Kál Csáji, Tamás Király
2022	J	`jnl`	Rainbow and monochromatic circuits and cocircuits in binary matroids. Discret. Math. Kristóf Bérczi, Tamás Schwarcz
2022	J	`jnl`	Resolving Infeasibility of Linear Systems: A Parameterized Approach. CoRR Kristóf Bérczi, Alexander Göke, Lydia Mirabel Mendoza-Cadena, Matthias Mnich
2022	J	`jnl`	Unique key Horn functions. Theor. Comput. Sci. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2022	J	`jnl`	Weighted exchange distance of basis pairs. CoRR Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
2021	J	`jnl`	A dual approach for dynamic pricing in multi-demand markets. CoRR Kristóf Bérczi, Erika R. Bérczi-Kovács, Evelin Szögi
2021	J	`jnl`	Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2021	J	`jnl`	Complexity of packing common bases in matroids. Math. Program. Kristóf Bérczi, Tamás Schwarcz
2021	J	`jnl`	Generating clause sequences of a CNF formula. Theor. Comput. Sci. Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
2021	J	`jnl`	List Coloring of Two Matroids through Reduction to Partition Matroids. SIAM J. Discret. Math. Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
2021	J	`jnl`	Market Pricing for Matroid Rank Valuations. SIAM J. Discret. Math. Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2020	J	`jnl`	A 3/2-Approximation for the Metric Many-visits Path TSP. CoRR Kristóf Bérczi, Matthias Mnich, Roland Vincze
2020	J	`jnl`	A tight $\sqrt{2}$-approximation for linear 3-cut. Math. Program. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2020	Misc	`conf`	Approximating minimum representations of key Horn functions. ISAIM Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2020	J	`jnl`	Envy-free Relaxations for Goods, Chores, and Mixed Items. CoRR Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino
2020	J	`jnl`	Generating clause sequences of a CNF formula. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino
2020	J	`jnl`	Improving the integrality gap for multiway cut. Math. Program. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2020	B	`conf`	Market Pricing for Matroid Rank Valuations. ISAAC Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2020	J	`jnl`	Market Pricing for Matroid Rank Valuations. CoRR Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi
2020	J	`jnl`	Rainbow and monochromatic circuits and cuts in binary matroids. CoRR Kristóf Bérczi, Tamás Schwarcz
2020	C	`conf`	Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. ISCO Kristóf Bérczi, Tamás Király, Simon Omlor
2020	J	`jnl`	Unique key Horn functions. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2019	J	`jnl`	Beating the 2-approximation factor for global bicut. Math. Program. Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2019	J	`jnl`	Complexity of packing common bases in matroids. CoRR Kristóf Bérczi, Tamás Schwarcz
2019	J	`jnl`	Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. CoRR Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze
2019	B	`conf`	Improving the Integrality Gap for Multiway Cut. IPCO Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2019	J	`jnl`	List colouring of two matroids through reduction to partition matroids. CoRR Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
2019	J	`jnl`	Packing tree degree sequences. Informatica (Slovenia) Kristóf Bérczi, Zoltán Király, Changshuo Liu, István Miklós
2019	J	`jnl`	Scheduling with Non-Renewable Resources: Minimizing the Sum of Completion Times. CoRR Kristóf Bérczi, Tamás Király, Simon Omlor
2018	A*	`conf`	A tight -approximation for Linear 3-Cut. SODA Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2018	J	`jnl`	Approximating minimum representations of key Horn functions. CoRR Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino
2018	J	`jnl`	Arrival time dependent routing policies in public transport. Discret. Appl. Math. Kristóf Bérczi, Alpár Jüttner, Marco Laumanns, Jácint Szabó
2018	J	`jnl`	Blocking optimal structures. Discret. Math. Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap
2018	J	`jnl`	Improving the Integrality Gap for Multiway Cut. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
2018	J	`jnl`	Making Bipartite Graphs DM-Irreducible. SIAM J. Discret. Math. Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
2018	J	`jnl`	Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. Math. Oper. Res. Kristóf Bérczi, András Frank
2018	J	`jnl`	Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. Math. Oper. Res. Kristóf Bérczi, András Frank
2018	J	`jnl`	Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs. Math. Oper. Res. Kristóf Bérczi, András Frank
2017	J	`jnl`	An algorithm for identifying cycle-plus-triangles graphs. Discret. Appl. Math. Kristóf Bérczi, Yusuke Kobayashi
2017	J	`jnl`	Directed hypergraphs and Horn minimization. Inf. Process. Lett. Kristóf Bérczi, Erika R. Bérczi-Kovács
2017	—	`conf`	Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2017	J	`jnl`	King-Serf Duo by Monochromatic Paths in k-Edge-Coloured Tournaments. Electron. J. Comb. Kristóf Bérczi, Attila Joó
2017	B	`conf`	Packing strictly-shortest paths in a tree for QoS-aware routing. Networking Jose Yallouz, János Tapolcai, Attila Körösi, Kristóf Bérczi, László Gyimóthi, Ariel Orda
2017	A	`conf`	The Directed Disjoint Shortest Paths Problem. ESA Kristóf Bérczi, Yusuke Kobayashi
2016	J	`jnl`	A Note on $\mathtt{V}$-free 2-matchings. Electron. J. Comb. Kristóf Bérczi, Attila Bernáth, Máté Vizer
2016	J	`jnl`	Covering Intersecting Bi-set Families under Matroid Constraints. SIAM J. Discret. Math. Kristóf Bérczi, Tamás Király, Yusuke Kobayashi
2016	J	`jnl`	Global and fixed-terminal cuts in digraphs. CoRR Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
2016	J	`jnl`	Making Bipartite Graphs DM-irreducible. CoRR Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
2016	J	`jnl`	Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs. CoRR Kristóf Bérczi, András Frank
2016	J	`jnl`	Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. CoRR Kristóf Bérczi, András Frank
2016	J	`jnl`	Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. CoRR Kristóf Bérczi, András Frank
2015	J	`jnl`	A note on $\mathtt{V}$-free $2$-matchings. CoRR Kristóf Bérczi, Attila Bernáth, Máté Vizer
2015	J	`jnl`	Regular Graphs are Antimagic. Electron. J. Comb. Kristóf Bérczi, Attila Bernáth, Máté Vizer
2015	J	`jnl`	Regular graphs are antimagic. CoRR Kristóf Bérczi, Attila Bernáth, Máté Vizer
2012	J	`jnl`	An algorithm for (n-3)-connectivity augmentation problem: Jump system approach. J. Comb. Theory B Kristóf Bérczi, Yusuke Kobayashi
2011	—	`conf`	ILP based diverse path routing with node inclusion. ICUMT Zsolt Lakatos, Lajos Bajzik, Tamás Kárász, Kristóf Bérczi, Erika R. Kovács, László A. Végh
2010	B	`conf`	Restricted IPCO Kristóf Bérczi, László A. Végh
2009	J	`jnl`	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. Kristóf Bérczi, Satoru Fujishige, Naoyuki Kamiyama