E-LIB Suche - Ergebnisse für: Mihalák, Matúš

1

Relaxed Agreement Forests:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,

Ardévol Martínez, Virginia ; Chaplick, Steven ; Kelk, Steven... - p. 40-54 , 2024

Link: https://doi.org/10.1007/..

2

Snakes and Ladders: A Treewidth Story:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Chaplick, Steven ; Kelk, Steven ; Meuwese, Ruben.. - p. 187-200 , 2023

Link: https://doi.org/10.1007/..

3

Sequential Solutions in Machine Scheduling Games:

, In: Web and Internet Economics; Lecture Notes in Computer Science,

Chen, Cong ; Giessler, Paul ; Mamageishvili, Akaki.. - p. 309-322 , 2020

Link: https://doi.org/10.1007/..

4

Near-Gathering of Energy-Constrained Mobile Agents:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,

Bärtschi, Andreas ; Bampas, Evangelos ; Chalopin, Jérémie... - p. 52-65 , 2019

Link: https://doi.org/10.1007/..

5

Collaborative Delivery on a Fixed Path with Homogeneous Ene..:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,

Chalopin, Jérémie ; Das, Shantanu ; Disser, Yann.. - p. 139-153 , 2019

Link: https://doi.org/10.1007/..

6

Sequence Hypergraphs: Paths, Flows, and Cuts:

, In: Adventures Between Lower Bounds and Higher Altitudes; Lecture Notes in Computer Science,

Böhmová, Kateřina ; Chalopin, Jérémie ; Mihalák, Matúš.. - p. 191-215 , 2018

Link: https://doi.org/10.1007/..

7

Improved bounds for the conflict-free chromatic art gallery..:

, In: Proceedings of the thirtieth annual symposium on Computational geometry,

Bärtschi, Andreas ; Ghosh, Subir Kumar ; Mihalák, Matúš.. - p. 144-153 , 2014

Link: https://dl.acm.org/doi/1..

8

Robust optimization in the presence of uncertainty:

, In: Proceedings of the 4th conference on Innovations in Theoretical Computer Science,

Buhmann, Joachim M. ; Mihalak, Matus ; Sramek, Rastislav. - p. 505-514 , 2013

Link: https://dl.acm.org/doi/1..

9

The Price of Anarchy in Network Creation Games Is (Mostly) ..:

, In: Algorithmic Game Theory; Lecture Notes in Computer Science,

Mihalák, Matúš ; Schlegel, Jan Christoph - p. 276-287 , 2010

Link: https://doi.org/10.1007/..

10

The price of anarchy in network creation games is (mostly) ..:

, In: Proceedings of the Third international conference on Algorithmic game theory,

Mihalák, Matúš ; Schlegel, Jan Christoph - p. 276-287 , 2010

Link: https://dl.acm.org/doi/1..