Publications & Talks

Preprints

K. Bérczi, V. Livanos, J. Soto, V. Verdugo, Free-order secretary for two-sided independence systems, arXiv:2511.04390 (2025).
K. Bérczi, F. Hörsch, A. Imolay, T. Schwarcz, Fixed-parameter tractability and hardness for Steiner rooted and locally connected orientations, arXiv:2511.02081 (2025).
K. Bérczi, K. Chandrasekaran, T. Király, D. P. Szabo, $\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions, arXiv:2510.25664 (2025).
D. Garamvölgyi, B. Jackson, and T. Jordán, Sparsity, stress-independence, and globally linked pairs in graph rigidity theory, arXiv:2509.03150 (2025).
J. Cruickshank, B. Jackson, T. Jordán, S. Tanigawa, Rigidity of graphs and frameworks: A matroid theoretic approach, arXiv:2508.11636 (2025).
K. Bérczi, M. Borbényi, L. Lovász, L. M. Tóth, Convergent sequences of combinatorial submodular setfunctions, arXiv:2507.15105 (2025).
K. Bérczi, B. Gehér, A. Imolay, L. Lovász, C. Padró, T. Schwarcz, Interaction between skew-representability, tensor products, extension properties, and rank inequalities, arXiv:2507.10709 (2025).
K. Bérczi, L. M. Mendoza-Cadena, J. Soto, Inverse matroid optimization under subset constraints, arXiv:2507.00930 (2025).
K. Bérczi, K. Chandrasekaran, T. Király, D. P. Szabo, Approximating Submodular Matroid-Constrained Partitioning, arXiv:2506.19507 (2025).
K. Clinch, D. Garamvölgyi, J. Haslegrave, T. Huynh, J. Legerský, A. Nixon, Stable cuts, NAC-colourings and flexible realisations of graphs, arXiv:2412.16018 (2024).
A. Clay, T. Jordán, S. H. Tóth, Minimally rigid tensegrity frameworks, arXiv:2410.07452 (2024).
K. Bérczi, T. Király, Y. Yamaguchi, Y. Yokoi, Rainbow Arborescence Conjecture, arXiv:2412.15457 (2024).
K. Bérczi, V. Livanos, J. Soto, V. Verdugo, Matroid secretary via labeling schemes, arXiv:2411.12069 (2024).
D. Garamvölgyi, R. Mizutani, T. Oki, T. Schwarcz, Y. Yamaguchi, Towards the proximity conjecture on group-labeled matroids, arXiv:2411.06771 (2024).
K. Bérczi, B. Gehér, A. Imolay, L. Lovász, B. Maga, T. Schwarcz, Matroid products via submodular coupling, arXiv:2411.02197 (2024).
K. Bérczi, Á. Jánosik, B. Mátravölgyi, Cyclic ordering of split matroids, arXiv:2411.01061 (2024).
D. Garamvölgyi, Rigidity and reconstruction in matroids of highly connected graphs, arXiv:2410.23431 (2024).
M. Bárász, K. Bérczi, T. Király, Y. Yamaguchi, Y. Yokoi, Matroid Intersection under Minimum Rank Oracle, arXiv:2407.03229 (2024).
K. Bérczi, M. Borbényi, L. Lovász, L. M. Tóth, Cycle Matroids of Graphings: From Convergence to Duality, arXiv:2406.08945 (2024).
K. Bérczi, M. Borbényi, L. Lovász, L. M. Tóth, Quotient-convergence of Submodular Setfunctions, arXiv:2406.08942 (2024).
B. Jackson, T. Jordán, Minimally globally rigid graphs with high minimum degree, EGRES TR-2024-04 (2024).
P. Gehér, A. Sagdeev, G. Tóth, Canonical theorems in geometric Ramsey theory, arXiv:2404.11454 (2024).
G. Csáji, Popularity and perfectness in one-sided matching markets with capacities, arXiv:2403.00598 (2024).
F. Hörsch, A. Imolay, R. Mizutani, T. Oki, T. Schwarcz, Problems on Group-labeled Matroid Bases, arXiv:2402.16259 (2024).
K. Bérczi, K. Chandrasekaran, T. Király, S. Kulkarni, Hypergraph Connectivity Augmentation in Strongly Polynomial Time, arXiv:2402.10861 (2024).
P. Gehér, M. Kölbl, L. M. Mendoza-Cadena, D. P. Szabo, Diameter Reduction Via Flipping Arcs, arXiv:2402.06259 (2024).
G. Araujo-Pardo, L. M. Mendoza-Cadena, On Mixed Cages of Girth 6, arXiv:2401.14768 (2024).
M. Benedek, P. Biró, G. Csáji, M. Johnson, D. Paulusma, X. Ye, Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded, arXiv:2312.16653 (2023)
G. Csáji, Popular and dominant matchings with uncertain, multilayer and aggregated preferences, arXiv:2310.14288 (2023)
G. Csáji, Weakly-popular and super-popular matchings with ties and their connection to stable matchings, arXiv:2310.12269 (2023)
G.Z. Dantas e Moura, T. Jordán, C. Silwerman, On generic universal rigidity on the line, arXiv:2305.14027 (2023).
G. Csáji, T. Király, Y. Yokoi, Approximation algorithms for matroidal and cardinal generalizations of stable matching, arXiv:2208.09583 (2022).
P. Madarasi, M. Simon, On vertex-coloring $\{a,b\}$-edge-weightings of graphs, EGRES Technical Report TR-2022-06 (2022).
K. Bérczi, A. Göke, L. M. Mendoza-Cadena, M. Mnich, Resolving Infe a sibility of Linear Systems: A Parameterized Approach, arxiv:2209.02017 (2022).
P. Madarasi, The simultaneous assignment problem, arXiv:2105.09439 (2021).

