On decomposing a hypergraph into k connected sub-hypergraphs A Frank, T Király, M Kriesell Discrete Applied Mathematics 131 (2), 373-383, 2003 | 117 | 2003 |

On the orientation of graphs and hypergraphs A Frank, T Király, Z Király Discrete Applied Mathematics 131 (2), 385-400, 2003 | 73 | 2003 |

Degree bounded matroids and submodular flows T Király, LC Lau, M Singh International Conference on Integer Programming and Combinatorial …, 2008 | 47* | 2008 |

Combined connectivity augmentation and orientation problems A Frank, T Király Discrete applied mathematics 131 (2), 401-419, 2003 | 26 | 2003 |

A survey on covering supermodular functions A Frank, T Király Research trends in combinatorial optimization, 87-126, 2009 | 19 | 2009 |

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 | 16 | 2016 |

Kernels, Stable Matchings, and Scarf's Lemma (Combinatorial Optimization and Discrete Algorithms) T KIRALY, J PAP RIMS Kokyuroku Bessatsu 23, 131-145, 2010 | 16* | 2010 |

A note on kernels and Sperner’s Lemma T Király, J Pap Discrete Applied Mathematics 157 (15), 3327-3331, 2009 | 16 | 2009 |

Blocking Optimal *k*-ArborescencesA Bernáth, T Király Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 15 | 2016 |

On polyhedra related to even factors T Király, M Makai International Conference on Integer Programming and Combinatorial …, 2004 | 14 | 2004 |

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 | 13 | 2008 |

A new approach to splitting-off A Bernáth, T Király International Conference on Integer Programming and Combinatorial …, 2008 | 13 | 2008 |

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 | 12 | 2014 |

Edge-connectivity of undirected and directed hypergraphs T Király, A Frank Operations research Department of Eötvös Loránd Univesity, 2003 | 12 | 2003 |

Stable multicommodity flows T Király, J Pap algorithms 6 (1), 161-168, 2013 | 11 | 2013 |

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 | 9 | 2008 |

Covering symmetric supermodular functions by uniform hypergraphs T Király Journal of Combinatorial Theory, Series B 91 (2), 185-200, 2004 | 9 | 2004 |

Profitability of the coin-hopping strategy T Király, L Lomoschitz EGRES quick proof 3, 2018, 2018 | 8 | 2018 |

Global and fixed-terminal cuts in digraphs K Bérczi, K Chandrasekaran, T Király, E Lee, C Xu arXiv preprint arXiv:1612.00156, 2016 | 8 | 2016 |

PPAD-completeness of polyhedral versions of Sperner’s Lemma T Király, J Pap Discrete Mathematics 313 (15), 1594-1599, 2013 | 8 | 2013 |