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

1

Sequential solutions in machine scheduling games:

Chen, Cong ; Giessler, Paul ; Mamageishvili, Akaki..
Journal of Scheduling. , 2024

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

2

Collaborative delivery on a fixed path with homogeneous ene..:

Chalopin, Jérémie ; Das, Shantanu ; Disser, Yann..
Theoretical Computer Science. 868 (2021) - p. 87-96 , 2021

Link: https://doi.org/10.1016/..

3

Near-gathering of energy-constrained mobile agents:

Bärtschi, Andreas ; Bampas, Evangelos ; Chalopin, Jérémie...
Theoretical Computer Science. 849 (2021) - p. 35-46 , 2021

Link: https://doi.org/10.1016/..

4

Collaborative delivery with energy-constrained mobile robot:

Bärtschi, Andreas ; Chalopin, Jérémie ; Das, Shantanu...
Theoretical Computer Science. 810 (2020) - p. 2-14 , 2020

Link: https://doi.org/10.1016/..

5

Improved bounds on equilibria solutions in the network desi..:

Mamageishvili, Akaki ; Mihalák, Matúš ; Montemezzani, Simone
International Journal of Game Theory. 47 (2017) 4 - p. 1113-1135 , 2017

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

6

Computing and Listing st-Paths in Public Transportation Net..:

Böhmová, Kateřina ; Häfliger, Luca ; Mihalák, Matúš...
Theory of Computing Systems. 62 (2017) 3 - p. 600-621 , 2017

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

7

Optimization Methods for Multistage Freight Train Formation:

Bohlin, Markus ; Gestrelius, Sara ; Dahms, Florian..
Transportation Science. 50 (2016) 3 - p. 823-840 , 2016

Link: http://www.jstor.org/sta..

8

Selecting vertex disjoint paths in plane graphs:

Flier, Holger ; Mihalák, Matúš ; Widmayer, Peter...
Networks. 66 (2015) 2 - p. 136-144 , 2015

Link: https://doi.org/10.1002/..

9

Mapping Simple Polygons : The Power of Telling Convex fr..:

Chalopin, Jérémie ; Das, Shantanu ; Disser, Yann..
ACM Transactions on Algorithms (TALG). 11 (2015) 4 - p. 1-16 , 2015

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

10

Improving the Hk-bound on the price of stability in undirec..:

Disser, Yann ; Feldmann, Andreas Emil ; Klimm, Max.
Theoretical Computer Science. 562 (2015) - p. 557-564 , 2015

Link: https://doi.org/10.1016/..

11

Mapping Simple Polygons: The Power of Telling Convex from R..:

Chalopin, Jérémie ; Das, Shantanu ; Disser, Yann..
ACM Transactions on Algorithms. 11 (2015) 4 - p. 1-16 , 2015

Link: https://doi.org/10.1145/..

12

Mapping a polygon with holes using a compass:

Disser, Yann ; Ghosh, Subir Kumar ; Mihalák, Matúš.
Theoretical Computer Science. 553 (2014) - p. 106-113 , 2014

Link: https://doi.org/10.1016/..

13

Approximately Counting Approximately-Shortest Paths in Dire..:

Mihalák, Matúš ; Šrámek, Rastislav ; Widmayer, Peter
Theory of Computing Systems. 58 (2014) 1 - p. 45-59 , 2014

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

14

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

Mihalák, Matúš ; Schlegel, Jan Christoph
Theory of Computing Systems. 53 (2013) 1 - p. 53-72 , 2013

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

15

Simple agents learn to find their way: An introduction on m..:

Chalopin, Jérémie ; Das, Shantanu ; Disser, Yann..
Discrete Applied Mathematics. 161 (2013) 10-11 - p. 1287-1307 , 2013

Link: https://doi.org/10.1016/..