Journal Articles

K. Bérczi, B. Gehér, A. Imolay, L. Lovász, T. Schwarcz, Monotonic Decompositions of Submodular Set Functions, SIAM Journal on Discrete Mathematics, to appear (2025).
K. Bérczi, T. Király, D. Szabó, Multiway Cuts with a Choice of Representatives, Discrete Applied Mathematics, 379, pp. 827–839 (2025).
K. Bérczi, B. Mátravölgyi, T. Schwarcz, Reconfiguration of basis pairs in regular matroids, Journal of Combinatorial Theory B, to appear (2025).
Y. Bai, K. Bérczi, G. Csáji, T. Schwarcz, Approximating maximum-size properly colored forests, European Journal of Combinatorics, 132(B) (2025).
G. Araujo-Pardo, M. Mendoza-Cadena, A Note on Mixed Cages of Girth 5, Discrete Applied Mathematics, 349(2), (2026).
B. Jackson, T. Jordán, Minimally globally rigid graphs with high minimum degree, Fields Communication, to appear (2025).
K. Bérczi, K. Chandrasekaran, T. Király, S. Kulkarni, Splitting-off in Hypergraphs, Journal of Combinatorial Theory B, 176, pp. 319-383, 2026.
P. Gehér, G. Tóth, 1-planar unit distance graphs, European Journal of Combinatorics, 130, 104212 (2025).
T. Jordán, S. Villányi, Globally linked pairs and cheapest globally rigid supergraphs, SIAM Journal on Discrete Mathematics, 39(3), pp. 1520–1544 (2025).
K. Bérczi, T. Király, Y. Kobayashi, Y. Yamaguchi, Y. Yokoi, Finding Spanning Trees with Perfect Matchings, Discrete Applied Mathematics (2025).
Y. Kobayashi, R. Mahara, T. Schwarcz, Reconfiguration of the union of arborescences, Algorithmica, 87, pp. 1040–1059 (2025).
D. Garamvölgyi, T. Jordán, Cs. Király, S. Villányi, Highly connected orientations from edge-disjoint rigid subgraphs, Forum of Mathematics, Pi, 13 (2025).
K. Bérczi, L. M. Mendoza-Cadena, K. Varga, Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $\ell_\infty$-norm objectives, Optimization Letters (2025).
K. Bérczi, L. Codazzi, J. Golak, A. Grigoriev, Envy-free dynamic pricing schemes, Operations Research (2025).
N. Frankl, P. Gehér, A. Sagdeev, G. Tóth, Monochromatic Infinite Sets in Minkowski Planes, Discrete and Computational Geometry (2024).
A. Jüttner, Cs. Király, L. M. Mendoza-Cadena, Gy. Pap, I. Schlotter, Y. Yamaguchi, Shortest odd path in conservative undirected graphs, Discrete Applied Mathematics, 357, pp. 34–50 (2024).
K. Bérczi, G. K. Csáji, T. Király, Manipulating the outcome of stable matching and roommates problems, Games and Economic Behavior, 147, pp. 407–428 (2024).
Cs. Beke, G. K. Csáji, P. Csikvári, S. Pituk, Permutation Tutte polynomial, European Journal of Combinatorics, 120 (2024).
G. Csáji, T. Király, Y. Yokoi, Solving the maximum popular matching problem with matroid constraints, SIAM Journal on Discrete Mathematics, 38(3), pp. 2226–2242 (2024).
D. Garamvölgyi, T. Jordán, Partial reflections and globally linked pairs in rigid graphs, SIAM Journal on Discrete Mathematics, 38(3), pp. 2005–2040 (2024).
K. Bérczi, L. M. Mendoza-Cadena, On the Complexity of Inverse Bivariate Multi-unit Assignment Valuation Problems, Optimization, pp. 1–16 (2024).
Cs. Beke, G. K. Csáji, P. Csikvári, S. Pituk, The Merino–Welsh conjecture is false for matroids, Advances in Mathematics, 446 (2024).
P. Biró, G. Csáji, Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains, Games and Economic Behavior, 145, pp. 217–238 (2024).
T. Jordán, S. Villányi, Globally linked pairs of vertices in generic frameworks, Combinatorica, 44, pp. 817–838 (2024).
K. Bérczi, E. Boros, M. Kazuhisa, Hypergraph Horn functions, SIAM Journal on Discrete Mathematics, 38(2), pp. 1417–1437 (2024).
K. Bérczi, T. Király, S. Omlor, Scheduling with non-renewable resources: Minimizing the sum of completion times, Journal of Scheduling, 27, pp. 151–164 (2024).
K. Bérczi, B. Mátravölgyi, T. Schwarcz, Weighted exchange distance of basis pairs, Discrete Applied Mathematics, 349, pp. 130–143 (2024).
J. Pintér, K. Varga, Color-avoiding connected spanning subgraphs with minimum number of edges, Discrete Applied Mathematics, 349, pp. 25–43 (2024).
D. Garamvölgyi, T. Jordán, Cs. Király, Count and cofactor matroids of hig hly connected graphs, Journal of Combinatorial Theory, Series B, 166, pp. 1–29 (2024).
K. Bérczi, E. Boros, M. Kazuhisa, Matroid Horn functions, Journal of Combinatorial Theory A, 203 (2024).
T. Jordán, Ear-decompositions, minimally connected matroids, and rigid graphs, Journal of Graph Theory, 105(3), pp. 451–467 (2024).
K. Bérczi, T. Schwarcz, Exchange distance of basis pairs in split matroids, SIAM Journal on Discrete Mathematics, 38(1), pp. 132–147 (2024).
K. Bérczi, T. Schwarcz, Partitioning into common independent sets via relaxing strongly base orderability, Journal of Combinatorial Theory A, 202 (2024).
K. Bérczi, E. R. Bérczi-Kovács, E. Boros, F. G. Tolessa, N. Kamiyama, K. Telikepalli, Y. Kobayashi, and K. Makino, Envy-free relaxations for goods, chores, and mixed items, Theoretical Computer Science, 1002:114596, 2024.
P. Madarasi, Matchings under distance constraints II, Annals of Operations Research, 332, pp. 303–327 (2024).
K. Bérczi, H. P. Hoang, L. Tóthmérész, On approximating the rank of graph divisors, Discrete Mathematics, 346(9) (2023).
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).
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).
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).
K. Bérczi, G. K. Csáji, T. Király, On the complexity of packing rainbow spanning trees, Discrete Mathematics, 346(4) (2023).
K. Bérczi, M. Mnich, and R. Vincze, Approximations for many-visits multiple traveling salesman problems, Omega, 116 (2023).
K. Bérczi, L. M. Mendoza-Cadena, K. Varga, Inverse optimization problems with multiple weight functions, Discrete Applied Mathematics, 327, pp. 134–147 (2023).
K. Bérczi, K. Chandrasekaran, T. Király, and A. Pillai, Analyzing Residual Random Greedy for monotone submodular maximization, Information Processing Letters, 180 (2023).
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).
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).
G. Csáji, On the complexity of stable hypergraph matching, stable multicommodity flow and related problems, Theoretical Computer Science, 931, pp. 1–16 (2022).
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).
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).
K. Bérczi and T. Schwarcz, Rainbow and monochromatic circuits and cocircuits in binary matroids, Discrete Mathematics, 345(6) (2022).
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).
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).
K. Bérczi, N. Kakimura, and Y. Kobayashi, Market pricing for matroid rank valuati ons, SIAM Journal on Discrete Mathematics, 35(4), pp. 2662–2678 (2021).
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).
K. Bérczi, T. Schwarcz, Complexity of packing common bases in matroids, Mathematical Programming, 188(1), pp. 1–18 (2021).

