Publications & Talks

Preprints

  1. K. Bérczi, G. K. Csáji, T. Király, Manipulating the outcome of stable matching and roommates problems, arXiv:2204.13485 (2022).
  2. K. Bérczi, T. Schwarcz, Exchange distance of basis pairs in split matroids, arXiv:2203.01779 (2022).
  3. K. Bérczi, T. Király, T. Schwarcz, Y. Yamaguchi, Y. Yokoi, Hypergraph characterization of split matroids, arXiv:2202.04371 (2022).
  4. 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).
  5. K. Bérczi, M. Mnich, and R. Vincze, Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems, arXiv:2201.02054 (2022).
  6. K. Bérczi, A. Göke, L. M. Mendoza-Cadena, M. Mnich, Resolving Infeasibility of Linear Systems: A Parameterized Approach, in submission (2022).
  7. K. Bérczi, L. M. Mendoza-Cadena, K. Varga, Inverse optimization problems with multiple weight functions, arXiv:2201.03078 (2022).
  8. 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, E. Boros, O. Čepek, P. Kučera, and M. Kazuhisa, Unique key Horn functions, Theoretical Computer Science, to appear (2022).
  2. 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).
  3. K. Bérczi and T. Schwarcz, Rainbow and monochromatic circuits and cocircuits in binary matroids, Discrete Mathematics, 345(6) (2022).
  4. 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).
  5. 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).
  6. 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).
  7. K. Bérczi, T. Schwarcz, Complexity of packing common bases in matroids, Mathematical Programming, 188(1), pp. 1-18 (2021).

Refereed Conference Proceedings

  1. 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).
  2. 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

  1. K. Bérczi, Extensions of the traveling salesman problem, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).
  2. L. M. Mendoza Cadena, Inverse arborescence problem with multiple cost functions, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).
  3. 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 in split matroids, KTH Combinatorics Seminar, KTH Royal Institute of Technology, Stockholm (Apr. 2022).
  2. K. Bérczi, Structural properties of matroid base families, Trimester Program on Discrete Optimization, Hausdorff Research Institute for Mathematics, Bonn (Nov. 2021).
  3. K. Bérczi, Dynamic pricing in combinatorial markets, Game Theory Seminar, Corvinus University, Budapest (Oct. 2021).