Publications & Talks

Preprints

  1. K. Bérczi, L. M. Mendoza-Cadena, K. Varga, Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and \ell_\infty-norm objectives, arXiv:2302.13411 (2023).
  2. K. Bérczi, L. M. Mendoza-Cadena, K. Varga, Newton-type algorithms for inverse optimization II: weighted span objective, arXiv:2302.13414 (2023).
  3. K. Bérczi, T. Schwarcz, Partitioning into common independent sets via relaxing strongly base orderability, arXiv:2302.01445 (2023).
  4. K. Bérczi, E. Boros, M. Kazuhisa, Matroid Horn functions, arXiv:2301.06642 (2023).
  5. K. Bérczi, E. Boros, M. Kazuhisa, Hypergraph Horn functions, arXiv:2301.05461 (2023).
  6. K. Bérczi, L. Codazzi, J. Golak, A. Grigoriev, Envy-free dynamic pricing schemes, arXiv:2301.01529 (2023).
  7. K. Bérczi, B. Mátravölgyi, T. Schwarcz, Weighted exchange distance of basis pairs, arXiv:2211.12750 (2022).
  8. D. Garamvölgyi, T. Jordán, Cs. Király, Count and cofactor matroids of highly connected graphs, arXiv:2209.06204 (2022).
  9. T. Jordán, Ear-decompositions, minimally connected matroids, and rigid graphs, EGRES Technical Report TR-2022-11 (2022).
  10. G. Csáji, T. Király, Y. Yokoi, Solving the maximum popular matching problem with matroid constraints, arXiv:2209.02195 (2022).
  11. G. Csáji, T. Király, Y. Yokoi, Approximation algorithms for matroidal and cardinal generalizations of stable matching, arXiv:2208.09583 (2022).
  12. P. Madarasi, The simultaneous assignment problem, arXiv:2105.09439 (2022).
  13. K. Bérczi, H. P. Hoang, L. Tóthmérész, On approximating the rank of graph divisors, arXiv:2206.09662 (2022).
  14. P. Madarasi, M. Simon, On vertex-coloring \{a,b\}-edge-weightings of graphs, EGRES Technical Report TR-2022-06 (2022).
  15. K. Bérczi, G. K. Csáji, T. Király, Manipulating the outcome of stable matching and roommates problems, arXiv:2204.13485 (2022).
  16. K. Bérczi, T. Schwarcz, Exchange distance of basis pairs in split matroids, arXiv:2203.01779 (2022).
  17. Cs. Beke, G. K. Csáji, P. Csikvári, S. Pituk, Short proof of a theorem of Brylawski on the coefficients of the Tutte polynomial, arXiv:2201.10404 (2022).
  18. K. Bérczi, A. Göke, L. M. Mendoza-Cadena, M. Mnich, Resolving Infeasibility of Linear Systems: A Parameterized Approach, arxiv:2209.02017 (2022).
  19. K. Bérczi, E. R. Bérczi-Kovács, and E. Szögi, A dual approach for dynamic pricing in multi-demand markets, arXiv:2107.05131 (2021).