Refereed Conference Proceedings

K. Bérczi, B. Gehér, A. Imolay, L. Lovász, C. Padró, T. Schwarcz, Interaction between skew-representability, tensor products, extension properties, and rank inequalities, ACM-SIAM Symposium on Discrete Algorithms (SODA 2026).
G. Araujo-Pardo, L. M. Mendoza-Cadena, Constructions of Small Regular Mixed Graphs with Girth 5 and 6, XIII Latin American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025).
I. Schlotter, L. M. Mendoza-Cadena, The Strong Core of Housing Markets with Partial Order Preferences, 24th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2025).
D. Garamvölgyi, R. Mizutani, T. Oki, T. Schwarcz, Y. Yamaguchi, Towards the proximity conjecture on group-labeled matroids, 52nd EATCS International Colloquium on Automata, Languages and Programming (ICALP 2025).
K. Bérczi, B. Gehér, A. Imolay, L. Lovász, B. Maga, T. Schwarcz, Matroid products via submodular coupling, 57th Annual ACM Symposium on Theory of Computing (STOC 2025).
K. Bérczi, V. Livanos, J. Soto, V. Verdugo, Matroid secretary via labeling schemes, 26th Conference on Integer Programming and Combinatorial Optimization (IPCO 2025).
P. Gehér, G. Tóth, 1-Planar Unit Distance Graphs, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024).
P. Gehér, M. Kölbl, L. M. Mendoza-Cadena, D. P. Szabo, Diameter Reduction via Flipping Arcs, 11th Latin American Workshop on Cliques in Graphs (LAWCG 2024).
L. Codazzi, G. Csáji, M. Mnich, Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities, 33rd International Joint Conference on Artificial Intelligence (IJCAI 2024).
G. Csáji, Popular and Dominant Matchings with Uncertain and Multimodal Preferences, 33rd International Joint Conference on Artificial Intelligence (IJCAI 2024).
G. Csáji, D. Manlove, I. McBridge, J. Trimble, Couples can be tractable: New algorithms and hardness results for the Hospitals/Residents problem with Couples, 33rd International Joint Conference on Artificial Intelligence (IJCAI 2024).
K. Bérczi, T. Király, D. Szabó, Multiway Cuts with a Choice of Representatives, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024).
K. Bérczi, K. Chandrasekaran, T. Király, S. Kulkarni, Hypergraph Connectivity Augmentation in Strongly Polynomial Time, European Symposium on Algorithms (ESA 2024).
Y. Bai, K. Bérczi, G. Csáji, T. Schwarcz, Approximating maximum-size properly colored forests, European Symposium on Algorithms (ESA 2024).
F. Hörsch, A. Imolay, R. Mizutani, T. Oki, T. Schwarcz, Problems on Group-labeled Matroid Bases, 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024).
K. Bérczi, K. Chandrasekaran, T. Király, S. Kulkarni, Splitting-off in Hypergraphs, 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024).
K. Bérczi, B. Mátravölgyi, T. Schwarcz, Reconfiguration of basis pairs in regular matroids, 56th Annual ACM Symposium on Theory of Computing (STOC 2024).
G. Csáji, A Simple 1.5-approximation Algorithm for a Wide Range of Maximum Size Stable Matching Problems, 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2024).
K. Bérczi, L. M. Mendoza-Cadena, K. Varga, Newton-type algorithms for inverse optimization: weighted span objective, Latin American Theoretical Informatics (LATIN 2024).
G. Csáji, T. Király, Y. Yokoi, Approximation algorithms for matroidal and cardinal generalizations of stable matching, SIAM Symposium on Simplicity in Algorithms (SOSA 2023).
H. Aziz, G. Csáji, Á. Cseh, Computational complexity of k-stable matchings, International Symposium on Algorithmic Game Theory (SAGT 2023).
Y. Kobayashi, R. Mahara, T. Schwarcz, Reconfiguration of the union of arborescences, 34st International Symposium on Algorithms and Computation (ISAAC 2023).
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).
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).
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).
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).
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).
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

