| 2009 |
|---|
| 13 | EE | Joachim Giesen,
Eva Schuberth,
Milos Stojakovic:
Approximate Sorting.
Fundam. Inform. 90(1-2): 67-72 (2009) |
| 12 | EE | Dan Hefetz,
Michael Krivelevich,
Milos Stojakovic,
Tibor Szabó:
Fast winning strategies in Maker-Breaker games.
J. Comb. Theory, Ser. B 99(1): 39-47 (2009) |
| 11 | EE | Dan Hefetz,
Michael Krivelevich,
Milos Stojakovic,
Tibor Szabó:
A sharp threshold for the Hamilton cycle Maker-Breaker game.
Random Struct. Algorithms 34(1): 112-122 (2009) |
| 2008 |
|---|
| 10 | EE | Dan Hefetz,
Michael Krivelevich,
Milos Stojakovic,
Tibor Szabó:
Planarity, Colorability, and Minor Games.
SIAM J. Discrete Math. 22(1): 194-212 (2008) |
| 2007 |
|---|
| 9 | EE | Dan Hefetz,
Michael Krivelevich,
Milos Stojakovic,
Tibor Szabó:
Fast winning strategies in positional games.
Electronic Notes in Discrete Mathematics 29: 213-217 (2007) |
| 8 | EE | Martin Marciniszyn,
Dieter Mitsche,
Milos Stojakovic:
Online balanced graph avoidance games.
Eur. J. Comb. 28(8): 2248-2263 (2007) |
| 2006 |
|---|
| 7 | EE | Joachim Giesen,
Eva Schuberth,
Milos Stojakovic:
Approximate Sorting.
LATIN 2006: 524-531 |
| 6 | EE | Udo Adamy,
Michael Hoffmann,
József Solymosi,
Milos Stojakovic:
Coloring octrees.
Theor. Comput. Sci. 363(1): 11-17 (2006) |
| 2005 |
|---|
| 5 | EE | Milos Stojakovic,
Tibor Szabó:
Positional games on random graphs.
Random Struct. Algorithms 26(1-2): 204-223 (2005) |
| 2004 |
|---|
| 4 | EE | Udo Adamy,
Michael Hoffmann,
József Solymosi,
Milos Stojakovic:
Coloring Octrees.
COCOON 2004: 62-71 |
| 2003 |
|---|
| 3 | EE | Milos Stojakovic:
Limit shape of optimal convex lattice polygons in the sense of different metrics.
Discrete Mathematics 271(1-3): 235-249 (2003) |
| 2 | EE | Jirí Matousek,
Milos Stojakovic:
On restricted min-wise independence of permutations.
Random Struct. Algorithms 23(4): 397-408 (2003) |
| 2001 |
|---|
| 1 | EE | Milos Stojakovic:
On Finding The Limit Shape Of Optimal Convex Lattice Polygons.
Electronic Notes in Discrete Mathematics 10: 265-267 (2001) |
