Publications & Talks

Preprints

  1. A. Jüttner, Cs. Király, L. M. Mendoza-Cadena, Gy. Pap, I. Schlotter, Y. Yamaguchi, Shortest odd path in conservative undirected graphs, arXiv:2308.12653 (2023).
  2. T. Jordán, S. Villányi, Globally linked pairs of vertices in generic frameworks, arXiv:2307.04451 (2023).
  3. D. Garamvölgyi, T. Jordán, Partial reflections and globally linked pairs in rigid graphs, arXiv:2305.03412 (2023).
  4. K. Bérczi, K. Chandrasekaran, T. Király, S. Kulkarni, Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time, arXiv:2307.08555 (2023).
  5. J. Pintér, K. Varga, Color-avoiding connected spanning subgraphs with minimum number of edges, arXiv:2302.11035 (2023).
  6. P. Madarasi, Matchings under distance constraints II, arXiv:2301.08988 (2023).
  7. Y. Kobayashi, R. Mahara, T. Schwarcz, Reconfiguration of the union of arborescences, arXiv:2304.13217 (2023).
  8. 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).
  9. K. Bérczi, L. M. Mendoza-Cadena, K. Varga, Newton-type algorithms for inverse optimization II: weighted span objective, arXiv:2302.13414 (2023).
  10. K. Bérczi, E. Boros, M. Kazuhisa, Matroid Horn functions, arXiv:2301.06642 (2023).
  11. K. Bérczi, E. Boros, M. Kazuhisa, Hypergraph Horn functions, arXiv:2301.05461 (2023).
  12. K. Bérczi, L. Codazzi, J. Golak, A. Grigoriev, Envy-free dynamic pricing schemes, arXiv:2301.01529 (2023).
  13. K. Bérczi, B. Mátravölgyi, T. Schwarcz, Weighted exchange distance of basis pairs, arXiv:2211.12750 (2022).
  14. D. Garamvölgyi, T. Jordán, Cs. Király, Count and cofactor matroids of highly connected graphs, arXiv:2209.06204 (2022).
  15. G. Csáji, T. Király, Y. Yokoi, Solving the maximum popular matching problem with matroid constraints, arXiv:2209.02195 (2022).
  16. G. Csáji, T. Király, Y. Yokoi, Approximation algorithms for matroidal and cardinal generalizations of stable matching, arXiv:2208.09583 (2022).
  17. P. Madarasi, The simultaneous assignment problem, arXiv:2105.09439 (2022).
  18. P. Madarasi, M. Simon, On vertex-coloring $\{a,b\}$-edge-weightings of graphs, EGRES Technical Report TR-2022-06 (2022).
  19. K. Bérczi, G. K. Csáji, T. Király, Manipulating the outcome of stable matching and roommates problems, arXiv:2204.13485 (2022).
  20. K. Bérczi, A. Göke, L. M. Mendoza-Cadena, M. Mnich, Resolving Infeasibility of Linear Systems: A Parameterized Approach, arxiv:2209.02017 (2022).

Journal Articles

  1. K. Bérczi, T. Schwarcz, Partitioning into common independent sets via relaxing strongly base orderability, Journal of Combinatorial Theory A, 202 (2024).
  2. K. Bérczi, T. Schwarcz, Exchange distance of basis pairs in split matroids, SIAM Journal on Discrete Mathematics, to appear (2023).
  3. T. Jordán, Ear-decompositions, minimally connected matroids, and rigid graphs, Journal of Graph Theory, to appear (2023).
  4. 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 (2023).
  5. K. Bérczi, H. P. Hoang, L. Tóthmérész, On approximating the rank of graph divisors, Discrete Mathematics, 346(9) (2023).
  6. 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, European Journal of Combinatorics, 110 (2023).
  7. K. Bérczi, E. R. Bérczi-Kovács, and E. Szögi, A dual approach for dynamic pricing in multi-demand markets, SIAM Journal on Discrete Mathematics, 37(3), pp. 1771-1787 (2023).
  8. K. Bérczi, T. Király, Y. Yamaguchi, and Y. Yokoi, Matroid intersection under restricted oracles, SIAM Journal on Discrete Mathematics, 37(2), pp. 1311-1330 (2023).
  9. K. Bérczi, G. K. Csáji, T. Király, On the complexity of packing rainbow spanning trees, Discrete Mathematics, 346(4) (2023).
  10. K. Bérczi, M. Mnich, and R. Vincze, Approximations for many-visits multiple traveling salesman problems, Omega, 116 (2023).
  11. K. Bérczi, L. M. Mendoza-Cadena, K. Varga, Inverse optimization problems with multiple weight functions, Discrete Applied Mathematics, 327, pp. 134-147 (2023).
  12. K. Bérczi, K. Chandrasekaran, T. Király, and A. Pillai, Analyzing Residual Random Greedy for monotone submodular maximization, Information Processing Letters, 180 (2023).
  13. 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).
  14. 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).
  15. G. Csáji, On the complexity of stable hypergraph matching, stable multicommodity flow and related problems, Theoretical Computer Science, 931, pp. 1-16 (2022).
  16. 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), pp. 2995-3030 (2022).
  17. 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).
  18. K. Bérczi and T. Schwarcz, Rainbow and monochromatic circuits and cocircuits in binary matroids, Discrete Mathematics, 345(6) (2022).
  19. 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).
  20. 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).
  21. 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).
  22. 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).
  23. K. Bérczi, T. Schwarcz, Complexity of packing common bases in matroids, Mathematical Programming, 188(1), pp. 1-18 (2021).

