Multi-criteria Shortest Paths in Time-Dependent Train Networks. - Yann Disser; Matthias Müller-Hannemann; Mathias Schnee (WEA, 2008)

How Simple Robots Benefit from Looking Back. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (CIAC, 2010)

Reconstructing a Simple Polygon from Its Angles. - Yann Disser; Matús Mihalák; Peter Widmayer (SWAT, 2010)

Telling convex from reflex allows to map a polygon. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (STACS, 2011)

A polygon is determined by its angles. - Yann Disser; Matús Mihalák; Peter Widmayer (Comput. Geom., 2011)

Mapping Polygons. - Yann Disser (2011)

Mapping Polygons with Agents That Measure Angles. - Yann Disser; Matús Mihalák; Peter Widmayer (WAFR, 2012)

Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (CoRR, 2012)

Reconstructing visibility graphs with simple robots. - Davide Bilò; Yann Disser; Matús Mihalák; Subhash Suri; Elias Vicari; Peter Widmayer (Theor. Comput. Sci., 2012)

Polygon-Constrained Motion Planning Problems. - Davide Bilò; Yann Disser; Luciano Gualà; Matús Mihalák; Guido Proietti; Peter Widmayer (ALGOSENSORS, 2013)

Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (CIAC, 2013)

Interval Selection with Machine-Dependent Intervals. - Katerina Böhmová; Yann Disser; Matús Mihalák; Peter Widmayer (WADS, 2013)

Mapping Simple Polygons: How Robots Benefit from Looking Back. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (Algorithmica, 2013)

In defense of the Simplex Algorithm's worst-case behavior. - Yann Disser; Martin Skutella (CoRR, 2013)

Simple agents learn to find their way: An introduction on mapping polygons. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (Discret. Appl. Math., 2013)

Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. - Yann Disser; Matús Mihalák; Sandro Montanari; Peter Widmayer (ISCO, 2014)

Mapping a polygon with holes using a compass. - Yann Disser; Subir Kumar Ghosh; Matús Mihalák; Peter Widmayer (Theor. Comput. Sci., 2014)

Scheduling Bidirectional Traffic on a Path. - Yann Disser; Max Klimm; Elisabeth Lübbecke (ICALP (1), 2015)

Fast collaborative graph exploration. - Dariusz Dereniowski; Yann Disser; Adrian Kosowski; Dominik Pajak; Przemyslaw Uznanski (Inf. Comput., 2015)

Mapping Simple Polygons: The Power of Telling Convex from Reflex. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (ACM Trans. Algorithms, 2015)

Improving the Hk-bound on the price of stability in undirected Shapley network design games. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Matús Mihalák (Theor. Comput. Sci., 2015)

Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. - Katerina Böhmová; Yann Disser; Matús Mihalák; Rastislav Srámek (LATIN, 2016)

Undirected Graph Exploration with ⊝(log log n) Pebbles. - Yann Disser; Jan Hackfeld; Max Klimm (SODA, 2016)

Degree-constrained orientations of embedded graphs. - Yann Disser; Jannik Matuschke (J. Comb. Optim., 2016)

General Bounds for Incremental Maximization. - Aaron Bernstein; Yann Disser; Martin Groß 001 (ICALP, 2017)

Energy-Efficient Delivery by Heterogeneous Mobile Agents. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Daniel Graf 001; Jan Hackfeld; Paolo Penna (STACS, 2017)

Robust and Adaptive Search. - Yann Disser; Stefan Kratsch (STACS, 2017)

Distance-preserving graph contractions. - Karl Däubel; Yann Disser; Max Klimm; Torsten Mütze; Frieder Smolny (CoRR, 2017)

Packing a Knapsack of Unknown Capacity. - Yann Disser; Max Klimm; Nicole Megow; Sebastian Stiller (SIAM J. Discret. Math., 2017)

On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule. - Yann Disser; Alexander V. Hopp (IPCO, 2019)

Evacuating Two Robots from a Disk: A Second Cut. - Yann Disser; Sören Schmitt (SIROCCO, 2019)

The Minimum Feasible Tileset Problem. - Yann Disser; Stefan Kratsch; Manuel Sorge (Algorithmica, 2019)

Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. - Yann Disser; Jan Hackfeld; Max Klimm (J. ACM, 2019)

Approximate lumpability for Markovian agent-based models using local symmetries. - Wasiur R. KhudaBukhsh; Arnab Auddy; Yann Disser; Heinz Koeppl (J. Appl. Probab., 2019)

Distance-Preserving Graph Contractions. - Aaron Bernstein; Karl Däubel; Yann Disser; Max Klimm; Torsten Mütze; Frieder Smolny (SIAM J. Discret. Math., 2019)

The Simplex Algorithm Is NP-Mighty. - Yann Disser; Martin Skutella (ACM Trans. Algorithms, 2019)

Scheduling maintenance jobs in networks. - Fidaa Abed; Lin Chen 009; Yann Disser; Martin Groß 001; Nicole Megow; Julie Meißner; Alexander T. Richter; Roman Rischke (Theor. Comput. Sci., 2019)

Recoloring Interval Graphs with Limited Recourse Budget. - Bartlomiej Bosek; Yann Disser; Andreas Emil Feldmann; Jakub Pawlewicz; Anna Zych-Pawlewicz (SWAT, 2020)

