Tamás Király

86 papers A* 5A 1B 8C 1Journal 68Unranked 3

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