T. Jordán, Orientations of graphs with rooted connectivity requirements, 13th Hungarian Japanese Symposium on Discrete Mathematics and Its Applications (May 2025).
Á. Jánosik, Cyclic ordering of split matroids, 13th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (May 2025).
K. Varga, Color-avoiding connected spanning subgraphs with minimum number of edges, 10th VOCAL Optimization Conference: Advanced Algorithms (June 2024).
P. Madarasi, Heuristics for finding largest (k,l)-sparse subgraphs, 10th VOCAL Optimization Conference: Advanced Algorithms (June 2024).
G. Csáji, On the complexity of finding maximum size properly colored trees and forests in edge-colored graphs, 10th VOCAL Optimization Conference: Advanced Algorithms (June 2024).
T. Schwarcz, Problems on group-labeled matroid bases, 10th VOCAL Optimization Conference: Advanced Algorithms (June 2024).
L. M. Mendoza-Cadena, On mixed cages, Seminar on Discrete Mathematics, Mathematics Institute, Juriquilla Campus, UNAM (March 2024).
L. M. Mendoza-Cadena, Shortest odd path in conservative undirected graphs, 56th Congress of the Mexican Mathematical Society (Oct. 2023).
K. Bérczi, Reduction of Matroids and Its Application to Optimization Problems, SIAM Conference on Optimization (June 2023).
T. Jordán, On generic universal rigidity on the line, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
P. Madarasi, Simultaneous assignments, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
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).
T. Schwarcz, Partitioning into common independent sets via relaxing strongly base orderability, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
B. Mátravölgyi, Weighted exchange distance of basis pairs, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
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).
K. Bérczi, Dynamic pricing schemes, 12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (March 2023).
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).
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).
K. Varga, Edge-color-avoiding connected colorings and orientations, 39th Colloquium on Combinatorics, KOLKOM (Nov. 2022).
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).
K. Bérczi, Extensions of the traveling salesman problem, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).
L. M. Mendoza Cadena, Inverse arborescence problem with multiple cost functions, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).
T. Schwarcz, Rainbow and monochromatic circuits and cuts in binary matroids, XXXIV. Magyar Operációkutatási Konferencia, Cegléd (Sept. 2021).

