default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKristóf Bérczi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Kristóf Bérczi
, Bence Mátravölgyi, Tamás Schwarcz:
Weighted exchange distance of basis pairs. Discret. Appl. Math. 349: 130-143 (2024)- [j41]Kristóf Bérczi, Gergely Csáji, Tamás Király:
Manipulating the outcome of stable marriage and roommates problems. Games Econ. Behav. 147: 407-428 (2024) - [j40]Kristóf Bérczi, Tamás Schwarcz:
Partitioning into common independent sets via relaxing strongly base orderability. J. Comb. Theory A 202: 105817 (2024) - [j39]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Matroid Horn functions. J. Comb. Theory A 203: 105838 (2024) - [j38]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): 151-164 (2024) - [j37]Kristóf Bérczi, Tamás Schwarcz:
Exchange Distance of Basis Pairs in Split Matroids. SIAM J. Discret. Math. 38(1): 132-147 (2024) - [j36]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Hypergraph Horn Functions. SIAM J. Discret. Math. 38(2): 1417-1437 (2024) - [j35]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: 114596 (2024) - [c16]Yuhang Bai, Kristóf Bérczi, Gergely Csáji, Tamás Schwarcz:
Approximating Maximum-Size Properly Colored Forests. ESA 2024: 14:1-14:18 - [c15]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. ESA 2024: 22:1-22:19 - [c14]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Splitting-Off in Hypergraphs. ICALP 2024: 23:1-23:20 - [c13]Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga:
Newton-Type Algorithms for Inverse Optimization: Weighted Span Objective. LATIN (2) 2024: 334-347 - [c12]Kristóf Bérczi, Tamás Király, Daniel P. Szabo:
Multiway Cuts with a Choice of Representatives. MFCS 2024: 25:1-25:17 - [c11]Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz:
Reconfiguration of Basis Pairs in Regular Matroids. STOC 2024: 1653-1664 - [i48]Yuhang Bai, Kristóf Bérczi, Gergely Kál Csáji, Tamás Schwarcz:
Approximating maximum-size properly colored forests. CoRR abs/2402.00834 (2024) - [i47]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR abs/2402.10861 (2024) - [i46]Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi:
Finding Spanning Trees with Perfect Matchings. CoRR abs/2407.02958 (2024) - [i45]Mihály Bárász, Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Minimum Rank Oracle. CoRR abs/2407.03229 (2024) - [i44]Kristóf Bérczi, Tamás Király, Daniel P. Szabo:
Multiway Cuts with a Choice of Representatives. CoRR abs/2407.03877 (2024) - [i43]Kristóf Bérczi, Áron Jánosik, Bence Mátravölgyi:
Cyclic ordering of split matroids. CoRR abs/2411.01061 (2024) - [i42]Kristóf Bérczi, Boglárka Gehér, András Imolay, László Lovász, Balázs Maga, Tamás Schwarcz:
Matroid products via submodular coupling. CoRR abs/2411.02197 (2024) - [i41]Kristóf Bérczi, Vasilis Livanos, José A. Soto, Victor Verdugo:
Matroid Secretary via Labeling Schemes. CoRR abs/2411.12069 (2024) - [i40]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Rainbow Arborescence Conjecture. CoRR abs/2412.15457 (2024) - 2023
- [j34]Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga:
Inverse optimization problems with multiple weight functions. Discret. Appl. Math. 327: 134-147 (2023) - [j33]Kristóf Bérczi, Gergely Kál Csáji, Tamás Király:
On the complexity of packing rainbow spanning trees. Discret. Math. 346(4): 113297 (2023) - [j32]Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész:
On approximating the rank of graph divisors. Discret. Math. 346(9): 113528 (2023) - [j31]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai:
Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. 180: 106340 (2023) - [j30]Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
Hypergraph characterization of split matroids. J. Comb. Theory A 194: 105697 (2023) - [j29]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. 37(2): 1311-1330 (2023) - [j28]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): 1771-1787 (2023) - [i39]Kristóf Bérczi, Laura Codazzi, Julian Golak, Alexander Grigoriev:
Envy-free dynamic pricing schemes. CoRR abs/2301.01529 (2023) - [i38]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Hypergraph Horn functions. CoRR abs/2301.05461 (2023) - [i37]Kristóf Bérczi, Endre Boros, Kazuhisa Makino:
Matroid Horn functions. CoRR abs/2301.06642 (2023) - [i36]Kristóf Bérczi, Tamás Schwarcz:
Partitioning into common independent sets via relaxing strongly base orderability. CoRR abs/2302.01445 (2023) - [i35]Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga:
Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and 𝓁∞-norm objectives. CoRR abs/2302.13411 (2023) - [i34]Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga:
Newton-type algorithms for inverse optimization II: weighted span objective. CoRR abs/2302.13414 (2023) - [i33]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 abs/2307.08555 (2023) - [i32]Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz:
Reconfiguration of basis pairs in regular matroids. CoRR abs/2311.07130 (2023) - 2022
- [j27]Kristóf Bérczi, Tamás Schwarcz:
Rainbow and monochromatic circuits and cocircuits in binary matroids. Discret. Math. 345(6): 112830 (2022) - [j26]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating Minimum Representations of Key Horn Functions. SIAM J. Comput. 51(1): 116-138 (2022) - [j25]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): 2995-3030 (2022) - [j24]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: 48-53 (2022) - [j23]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. Theor. Comput. Sci. 922: 170-178 (2022) - [i31]Kristóf Bérczi, Matthias Mnich, Roland Vincze:
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems. CoRR abs/2201.02054 (2022) - [i30]Kristóf Bérczi, Lydia Mirabel Mendoza Cadena, Kitti Varga:
Inverse optimization problems with multiple weight functions. CoRR abs/2201.03078 (2022) - [i29]Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
Hypergraph characterization of split matroids. CoRR abs/2202.04371 (2022) - [i28]Kristóf Bérczi, Tamás Schwarcz:
Exchange distance of basis pairs in split matroids. CoRR abs/2203.01779 (2022) - [i27]Kristóf Bérczi, Gergely Kál Csáji, Tamás Király:
Manipulating the outcome of stable matching and roommates problems. CoRR abs/2204.13485 (2022) - [i26]Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész:
On approximating the rank of graph divisors. CoRR abs/2206.09662 (2022) - [i25]Kristóf Bérczi, Gergely Kál Csáji, Tamás Király:
On the complexity of packing rainbow spanning trees. CoRR abs/2206.11924 (2022) - [i24]Kristóf Bérczi, Alexander Göke, Lydia Mirabel Mendoza Cadena, Matthias Mnich:
Resolving Infeasibility of Linear Systems: A Parameterized Approach. CoRR abs/2209.02017 (2022) - [i23]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Restricted Oracles. CoRR abs/2209.14516 (2022) - [i22]Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz:
Weighted exchange distance of basis pairs. CoRR abs/2211.12750 (2022) - 2021
- [j22]Kristóf Bérczi, Tamás Schwarcz:
Complexity of packing common bases in matroids. Math. Program. 188(1): 1-18 (2021) - [j21]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): 2192-2209 (2021) - [j20]Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. SIAM J. Discret. Math. 35(4): 2662-2678 (2021) - [j19]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: 68-74 (2021) - [i21]Kristóf Bérczi, Erika R. Bérczi-Kovács, Evelin Szögi:
A dual approach for dynamic pricing in multi-demand markets. CoRR abs/2107.05131 (2021) - [i20]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR abs/2107.09897 (2021) - 2020
- [j18]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the integrality gap for multiway cut. Math. Program. 183(1): 171-193 (2020) - [j17]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): 411-443 (2020) - [c10]Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. ISAAC 2020: 39:1-39:15 - [c9]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. ISAIM 2020 - [c8]Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. ISCO 2020: 167-178 - [i19]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. CoRR abs/2002.06727 (2020) - [i18]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Unique key Horn functions. CoRR abs/2002.06964 (2020) - [i17]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 abs/2006.04428 (2020) - [i16]Kristóf Bérczi, Naonori Kakimura, Yusuke Kobayashi:
Market Pricing for Matroid Rank Valuations. CoRR abs/2007.08759 (2020) - [i15]Kristóf Bérczi, Matthias Mnich, Roland Vincze:
A 3/2-Approximation for the Metric Many-visits Path TSP. CoRR abs/2007.11389 (2020) - [i14]Kristóf Bérczi, Tamás Schwarcz:
Rainbow and monochromatic circuits and cuts in binary matroids. CoRR abs/2012.05037 (2020)
2010 – 2019
- 2019
- [j16]Kristóf Bérczi, Zoltán Király, Changshuo Liu, István Miklós:
Packing tree degree sequences. Informatica (Slovenia) 43(1) (2019) - [j15]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): 291-320 (2019) - [c7]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the Integrality Gap for Multiway Cut. IPCO 2019: 115-127 - [i13]Kristóf Bérczi, Tamás Schwarcz:
Complexity of packing common bases in matroids. CoRR abs/1903.03579 (2019) - [i12]Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze:
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. CoRR abs/1911.09890 (2019) - [i11]Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi:
List colouring of two matroids through reduction to partition matroids. CoRR abs/1911.10485 (2019) - [i10]Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with Non-Renewable Resources: Minimizing the Sum of Completion Times. CoRR abs/1911.12138 (2019) - 2018
- [j14]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: 93-102 (2018) - [j13]Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap:
Blocking optimal structures. Discret. Math. 341(7): 1864-1872 (2018) - [j12]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. Math. Oper. Res. 43(3): 726-753 (2018) - [j11]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. Math. Oper. Res. 43(3): 754-762 (2018) - [j10]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs. Math. Oper. Res. 43(3): 763-780 (2018) - [j9]Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-Irreducible. SIAM J. Discret. Math. 32(1): 560-590 (2018) - [c6]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
A tight -approximation for Linear 3-Cut. SODA 2018: 1393-1406 - [i9]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan:
Improving the Integrality Gap for Multiway Cut. CoRR abs/1807.09735 (2018) - [i8]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino:
Approximating minimum representations of key Horn functions. CoRR abs/1811.05160 (2018) - 2017
- [j8]Kristóf Bérczi, Attila Joó:
King-Serf Duo by Monochromatic Paths in k-Edge-Coloured Tournaments. Electron. J. Comb. 24(1): 1 (2017) - [j7]Kristóf Bérczi, Yusuke Kobayashi:
An algorithm for identifying cycle-plus-triangles graphs. Discret. Appl. Math. 226: 10-16 (2017) - [j6]Kristóf Bérczi, Erika R. Bérczi-Kovács:
Directed hypergraphs and Horn minimization. Inf. Process. Lett. 128: 32-37 (2017) - [c5]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM 2017: 2:1-2:20 - [c4]Kristóf Bérczi, Yusuke Kobayashi:
The Directed Disjoint Shortest Paths Problem. ESA 2017: 13:1-13:13 - [c3]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: 1-9 - 2016
- [j5]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
A Note on $\mathtt{V}$-free 2-matchings. Electron. J. Comb. 23(4): 4 (2016) - [j4]Kristóf Bérczi, Tamás Király, Yusuke Kobayashi:
Covering Intersecting Bi-set Families under Matroid Constraints. SIAM J. Discret. Math. 30(3): 1758-1774 (2016) - [i7]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings. CoRR abs/1608.05722 (2016) - [i6]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Opitimization III: Highly-connected Digraphs. CoRR abs/1608.05729 (2016) - [i5]Kristóf Bérczi, András Frank:
Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation. CoRR abs/1608.05730 (2016) - [i4]Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
Global and fixed-terminal cuts in digraphs. CoRR abs/1612.00156 (2016) - [i3]Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-irreducible. CoRR abs/1612.08828 (2016) - 2015
- [j3]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
Regular Graphs are Antimagic. Electron. J. Comb. 22(3): 3 (2015) - [i2]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
Regular graphs are antimagic. CoRR abs/1504.08146 (2015) - [i1]Kristóf Bérczi, Attila Bernáth, Máté Vizer:
A note on $\mathtt{V}$-free $2$-matchings. CoRR abs/1505.03717 (2015) - 2012
- [j2]Kristóf Bérczi, Yusuke Kobayashi:
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach. J. Comb. Theory B 102(3): 565-587 (2012) - 2011
- [c2]Zsolt Lakatos, Lajos Bajzik, Tamás Kárász, Kristóf Bérczi, Erika R. Kovács, László A. Végh:
ILP based diverse path routing with node inclusion. ICUMT 2011: 1-8 - 2010
- [c1]Kristóf Bérczi, László A. Végh:
Restricted b-Matchings in Degree-Bounded Graphs. IPCO 2010: 43-56
2000 – 2009
- 2009
- [j1]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): 1227-1231 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-02 23:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
