| 2008 |
|---|
| 14 | EE | Zoltán Király:
Better and Simpler Approximation Algorithms for the Stable Marriage Problem.
ESA 2008: 623-634 |
| 13 | EE | Attila Bernáth,
Satoru Iwata,
Tamás Király,
Zoltán Király,
Zoltán Szigeti:
Recent results on well-balanced orientations.
Discrete Optimization 5(4): 663-676 (2008) |
| 2007 |
|---|
| 12 | EE | András Frank,
Zoltán Király,
Balázs Kotnyek:
An algorithm for node-capacitated ring routing.
Oper. Res. Lett. 35(3): 385-391 (2007) |
| 2006 |
|---|
| 11 | EE | Zoltán Király,
Zoltán Szigeti:
Simultaneous well-balanced orientations of graphs.
J. Comb. Theory, Ser. B 96(5): 684-692 (2006) |
| 2005 |
|---|
| 10 | EE | András Frank,
Zoltán Király,
Balázs Kotnyek:
An Algorithm for Node-Capacitated Ring Routing.
ESA 2005: 249-258 |
| 9 | EE | Vince Grolmusz,
Zoltán Király:
Generalized Secure Routerless Routing.
ICN (2) 2005: 454-462 |
| 2004 |
|---|
| 8 | EE | Mikio Kano,
Gyula Y. Katona,
Zoltán Király:
Packing paths of length at least two.
Discrete Mathematics 283(1-3): 129-135 (2004) |
| 2003 |
|---|
| 7 | EE | András Frank,
Tamás Király,
Zoltán Király:
On the orientation of graphs and hypergraphs.
Discrete Applied Mathematics 131(2): 385-400 (2003) |
| 2002 |
|---|
| 6 | EE | András Frank,
Zoltán Király:
Graph Orientations with Edge-connection and Parity Constraints.
Combinatorica 22(1): 47-70 (2002) |
| 1999 |
|---|
| 5 | EE | András A. Benczúr,
Jörg Förster,
Zoltán Király:
Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis.
ESA 1999: 498-509 |
| 4 | EE | András Frank,
Zoltán Király:
Parity Constrained k-Edge-Connected Orientations.
IPCO 1999: 191-201 |
| 3 | EE | András Gyárfás,
Zoltán Király,
Jenö Lehel:
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.
SIAM J. Discrete Math. 12(3): 385-411 (1999) |
| 1998 |
|---|
| 2 | EE | Barry Guiduli,
Zoltán Király:
On intersecting hypergraphs.
Discrete Mathematics 182(1-3): 139-151 (1998) |
| 1997 |
|---|
| 1 | EE | András Gyárfás,
Zoltán Király,
Jenö Lehel:
On-line 3-chromatic graphs - II critical graphs.
Discrete Mathematics 177(1-3): 99-122 (1997) |
