Zobrazeno 1 - 10
of 2 255
pro vyhledávání: '"Stojakovic, A"'
Autor:
Bagan, Guillaume, Duchêne, Eric, Galliot, Florian, Gledel, Valentin, Mikalački, Mirjana, Oijid, Nacim, Parreau, Aline, Stojaković, Miloš
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an additional struc
Externí odkaz:
http://arxiv.org/abs/2404.07700
We study the following game version of the generalized graph Tur\'an problem. For two fixed graphs F and H, two players, Max and Mini, alternately claim unclaimed edges of the complete graph Kn such that the graph G of the claimed edges must remain F
Externí odkaz:
http://arxiv.org/abs/2404.02288
Publikováno v:
Applicable Analysis and Discrete Mathematics, 2024 Apr 01. 18(1), 193-214.
Externí odkaz:
https://www.jstor.org/stable/27303532
Autor:
Gärtner, Bernd, Kalani, Vishwas, Reddy, Meghana M., Meulemans, Wouter, Speckmann, Bettina, Stojaković, Miloš
In information visualization, the position of symbols often encodes associated data values. When visualizing data elements with both a numerical and a categorical dimension, positioning in the categorical axis admits some flexibility. This flexibilit
Externí odkaz:
http://arxiv.org/abs/2310.01147
Autor:
Duchêne, Eric, Gledel, Valentin, Inerney, Fionn Mc, Nisse, Nicolas, Oijid, Nacim, Parreau, Aline, Stojaković, Miloš
We initiate the study of the algorithmic complexity of Maker-Breaker games played on the edge sets of general graphs. We mainly consider the perfect matching game and the $H$-game. Maker wins if she claims the edges of a perfect matching in the first
Externí odkaz:
http://arxiv.org/abs/2302.10972
Autor:
Stojaković, Miloš, Wulf, Lasse
We study a variant of the Cops and Robbers game on graphs in which the robbers damage the visited vertices, aiming to maximise the number of damaged vertices. For that game with one cop against $s$ robbers a conjecture was made in~\cite{carlson2022mu
Externí odkaz:
http://arxiv.org/abs/2209.10965
Autor:
Miltzow, Tillmann, Stojaković, Miloš
In an Avoider-Enforcer game, we are given a hypergraph. Avoider and Enforcer alternate in claiming an unclaimed vertex, until all the vertices of the hypergraph are claimed. Enforcer wins if Avoider claims all vertices of an edge; Avoider wins otherw
Externí odkaz:
http://arxiv.org/abs/2208.06687
Autor:
Stojaković, Miloš, Stratijev, Jelena
Given an increasing graph property $\cal F$, the strong Avoider-Avoider $\cal F$ game is played on the edge set of a complete graph. Two players, Red and Blue, take turns in claiming previously unclaimed edges with Red going first, and the player who
Externí odkaz:
http://arxiv.org/abs/2204.07971
We study the following game version of the generalized graph Tur\'an problem. For two fixed graphs $F$ and $H$, two players, Constructor and Blocker, alternately claim unclaimed edges of the complete graph $K_n$. Constructor can only claim edges so t
Externí odkaz:
http://arxiv.org/abs/2203.14707
Autor:
Andrea Stojakovic, Sergey Trushin, Anthony Sheu, Layla Khalili, Su-Youne Chang, Xing Li, Trace Christensen, Jeffrey L. Salisbury, Rachel E. Geroux, Benjamin Gateno, Padraig J. Flannery, Mrunal Dehankar, Cory C. Funk, Jordan Wilkins, Anna Stepanova, Tara O’Hagan, Alexander Galkin, Jarred Nesbitt, Xiujuan Zhu, Utkarsh Tripathi, Slobodan Macura, Tamar Tchkonia, Tamar Pirtskhalava, James L. Kirkland, Rachel A. Kudgus, Renee A. Schoon, Joel M. Reid, Yu Yamazaki, Takahisa Kanekiyo, Song Zhang, Emirhan Nemutlu, Petras Dzeja, Adam Jaspersen, Ye In Christopher Kwon, Michael K. Lee, Eugenia Trushina
Publikováno v:
Communications Biology, Vol 7, Iss 1, Pp 1-9 (2024)
Externí odkaz:
https://doaj.org/article/67f438cf2e6642df8392e5f12d364395