Improved Lower Bound for Competitive Graph Exploration. - Alexander Birx; Yann Disser; Alexander V. Hopp; Christina Karousatou (CoRR, 2020)

On Dynamic Parameterized k-Path. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Michal Pilipczuk; Marcin Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (CoRR, 2020)

Hiring Secretaries over Time: The Benefit of Concurrent Employment. - Yann Disser; John Fearnley; Martin Gairing; Oliver Göbel 002; Max Klimm; Daniel Schmand; Alexander Skopalik; Andreas Tönnis (Math. Oper. Res., 2020)

The complexity of computing a robust flow. - Yann Disser; Jannik Matuschke (Oper. Res. Lett., 2020)

Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. - Alexander Birx; Yann Disser (SIAM J. Discret. Math., 2020)

Collaborative delivery with energy-constrained mobile robots. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Barbara Geissmann; Daniel Graf 001; Arnaud Labourel; Matús Mihalák (Theor. Comput. Sci., 2020)

A general lower bound for collaborative tree exploration. - Yann Disser; Frank Mousset; Andreas Noever; Nemanja Skoric; Angelika Steger (Theor. Comput. Sci., 2020)

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (SODA, 2021)

Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. - Yann Disser; Max Klimm; David Weckbecker (WAOA, 2021)

Travelling on Graphs with Small Highway Dimension. - Yann Disser; Andreas Emil Feldmann; Max Klimm; Jochen Könemann (Algorithmica, 2021)

Tight Bounds for Online TSP on the Line. - Antje Bjelde; Jan Hackfeld; Yann Disser; Christoph Hansknecht; Maarten Lipmann; Julie Meißner; Miriam Schlöter; Kevin Schewior; Leen Stougie (ACM Trans. Algorithms, 2021)

An improved lower bound for competitive graph exploration. - Alexander Birx; Yann Disser; Alexander V. Hopp; Christina Karousatou (Theor. Comput. Sci., 2021)

Collaborative delivery on a fixed path with homogeneous energy-constrained agents. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Arnaud Labourel; Matús Mihalák (Theor. Comput. Sci., 2021)

The Space Complexity of Undirected Graph Exploration. - Yann Disser; Max Klimm (Algorithms for Big Data, 2022)

On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. - Johannes Blum 001; Yann Disser; Andreas Emil Feldmann; Siddharth Gupta 002; Anna Zych-Pawlewicz (IPEC, 2022)

An Improved Algorithm for Open Online Dial-a-Ride. - Júlia Baligács; Yann Disser; Nils Mosis; David Weckbecker (WAOA, 2022)

Tight analysis of lazy: an improved algorithm for open online dial-a-ride. - Júlia Baligács; Yann Disser; David Weckbecker (CoRR, 2022)

Improved Universal Circuits using Lookup Tables. - Yann Disser; Daniel Günther 004; Thomas Schneider 003; Maximilian Stillger; Arthur Wigandt; Hossein Yalame (IACR Cryptol. ePrint Arch., 2022)

General bounds for incremental maximization. - Aaron Bernstein; Yann Disser; Martin Groß 001; Sandra Himburg (Math. Program., 2022)

Breaking the Size Barrier: Universal Circuits Meet Lookup Tables. - Yann Disser; Daniel Günther 004; Thomas Schneider 003; Maximilian Stillger; Arthur Wigandt; Hossein Yalame (ASIACRYPT (1), 2023)

Exploration of Graphs with Excluded Minors. - Júlia Baligács; Yann Disser; Irene Heinrich; Pascal Schweitzer (ESA, 2023)

Incremental Maximization via Continuization. - Yann Disser; Max Klimm; Kevin Schewior; David Weckbecker (ICALP, 2023)

A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. - Yann Disser; Nils Mosis (ISAAC, 2023)

Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. - Júlia Baligács; Yann Disser; Farehe Soheil; David Weckbecker (WADS, 2023)

Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition. - Simon Emde; Shohre Zehtabian; Yann Disser (Ann. Oper. Res., 2023)

Improved Bounds for Open Online Dial-a-Ride on the Line. - Alexander Birx; Yann Disser; Kevin Schewior (Algorithmica, 2023)

An exponential lower bound for Zadeh's pivot rule. - Yann Disser; Oliver Friedmann; Alexander V. Hopp (Math. Program., 2023)

A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. - Júlia Baligács; Yann Disser; Andreas Emil Feldmann; Anna Zych-Pawlewicz (ESA, 2024)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. - Yann Disser; Svenja M. Griesbach; Max Klimm; Annette Lutz (ESA, 2024)

Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. - Yann Disser; Max Klimm; Annette Lutz; David Weckbecker (SIAM J. Discret. Math., 2024)

Unified Greedy Approximability beyond Submodular Maximization. - Yann Disser; David Weckbecker (SIAM J. Discret. Math., 2024)

An Unconditional Lower Bound for the Active-Set Method on the Hypercube. - Yann Disser; Nils Mosis (IPCO, 2025)

An unconditional lower bound for the active-set method in convex quadratic maximization. - Eleon Bach; Yann Disser; Sophie Huiberts; Nils Mosis (CoRR, 2025)