Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs von Chaplick, Steven, Frohn, Martin, Kelk, Steven, Lottermoser, Johann, Mihalák, Matúš

Volltext

Sequential solutions in machine scheduling games von Chen, Cong, Giessler, Paul, Mamageishvili, Akaki, Mihalák, Matúš, Penna, Paolo

Volltext

Collaborative delivery on a fixed path with homogeneous energy-constrained agents von Chalopin, Jérémie, Das, Shantanu, Disser, Yann, Labourel, Arnaud, Mihalák, Matúš

Volltext

Collaborative delivery with energy-constrained mobile robots von Bärtschi, Andreas, Chalopin, Jérémie, Das, Shantanu, Disser, Yann, Geissmann, Barbara, Graf, Daniel, Labourel, Arnaud, Mihalák, Matúš

Volltext

Optimization Methods for Multistage Freight Train Formation von Bohlin, Markus, Gestrelius, Sara, Dahms, Florian, Mihalák, Matúš, Flier, Holger

Volltext

Tree Nash Equilibria in the Network Creation Game von Mamageishvili, Akaki, Mihalák, Matúš, Müller, Dominik

Volltext

Improved bounds on equilibria solutions in the network design game von Mamageishvili, Akaki, Mihalák, Matúš, Montemezzani, Simone

Volltext

Computing and Listing st-Paths in Public Transportation Networks von Böhmová, Kateřina, Häfliger, Luca, Mihalák, Matúš, Pröger, Tobias, Sacomoto, Gustavo, Sagot, Marie-France

Volltext

Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents von Chalopin, Jérémie, Das, Shantanu, Disser, Yann, Labourel, Arnaud, Mihalák, Matúš

Volltext

Mapping a polygon with holes using a compass von Disser, Yann, Ghosh, Subir Kumar, Mihalák, Matúš, Widmayer, Peter

Volltext

Improving the H k -bound on the price of stability in undirected Shapley network design games von Disser, Yann, Feldmann, Andreas Emil, Klimm, Max, Mihalák, Matúš

Volltext

Snakes and Ladders: A Treewidth Story von Chaplick, Steven, Kelk, Steven, Meuwese, Ruben, Mihalák, Matúš, Stamoulis, Georgios

Volltext

A polygon is determined by its angles von Disser, Yann, Mihalák, Matúš, Widmayer, Peter

Volltext

Relaxed Agreement Forests von Ardévol Martínez, Virginia, Chaplick, Steven, Kelk, Steven, Meuwese, Ruben, Mihalák, Matúš, Stamoulis, Georgios

Volltext

Multicast Network Design Game on a Ring von Mamageishvili, Akaki, Mihalák, Matúš

Volltext

Near-Gathering of Energy-Constrained Mobile Agents von Bärtschi, Andreas, Bampas, Evangelos, Chalopin, Jérémie, Das, Shantanu, Karousatou, Christina, Mihalák, Matúš

Volltext

Discovery of network properties with all-shortest-paths queries von Bilò, Davide, Erlebach, Thomas, Mihalák, Matúš, Widmayer, Peter

Volltext

The price of anarchy in network creation games is (mostly) constant von Mihalák, Matúš, Schlegel, Jan Christoph

Volltext

On a Fixed Haplotype Variant of the Minimum Error Correction Problem von Goblet, Axel, Kelk, Steven, Mihalák, Matúš, Stamoulis, Georgios

Volltext

How to Guard a Graph? von Fomin, Fedor V., Golovach, Petr A., Hall, Alex, Mihalák, Matúš, Vicari, Elias, Widmayer, Peter

Volltext