default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMilos Stojakovic
Person information
- affiliation: University of Novi Sad, Serbia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Poset Positional Games. FUN 2024: 2:1-2:12- [c6]Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic:
Optimizing Symbol Visibility Through Displacement. SWAT 2024: 24:1-24:16 - [i14]Balázs Patkós, Milos Stojakovic, Jelena Stratijev, Máté Vizer:
Generalized saturation game. CoRR abs/2404.02288 (2024) - [i13]Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Poset Positional Games. CoRR abs/2404.07700 (2024) - 2023
- [j36]Milos Stojakovic
, Jelena Stratijev:
On strong avoiding games. Discret. Math. 346(3): 113270 (2023) - [i12]Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Complexity of Maker-Breaker Games on Edge Sets of Graphs. CoRR abs/2302.10972 (2023) - [i11]Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy, Wouter Meulemans, Bettina Speckmann, Milos Stojakovic:
Optimizing Symbol Visibility through Displacement. CoRR abs/2310.01147 (2023) - 2022
- [j35]Marko Savic, Milos Stojakovic:
Structural properties of bichromatic non-crossing matchings. Appl. Math. Comput. 415: 126695 (2022) - [i10]Milos Stojakovic, Jelena Stratijev:
On strong avoiding games. CoRR abs/2204.07971 (2022) - [i9]Tillmann Miltzow, Milos Stojakovic:
Avoider-Enforcer Game is NP-hard. CoRR abs/2208.06687 (2022) - [i8]Milos Stojakovic, Lasse Wulf:
On the Multi-Robber Damage Number. CoRR abs/2209.10965 (2022) - 2021
- [j34]Milos Stojakovic, Nikola Trkulja:
Hamiltonian Maker-Breaker Games on Small Graphs. Exp. Math. 30(4): 595-604 (2021) - 2020
- [j33]Omri Ben-Eliezer, Dan Hefetz, Gal Kronenberg, Olaf Parczyk, Clara Shikhelman, Milos Stojakovic:
Semi-random graph process. Random Struct. Algorithms 56(3): 648-675 (2020)
2010 – 2019
- 2019
- [j32]Chris Dowden, Mihyun Kang, Mirjana Mikalacki, Milos Stojakovic:
The Toucher-Isolator game. Electron. J. Comb. 26(4): 4 (2019) - 2018
- [j31]Mirjana Mikalacki, Milos Stojakovic:
Fast strategies in biased Maker-Breaker games. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [i7]Marko Savic, Milos Stojakovic:
Bottleneck Bichromatic Non-crossing Matchings using Orbits. CoRR abs/1802.06301 (2018) - 2017
- [j30]Marko Savic, Milos Stojakovic:
Faster bottleneck non-crossing matchings of points in convex position. Comput. Geom. 65: 27-34 (2017) - [j29]Mirjana Mikalacki, Milos Stojakovic:
Winning fast in biased Maker-Breaker games. Electron. Notes Discret. Math. 61: 863-868 (2017) - [j28]Mladen Kovacevic, Milos Stojakovic, Vincent Y. F. Tan:
Zero-Error Capacity of P-ary Shift Channels and FIFO Queues. IEEE Trans. Inf. Theory 63(12): 7698-7707 (2017) - [i6]Milos Stojakovic, Nikola Trkulja:
Hamiltonian Maker-Breaker games on small graphs. CoRR abs/1708.07579 (2017) - 2016
- [j27]Dan Hefetz, Michael Krivelevich, Alon Naor, Milos Stojakovic:
On saturation games. Eur. J. Comb. 51: 315-335 (2016) - [j26]Rajko Nenadov, Angelika Steger, Milos Stojakovic:
On the threshold for the Maker-Breaker H-game. Random Struct. Algorithms 49(3): 558-578 (2016) - [i5]Marko Savic, Milos Stojakovic:
Faster Bottleneck Non-crossing Matchings of Points in Convex Position. CoRR abs/1602.04922 (2016) - [i4]Mladen Kovacevic, Milos Stojakovic, Vincent Y. F. Tan:
Zero-Error Shift-Correcting and Shift-Detecting Codes. CoRR abs/1605.02441 (2016) - 2015
- [j25]Marko Savic, Milos Stojakovic:
Linear time algorithm for optimal feed-link placement. Comput. Geom. 48(3): 189-204 (2015) - 2014
- [j24]Gordana Manic, Daniel M. Martin, Milos Stojakovic:
On Bichromatic Triangle Game. Discret. Appl. Math. 164: 400-405 (2014) - [j23]Tobias Müller, Milos Stojakovic:
A threshold for the Maker-Breaker clique game. Random Struct. Algorithms 45(2): 318-341 (2014) - [j22]Andrew Beveridge, Andrzej Dudek, Alan M. Frieze, Tobias Müller, Milos Stojakovic:
Maker-breaker games on random geometric graphs. Random Struct. Algorithms 45(4): 553-607 (2014) - [c5]Milos Stojakovic:
Games on Graphs. ICCS 2014: 31-36 - 2013
- [j21]József Solymosi, Milos Stojakovic:
Many Collinear k-Tuples with no k+1 Collinear Points. Discret. Comput. Geom. 50(3): 811-820 (2013) - 2012
- [j20]Dan Hefetz, Mirjana Mikalacki, Milos Stojakovic:
Doubly Biased Maker-Breaker Connectivity Game. Electron. J. Comb. 19(1): 61 (2012) - [j19]Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Consistent Digital Line Segments. Discret. Comput. Geom. 47(4): 691-710 (2012) - [i3]Marko Savic, Milos Stojakovic:
Linear Time Algorithm for Optimal Feed-link Placement. CoRR abs/1208.0395 (2012) - 2011
- [j18]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Global Maker-Breaker games on sparse graphs. Eur. J. Comb. 32(2): 162-177 (2011) - [j17]Gordana Manic, Daniel M. Martin, Milos Stojakovic:
Bichromatic Triangle Games. Electron. Notes Discret. Math. 37: 105-110 (2011) - [j16]Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Digitalizing line segments. Electron. Notes Discret. Math. 38: 273-278 (2011) - [i2]József Solymosi, Milos Stojakovic:
Many collinear k-tuples with no k+1 collinear points. CoRR abs/1107.0327 (2011) - 2010
- [j15]János Barát, Milos Stojakovic:
On Winning Fast in Avoider-Enforcer Games. Electron. J. Comb. 17(1) (2010) - [j14]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Avoider-Enforcer: The rules of the game. J. Comb. Theory A 117(2): 152-163 (2010) - [c4]Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Consistent digital line segments. SCG 2010: 11-18 - [i1]Tobias Christ, Dömötör Pálvölgyi, Milos Stojakovic:
Consistent digital line segments. CoRR abs/1009.2142 (2010)
2000 – 2009
- 2009
- [j13]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Avoider-Enforcer: The Rules of the Game. Electron. Notes Discret. Math. 34: 261-265 (2009) - [j12]Joachim Giesen, Eva Schuberth, Milos Stojakovic:
Approximate Sorting. Fundam. Informaticae 90(1-2): 67-72 (2009) - [j11]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast Winning Strategies in Avoider-Enforcer Games. Graphs Comb. 25(4): 533-544 (2009) - [j10]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast winning strategies in Maker-Breaker games. J. Comb. Theory B 99(1): 39-47 (2009) - [j9]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) - [c3]Cedomir Stefanovic, Vladimir Stankovic, Milos Stojakovic, Dejan Vukobratovic:
Raptor packets: A packet-centric approach to distributed raptor code design. ISIT 2009: 2336-2340 - 2008
- [j8]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Planarity, Colorability, and Minor Games. SIAM J. Discret. Math. 22(1): 194-212 (2008) - 2007
- [j7]Martin Marciniszyn, Dieter Mitsche, Milos Stojakovic:
Online balanced graph avoidance games. Eur. J. Comb. 28(8): 2248-2263 (2007) - [j6]Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast winning strategies in positional games. Electron. Notes Discret. Math. 29: 213-217 (2007) - 2006
- [j5]Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic:
Coloring octrees. Theor. Comput. Sci. 363(1): 11-17 (2006) - [c2]Joachim Giesen, Eva Schuberth, Milos Stojakovic:
Approximate Sorting. LATIN 2006: 524-531 - 2005
- [j4]Milos Stojakovic, Tibor Szabó:
Positional games on random graphs. Random Struct. Algorithms 26(1-2): 204-223 (2005) - 2004
- [c1]Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic:
Coloring Octrees. COCOON 2004: 62-71 - 2003
- [j3]Milos Stojakovic:
Limit shape of optimal convex lattice polygons in the sense of different metrics. Discret. Math. 271(1-3): 235-249 (2003) - [j2]Jirí Matousek, Milos Stojakovic:
On restricted min-wise independence of permutations. Random Struct. Algorithms 23(4): 397-408 (2003) - 2001
- [j1]Milos Stojakovic:
On Finding The Limit Shape Of Optimal Convex Lattice Polygons. Electron. Notes Discret. Math. 10: 265-267 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
