Publications - Milos Stojakovic

List of Publications - Miloš Stojaković
<<< back to homepage – journal publications – theses – conference proceedings

Submitted:

Cs. Bujtas, P. Dokyeesun, S. Klavzar, M. Stojakovic: Criticality for Maker-Breaker domination games with predomination, submitted.

M. Stojakovic, L. Wulf: On the multi-robber damage number, submitted.

B. Gärtner, V. Kalani, M. M.Reddy, W. Meulemans, B. Speckmann, M. Stojakovic: Optimizing symbol visibility through displacement, submitted.
B. Patkos, M. Stojakovic, J. Stratijev, M. Vizer: Generalized saturation game, submitted.

Journal publications:

G. Bagan, E. Duchene, F. Galliot, V. Gledel, M. Mikalacki, N. Oijid, A. Parreau, M. Stojakovic: Poset positional games, Discrete Mathematics 348 (2025), 114455.
E. Duchene, V. Gledel, F. Mc Inerney, N. Nisse, N. Oijid, A. Parreau, M. Stojakovic: Complexity of Maker-Breaker games on edge sets of graphs, Discrete Applied Mathematics 361 (2025), 502-522.

B. Patkos, M. Stojakovic, M. Vizer: The Constructor-Blocker game, Applicable Analysis and Discrete Mathematics 18 (2024), 193-214.

M. Stojakovic, J. Stratijev: On strong avoiding games, Discrete Mathematics 346 (2023), 113270.

M. Savic, M. Stojakovic: Structural properties of bichromatic non-crossing matchings, Applied Mathematics and Computation 415 (2022), 126695.

M. Stojakovic, N. Trkulja: Hamiltonian Maker-Breaker games on small graphs, Experimental Mathematics 40 (2021), 595-604.

O. Ben-Eliezer, D. Hefetz, G. Kronenberg, O. Parczyk, C. Shikhelman, M. Stojakovic: Semi-random graph process, Random Structures & Algorithms 56 (2020), 648-675.

C. Dowden, M. Kang, M. Mikalacki, M Stojakovic: The Toucher-Isolator game, The Electronic Journal of Combinatorics 26 (2019), #P4.6.

M. Mikalacki, M. Stojakovic: Fast strategies in biased Maker-Breaker games, Discrete Mathematics & Theoretical Computer Science 20:2 (2018), #5.

