Tamás Király

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 52

Top Topics

Completion Times

Optimization Methods

Bipartite Graph

Top Venues

SIAM J. Discret. Math.

Publications

Kristóf Bérczi, Tamás Király, Daniel P. Szabo
Multiway Cuts with a Choice of Representatives. MFCS (2024)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. CoRR (2024)
Kristóf Bérczi, Tamás Király, Simon Omlor
Scheduling with non-renewable resources: minimizing the sum of completion times. J. Sched. 27 (2) (2024)
Péter Biró, Sándor Bozóki, Tamás Király, Alexandru Kristály
Optimization methods and algorithms. Central Eur. J. Oper. Res. 32 (1) (2024)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
Splitting-Off in Hypergraphs. ICALP (2024)
Kristóf Bérczi, Tamás Király, Daniel P. Szabo
Multiway Cuts with a Choice of Representatives. CoRR (2024)
Mihály Bárász, Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Minimum Rank Oracle. CoRR (2024)
Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
Finding Spanning Trees with Perfect Matchings. CoRR (2024)
Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi
Popular Maximum-Utility Matchings with Matroid Constraints. CoRR (2024)
Gergely Kál Csáji, Tamás Király, Yu Yokoi
Solving the Maximum Popular Matching Problem with Matroid Constraints. SIAM J. Discret. Math. 38 (3) (2024)
Kristóf Bérczi, Gergely Csáji, Tamás Király
Manipulating the outcome of stable marriage and roommates problems. Games Econ. Behav. 147 (2024)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni
Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time. CoRR (2023)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. 37 (2) (2023)
Gergely Csáji, Tamás Király, Yu Yokoi
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. SOSA (2023)
Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
Hypergraph characterization of split matroids. J. Comb. Theory, Ser. A 194 (2023)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai
Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. 180 (2023)
Kristóf Bérczi, Gergely Csáji, Tamás Király
On the complexity of packing rainbow spanning trees. Discret. Math. 346 (4) (2023)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
Popular branchings and their dual certificates. Math. Program. 192 (1) (2022)
Kristóf Bérczi, Gergely Csáji, Tamás Király
Manipulating the outcome of stable matching and roommates problems. CoRR (2022)
Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa
Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory, Ser. B 157 (2022)
Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
Hypergraph characterization of split matroids. CoRR (2022)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
The popular assignment problem: when cardinality is more important than popularity. SODA (2022)
Gergo Gombos, Dávid Kis, Lilla Tóthmérész, Tamás Király, Szilveszter Nádas, Sándor Laki
Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology. IEEE Access 10 (2022)
Gergely Csáji, Tamás Király, Yu Yokoi
Solving the Maximum Popular Matching Problem with Matroid Constraints. CoRR (2022)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Restricted Oracles. CoRR (2022)
Tamás Király, Yu Yokoi
Equitable partitions into matchings and coverings in mixed graphs. Discret. Math. 345 (1) (2022)
Kristóf Bérczi, Gergely Csáji, Tamás Király
On the complexity of packing rainbow spanning trees. CoRR (2022)
Gergely Csáji, Tamás Király, Yu Yokoi
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching. CoRR (2022)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Approximation by lexicographically maximal solutions in matching and matroid intersection problems. Theor. Comput. Sci. 910 (2022)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
The popular assignment problem: when cardinality is more important than popularity. CoRR (2021)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR (2021)
Kristóf Bérczi, Tamás Király, Simon Omlor
Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. ISCO (2020)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
Popular Branchings and Their Dual Certificates. IPCO (2020)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
A tight $\sqrt{2}$-approximation for linear 3-cut. Math. Program. 184 (1) (2020)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
Improving the integrality gap for multiway cut. Math. Program. 183 (1) (2020)
Tamás Király, Zsuzsa Mészáros-Karkus
Finding strongly popular b-matchings in bipartite graphs. Eur. J. Comb. 88 (2020)
Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin
Popular Branchings and Their Dual Certificates. CoRR (2019)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Beating the 2-approximation factor for global bicut. Math. Program. 177 (1-2) (2019)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
Improving the Integrality Gap for Multiway Cut. IPCO (2019)
Kristóf Bérczi, Tamás Király, Simon Omlor
Scheduling with Non-Renewable Resources: Minimizing the Sum of Completion Times. CoRR (2019)
Tamás Király, Yu Yokoi
Equitable Partitions into Matchings and Coverings in Mixed Graphs. CoRR (2018)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
Improving the Integrality Gap for Multiway Cut. CoRR (2018)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Vivek Madan
A tight -approximation for Linear 3-Cut. SODA (2018)
Tamás Király
Base polyhedra and the linking property. J. Comb. Optim. 36 (3) (2018)
Kristóf Bérczi, Attila Bernáth, Tamás Király, Gyula Pap
Blocking optimal structures. Discret. Math. 341 (7) (2018)
Tamás Király, Zsuzsa Mészáros-Karkus
Finding strongly popular b-matchings in bipartite graphs. Electron. Notes Discret. Math. 61 (2017)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Global and Fixed-Terminal Cuts in Digraphs. APPROX-RANDOM (2017)
Kristóf Bérczi, Tamás Király, Yusuke Kobayashi
Covering Intersecting Bi-set Families under Matroid Constraints. SIAM J. Discret. Math. 30 (3) (2016)
Tamás Király, Júlia Pap
An extension of Lehman's theorem and ideal set functions. Discret. Appl. Math. 209 (2016)
Attila Bernáth, Tamás Király
-Arborescences. SODA (2016)
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu
Global and fixed-terminal cuts in digraphs. CoRR (2016)
Attila Bernáth, Tamás Király
Blocking optimal k-arborescences. CoRR (2015)
András Frank, Tamás Király, Júlia Pap, David Pritchard
Characterizing and recognizing generalized polymatroids. Math. Program. 146 (1-2) (2014)
Tamás Király, Júlia Pap
Stable Multicommodity Flows. Algorithms 6 (1) (2013)
Tamás Király, Júlia Pap
PPAD-completeness of polyhedral versions of Sperner's Lemma. Discret. Math. 313 (15) (2013)
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
Algorithms for multiplayer multicommodity flow problems. Central Eur. J. Oper. Res. 21 (4) (2013)
Tamás Király, Lap Chi Lau, Mohit Singh
Degree bounded matroids and submodular flows. Comb. 32 (6) (2012)
Attila Bernáth, Tamás Király
A unifying approach to splitting-off. Comb. 32 (4) (2012)
Tamás Király, Lap Chi Lau
Degree Bounded Forest Covering. IPCO (2011)
Nicholas J. A. Harvey, Tamás Király, Lap Chi Lau
On Disjoint Common Bases in Two Matroids. SIAM J. Discret. Math. 25 (4) (2011)
Tamás Király, Júlia Pap
A note on kernels and Sperner's Lemma. Discret. Appl. Math. 157 (15) (2009)
Tamás Király, Jácint Szabó
A note on parity constrained orientations. Comb. 29 (5) (2009)
Attila Bernáth, Tamás Király
Covering skew-supermodular functions by hypergraphs of minimum total size. Oper. Res. Lett. 37 (5) (2009)
Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti
Recent results on well-balanced orientations. Discret. Optim. 5 (4) (2008)
Tamás Király, Lap Chi Lau, Mohit Singh
Degree Bounded Matroids and Submodular Flows. IPCO (2008)
András Frank, Tamás Király
A Survey on Covering Supermodular Functions. Bonn Workshop of Combinatorial Optimization (2008)
Tamás Király, Júlia Pap
Total Dual Integrality of Rothblum's Description of the Stable-Marriage Polyhedron. Math. Oper. Res. 33 (2) (2008)
Attila Bernáth, Tamás Király
A New Approach to Splitting-Off. IPCO (2008)
Tamás Király, Lap Chi Lau
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs. J. Comb. Theory, Ser. B 98 (6) (2008)
Tamás Király, Lap Chi Lau
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. FOCS (2006)
Tamás Király
Covering symmetric supermodular functions by uniform hypergraphs. J. Comb. Theory, Ser. B 91 (2) (2004)
Tamás Király, Márton Makai
On Polyhedra Related to Even Factors. IPCO (2004)
András Frank, Tamás Király, Matthias Kriesell
On decomposing a hypergraph into k connected sub-hypergraphs. Discret. Appl. Math. 131 (2) (2003)
András Frank, Tamás Király, Zoltán Király
On the orientation of graphs and hypergraphs. Discret. Appl. Math. 131 (2) (2003)
András Frank, Tamás Király
Combined connectivity augmentation and orientation problems. Discret. Appl. Math. 131 (2) (2003)
András Frank, Tamás Király
Combined Connectivity Augmentation and Orientation Problems. IPCO (2001)