Milos Stojakovic

Orcid: 0000-0002-2545-8849

Affiliations:
  • University of Novi Sad, Serbia


According to our database1, Milos Stojakovic authored at least 43 papers between 2001 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On strong avoiding games.
Discret. Math., 2023

Optimizing Symbol Visibility through Displacement.
CoRR, 2023

Complexity of Maker-Breaker Games on Edge Sets of Graphs.
CoRR, 2023

2022
On the Multi-Robber Damage Number.
CoRR, 2022

Avoider-Enforcer Game is NP-hard.
CoRR, 2022

Structural properties of bichromatic non-crossing matchings.
Appl. Math. Comput., 2022

2021
Hamiltonian Maker-Breaker Games on Small Graphs.
Exp. Math., 2021

2020
Semi-random graph process.
Random Struct. Algorithms, 2020

2019
The Toucher-Isolator game.
Electron. J. Comb., 2019

2018
Fast strategies in biased Maker-Breaker games.
Discret. Math. Theor. Comput. Sci., 2018

Bottleneck Bichromatic Non-crossing Matchings using Orbits.
CoRR, 2018

2017
Zero-Error Capacity of P-ary Shift Channels and FIFO Queues.
IEEE Trans. Inf. Theory, 2017

Winning fast in biased Maker-Breaker games.
Electron. Notes Discret. Math., 2017

Faster bottleneck non-crossing matchings of points in convex position.
Comput. Geom., 2017

2016
On the threshold for the Maker-Breaker <i>H</i>-game.
Random Struct. Algorithms, 2016

On saturation games.
Eur. J. Comb., 2016

Zero-Error Shift-Correcting and Shift-Detecting Codes.
CoRR, 2016

2015
Linear time algorithm for optimal feed-link placement.
Comput. Geom., 2015

2014
A threshold for the Maker-Breaker clique game.
Random Struct. Algorithms, 2014

Maker-breaker games on random geometric graphs.
Random Struct. Algorithms, 2014

On Bichromatic Triangle Game.
Discret. Appl. Math., 2014

Games on Graphs.
Proceedings of the Graph-Based Representation and Reasoning, 2014

2013
Many Collinear k-Tuples with no k+1 Collinear Points.
Discret. Comput. Geom., 2013

2012
Consistent Digital Line Segments.
Discret. Comput. Geom., 2012

Doubly Biased Maker-Breaker Connectivity Game.
Electron. J. Comb., 2012

2011
Bichromatic Triangle Games.
Electron. Notes Discret. Math., 2011

Digitalizing line segments.
Electron. Notes Discret. Math., 2011

Global Maker-Breaker games on sparse graphs.
Eur. J. Comb., 2011

2010
On Winning Fast in Avoider-Enforcer Games.
Electron. J. Comb., 2010

2009
A sharp threshold for the Hamilton cycle Maker-Breaker game.
Random Struct. Algorithms, 2009

Fast winning strategies in Maker-Breaker games.
J. Comb. Theory, Ser. B, 2009

Fast Winning Strategies in Avoider-Enforcer Games.
Graphs Comb., 2009

Approximate Sorting.
Fundam. Informaticae, 2009

Avoider-Enforcer: The Rules of the Game.
Electron. Notes Discret. Math., 2009

Raptor packets: A packet-centric approach to distributed raptor code design.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Planarity, Colorability, and Minor Games.
SIAM J. Discret. Math., 2008

2007
Fast winning strategies in positional games.
Electron. Notes Discret. Math., 2007

Online balanced graph avoidance games.
Eur. J. Comb., 2007

2006
Coloring octrees.
Theor. Comput. Sci., 2006

2005
Positional games on random graphs.
Random Struct. Algorithms, 2005

2003
On restricted min-wise independence of permutations.
Random Struct. Algorithms, 2003

Limit shape of optimal convex lattice polygons in the sense of different metrics.
Discret. Math., 2003

2001
On Finding The Limit Shape Of Optimal Convex Lattice Polygons.
Electron. Notes Discret. Math., 2001


  Loading...