Milos Stojakovic - researchr alias

researchr

You are not signed in
Sign in
Sign up

2009

Approximate SortingJoachim Giesen, Eva Schuberth, Milos Stojakovic. FUIN, 90(1-2):67-72, 2009. [doi]
Fast winning strategies in Maker-Breaker gamesDan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó. JCT, 99(1):39-47, 2009. [doi]
A sharp threshold for the Hamilton cycle Maker-Breaker gameDan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó. rsa, 34(1):112-122, 2009. [doi]

2008

Planarity, Colorability, and Minor GamesDan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó. siamdm, 22(1):194-212, 2008. [doi]

2007

Fast winning strategies in positional gamesDan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó. endm, 29:213-217, 2007. [doi]
Online balanced graph avoidance gamesMartin Marciniszyn, Dieter Mitsche, Milos Stojakovic. ejc, 28(8):2248-2263, 2007. [doi]

2006

Coloring octreesUdo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic. TCS, 363(1):11-17, 2006. [doi]
Approximate SortingJoachim Giesen, Eva Schuberth, Milos Stojakovic. latin 2006: 524-531 [doi]

2005

Positional games on random graphsMilos Stojakovic, Tibor Szabó. rsa, 26(1-2):204-223, 2005. [doi]

2004

Coloring OctreesUdo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic. cocoon 2004: 62-71 [doi]

2003

On restricted min-wise independence of permutationsJirí Matousek, Milos Stojakovic. rsa, 23(4):397-408, 2003. [doi]
Limit shape of optimal convex lattice polygons in the sense of different metricsMilos Stojakovic. DM, 271(1-3):235-249, 2003. [doi]

2001

On Finding The Limit Shape Of Optimal Convex Lattice PolygonsMilos Stojakovic. endm, 10:265-267, 2001. [doi]