Yann Disser - RankMe

125 papers A* 7A 11B 19C 8Journal 70Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	An Unconditional Lower Bound for the Active-Set Method in Convex Quadratic Maximization. SODA Eleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis
2026	J	`jnl`	Exploration of graphs with excluded minors. J. Comput. Syst. Sci. Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer
2026	A	`conf`	Lower Bounds for Ranking-Based Pivot Rules. STACS Yann Disser, Georg Loho, Matthew T. Maat, Nils Mosis
2026	J	`jnl`	Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. SIAM J. Discret. Math. Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
2025	B	`conf`	A Tight Lower Bound for Online Service with Deadlines and Lazy Server. ISAAC Yann Disser, Linda Thelen
2025	B	`conf`	An Unconditional Lower Bound for the Active-Set Method on the Hypercube. IPCO Yann Disser, Nils Mosis
2025	J	`jnl`	An unconditional lower bound for the active-set method in convex quadratic maximization. CoRR Eleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis
2025	J	`jnl`	An unconditional lower bound for the active-set method on the hypercube. CoRR Yann Disser, Nils Mosis
2025	A	`conf`	Incremental Maximization for a Broad Class of Objectives. ESA Yann Disser, David Weckbecker
2025	B	`conf`	Incremental-Decremental Maximization. WAOA Yann Disser, Max Klimm, Annette Lutz, Lea Strubberg
2025	J	`jnl`	Incremental-Decremental Maximization. CoRR Yann Disser, Max Klimm, Annette Lutz, Lea Strubberg
2025	J	`jnl`	Lower bounds for ranking-based pivot rules. CoRR Yann Disser, Georg Loho, Matthew T. Maat, Nils Mosis
2024	A	`conf`	A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. ESA Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
2024	J	`jnl`	A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP. CoRR Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz
2024	A	`conf`	Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. ESA Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz
2024	J	`jnl`	Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. CoRR Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz
2024	J	`jnl`	Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. SIAM J. Discret. Math. Yann Disser, Max Klimm, Annette Lutz, David Weckbecker
2024	J	`jnl`	Unified Greedy Approximability beyond Submodular Maximization. SIAM J. Discret. Math. Yann Disser, David Weckbecker
2023	B	`conf`	A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. ISAAC Yann Disser, Nils Mosis
2023	J	`jnl`	A unified worst case for classical simplex and policy iteration pivot rules. CoRR Yann Disser, Nils Mosis
2023	J	`jnl`	An exponential lower bound for Zadeh's pivot rule. Math. Program. Yann Disser, Oliver Friedmann, Alexander V. Hopp
2023	—	`conf`	Breaking the Size Barrier: Universal Circuits Meet Lookup Tables. ASIACRYPT (1) Yann Disser, Daniel Günther, Thomas Schneider, Maximilian Stillger, Arthur Wigandt, Hossein Yalame
2023	A	`conf`	Exploration of Graphs with Excluded Minors. ESA Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer
2023	J	`jnl`	Exploration of graphs with excluded minors. CoRR Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer
2023	J	`jnl`	Improved Bounds for Open Online Dial-a-Ride on the Line. Algorithmica Alexander Birx, Yann Disser, Kevin Schewior
2023	A*	`conf`	Incremental Maximization via Continuization. ICALP Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
2023	J	`jnl`	Incremental Maximization via Continuization. CoRR Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker
2023	J	`jnl`	Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition. Ann. Oper. Res. Simon Emde, Shohre Zehtabian, Yann Disser
2023	B	`conf`	Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. WADS Júlia Baligács, Yann Disser, Farehe Soheil, David Weckbecker
2022	B	`conf`	An Improved Algorithm for Open Online Dial-a-Ride. WAOA Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
2022	J	`jnl`	An Improved Algorithm for Open Online Dial-a-Ride. CoRR Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker
2022	J	`jnl`	General bounds for incremental maximization. Math. Program. Aaron Bernstein, Yann Disser, Martin Groß, Sandra Himburg
2022	J	`jnl`	Improved Universal Circuits using Lookup Tables. IACR Cryptol. ePrint Arch. Yann Disser, Daniel Günther, Thomas Schneider, Maximilian Stillger, Arthur Wigandt, Hossein Yalame
2022	B	`conf`	On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
2022	J	`jnl`	On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
2022	—	`ch.`	The Space Complexity of Undirected Graph Exploration. Algorithms for Big Data Yann Disser, Max Klimm
2022	J	`jnl`	Tight analysis of lazy: an improved algorithm for open online dial-a-ride. CoRR Júlia Baligács, Yann Disser, David Weckbecker
2022	C	`conf`	Unified Greedy Approximability Beyond Submodular Maximization. ISCO Yann Disser, David Weckbecker
2021	J	`jnl`	An improved lower bound for competitive graph exploration. Theor. Comput. Sci. Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou
2021	J	`jnl`	Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
2021	A*	`conf`	Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 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
2021	B	`conf`	Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. WAOA Yann Disser, Max Klimm, David Weckbecker
2021	J	`jnl`	Fractionally Subadditive Maximization under an Incremental Knapsack Constraint. CoRR Yann Disser, Max Klimm, David Weckbecker
2021	J	`jnl`	Tight Bounds for Online TSP on the Line. ACM Trans. Algorithms Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior, Leen Stougie
2021	J	`jnl`	Travelling on Graphs with Small Highway Dimension. Algorithmica Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2020	J	`jnl`	A general lower bound for collaborative tree exploration. Theor. Comput. Sci. Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
2020	J	`jnl`	Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
2020	J	`jnl`	Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
2020	J	`jnl`	Improved Lower Bound for Competitive Graph Exploration. CoRR Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou
2020	J	`jnl`	On Dynamic Parameterized k-Path. CoRR 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
2020	—	`conf`	Recoloring Interval Graphs with Limited Recourse Budget. SWAT Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz
2020	J	`jnl`	The complexity of computing a robust flow. Oper. Res. Lett. Yann Disser, Jannik Matuschke
2020	J	`jnl`	Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. SIAM J. Discret. Math. Alexander Birx, Yann Disser
2020	J	`jnl`	Unified greedy approximability beyond submodular maximization. CoRR Yann Disser, David Weckbecker
2019	—	`ed.`	Algorithmic Aspects of Cloud Computing - 4th International Symposium, ALGOCLOUD 2018, Helsinki, Finland, August 20-21, 2018, Revised Selected Papers ALGOCLOUD Yann Disser, Vassilios S. Verykios
2019	J	`jnl`	An Exponential Lower Bound for Zadeh's pivot rule. CoRR Yann Disser, Oliver Friedmann, Alexander V. Hopp
2019	J	`jnl`	Approximate lumpability for Markovian agent-based models using local symmetries. J. Appl. Probab. Wasiur R. KhudaBukhsh, Arnab Auddy, Yann Disser, Heinz Koeppl
2019	B	`conf`	Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
2019	J	`jnl`	Distance-Preserving Graph Contractions. SIAM J. Discret. Math. Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
2019	B	`conf`	Evacuating Two Robots from a Disk: A Second Cut. SIROCCO Yann Disser, Sören Schmitt
2019	J	`jnl`	Evacuating Two Robots from a Disk: A Second Cut. CoRR Yann Disser, Sören Schmitt
2019	—	`conf`	Improved Bounds for Open Online Dial-a-Ride on the Line. APPROX-RANDOM Alexander Birx, Yann Disser, Kevin Schewior
2019	B	`conf`	On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule. IPCO Yann Disser, Alexander V. Hopp
2019	J	`jnl`	Scheduling maintenance jobs in networks. Theor. Comput. Sci. Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
2019	J	`jnl`	The Minimum Feasible Tileset Problem. Algorithmica Yann Disser, Stefan Kratsch, Manuel Sorge
2019	J	`jnl`	The Simplex Algorithm Is NP-Mighty. ACM Trans. Algorithms Yann Disser, Martin Skutella
2019	A	`conf`	Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. STACS Alexander Birx, Yann Disser
2019	J	`jnl`	Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. CoRR Alexander Birx, Yann Disser
2019	J	`jnl`	Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. J. ACM Yann Disser, Jan Hackfeld, Max Klimm
2019	B	`conf`	Travelling on Graphs with Small Highway Dimension. WG Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2019	J	`jnl`	Travelling on Graphs with Small Highway Dimension. CoRR Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann
2018	A	`conf`	Distance-Preserving Graph Contractions. ITCS Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
2018	J	`jnl`	Tight bounds for undirected graph exploration with pebbles and multiple agents. CoRR Yann Disser, Jan Hackfeld, Max Klimm
2017	B	`conf`	A General Lower Bound for Collaborative Tree Exploration. SIROCCO Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
2017	J	`jnl`	Distance-preserving graph contractions. CoRR Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny
2017	A	`conf`	Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
2017	A*	`conf`	General Bounds for Incremental Maximization. ICALP Aaron Bernstein, Yann Disser, Martin Groß
2017	J	`jnl`	General Bounds for Incremental Maximization. CoRR Aaron Bernstein, Yann Disser, Martin Groß
2017	J	`jnl`	Packing a Knapsack of Unknown Capacity. SIAM J. Discret. Math. Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
2017	A	`conf`	Robust and Adaptive Search. STACS Yann Disser, Stefan Kratsch
2017	J	`jnl`	Robust and adaptive search. CoRR Yann Disser, Stefan Kratsch
2017	C	`conf`	Scheduling Maintenance Jobs in Networks. CIAC Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
2017	J	`jnl`	Scheduling Maintenance Jobs in Networks. CoRR Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke
2017	J	`jnl`	The Complexity of Computing a Robust Flow. CoRR Yann Disser, Jannik Matuschke
2017	A*	`conf`	Tight Bounds for Online TSP on the Line. SODA Antje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie
2016	J	`jnl`	A general lower bound for collaborative tree exploration. CoRR Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger
2016	B	`conf`	Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
2016	J	`jnl`	Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
2016	J	`jnl`	Degree-constrained orientations of embedded graphs. J. Comb. Optim. Yann Disser, Jannik Matuschke
2016	J	`jnl`	Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
2016	J	`jnl`	Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
2016	B	`conf`	Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. LATIN Katerina Böhmová, Yann Disser, Matús Mihalák, Rastislav Srámek
2016	A*	`conf`	Undirected Graph Exploration with ⊝(log log SODA Yann Disser, Jan Hackfeld, Max Klimm
2015	J	`jnl`	Fast collaborative graph exploration. Inf. Comput. Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
2015	J	`jnl`	Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theor. Comput. Sci. Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
2015	J	`jnl`	Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2015	—	`conf`	Scheduling Bidirectional Traffic on a Path. ICALP (1) Yann Disser, Max Klimm, Elisabeth Lübbecke
2015	J	`jnl`	Scheduling Bidirectional Traffic on a Path. CoRR Yann Disser, Max Klimm, Elisabeth Lübbecke
2015	A*	`conf`	The Simplex Algorithm is NP-mighty. SODA Yann Disser, Martin Skutella
2014	J	`jnl`	Mapping a polygon with holes using a compass. Theor. Comput. Sci. Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
2014	A	`conf`	Packing a Knapsack of Unknown Capacity. STACS Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
2014	C	`conf`	Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. ISCO Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer
2014	B	`conf`	The Minimum Feasible Tileset Problem. WAOA Yann Disser, Stefan Kratsch, Manuel Sorge
2014	J	`jnl`	The Minimum Feasible Tileset problem. CoRR Yann Disser, Stefan Kratsch, Manuel Sorge
2013	—	`conf`	Fast Collaborative Graph Exploration. ICALP (2) Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
2013	C	`conf`	Improving the CIAC Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
2013	J	`jnl`	In defense of the Simplex Algorithm's worst-case behavior. CoRR Yann Disser, Martin Skutella
2013	B	`conf`	Interval Selection with Machine-Dependent Intervals. WADS Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer
2013	J	`jnl`	Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2013	J	`jnl`	Packing a Knapsack of Unknown Capacity. CoRR Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller
2013	C	`conf`	Polygon-Constrained Motion Planning Problems. ALGOSENSORS Davide Bilò, Yann Disser, Luciano Gualà, Matús Mihalák, Guido Proietti, Peter Widmayer
2013	J	`jnl`	Simple agents learn to find their way: An introduction on mapping polygons. Discret. Appl. Math. Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2012	B	`conf`	Degree-Constrained Orientations of Embedded Graphs. ISAAC Yann Disser, Jannik Matuschke
2012	J	`jnl`	Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games CoRR Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák
2012	C	`conf`	Mapping Polygons with Agents That Measure Angles. WAFR Yann Disser, Matús Mihalák, Peter Widmayer
2012	C	`conf`	Mapping a Polygon with Holes Using a Compass. ALGOSENSORS Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer
2012	J	`jnl`	Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2012	J	`jnl`	Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons CoRR Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2011	J	`jnl`	A polygon is determined by its angles. Comput. Geom. Yann Disser, Matús Mihalák, Peter Widmayer
2011	—	`—`	Mapping Polygons. Yann Disser
2011	A	`conf`	Telling convex from reflex allows to map a polygon. STACS Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2010	C	`conf`	How Simple Robots Benefit from Looking Back. CIAC Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
2010	—	`conf`	Reconstructing a Simple Polygon from Its Angles. SWAT Yann Disser, Matús Mihalák, Peter Widmayer
2009	B	`conf`	Reconstructing Visibility Graphs with Simple Robots. SIROCCO Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer
2008	—	`conf`	Multi-criteria Shortest Paths in Time-Dependent Train Networks. WEA Yann Disser, Matthias Müller-Hannemann, Mathias Schnee