Refereed Conference Proceedings

  1. H. Aziz, G. Csáji, Á. Cseh, Computational complexity of k-stable matchings, International Symposium on Algorithmic Game Theory (SAGT 2023).
  2. Y. Kobayashi, R. Mahara, T. Schwarcz, Reconfiguration of the union of arborescences, 34st International Symposium on Algorithms and Computation (ISAAC 2023).
  3. J. Chen, G. K. Csáji, Optimal Capacity Modification for Many-To-One Matching Problems, International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023).
  4. J. Chen, G. K. Csáji, S. Roy, S. Simola, Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity, International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023).
  5. G. K. Csáji, T. Király, Y. Yokoi, Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching, Symposium on Simplicity in Algorithms (SOSA 2023).
  6. 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).
  7. 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).
  8. K. Bérczi, N. Kakimura, and Y. Kobayashi, Market pricing for matroid rank valuations, 31st International Symposium on Algorithms and Computation (ISAAC 2020).

Conference Talks & Posters

  1. T. Jordán, Globally linked vertex pairs in graphs, Workshop on Geometric Constraints: Materials, Graphs and Matroids, Rigidity and Packings, The Fields Institute for Research in Mathematical Sciences, Toronto (Jul. 2023).
  2. K. Bérczi, Reduction of Matroids and Its Application to Optimization Problems, SIAM Conference on Optimization (June 2023).
  3. T. Jordán, On generic universal rigidity on the line, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
  4. P. Madarasi, Simultaneous assignments, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
  5. G. K. Csáji, Approximation algorithms for matroidal and cardinal generalizations of stable matching, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
  6. T. Schwarcz, Partitioning into common independent sets via relaxing strongly base orderability, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
  7. B. Mátravölgyi, Weighted exchange distance of basis pairs, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
  8. T. Király, Scheduling under a resource constraint: the case of negligible processing times, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
  9. K. Bérczi, Dynamic pricing schemes, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
  10. K. Varga, Newton-type algorithms for inverse optimization problems I and II: Weighted infinity norm and span, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
  11. L. M. Mendoza Cadena, Newton-type algorithms for inverse optimization problems I and II: Weighted infinity norm and span, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
  12. 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 (Sept. 2022).
  13. K. Bérczi, Extensions of the traveling salesman problem, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).
  14. L. M. Mendoza Cadena, Inverse arborescence problem with multiple cost functions, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).
  15. 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. T. Schwarcz, Reconfiguration of the union of arborescences, 3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023, Paderborn (Jul. 2023).
  2. K. Bérczi, Newton-type algorithms in inverse optimization, CIAS-CCOR Optimization Seminar, Budapest (May 2023).
  3. T. Király, Duális bizonyítékok használata népszerű párosítási problémák megoldására, Online Hungarian Operations Research Seminar (May 2023).
  4. K. Bérczi, Supermodularity in unweighted graph optimization: Algorithms, Combinatorial Optimization Seminar, Grenoble (Apr. 2023).
  5. T. Schwarcz, Reconfiguration of the union of arborescences, Combinatorial Optimization Seminar, Grenoble (Apr. 2023).
  6. T. Schwarcz, Weighted exchange distance of basis pairs, RIMS, Kyoto (Feb. 2023).
  7. K. Bérczi, Exchange distance of basis pairs, RIMS, Kyoto (Jan. 2023).
  8. T. Jordán, A távolságok geometriájának algoritmikus kérdéseiről, CIAS-CCOR Optimization Seminar, Budapest (Nov. 2022).
  9. K. Bérczi, Paths consisting of short edges of the matroid intersection polytope, Eleventh Cargese Workshop on Combinatorial Optimization (Sept. 2022).
  10. T. Schwarcz, Exchange distance of basis pairs in split matroids, 29th British Combinatorial Conference, Lancaster (Jul. 2022).
  11. 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).
  12. K. Bérczi, Exchange distance in split matroids, KTH Combinatorics Seminar, KTH Royal Institute of Technology, Stockholm (Apr. 2022).
  13. K. Bérczi, Structural properties of matroid base families, Trimester Program on Discrete Optimization, Hausdorff Research Institute for Mathematics, Bonn (Nov. 2021).
  14. K. Bérczi, Dynamic pricing in combinatorial markets, Game Theory Seminar, Corvinus University, Budapest (Oct. 2021).