Combined connectivity augmentation and orientation problems. - András Frank; Tamás Király (Discret. Appl. Math., 2003)

On decomposing a hypergraph into k connected sub-hypergraphs. - András Frank; Tamás Király; Matthias Kriesell (Discret. Appl. Math., 2003)

On the orientation of graphs and hypergraphs. - András Frank; Tamás Király; Zoltán Király (Discret. Appl. Math., 2003)

On Polyhedra Related to Even Factors. - Tamás Király; Márton Makai (IPCO, 2004)

Covering symmetric supermodular functions by uniform hypergraphs. - Tamás Király (J. Comb. Theory B, 2004)

Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. - Tamás Király; Lap Chi Lau (FOCS, 2006)

A Survey on Covering Supermodular Functions. - András Frank; Tamás Király (Bonn Workshop of Combinatorial Optimization, 2008)

A New Approach to Splitting-Off. - Attila Bernáth; Tamás Király (IPCO, 2008)

Recent results on well-balanced orientations. - Attila Bernáth; Satoru Iwata 001; Tamás Király; Zoltán Király; Zoltán Szigeti (Discret. Optim., 2008)

Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs. - Tamás Király; Lap Chi Lau (J. Comb. Theory B, 2008)

Total Dual Integrality of Rothblum's Description of the Stable-Marriage Polyhedron. - Tamás Király; Júlia Pap (Math. Oper. Res., 2008)

A note on parity constrained orientations. - Tamás Király; Jácint Szabó (Comb., 2009)

A note on kernels and Sperner's Lemma. - Tamás Király; Júlia Pap (Discret. Appl. Math., 2009)

Covering skew-supermodular functions by hypergraphs of minimum total size. - Attila Bernáth; Tamás Király (Oper. Res. Lett., 2009)

Degree Bounded Forest Covering. - Tamás Király; Lap Chi Lau (IPCO, 2011)

On Disjoint Common Bases in Two Matroids. - Nicholas J. A. Harvey; Tamás Király; Lap Chi Lau (SIAM J. Discret. Math., 2011)

A unifying approach to splitting-off. - Attila Bernáth; Tamás Király (Comb., 2012)

Degree bounded matroids and submodular flows. - Tamás Király; Lap Chi Lau; Mohit Singh (Comb., 2012)

Stable Multicommodity Flows. - Tamás Király; Júlia Pap (Algorithms, 2013)

Algorithms for multiplayer multicommodity flow problems. - Attila Bernáth; Tamás Király; Erika R. Kovács; Gergely Mádi-Nagy; Gyula Pap; Júlia Pap; Jácint Szabó; László A. Végh (Central Eur. J. Oper. Res., 2013)

PPAD-completeness of polyhedral versions of Sperner's Lemma. - Tamás Király; Júlia Pap (Discret. Math., 2013)

Characterizing and recognizing generalized polymatroids. - András Frank; Tamás Király; Júlia Pap; David Pritchard 001 (Math. Program., 2014)

Blocking optimal k-arborescences. - Attila Bernáth; Tamás Király (CoRR, 2015)

Blocking Optimal k-Arborescences. - Attila Bernáth; Tamás Király (SODA, 2016)

An extension of Lehman's theorem and ideal set functions. - Tamás Király; Júlia Pap (Discret. Appl. Math., 2016)

Covering Intersecting Bi-set Families under Matroid Constraints. - Kristóf Bérczi; Tamás Király; Yusuke Kobayashi 001 (SIAM J. Discret. Math., 2016)

Global and Fixed-Terminal Cuts in Digraphs. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (APPROX-RANDOM, 2017)

Finding strongly popular b-matchings in bipartite graphs. - Tamás Király; Zsuzsa Mészáros-Karkus (Electron. Notes Discret. Math., 2017)

A tight -approximation for Linear 3-Cut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan (SODA, 2018)

Blocking optimal structures. - Kristóf Bérczi; Attila Bernáth; Tamás Király; Gyula Pap (Discret. Math., 2018)

Base polyhedra and the linking property. - Tamás Király (J. Comb. Optim., 2018)

Beating the 2-approximation factor for global bicut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Euiwoong Lee; Chao Xu 002 (Math. Program., 2019)

