Yann Disser

According to our database1, Yann Disser
  • authored at least 51 papers between 2008 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Packing a Knapsack of Unknown Capacity.
SIAM J. Discrete Math., 2017

The Complexity of Computing a Robust Flow.
CoRR, 2017

Robust and adaptive search.
CoRR, 2017

Distance-preserving graph contractions.
CoRR, 2017

General Bounds for Incremental Maximization.
CoRR, 2017

Scheduling Maintenance Jobs in Networks.
CoRR, 2017

Robust and Adaptive Search.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Energy-Efficient Delivery by Heterogeneous Mobile Agents.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Tight Bounds for Online TSP on the Line.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

General Bounds for Incremental Maximization.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Scheduling Maintenance Jobs in Networks.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Degree-constrained orientations of embedded graphs.
J. Comb. Optim., 2016

A general lower bound for collaborative tree exploration.
CoRR, 2016

Hiring Secretaries over Time: The Benefit of Concurrent Employment.
CoRR, 2016

Energy-efficient Delivery by Heterogeneous Mobile Agents.
CoRR, 2016

Collaborative Delivery with Energy-Constrained Mobile Robots.
CoRR, 2016

Undirected Graph Exploration with ⊝(log log n) Pebbles.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Collaborative Delivery with Energy-Constrained Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2016

Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Improving the Hk-bound on the price of stability in undirected Shapley network design games.
Theor. Comput. Sci., 2015

Mapping Simple Polygons: The Power of Telling Convex from Reflex.
ACM Trans. Algorithms, 2015

Fast collaborative graph exploration.
Inf. Comput., 2015

Scheduling Bidirectional Traffic on a Path.
CoRR, 2015

The Simplex Algorithm is NP-mighty.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Scheduling Bidirectional Traffic on a Path.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Mapping a polygon with holes using a compass.
Theor. Comput. Sci., 2014

The Minimum Feasible Tileset problem.
CoRR, 2014

The Minimum Feasible Tileset Problem.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Packing a Knapsack of Unknown Capacity.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Simple agents learn to find their way: An introduction on mapping polygons.
Discrete Applied Mathematics, 2013

In defense of the Simplex Algorithm's worst-case behavior.
CoRR, 2013

Packing a Knapsack of Unknown Capacity.
CoRR, 2013

Mapping Simple Polygons: How Robots Benefit from Looking Back.
Algorithmica, 2013

Interval Selection with Machine-Dependent Intervals.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Fast Collaborative Graph Exploration.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Polygon-Constrained Motion Planning Problems.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Reconstructing visibility graphs with simple robots.
Theor. Comput. Sci., 2012

Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games
CoRR, 2012

Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons
CoRR, 2012

Mapping Polygons with Agents That Measure Angles.
Proceedings of the Algorithmic Foundations of Robotics X, 2012

Degree-Constrained Orientations of Embedded Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Mapping a Polygon with Holes Using a Compass.
Proceedings of the Algorithms for Sensor Systems, 2012

2011
Mapping Polygons.
PhD thesis, 2011

A polygon is determined by its angles.
Comput. Geom., 2011

Telling convex from reflex allows to map a polygon.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010
Reconstructing a Simple Polygon from Its Angles.
Proceedings of the Algorithm Theory, 2010

How Simple Robots Benefit from Looking Back.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Reconstructing Visibility Graphs with Simple Robots.
Proceedings of the Structural Information and Communication Complexity, 2009

2008
Multi-criteria Shortest Paths in Time-Dependent Train Networks.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008


  Loading...