On Finding The Limit Shape Of Optimal Convex Lattice Polygons. - Milos Stojakovic (Electron. Notes Discret. Math., 2001)

Limit shape of optimal convex lattice polygons in the sense of different metrics. - Milos Stojakovic (Discret. Math., 2003)

On restricted min-wise independence of permutations. - Jirí Matousek 001; Milos Stojakovic (Random Struct. Algorithms, 2003)

Positional games on random graphs. - Milos Stojakovic; Tibor Szabó (Random Struct. Algorithms, 2005)

Coloring octrees. - Udo Adamy; Michael Hoffmann 001; József Solymosi; Milos Stojakovic (Theor. Comput. Sci., 2006)

Online balanced graph avoidance games. - Martin Marciniszyn; Dieter Mitsche; Milos Stojakovic (Eur. J. Comb., 2007)

Fast winning strategies in positional games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Electron. Notes Discret. Math., 2007)

Planarity, Colorability, and Minor Games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (SIAM J. Discret. Math., 2008)

Raptor packets: A packet-centric approach to distributed raptor code design. - Cedomir Stefanovic; Vladimir Stankovic 001; Milos Stojakovic; Dejan Vukobratovic (ISIT, 2009)

Approximate Sorting. - Joachim Giesen; Eva Schuberth; Milos Stojakovic (Fundam. Informaticae, 2009)

Fast Winning Strategies in Avoider-Enforcer Games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Graphs Comb., 2009)

Fast winning strategies in Maker-Breaker games. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (J. Comb. Theory B, 2009)

A sharp threshold for the Hamilton cycle Maker-Breaker game. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Random Struct. Algorithms, 2009)

On Winning Fast in Avoider-Enforcer Games. - János Barát; Milos Stojakovic (Electron. J. Comb., 2010)

Avoider-Enforcer: The rules of the game. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (J. Comb. Theory A, 2010)

Global Maker-Breaker games on sparse graphs. - Dan Hefetz; Michael Krivelevich; Milos Stojakovic; Tibor Szabó (Eur. J. Comb., 2011)

Digitalizing line segments. - Tobias Christ; Dömötör Pálvölgyi; Milos Stojakovic (Electron. Notes Discret. Math., 2011)

Bichromatic Triangle Games. - Gordana Manic; Daniel M. Martin; Milos Stojakovic (Electron. Notes Discret. Math., 2011)

Doubly Biased Maker-Breaker Connectivity Game. - Dan Hefetz; Mirjana Mikalacki; Milos Stojakovic (Electron. J. Comb., 2012)

Consistent Digital Line Segments. - Tobias Christ; Dömötör Pálvölgyi; Milos Stojakovic (Discret. Comput. Geom., 2012)

Many Collinear k-Tuples with no k+1 Collinear Points. - József Solymosi; Milos Stojakovic (Discret. Comput. Geom., 2013)

Games on Graphs. - Milos Stojakovic (ICCS, 2014)

On Bichromatic Triangle Game. - Gordana Manic; Daniel M. Martin; Milos Stojakovic (Discret. Appl. Math., 2014)

Maker-breaker games on random geometric graphs. - Andrew Beveridge; Andrzej Dudek; Alan M. Frieze; Tobias Müller 001; Milos Stojakovic (Random Struct. Algorithms, 2014)

A threshold for the Maker-Breaker clique game. - Tobias Müller 001; Milos Stojakovic (Random Struct. Algorithms, 2014)

Linear time algorithm for optimal feed-link placement. - Marko Savic; Milos Stojakovic (Comput. Geom., 2015)

Zero-Error Shift-Correcting and Shift-Detecting Codes. - Mladen Kovacevic 001; Milos Stojakovic; Vincent Y. F. Tan (CoRR, 2016)

On saturation games. - Dan Hefetz; Michael Krivelevich; Alon Naor; Milos Stojakovic (Eur. J. Comb., 2016)

On the threshold for the Maker-Breaker H-game. - Rajko Nenadov; Angelika Steger; Milos Stojakovic (Random Struct. Algorithms, 2016)

Faster bottleneck non-crossing matchings of points in convex position. - Marko Savic; Milos Stojakovic (Comput. Geom., 2017)

Winning fast in biased Maker-Breaker games. - Mirjana Mikalacki; Milos Stojakovic (Electron. Notes Discret. Math., 2017)

Zero-Error Capacity of P-ary Shift Channels and FIFO Queues. - Mladen Kovacevic 001; Milos Stojakovic; Vincent Y. F. Tan (IEEE Trans. Inf. Theory, 2017)

Bottleneck Bichromatic Non-crossing Matchings using Orbits. - Marko Savic; Milos Stojakovic (CoRR, 2018)

Fast strategies in biased Maker-Breaker games. - Mirjana Mikalacki; Milos Stojakovic (Discret. Math. Theor. Comput. Sci., 2018)

The Toucher-Isolator game. - Chris Dowden; Mihyun Kang; Mirjana Mikalacki; Milos Stojakovic (Electron. J. Comb., 2019)

Semi-random graph process. - Omri Ben-Eliezer; Dan Hefetz; Gal Kronenberg; Olaf Parczyk; Clara Shikhelman; Milos Stojakovic (Random Struct. Algorithms, 2020)

Hamiltonian Maker-Breaker Games on Small Graphs. - Milos Stojakovic; Nikola Trkulja (Exp. Math., 2021)

Structural properties of bichromatic non-crossing matchings. - Marko Savic; Milos Stojakovic (Appl. Math. Comput., 2022)

Avoider-Enforcer Game is NP-hard. - Tillmann Miltzow; Milos Stojakovic (CoRR, 2022)

On the Multi-Robber Damage Number. - Milos Stojakovic; Lasse Wulf (CoRR, 2022)

On strong avoiding games. - Milos Stojakovic; Jelena Stratijev (Discret. Math., 2023)

Polychromatic Coloring of Tuples in Hypergraphs. - Ahmad Biniaz; Jean-Lou De Carufel; Anil Maheshwari; Michiel Smid; Shakhar Smorodinsky; Milos Stojakovic (SoCG, 2025)

Optimizing symbol visibility through displacement. - Bernd Gärtner; Vishwas Kalani; Meghana M. Reddy; Wouter Meulemans; Bettina Speckmann; Milos Stojakovic (Appl. Math. Comput., 2025)

Complexity of Maker-Breaker games on edge sets of graphs. - Éric Duchêne; Valentin Gledel; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid; Aline Parreau; Milos Stojakovic (Discret. Appl. Math., 2025)

Generalized saturation game. - Balázs Patkós; Milos Stojakovic; Jelena Stratijev; Máté Vizer (Discret. Appl. Math., 2025)

Poset positional games. - Guillaume Bagan; Éric Duchêne; Florian Galliot; Valentin Gledel; Mirjana Mikalacki; Nacim Oijid; Aline Parreau; Milos Stojakovic (Discret. Math., 2025)