Follow
Tamás Király
Title
Cited by
Cited by
Year
On decomposing a hypergraph into k connected sub-hypergraphs
A Frank, T Király, M Kriesell
Discrete Applied Mathematics 131 (2), 373-383, 2003
1352003
On the orientation of graphs and hypergraphs
A Frank, T Király, Z Király
Discrete Applied Mathematics 131 (2), 385-400, 2003
902003
Degree bounded matroids and submodular flows
T Király, LC Lau, M Singh
International Conference on Integer Programming and Combinatorial …, 2008
56*2008
Combined connectivity augmentation and orientation problems
A Frank, T Király
Discrete applied mathematics 131 (2), 401-419, 2003
302003
Kernels, Stable Matchings, and Scarf's Lemma (Combinatorial Optimization and Discrete Algorithms)
T KIRALY, J PAP
RIMS Kokyuroku Bessatsu 23, 131-145, 2010
20*2010
A survey on covering supermodular functions
A Frank, T Király
Research Trends in Combinatorial Optimization: Bonn 2008, 87-126, 2009
202009
A note on kernels and Sperner’s Lemma
T Király, J Pap
Discrete Applied Mathematics 157 (15), 3327-3331, 2009
182009
Improving the integrality gap for multiway cut
K Bérczi, K Chandrasekaran, T Király, V Madan
Mathematical Programming 183 (1), 171-193, 2020
172020
Blocking Optimal k-Arborescences
A Bernáth, T Király
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
162016
Covering intersecting bi-set families under matroid constraints
K Bérczi, T Király, Y Kobayashi
SIAM journal on discrete mathematics 30 (3), 1758-1774, 2016
162016
On polyhedra related to even factors
T Király, M Makai
International Conference on Integer Programming and Combinatorial …, 2004
162004
Stable multicommodity flows
T Király, J Pap
algorithms 6 (1), 161-168, 2013
152013
Recent results on well-balanced orientations
A Bernáth, S Iwata, T Király, Z Király, Z Szigeti
Discrete Optimization 5 (4), 663-676, 2008
152008
Total Dual Integrality of Rothblum's Description of the Stable-Marriage Polyhedron
T Király, J Pap
Mathematics of Operations Research 33 (2), 283-290, 2008
152008
Edge-connectivity of undirected and directed hypergraphs
T Király, A Frank
Operations research Department of Eötvös Loránd Univesity, 2003
142003
Approximate min–max theorems for Steiner rooted-orientations of graphs and hypergraphs
T Király, LC Lau
Journal of Combinatorial Theory, Series B 98 (6), 1233-1252, 2008
132008
Popular branchings and their dual certificates
T Kavitha, T Király, J Matuschke, I Schlotter, U Schmidt-Kraepelin
Integer Programming and Combinatorial Optimization: 21st International …, 2020
122020
Minimizing submodular functions on diamonds via generalized fractional matroid matchings
S Fujishige, T Király, K Makino, K Takazawa, S Tanigawa
EGRES Technical Report 2014-14, 2014
122014
A new approach to splitting-off
A Bernáth, T Király
Integer Programming and Combinatorial Optimization: 13th International …, 2008
122008
Popular branchings and their dual certificates
T Kavitha, T Király, J Matuschke, I Schlotter, U Schmidt-Kraepelin
Mathematical Programming 192 (1), 567-595, 2022
102022
The system can't perform the operation now. Try again later.
Articles 1–20