Improving the integrality gap for multiway cut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan (Math. Program., 2020)

A tight $ sqrt{2}$-approximation for linear 3-cut. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Vivek Madan (Math. Program., 2020)

The popular assignment problem: when cardinality is more important than popularity. - Telikepalli Kavitha; Tamás Király; Jannik Matuschke; Ildikó Schlotter; Ulrike Schmidt-Kraepelin (SODA, 2022)

Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology. - Gergo Gombos; Dávid Kis; Lilla Tóthmérész; Tamás Király; Szilveszter Nádas; Sándor Laki (IEEE Access, 2022)

Manipulating the outcome of stable matching and roommates problems. - Kristóf Bérczi; Gergely Kál Csáji; Tamás Király (CoRR, 2022)

Equitable partitions into matchings and coverings in mixed graphs. - Tamás Király; Yu Yokoi (Discret. Math., 2022)

Minimizing submodular functions on diamonds via generalized fractional matroid matchings. - Satoru Fujishige; Tamás Király; Kazuhisa Makino; Kenjiro Takazawa; Shin-ichi Tanigawa (J. Comb. Theory B, 2022)

Popular branchings and their dual certificates. - Telikepalli Kavitha; Tamás Király; Jannik Matuschke; Ildikó Schlotter; Ulrike Schmidt-Kraepelin (Math. Program., 2022)

Approximation by lexicographically maximal solutions in matching and matroid intersection problems. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (Theor. Comput. Sci., 2022)

Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. - Gergely Kál Csáji; Tamás Király; Yu Yokoi (SOSA, 2023)

Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Shubhang Kulkarni (CoRR, 2023)

Analyzing Residual Random Greedy for monotone submodular maximization. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Aditya Pillai (Inf. Process. Lett., 2023)

Hypergraph characterization of split matroids. - Kristóf Bérczi; Tamás Király; Tamás Schwarcz; Yutaro Yamaguchi 001; Yu Yokoi (J. Comb. Theory A, 2023)

On the complexity of packing rainbow spanning trees. - Kristóf Bérczi; Gergely Kál Csáji; Tamás Király (Discret. Math., 2023)

Matroid Intersection under Restricted Oracles. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (SIAM J. Discret. Math., 2023)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Shubhang Kulkarni (ESA, 2024)

Splitting-Off in Hypergraphs. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Shubhang Kulkarni (ICALP, 2024)

Multiway Cuts with a Choice of Representatives. - Kristóf Bérczi; Tamás Király; Daniel P. Szabo (MFCS, 2024)

Matroid Intersection under Minimum Rank Oracle. - Mihály Bárász; Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2024)

Popular Maximum-Utility Matchings with Matroid Constraints. - Gergely Csáji; Tamás Király; Kenjiro Takazawa; Yu Yokoi (CoRR, 2024)

The NTU Partitioned Matching Game for International Kidney Exchange Programs. - Gergely Csáji; Tamás Király; Zsuzsa Mészáros-Karkus (CoRR, 2024)

A new approach to bipartite stable matching optimization. - Tamás Fleiner; András Frank; Tamás Király (CoRR, 2024)

Rainbow Arborescence Conjecture. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2024)

Manipulating the outcome of stable marriage and roommates problems. - Kristóf Bérczi; Gergely Csáji; Tamás Király (Games Econ. Behav., 2024)

Solving the Maximum Popular Matching Problem with Matroid Constraints. - Gergely Kál Csáji; Tamás Király; Yu Yokoi (SIAM J. Discret. Math., 2024)

Optimization methods and algorithms. - Péter Biró 001; Sándor Bozóki; Tamás Király; Alexandru Kristály (Central Eur. J. Oper. Res., 2024)

Scheduling with non-renewable resources: minimizing the sum of completion times. - Kristóf Bérczi; Tamás Király; Simon Omlor (J. Sched., 2024)

Finding spanning trees with perfect matchings. - Kristóf Bérczi; Tamás Király; Yusuke Kobayashi 001; Yutaro Yamaguchi 001; Yu Yokoi (Discret. Appl. Math., 2025)

Approximating Submodular Matroid-Constrained Partitioning. - Kristóf Bérczi; Karthekeyan Chandrasekaran; Tamás Király; Daniel P. Szabo (CoRR, 2025)