Seminars, Workshops & Summer schools

K. Bérczi, Interaction between skew-representability, tensor products, extension properties, and rank inequalities, Bonn Workshop on Combinatorial Optimization, Bonn (Nov. 2025).
K. Bérczi, Monotonic Decompositions of Submodular Set Functions, Workshop on Algorithmic and Structural Aspects of Submodularity, Chicago (Aug. 2025).
K. Bérczi, Matroid Products via Submodular Coupling, KTH Combinatorics Seminar, KTH Royal Institute of Technology, Stockholm (March 2025).
K. Bérczi, Packing and Covering Problems in Matroids, XX Summer School in Discrete Mathematics, Viña del Mar (Jan. 2025).
K. Bérczi, Approximability of multiway cut, Mixed Integer Programming International Workshop, Mumbai (Dec. 2024).
K. Bérczi, Matroid reconfiguration problems, Bremen Workshop on Combinatorial Reconfiguration and Beyond, Bremen (Nov. 2024).
T. Schwarcz, Reconfiguration of the union of arborescences, Bremen Workshop on Combinatorial Reconfiguration and Beyond, Bremen (Nov. 2024)
K. Bérczi, Matroid products via submodular coupling, HUN-REN Rényi Institute, Budapest (Nov. 2024).
K. Bérczi, Relaxing strongly base orderability for matroids, Colloquium of Faculty of Informatics, Brno (Oct. 2024).
L. M. Mendoza-Cadena, Inverse problems in combinatorial optimization, Seminar of Operations Research Dissemination, Mexico City (Aug. 2024).
T. Jordán, Minimally rigid tensegrity frameworks, Theory and Algorithms in Graph Rigidity and Algebraic Statistics, Shonan Village Center seminar (Sept. 2024).
T. Schwarcz, Reconfiguration of basis pairs in regular matroids, 2024 Workshop on (Mostly) Matroids (Aug. 2024).
T. Jordán, Highly connected orientations of graphs, Graphs and combinatorics workshop, NWPU, Xi’an (June 2024).
T. Jordán, Tensegrity frameworks, Workshop on Geometric Rigidity, Graphic Statics and Engineering, London (June 2024).
T. Jordán, Highly connected orientations and removable spanning trees with the help of graph rigidity, Combinatorics Seminar, HUN-REN Rényi Institute, Budapest (May 2024).
P. Madarasi, Efficient implementations of algorithms for finding largest (k,l)-sparse subgraphs, Landscapes of rigidity workshop, Special Semester on Rigidity and Flexibility, Johann Radon Institute, Linz, Austria (March 2024).
T. Jordán, Rigidity and connectivity, Landscapes of rigidity workshop, Special Semester on Rigidity and Flexibility, Johann Radon Institute, Linz, Austria (March 2024).
K. Bérczi, Dynamic prices and 2-polymatroids, University of Chile (Jan. 2024).
K. Bérczi, Reconfiguration of basis pairs in regular matroids, Seminar on Combinatorics, Games and Optimisation, London School of Economics (Dec. 2023).
T. Schwarcz, Reconfiguration of basis pairs in regular matroids, Mathematical Informatics 7th Laboratory, The University of Tokyo (Nov. 2023).
K. Bérczi, Dynamic pricing schemes in combinatorial markets, Workshop on Matroids and Applications in Combinatorial Optimization, Quantum Physics, and Statistics, Leuven (Nov. 2023).
P. Gehér, 1-planar unit distance graphs, Erdős Center Seminar of Discrete Geometry and Convexity, Budapest (Oct., 2023).
K. Bérczi, Matroid Horn functions, Boolean Seminar, Liblice (Sept. 2023).
T. Schwarcz, Reconfiguration of the union of arborescences, 3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023, Paderborn (Jul. 2023).
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).
K. Bérczi, Newton-type algorithms in inverse optimization, CIAS-CCOR Optimization Seminar, Budapest (May 2023).
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).
K. Bérczi, Supermodularity in unweighted graph optimization: Algorithms, Combinatorial Optimization Seminar, Grenoble (Apr. 2023).
T. Schwarcz, Reconfiguration of the union of arborescences, Combinatorial Optimization Seminar, Grenoble (Apr. 2023).
T. Schwarcz, Weighted exchange distance of basis pairs, RIMS, Kyoto (Feb. 2023).
K. Bérczi, Exchange distance of basis pairs, RIMS, Kyoto (Jan. 2023).
T. Jordán, A távolságok geometriájának algoritmikus kérdéseiről, CIAS-CCOR Optimization Seminar, Budapest (Nov. 2022).
K. Bérczi, Paths consisting of short edges of the matroid intersection polytope, Eleventh Cargese Workshop on Combinatorial Optimization (Sept. 2022).
T. Schwarcz, Exchange distance of basis pairs in split matroids, 29th British Combinatorial Conference, Lancaster (Jul. 2022).
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).
K. Bérczi, Exchange distance in split matroids, KTH Combinatorics Seminar, KTH Royal Institute of Technology, Stockholm (Apr. 2022).
K. Bérczi, Structural properties of matroid base families, Trimester Program on Discrete Optimization, Hausdorff Research Institute for Mathematics, Bonn (Nov. 2021).
K. Bérczi, Dynamic pricing in combinatorial markets, Game Theory Seminar, Corvinus University, Budapest (Oct. 2021).