| On the orientation of graphs and hypergraphs A Frank, T Király, Z Király Discrete Applied Mathematics 131 (2), 385-400, 2003 | 109 | 2003 |
| Linear Time Local Approximation Algorithm for Maximum Stable Marriage Z Kiraly Algorithms 6 (3), 471-484, 2013 | 108 | 2013 |
| Efficient implementations of minimum-cost flow algorithms Z Kiraly, P Kovacs Acta Univ. Sapientiae, Informatica 4 (1), 67-118, 2012 | 104 | 2012 |
| Better and simpler approximation algorithms for the stable marriage problem Z Király Algorithmica 60 (1), 3-20, 2011 | 102 | 2011 |
| Packing paths of length at least two M Kano, GY Katona, Z Király Discrete mathematics 283 (1-3), 129-135, 2004 | 83 | 2004 |
| Network topologies Á Szentesi, G Magyar, Z Király US Patent 7,366,108, 2008 | 64 | 2008 |
| Graph orientations with edge-connection and parity constraints A Frank, Z Király Combinatorica 22 (1), 47-70, 2002 | 51* | 2002 |
| On the Swap-Distances of Different Realizations of a Graphical Degree Sequence PL Erdős, Z Király, I Miklós Combinatorics, Probability and Computing 22 (8), 366-383, 2013 | 40* | 2013 |
| Simultaneous well-balanced orientations of graphs Z Király, Z Szigeti Journal of Combinatorial Theory, Series B 96 (5), 684-692, 2006 | 40 | 2006 |
| C4-free 2-factors in bipartite graphs Z Király manuscript, 1999 | 37 | 1999 |
| On the combinatorics of projective mappings G Elekes, Z Király Journal of Algebraic Combinatorics 14 (3), 183-197, 2001 | 35 | 2001 |
| Local edge-connectivity augmentation in hypergraphs is NP-complete Z Király, B Cosh, B Jackson Discrete Applied Mathematics 158 (6), 723-727, 2010 | 28* | 2010 |
| An efficient algorithm for global path optimization in MPLS networks BEGE J# x00F3; zsa, ZE Kir# x00E1; ly, GE Magyar, C Szentesi Optimization and Engineering 2 (3), 321-347, 2001 | 28 | 2001 |
| Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding A Pasic, P Babarczi, J Tapolcai, E Berczi-Kovacs, Z Kiraly, L Ronyai IEEE/ACM Transactions on Networking 28 (1), 289-300, 2020 | 23* | 2020 |
| On families of weakly cross-intersecting set-pairs Z Király, ZL Nagy, D Pálvölgyi, M Visontai Fundamenta Informaticae 117 (1-4), 189-198, 2012 | 21 | 2012 |
| 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 | 20* | 2008 |
| Dilworth’s theorem and its application for path systems of a cycle—implementation and analysis AA Benczúr, J Förster, Z Király European Symposium on Algorithms, 498-509, 1999 | 20 | 1999 |
| On-line 3-chromatic graphs-II critical graphs A Gyárfás, Z Király, J Lehel Discrete Mathematics 177 (1-3), 99-122, 1997 | 16 | 1997 |
| On-line competitive coloring algorithms A Gyárfás, Z Király, J Lehel Technical report TR-9703-1, 1997 | 16 | 1997 |
| Optimal and heuristic network coding algorithms for multi‐layered video broadcast ER Bérczi‐Kovács, Z Király Networks 71 (1), 51-59, 2018 | 15* | 2018 |
András FrankProfessor emeritus, Eötvös University BudapestVerified email at cs.elte.hu
