Yann Disser
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
46
Venues
15
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
46 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Online and Incremental Fractional Vertex Cover on Trees. | Jlia Baligcs, Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Grzegorz Gutowski, Katarzyna Kepinska, Pawel Putra, Anna Zych-Pawlewicz |
| 2026 | ESA | Incremental Submodular Maximization: Better Than Greedy. | Marcin Bienkowski, Joakim Blikstad, Jaroslaw Byrka, Martn Costa, Yann Disser, Annette Lutz |
| 2026 | SODA | An Unconditional Lower Bound for the Active-Set Method in Convex Quadratic Maximization. | Eleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis |
| 2026 | STACS | Lower Bounds for Ranking-Based Pivot Rules. | Yann Disser, Georg Loho, Matthew T. Maat, Nils Mosis |
| 2025 | ESA | Incremental Maximization for a Broad Class of Objectives. | Yann Disser, David Weckbecker |
| 2025 | IPCO | An Unconditional Lower Bound for the Active-Set Method on the Hypercube. | Yann Disser, Nils Mosis |
| 2025 | ISAAC | A Tight Lower Bound for Online Service with Deadlines and Lazy Server. | Yann Disser, Linda Thelen |
| 2025 | WAOA | Incremental-Decremental Maximization. | Yann Disser, Max Klimm, Annette Lutz, Lea Strubberg |
| 2024 | ESA | A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. | Jlia Baligcs, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz |
| 2024 | ESA | Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. | Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz |
| 2023 | ASIACRYPT | Breaking the Size Barrier: Universal Circuits Meet Lookup Tables. | Yann Disser, Daniel Gnther, Thomas Schneider, Maximilian Stillger, Arthur Wigandt, Hossein Yalame |
| 2023 | ESA | Exploration of Graphs with Excluded Minors. | Jlia Baligcs, Yann Disser, Irene Heinrich, Pascal Schweitzer |
| 2023 | ICALP | Incremental Maximization via Continuization. | Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker |
| 2023 | ISAAC | A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. | Yann Disser, Nils Mosis |
| 2023 | WADS | Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. | Jlia Baligcs, Yann Disser, Farehe Soheil, David Weckbecker |
| 2022 | WAOA | An Improved Algorithm for Open Online Dial-a-Ride. | Jlia Baligcs, Yann Disser, Nils Mosis, David Weckbecker |
| 2021 | SODA | Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. | Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wrblewski, Anna Zych-Pawlewicz |
| 2021 | WAOA | Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. | Yann Disser, Max Klimm, David Weckbecker |
| 2019 | IPCO | On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule. | Yann Disser, Alexander V. Hopp |
| 2019 | STACS | Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. | Alexander Birx, Yann Disser |
| 2019 | SIROCCO | Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. | Jrmie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Mats Mihalk |
| 2019 | SIROCCO | Evacuating Two Robots from a Disk: A Second Cut. | Yann Disser, Sren Schmitt |
| 2019 | WG | Travelling on Graphs with Small Highway Dimension. | Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Knemann |
| 2017 | CIAC | Scheduling Maintenance Jobs in Networks. | Fidaa Abed, Lin Chen, Yann Disser, Martin Gro, Nicole Megow, Julie Meiner, Alexander T. Richter, Roman Rischke |
| 2017 | ICALP | General Bounds for Incremental Maximization. | Aaron Bernstein, Yann Disser, Martin Gro |
| 2017 | SODA | Tight Bounds for Online TSP on the Line. | Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meiner, Kevin Schewior, Miriam Schlter, Leen Stougie |
| 2017 | STACS | Energy-Efficient Delivery by Heterogeneous Mobile Agents. | Andreas Brtschi, Jrmie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna |
| 2017 | STACS | Robust and Adaptive Search. | Yann Disser, Stefan Kratsch |
| 2017 | SIROCCO | A General Lower Bound for Collaborative Tree Exploration. | Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger |
| 2016 | LATIN | Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. | Katerina Bhmov, Yann Disser, Mats Mihalk, Rastislav Srmek |
| 2016 | SODA | Undirected Graph Exploration with ⊝(log log | Yann Disser, Jan Hackfeld, Max Klimm |
| 2016 | SIROCCO | Collaborative Delivery with Energy-Constrained Mobile Robots. | Andreas Brtschi, Jrmie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Mats Mihalk |
| 2015 | ICALP | Scheduling Bidirectional Traffic on a Path. | Yann Disser, Max Klimm, Elisabeth Lbbecke |
| 2015 | SODA | The Simplex Algorithm is NP-mighty. | Yann Disser, Martin Skutella |
| 2014 | STACS | Packing a Knapsack of Unknown Capacity. | Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller |
| 2014 | WAOA | The Minimum Feasible Tileset Problem. | Yann Disser, Stefan Kratsch, Manuel Sorge |
| 2013 | Algosensors | Polygon-Constrained Motion Planning Problems. | Davide Bil, Yann Disser, Luciano Gual, Mats Mihalk, Guido Proietti, Peter Widmayer |
| 2013 | CIAC | Improving the | Yann Disser, Andreas Emil Feldmann, Max Klimm, Mats Mihalk |
| 2013 | ICALP | Fast Collaborative Graph Exploration. | Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski |
| 2013 | WADS | Interval Selection with Machine-Dependent Intervals. | Katerina Bhmov, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2012 | Algosensors | Mapping a Polygon with Holes Using a Compass. | Yann Disser, Subir Kumar Ghosh, Mats Mihalk, Peter Widmayer |
| 2012 | ISAAC | Degree-Constrained Orientations of Embedded Graphs. | Yann Disser, Jannik Matuschke |
| 2012 | WAFR | Mapping Polygons with Agents That Measure Angles. | Yann Disser, Mats Mihalk, Peter Widmayer |
| 2011 | STACS | Telling convex from reflex allows to map a polygon. | Jrmie Chalopin, Shantanu Das, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2010 | CIAC | How Simple Robots Benefit from Looking Back. | Jrmie Chalopin, Shantanu Das, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2009 | SIROCCO | Reconstructing Visibility Graphs with Simple Robots. | Davide Bil, Yann Disser, Mats Mihalk, Subhash Suri, Elias Vicari, Peter Widmayer |