Yann Disser

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 77

Top Venues

CoRR

Theor. Comput. Sci.

SIAM J. Discret. Math.

SODA

ETH Zurich (PHD)

Education History

ETH Zurich

PHD

Publications

Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz
Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. CoRR (2024)
Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP. CoRR (2024)
Yann Disser, David Weckbecker
Unified Greedy Approximability beyond Submodular Maximization. SIAM J. Discret. Math. 38 (1) (2024)
Yann Disser, Max Klimm, Annette Lutz, David Weckbecker
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. SIAM J. Discret. Math. 38 (1) (2024)
Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
Incremental Maximization via Continuization. ICALP (2023)
Yann Disser, Oliver Friedmann, Alexander V. Hopp
An exponential lower bound for Zadeh's pivot rule. Math. Program. 199 (1) (2023)
Yann Disser, Daniel Günther, Thomas Schneider, Maximilian Stillger, Arthur Wigandt, Hossein Yalame
Breaking the Size Barrier: Universal Circuits Meet Lookup Tables. ASIACRYPT (1) (2023)
Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer
Exploration of Graphs with Excluded Minors. ESA (2023)
Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer
Exploration of graphs with excluded minors. CoRR (2023)
Simon Emde, Shohre Zehtabian, Yann Disser
Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition. Ann. Oper. Res. 322 (1) (2023)
Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
Incremental Maximization via Continuization. CoRR (2023)
Alexander Birx, Yann Disser, Kevin Schewior
Improved Bounds for Open Online Dial-a-Ride on the Line. Algorithmica 85 (5) (2023)
Yann Disser, Nils Mosis
A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. ISAAC (2023)
Júlia Baligács, Yann Disser, Farehe Soheil, David Weckbecker
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. WADS (2023)
Yann Disser, Nils Mosis
A unified worst case for classical simplex and policy iteration pivot rules. CoRR (2023)
Júlia Baligács, Yann Disser, David Weckbecker
Tight analysis of lazy: an improved algorithm for open online dial-a-ride. CoRR (2022)
Yann Disser, Daniel Günther, Thomas Schneider, Maximilian Stillger, Arthur Wigandt, Hossein Yalame
Improved Universal Circuits using Lookup Tables. IACR Cryptol. ePrint Arch. 2022 (2022)
Aaron Bernstein, Yann Disser, Martin Groß, Sandra Himburg
General bounds for incremental maximization. Math. Program. 191 (2) (2022)
Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR (2022)
Yann Disser, David Weckbecker
Unified Greedy Approximability Beyond Submodular Maximization. ISCO (2022)
Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
An Improved Algorithm for Open Online Dial-a-Ride. WAOA (2022)
Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
An Improved Algorithm for Open Online Dial-a-Ride. CoRR (2022)
Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC (2022)
Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. 868 (2021)
Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior, Leen Stougie
Tight Bounds for Online TSP on the Line. ACM Trans. Algorithms 17 (1) (2021)
Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou
An improved lower bound for competitive graph exploration. Theor. Comput. Sci. 868 (2021)
Yann Disser, Max Klimm, David Weckbecker
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint. CoRR (2021)
Yann Disser, Max Klimm, David Weckbecker
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. WAOA (2021)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. Algorithmica 83 (5) (2021)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA (2021)
Yann Disser, Jannik Matuschke
The complexity of computing a robust flow. Oper. Res. Lett. 48 (1) (2020)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810 (2020)
Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann, Danny Hermelin, Wojciech Nadara, Michal Pilipczuk, Marcin Pilipczuk, Manuel Sorge, Bartlomiej Wróblewski, Anna Zych-Pawlewicz
On Dynamic Parameterized k-Path. CoRR (2020)
Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou
Improved Lower Bound for Competitive Graph Exploration. CoRR (2020)
Alexander Birx, Yann Disser
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. SIAM J. Discret. Math. 34 (2) (2020)
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. 45 (1) (2020)
Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz
Recoloring Interval Graphs with Limited Recourse Budget. SWAT (2020)
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
A general lower bound for collaborative tree exploration. Theor. Comput. Sci. 811 (2020)
Yann Disser, David Weckbecker
Unified greedy approximability beyond submodular maximization. CoRR (2020)
Yann Disser, Sören Schmitt
Evacuating Two Robots from a Disk: A Second Cut. CoRR (2019)
Yann Disser, Oliver Friedmann, Alexander V. Hopp
An Exponential Lower Bound for Zadeh's pivot rule. CoRR (2019)
Alexander Birx, Yann Disser, Kevin Schewior
Improved Bounds for Open Online Dial-a-Ride on the Line. APPROX-RANDOM (2019)
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Scheduling maintenance jobs in networks. Theor. Comput. Sci. 754 (2019)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. WG (2019)
Wasiur R. KhudaBukhsh, Arnab Auddy, Yann Disser, Heinz Koeppl
Approximate lumpability for Markovian agent-based models using local symmetries. J. Appl. Probab. 56 (3) (2019)
Yann Disser, Martin Skutella
The Simplex Algorithm Is NP-Mighty. ACM Trans. Algorithms 15 (1) (2019)
Alexander Birx, Yann Disser
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. STACS (2019)
Yann Disser, Alexander V. Hopp
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule. IPCO (2019)
Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
Distance-Preserving Graph Contractions. SIAM J. Discret. Math. 33 (3) (2019)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
Travelling on Graphs with Small Highway Dimension. CoRR (2019)
Yann Disser, Sören Schmitt
Evacuating Two Robots from a Disk: A Second Cut. SIROCCO (2019)
Alexander Birx, Yann Disser
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. CoRR (2019)
Yann Disser, Jan Hackfeld, Max Klimm
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. J. ACM 66 (6) (2019)
Yann Disser, Stefan Kratsch, Manuel Sorge
The Minimum Feasible Tileset Problem. Algorithmica 81 (3) (2019)
Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO (2019)
Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
Distance-Preserving Graph Contractions. ITCS (2018)
Yann Disser, Jan Hackfeld, Max Klimm
Tight bounds for undirected graph exploration with pebbles and multiple agents. CoRR (2018)
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Scheduling Maintenance Jobs in Networks. CIAC (2017)
Aaron Bernstein, Yann Disser, Martin Groß
General Bounds for Incremental Maximization. CoRR (2017)
Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
Distance-preserving graph contractions. CoRR (2017)
Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
Packing a Knapsack of Unknown Capacity. SIAM J. Discret. Math. 31 (3) (2017)
Aaron Bernstein, Yann Disser, Martin Groß
General Bounds for Incremental Maximization. ICALP (2017)
Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
Scheduling Maintenance Jobs in Networks. CoRR (2017)
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
A General Lower Bound for Collaborative Tree Exploration. SIROCCO (2017)
Yann Disser, Stefan Kratsch
Robust and Adaptive Search. STACS (2017)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS (2017)
Yann Disser, Stefan Kratsch
Robust and adaptive search. CoRR (2017)
Yann Disser, Jannik Matuschke
The Complexity of Computing a Robust Flow. CoRR (2017)
Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie
Tight Bounds for Online TSP on the Line. SODA (2017)
Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
A general lower bound for collaborative tree exploration. CoRR (2016)
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO (2016)
Yann Disser, Jan Hackfeld, Max Klimm
) Pebbles. SODA (2016)
Yann Disser, Jannik Matuschke
Degree-constrained orientations of embedded graphs. J. Comb. Optim. 31 (2) (2016)
Katerina Böhmová, Yann Disser, Matús Mihalák, Rastislav Srámek
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. LATIN (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR (2016)
Yann Disser, Max Klimm, Elisabeth Lübbecke
Scheduling Bidirectional Traffic on a Path. CoRR (2015)
Yann Disser, Martin Skutella
The Simplex Algorithm is NP-mighty. SODA (2015)
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms 11 (4) (2015)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theor. Comput. Sci. 562 (2015)
Yann Disser, Max Klimm, Elisabeth Lübbecke
Scheduling Bidirectional Traffic on a Path. ICALP (1) (2015)
Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Fast collaborative graph exploration. Inf. Comput. 243 (2015)
Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
Mapping a polygon with holes using a compass. Theor. Comput. Sci. 553 (2014)
Yann Disser, Stefan Kratsch, Manuel Sorge
The Minimum Feasible Tileset Problem. WAOA (2014)
Yann Disser, Stefan Kratsch, Manuel Sorge
The Minimum Feasible Tileset problem. CoRR (2014)
Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
Packing a Knapsack of Unknown Capacity. STACS (2014)
Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. ISCO (2014)
Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer
Interval Selection with Machine-Dependent Intervals. WADS (2013)
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65 (1) (2013)
Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer
Polygon-Constrained Motion Planning Problems. ALGOSENSORS (2013)
Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Fast Collaborative Graph Exploration. ICALP (2) (2013)
Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
-Bound on the Price of Stability in Undirected Shapley Network Design Games. CIAC (2013)
Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
Packing a Knapsack of Unknown Capacity. CoRR (2013)
Yann Disser, Martin Skutella
In defense of the Simplex Algorithm's worst-case behavior. CoRR (2013)
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
Simple agents learn to find their way: An introduction on mapping polygons. Discret. Appl. Math. 161 (10-11) (2013)
Yann Disser, Jannik Matuschke
Degree-Constrained Orientations of Embedded Graphs. ISAAC (2012)
Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
Mapping a Polygon with Holes Using a Compass. ALGOSENSORS (2012)
Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444 (2012)
Yann Disser, Matús Mihalák, Peter Widmayer
Mapping Polygons with Agents That Measure Angles. WAFR (2012)

Yann Disser.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yann Disser