M. Kovacevic, M. Stojakovic, V. Tan: Zero-error capacity of P-ary shift channels and FIFO queues, IEEE Transactions on Information Theory 63 (2017), 7698-7707.
M. Savic, M. Stojakovic: Faster bottleneck non-crossing matchings of points in convex position, Computational Geometry: Theory and Applications 65 (2017), 27-34.
R. Nenadov, A. Steger, M. Stojakovic: On the threshold for the Maker-Breaker H-game, Random Structures & Algorithms 49 (2016), 558-578.
D. Hefetz, M. Krivelevich, A. Naor, M. Stojakovic: On saturation games, European Journal of Combinatorics 51 (2016), 315-335.
M. Savic, M. Stojakovic: Linear time algorithm for optimal feed-link placement, Computational Geometry: Theory and Applications 48 (2015), 189-204.
A. Beveridge, A. Dudek, A. Frieze, T. Muller, M. Stojakovic: Maker-Breaker games on random geometric graphs, Random Structures & Algorithms 45 (2014), 553-607.
G. Manic, D. Martin, M. Stojakovic: On Bichromatic Triangle game, Discrete Applied Mathematics 164 (2014), 400-405.
T. Muller, M. Stojakovic: A threshold for Maker-Breaker Clique game, Random Structures & Algorithms 45 (2014), 318-341.
J. Solymosi, M. Stojakovic: Many collinear k-tuples with no k+1 collinear points, Discrete & Computational Geometry 50 (2013), 811-820.
D. Hefetz, M. Mikalacki, M. Stojakovic: Doubly biased Maker-Breaker Connectivity game, The Electronic Journal of Combinatorics 19 (2012), P61.
T. Christ, D. Palvolgyi, M. Stojakovic: Consistent digital line segments, Discrete & Computational Geometry 47 (2012), 691-710.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Global Maker-Breaker games on sparse graphs, European Journal of Combinatorics 32 (2011), 162-177.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Avoider-Enforcer: The rules of the Game, Journal of Combinatorial Theory, Series A 117 (2010), 152-163.
J. Barat, M. Stojakovic: On winning fast in Avoider-Enforcer games, The Electronic Journal of Combinatorics 17 (2010), R56.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Fast winning strategies in Avoider-Enforcer games, Graphs and Combinatorics 25 (2009), 533-544.
J. Giesen, E. Schuberth, M. Stojakovic: Approximate sorting, Fundamenta Informaticae 90 (2009), 67-72.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: A sharp threshold for the Hamilton cycle Maker-Breaker game, Random Structures & Algorithms 34 (2009), 112-122.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Fast winning strategies in Maker-Breaker games, Journal of Combinatorial Theory, Series B 99 (2009), 39-47.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Planarity, colorability and minor games, SIAM Journal on Discrete Mathematics 22 (2008), 194-212.
D. Mitsche, M. Marciniszyn, M. Stojakovic: Online balanced graph avoidance games, European Journal of Combinatorics 28 (2007), 2248-2263.
U. Adamy, M. Hoffmann, J. Solymosi, M. Stojakovic: Coloring octrees, Theoretical Computer Science 363 (2006), 11-17.
M. Stojakovic, T. Szabo: Positional games on random graphs, Random Structures & Algorithms 26 (2005), 204-223.
J. Matousek, M. Stojakovic: On restricted min-wise independence of permutations, Random Structures & Algorithms 23 (2003), 397-408.
M. Stojakovic: Limit shape of optimal convex lattice polygons in the sense of different metrics, Discrete Mathematics 271 (2003), 235-249.
M. Stojakovic: The perimeter of optimal convex lattice polygons in the sense of different metrics, Bull. Austral. Math. Soc. 63 (2001), 229-242.
M. Stojakovic: Euclidian perimeter of classes of optimal convex lattice 2k-gons, Novi Sad J. Math. 30 (2000), 123-131.

Unpublished:

T. Miltzow, M. Stojakovic: Avoider-Enforcer Game is NP-hard, arXiv:2208.06687 (2022).
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Continuous Box game, 2011.

Theses:

M. Stojakovic: Games on graphs, Ph.D. thesis (advisors: Emo Welzl and Tibor Szabo), ETH Zurich, Switzerland, 2005.
M. Stojakovic: Extremal problems on the integer grid (in Serbian), M.Sc. thesis (advisor: Jovisa Zunic), University of Novi Sad, Serbia, 2001.

Conference proceedings (with refereeing):

A. Biniaz, J.-L. De Carufel, A. Maheshwari, M. Smid, S. Smorodinsky, M. Stojakovic: Polychromatic coloring of tuples in hypergraphs, Proc. 41st International Symposium on Computational Geometry (SoCG 2025), Kanazawa, Japan, to appear, 2025.

B. Gärtner, V. Kalani, M. M. Reddy, W. Meulemans, B. Speckmann, M. Stojakovic: Optimizing symbol visibility through displacement, Leibniz International Proceedings in Informatics (LIPIcs) 294 (2024), pp. 24:1-24:16.
(Proc. 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024), Helsinki, Finland, 2024.)

G. Bagan, E. Duchene, F. Galliot, V. Gledel, M. Mikalacki, N. Oijid, A. Parreau, M. Stojakovic: Poset positional games, Leibniz International Proceedings in Informatics (LIPIcs) 291 (2024), pp. 2:1-2:12.
(Proc. 12th International Conference on Fun with Algorithms (FUN 2024), Island of La Maddalena, Sardinia, 2024.)

C. Dowden, M. Kang, M. Mikalacki, M. Stojakovic: The game of Toucher and Isolator, Trends in Mathematics 14 (2021), 417-422.
(Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2021), Barcelona (virtual), Spain, 2021.)