Journal Articles

  1. K. Bérczi, T. Király, Y. Yamaguchi, and Y. Yokoi, Matroid intersection under restricted oracles, SIAM Journal on Discrete Mathematics, to appear (2022).
  2. K. Bérczi, G. K. Csáji, T. Király, On the complexity of packing rainbow spanning trees, Discrete Mathematics, 346(4) (2023).
  3. K. Bérczi, L. M. Mendoza-Cadena, K. Varga, Inverse optimization problems with multiple weight functions, Discrete Applied Mathematics, 327, pp. 134-147 (2023).
  4. K. Bérczi, M. Mnich, and R. Vincze, Approximations for many-visits multiple traveling salesman problems, Omega, 116 (2023).
  5. K. Bérczi, K. Chandrasekaran, T. Király, and A. Pillai, Analyzing Residual Random Greedy for monotone submodular maximization, Information Processing Letters, 180 (2023).
  6. K. Bérczi, T. Király, and S. Omlor, Scheduling with non-renewable resources: Minimizing the sum of completion times, Journal of Scheduling, to appear (2022).
  7. K. Bérczi, T. Király, T. Schwarcz, Y. Yamaguchi, Y. Yokoi, Hypergraph characterization of split matroids, Journal of Combinatorial Theory, Series A, 194 (2023).
  8. S. Fujishige, T. Király, K. Makino, K. Takazawa, S. Tanigawa, Minimizing submodular functions on diamonds via generalized fractional matroid matchings, Journal of Combinatorial Theory, Series B, 157, pp. 294-345 (2022).
  9. K. Bérczi, M. Mnich, and R. Vincze, A 3/2-approximation for the metric Many-visits Path TSP, SIAM Journal on Discrete Mathematics, 36(4) (2022).
  10. K. Bérczi, E. Boros, O. Čepek, P. Kučera, and M. Kazuhisa, Unique key Horn functions, Theoretical Computer Science, 922, pp. 170-178 (2022).
  11. K. Bérczi, T. Király, Y. Yamaguchi, and Y. Yokoi, Approximation by lexicographically maximal solutions in matching and matroid intersection problems, Theoretical Computer Science, 910, pp. 48-53 (2022).
  12. K. Bérczi and T. Schwarcz, Rainbow and monochromatic circuits and cocircuits in binary matroids, Discrete Mathematics, 345(6) (2022).
  13. K. Bérczi, E. Boros, O. Čepek, P. Kučera, and K. Makino, Approximating minimum representations of key Horn functions, SIAM Journal on Computing, 51(1), pp. 116-138 (2022).
  14. K. Bérczi, N. Kakimura, and Y. Kobayashi, Market pricing for matroid rank valuations, SIAM Journal on Discrete Mathematics, 35(4), pp. 2662–2678 (2021).
  15. K. Bérczi, T. Schwarcz, and Y. Yamaguchi, List colouring of two matroids through reduction to partition matroids, SIAM Journal on Discrete Mathematics, 35(3), pp. 2192-2209 (2021).
  16. K. Bérczi, T. Schwarcz, Complexity of packing common bases in matroids, Mathematical Programming, 188(1), pp. 1-18 (2021).

Refereed Conference Proceedings

  1. K. Bérczi, E. R. Bérczi-Kovács, and E. Szögi, A dual approach for dynamic pricing in multi-demand markets, International Workshop on Matching Under Preferences (MATCH-UP 2022).
  2. T. Kavitha, T. Király, J. Matuschke, I. Schlotter, U. Schmidt-Kraepelin, The popular assignment problem: when cardinality is more important than popularity, ACM-SIAM Symposium on Discrete Algorithms (SODA 2022).
  3. K. Bérczi, N. Kakimura, and Y. Kobayashi, Market pricing for matroid rank valuations, 31st International Symposium on Algorithms and Computation (ISAAC 2020), pp. 1-15 (2020).

Conference Talks & Posters

  1. K. Bérczi, G. K. Csáji, T. Király, Manipulating the outcome of stable matching and roommates problems, poster, International Workshop on Matching Under Preferences (MATCH-UP 2022).
  2. K. Bérczi, Extensions of the traveling salesman problem, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).
  3. L. M. Mendoza Cadena, Inverse arborescence problem with multiple cost functions, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).
  4. T. Schwarcz, Rainbow and monochromatic circuits and cuts in binary matroids, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).

Seminars & Workshops

  1. K. Bérczi, Exchange distance of basis pairs, RIMS, Kyoto (Jan. 2023).
  2. K. Bérczi, Paths consisting of short edges of the matroid intersection polytope, Eleventh Cargese Workshop on Combinatorial Optimization (Sept. 2022).
  3. T. Schwarcz, Exchange distance of basis pairs in split matroids, 29th British Combinatorial Conference, Lancaster (Jul. 2022).
  4. K. Bérczi, A dual approach for dynamic pricing in multi-demand markets, Annual Meeting  of the Canadian Society of Applied and Industrial Mathematics CAIMS (Jun. 2022).
  5. K. Bérczi, Exchange distance in split matroids, KTH Combinatorics Seminar, KTH Royal Institute of Technology, Stockholm (Apr. 2022).
  6. K. Bérczi, Structural properties of matroid base families, Trimester Program on Discrete Optimization, Hausdorff Research Institute for Mathematics, Bonn (Nov. 2021).
  7. K. Bérczi, Dynamic pricing in combinatorial markets, Game Theory Seminar, Corvinus University, Budapest (Oct. 2021).