Kristóf Bérczi
research fellow, member
| Address: | Department of Operations Research |
| Eötvös Loránd University |
| 1117 Budapest |
| Pázmány Péter sétány, 1/C, 3-516 |
| Tel: | (+36-1) 372-2500/8582 |
| Email: | berkri_at_cs.elte.hu |
| Home page: | http://www.cs.elte.hu/~berkri |
| Publication list: | |
|
 |
Interests
- restricted b-matchings
- connectivity augmentation
- packing and covering of branchings and arborescences
List of EGRES technical reports
- Rainbow and monochromatic circuits and cuts in binary matroids (Kristóf Bérczi, Tamás Schwarcz)
- A 3/2-Approximation for the Metric Many-visits Path TSP (Kristóf Bérczi, Matthias Mnich, Roland Vincze)
- Envy-free Relaxations for Goods, Chores, and Mixed Items (Kristóf Bérczi, Erika Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino)
- List coloring of two matroids through reduction to partition matroids (Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi)
- Improving the Integrality Gap for Multiway Cut (Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan)
- Complexity of packing common bases in matroids (Kristóf Bérczi, Tamás Schwarcz)
- Minimal representation of elementary Horn functions (Kristóf Bérczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino)
- A tight $\sqrt{2}$-approximation for Linear 3-Cut (Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan)
- Beating the 2-approximation factor for Global Bicut (Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu)
- Blocking optimal structures (Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap)
- The directed disjoint shortest paths problem (Kristóf Bérczi, Yusuke Kobayashi)
- An algorithm for identifying cycle-plus-triangles graphs (Kristóf Bérczi, Yusuke Kobayashi)
- Supermodularity in unweighted graph optimization III: Highly connected digraphs (Kristóf Bérczi, András Frank)
- Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation (Kristóf Bérczi, András Frank)
- Supermodularity in unweighted graph optimization I: Branchings and matchings (Kristóf Bérczi, András Frank)
- King-serf duo by monochromatic paths in k-edge-coloured tournaments (Kristóf Bérczi, Attila Joó)
- Non-TDI graph-optimization with supermodular functions (extended abstract) (Kristóf Bérczi, András Frank)
- Algorithmic aspects of covering supermodular functions under matroid constraints (Kristóf Bérczi, Tamás Király, Yusuke Kobayashi)
- Covering intersecting bi-set families under matroid constraints (Kristóf Bérczi, Tamás Király, Yusuke Kobayashi)
- Splitting property via shadow systems (Kristóf Bérczi, Péter Csikvári, Erika Bérczi-Kovács, László Végh)
- The triangle-free 2-matching polytope of subcubic graphs (Kristóf Bérczi)
- A Note On Strongly Edge-Disjoint Arborescences (Kristóf Bérczi, Erika Bérczi-Kovács)
- Restricted b-matchings in degree-bounded graphs (Kristóf Bérczi, László Végh)
- Packing Arborescences (Kristóf Bérczi, András Frank)
- Variations For Lovász' Submodular Ideas (Kristóf Bérczi, András Frank)
List of EGRES quick proofs
- Facility location functions are deep submodular functions (Kristóf Bérczi, Erika Bérczi-Kovács, András Lőrincz, Zoltán Á. Milacski)
- Triangle-free Eulerian planar graphs are friendly (Kristóf Bérczi, Zoltán Paulovics)
- Total domatic number of triangulated planar graphs (Kristóf Bérczi, Hanna Gábor)
- A note on packing half-regular bipartite graphs (Kristóf Bérczi)
- A note on V-free 2-matchings (Kristóf Bérczi, Attila Bernáth, Máté Vizer)
- Regular graphs are antimagic (Kristóf Bérczi, Attila Bernáth, Máté Vizer)
- A note on conservative costs (Kristóf Bérczi, Erika Bérczi-Kovács)
- Constructive characterization of dumpy digraphs (Kristóf Bérczi, Erika Bérczi-Kovács)
- Subgraphs with restricted degree differences (Kristóf Bérczi)
Last modification: 10.2.2021. Please email your comments to Tamás Király!
|