M. Hoffmann, J. Pach, M. Stojakovic: Green-Wins Solitaire Revisited - Simultaneous Flips that Affect Many Edges, Proc. 35th European Workshop on Computational Geometry (EuroCG 2019), Utrecht, Netherlands, 2019, #9:1-6.

M. Savic, M. Stojakovic: Bottleneck bichromatic non-crossing matchings using orbits, Proc. 34th European Workshop on Computational Geometry (EuroCG 2018), Berlin, Germany, 2018, #70:1-6.
M. Mikalacki, M. Stojakovic: Winning fast in biased Maker-Breaker games, Electronic Notes in Discrete Mathematics 61 (2017), 863-868.
(Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2017), Vienna, Austria, 2017.)

M. Savic, M. Stojakovic: Bottleneck matchings of points in convex position, Proc. 32nd European Workshop on Computational Geometry (EuroCG 2016), Lugano, Switzerland, 2016, 175-178.
M. Stojakovic: Games on graphs (invited talk), Lecture Notes in Artificial Intelligence (subseries of Lecture Notes in Computer Science) 8577 (2014), 31-36.
(Proc. Graph-Based Representation and Reasoning, 21st International Conference on Conceptual Structures (ICCS 2014), Iasi, Romania, 2014)
T. Muller, M. Stojakovic: A threshold for Maker-Breaker Clique game, Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2013), Pisa, Italy, 2013, 353-358.
J. Solymosi, M. Stojakovic: Many collinear k-tuples with no k+1 collinear points, Proc. 28th European Workshop on Computational Geometry (EuroCG 2012), Assisi, Italy, 2012, 73-77.
T. Christ, D. Palvolgyi, M. Stojakovic: Digitalizing line segments, Electronic Notes in Discrete Mathematics, 38 (2011), 273-278.
(Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2011), Budapest, Hungary, 2011)
G. Manic, D. Martin, M. Stojakovic: Bichromatic triangle games, Electronic Notes in Discrete Mathematics, 37 (2011), 105-110.
(Proc. 6th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'11), Bariloche, Argentina, 2011)
T. Christ, D. Palvolgyi, M. Stojakovic: Consistent digital line segments, Proc. 26th Annual ACM Symposium on Computational Geometry (SoCG 2010), Snowbird, Utah, 2010, 11-18.
D. Vukobratovic, C. Stefanovic, M. Stojakovic, V. Stankovic: Raptor Packets: A Packet-Centric Approach to Distributed Raptor Code Design, Proc. IEEE International Symposium on Information Theory (ISIT 2009), Seoul, Korea, 2009, 2336 - 2340.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Avoider-Enforcer: The rules of the Game, Electronic Notes in Discrete Mathematics 34 (2009), 261-265.
(Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), Bordeaux, France, 2009)
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabo: Fast winning strategies in positional games, Electronic Notes in Discrete Mathematics 29 (2007), 213-217.
(Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2007), Seville, Spain, 2007)
J. Giesen, E. Schuberth, M. Stojakovic: Approximate sorting, Lecture Notes in Computer Science 3887 (2006), 524-531.
(Proc. 7th Latin American Theoretical Informatics Symposium (LATIN 2006), Valdivia, Chile, 2006)
D. Mitsche, M. Marciniszyn, M. Stojakovic: Balanced avoidance games on random graphs, Discrete Mathematics & Theoretical Computer Science proc. AE (2005), 329-334.
(Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2005), Berlin, Germany, 2005)
U. Adamy, M. Hoffmann, J. Solymosi, M. Stojakovic: Coloring octrees, Lecture Notes in Computer Science 3106 (2004), 62-71.
(Proc. 10th Ann. Internat. Conf. Computing and Combinatorics (COCOON 2004), Jeju Island, Korea, 2004)
J. Matousek, M. Stojakovic: On restricted min-wise independence of permutations, ITI Series 2003-145, 264-268.
(Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2003), J. Fiala, ed., Prague, Czech Republic, 2003)
M. Stojakovic: On finding the limit shape of optimal convex lattice polygons, Electronic Notes in Discrete Mathematics 10 (2001), 1-3.
(Proc. Euro-conference on Combinatorics, Graph Theory and Applications (COMB 2001), Barcelona, Spain, 2001)

<<< back to homepage