Sledovat
Yann Disser
Yann Disser
Professor of Mathematics, TU Darmstadt
E-mailová adresa ověřena na: mathematik.tu-darmstadt.de - Domovská stránka
Název
Citace
Citace
Rok
Multi-criteria shortest paths in time-dependent train networks
Y Disser, M Müller–Hannemann, M Schnee
Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008
1562008
Fast collaborative graph exploration
D Dereniowski, Y Disser, A Kosowski, D Pająk, P Uznański
Information and Computation 243, 37-49, 2015
692015
Tight bounds for online TSP on the line
A Bjelde, J Hackfeld, Y Disser, C Hansknecht, M Lipmann, J Meißner, ...
ACM Transactions on Algorithms (TALG) 17 (1), 1-58, 2020
462020
The simplex algorithm is NP-mighty
Y Disser, M Skutella
ACM Transactions on Algorithms (TALG) 15 (1), 1-19, 2018
442018
Tight bounds for undirected graph exploration with pebbles and multiple agents
Y Disser, J Hackfeld, M Klimm
Journal of the ACM (JACM) 66 (6), 1-41, 2019
37*2019
Collaborative delivery with energy-constrained mobile robots
A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ...
Theoretical Computer Science 810, 2-14, 2020
292020
A polygon is determined by its angles
Y Disser, M Mihalák, P Widmayer
Computational Geometry 44 (8), 418-426, 2011
27*2011
Energy-efficient delivery by heterogeneous mobile agents
A Bärtschi, J Chalopin, S Das, Y Disser, D Graf, J Hackfeld, P Penna
Proceedings of the 34th International Symposium on Theoretical Aspects of …, 2017
262017
Mapping simple polygons: How robots benefit from looking back
J Chalopin, S Das, Y Disser, M Mihalák, P Widmayer
Algorithmica 65, 43-59, 2013
22*2013
Packing a knapsack of unknown capacity
Y Disser, M Klimm, N Megow, S Stiller
SIAM Journal on Discrete Mathematics 31 (3), 1477-1497, 2017
212017
Mapping simple polygons: The power of telling convex from reflex
J Chalopin, S Das, Y Disser, M Mihalák, P Widmayer
ACM Transactions on Algorithms (TALG) 11 (4), 1-16, 2015
20*2015
Reconstructing visibility graphs with simple robots
D Bilò, Y Disser, M Mihalák, S Suri, E Vicari, P Widmayer
Theoretical Computer Science 444, 52-59, 2012
202012
A general lower bound for collaborative tree exploration
Y Disser, F Mousset, A Noever, N Škorić, A Steger
Structural Information and Communication Complexity: 24th International …, 2017
192017
Improving the Hk-bound on the price of stability in undirected shapley network design games
Y Disser, AE Feldmann, M Klimm, M Mihalák
Theoretical Computer Science 562, 557-564, 2015
192015
Scheduling transfers of resources over time: Towards car-sharing with flexible drop-offs
K Böhmová, Y Disser, M Mihalák, R Šrámek
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016
182016
The complexity of computing a robust flow
Y Disser, J Matuschke
Operations Research Letters 48 (1), 18-23, 2020
172020
Distance-preserving graph contractions
A Bernstein, K Däubel, Y Disser, M Klimm, T Mütze, F Smolny
SIAM Journal on Discrete Mathematics 33 (3), 1607-1636, 2019
17*2019
Approximate lumpability for Markovian agent-based models using local symmetries
WR KhudaBukhsh, A Auddy, Y Disser, H Koeppl
Journal of Applied Probability 56 (3), 647-671, 2019
172019
Scheduling bidirectional traffic on a path
Y Disser, M Klimm, E Lübbecke
Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015
17*2015
Rectilinear shortest path and rectilinear minimum spanning tree with neighborhoods
Y Disser, M Mihalák, S Montanari, P Widmayer
Combinatorial Optimization: Third International Symposium, ISCO 2014, Lisbon …, 2014
172014
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20