default search action
Yann Disser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j31]Yann Disser
, David Weckbecker
Unified Greedy Approximability beyond Submodular Maximization. SIAM J. Discret. Math. 38(1): 348-379 (2024) - [j30]Yann Disser
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. SIAM J. Discret. Math. 38(1): 764-789 (2024) - [c46]Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz:
A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. ESA 2024: 15:1-15:15 - [c45]Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz:
Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. ESA 2024: 47:1-47:16 - [i33]Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz:
A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP. CoRR abs/2402.13938 (2024) - [i32]Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz:
Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. CoRR abs/2407.04447 (2024) - 2023
- [j29]Alexander Birx, Yann Disser
Improved Bounds for Open Online Dial-a-Ride on the Line. Algorithmica 85(5): 1372-1414 (2023) - [j28]Simon Emde
Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition. Ann. Oper. Res. 322(1): 467-496 (2023) - [j27]Yann Disser
An exponential lower bound for Zadeh's pivot rule. Math. Program. 199(1): 865-936 (2023) - [c44]Yann Disser
Breaking the Size Barrier: Universal Circuits Meet Lookup Tables. ASIACRYPT (1) 2023: 3-37 - [c43]Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer
Exploration of Graphs with Excluded Minors. ESA 2023: 11:1-11:15 - [c42]Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker:
Incremental Maximization via Continuization. ICALP 2023: 47:1-47:17 - [c41]Yann Disser, Nils Mosis:
A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules. ISAAC 2023: 27:1-27:17 - [c40]Júlia Baligács
Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. WADS 2023: 43-64 - [i31]Yann Disser, Max Klimm, Kevin Schewior, David Weckbecker:
Incremental Maximization via Continuization. CoRR abs/2305.01310 (2023) - [i30]Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer
Exploration of graphs with excluded minors. CoRR abs/2308.06823 (2023) - [i29]Yann Disser, Nils Mosis:
A unified worst case for classical simplex and policy iteration pivot rules. CoRR abs/2309.14034 (2023) - 2022
- [j26]Aaron Bernstein, Yann Disser
General bounds for incremental maximization. Math. Program. 191(2): 953-979 (2022) - [c39]Yann Disser
Unified Greedy Approximability Beyond Submodular Maximization. ISCO 2022: 299-311 - [c38]Johannes Blum, Yann Disser, Andreas Emil Feldmann
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC 2022: 5:1-5:23 - [c37]Júlia Baligács
An Improved Algorithm for Open Online Dial-a-Ride. WAOA 2022: 154-171 - [p1]Yann Disser, Max Klimm:
The Space Complexity of Undirected Graph Exploration. Algorithms for Big Data 2022: 152-166 - [i28]Johannes Blum, Yann Disser, Andreas Emil Feldmann
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR abs/2208.14132 (2022) - [i27]Júlia Baligács, Yann Disser, David Weckbecker:
Tight analysis of lazy: an improved algorithm for open online dial-a-ride. CoRR abs/2210.13850 (2022) - [i26]Júlia Baligács, Yann Disser, Nils Mosis, David Weckbecker:
An Improved Algorithm for Open Online Dial-a-Ride. CoRR abs/2210.13854 (2022) - [i25]Yann Disser, Daniel Günther, Thomas Schneider, Maximilian Stillger, Arthur Wigandt, Hossein Yalame:
Improved Universal Circuits using Lookup Tables. IACR Cryptol. ePrint Arch. 2022: 1652 (2022) - 2021
- [j25]Yann Disser, Andreas Emil Feldmann
Travelling on Graphs with Small Highway Dimension. Algorithmica 83(5): 1352-1370 (2021) - [j24]Antje Bjelde
Tight Bounds for Online TSP on the Line. ACM Trans. Algorithms 17(1): 3:1-3:58 (2021) - [j23]Alexander Birx, Yann Disser, Alexander V. Hopp
An improved lower bound for competitive graph exploration. Theor. Comput. Sci. 868: 65-86 (2021) - [j22]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: 87-96 (2021) - [c36]Jiehua Chen, Wojciech Czerwinski, Yann Disser, Andreas Emil Feldmann
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. SODA 2021: 796-809 - [c35]Yann Disser
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint. WAOA 2021: 206-223 - [i24]Yann Disser, Max Klimm, David Weckbecker:
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint. CoRR abs/2106.14454 (2021) - 2020
- [j21]Yann Disser
Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. 45(1): 323-352 (2020) - [j20]Yann Disser, Jannik Matuschke
The complexity of computing a robust flow. Oper. Res. Lett. 48(1): 18-23 (2020) - [j19]Alexander Birx, Yann Disser:
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. SIAM J. Discret. Math. 34(2): 1409-1443 (2020) - [j18]Andreas Bärtschi
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810: 2-14 (2020) - [j17]Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A general lower bound for collaborative tree exploration. Theor. Comput. Sci. 811: 70-78 (2020) - [c34]Bartlomiej Bosek
Recoloring Interval Graphs with Limited Recourse Budget. SWAT 2020: 17:1-17:23 - [i23]Alexander Birx, Yann Disser, Alexander V. Hopp, Christina Karousatou:
Improved Lower Bound for Competitive Graph Exploration. CoRR abs/2002.10958 (2020) - [i22]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 abs/2006.00571 (2020) - [i21]Yann Disser, David Weckbecker:
Unified greedy approximability beyond submodular maximization. CoRR abs/2011.00962 (2020)
2010 – 2019
- 2019
- [j16]Yann Disser, Stefan Kratsch, Manuel Sorge:
The Minimum Feasible Tileset Problem. Algorithmica 81(3): 1126-1151 (2019) - [j15]Yann Disser, Jan Hackfeld, Max Klimm
Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. J. ACM 66(6): 40:1-40:41 (2019) - [j14]Wasiur R. KhudaBukhsh
Approximate lumpability for Markovian agent-based models using local symmetries. J. Appl. Probab. 56(3): 647-671 (2019) - [j13]Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny:
Distance-Preserving Graph Contractions. SIAM J. Discret. Math. 33(3): 1607-1636 (2019) - [j12]Yann Disser
The Simplex Algorithm Is NP-Mighty. ACM Trans. Algorithms 15(1): 5:1-5:19 (2019) - [j11]Fidaa Abed
Scheduling maintenance jobs in networks. Theor. Comput. Sci. 754: 107-121 (2019) - [c33]Alexander Birx, Yann Disser, Kevin Schewior
Improved Bounds for Open Online Dial-a-Ride on the Line. APPROX-RANDOM 2019: 21:1-21:22 - [c32]Yann Disser, Alexander V. Hopp
On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule. IPCO 2019: 168-180 - [c31]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: 139-153 - [c30]Yann Disser, Sören Schmitt
Evacuating Two Robots from a Disk: A Second Cut. SIROCCO 2019: 200-214 - [c29]Alexander Birx, Yann Disser:
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. STACS 2019: 15:1-15:17 - [c28]Yann Disser, Andreas Emil Feldmann
Travelling on Graphs with Small Highway Dimension. WG 2019: 175-189 - [e1]Yann Disser, Vassilios S. Verykios:
Algorithmic Aspects of Cloud Computing - 4th International Symposium, ALGOCLOUD 2018, Helsinki, Finland, August 20-21, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11409, Springer 2019, ISBN 978-3-030-19758-2 [contents] - [i20]Alexander Birx, Yann Disser:
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line. CoRR abs/1901.04272 (2019) - [i19]Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann:
Travelling on Graphs with Small Highway Dimension. CoRR abs/1902.07040 (2019) - [i18]Yann Disser, Sören Schmitt:
Evacuating Two Robots from a Disk: A Second Cut. CoRR abs/1905.10592 (2019) - [i17]Yann Disser, Oliver Friedmann, Alexander V. Hopp
An Exponential Lower Bound for Zadeh's pivot rule. CoRR abs/1911.01074 (2019) - 2018
- [c27]Aaron Bernstein, Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny:
Distance-Preserving Graph Contractions. ITCS 2018: 51:1-51:14 - [i16]Yann Disser, Jan Hackfeld, Max Klimm:
Tight bounds for undirected graph exploration with pebbles and multiple agents. CoRR abs/1805.03476 (2018) - 2017
- [j10]Yann Disser, Max Klimm, Nicole Megow
Packing a Knapsack of Unknown Capacity. SIAM J. Discret. Math. 31(3): 1477-1497 (2017) - [c26]Fidaa Abed
Scheduling Maintenance Jobs in Networks. CIAC 2017: 19-30 - [c25]Aaron Bernstein, Yann Disser, Martin Groß:
General Bounds for Incremental Maximization. ICALP 2017: 43:1-43:14 - [c24]Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A General Lower Bound for Collaborative Tree Exploration. SIROCCO 2017: 125-139 - [c23]Antje Bjelde
Tight Bounds for Online TSP on the Line. SODA 2017: 994-1005 - [c22]Andreas Bärtschi
Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS 2017: 10:1-10:14 - [c21]Yann Disser, Stefan Kratsch:
Robust and Adaptive Search. STACS 2017: 26:1-26:14 - [i15]Fidaa Abed, Lin Chen, Yann Disser, Martin Groß, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke:
Scheduling Maintenance Jobs in Networks. CoRR abs/1701.08809 (2017) - [i14]Yann Disser, Stefan Kratsch:
Robust and adaptive search. CoRR abs/1702.05932 (2017) - [i13]Yann Disser, Jannik Matuschke:
The Complexity of Computing a Robust Flow. CoRR abs/1704.08241 (2017) - [i12]Karl Däubel, Yann Disser, Max Klimm, Torsten Mütze, Frieder Smolny:
Distance-preserving graph contractions. CoRR abs/1705.04544 (2017) - [i11]Aaron Bernstein, Yann Disser, Martin Groß:
General Bounds for Incremental Maximization. CoRR abs/1705.10253 (2017) - 2016
- [j9]Yann Disser, Jannik Matuschke
Degree-constrained orientations of embedded graphs. J. Comb. Optim. 31(2): 758-773 (2016) - [c20]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: 220-234 - [c19]Andreas Bärtschi
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO 2016: 258-274 - [c18]Yann Disser, Jan Hackfeld, Max Klimm:
Undirected Graph Exploration with ⊝(log log n) Pebbles. SODA 2016: 25-39 - [i10]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 abs/1604.08125 (2016) - [i9]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 abs/1608.08500 (2016) - [i8]Yann Disser, Frank Mousset, Andreas Noever, Nemanja Skoric, Angelika Steger:
A general lower bound for collaborative tree exploration. CoRR abs/1610.01753 (2016) - [i7]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 abs/1610.02361 (2016) - 2015
- [j8]Dariusz Dereniowski
Fast collaborative graph exploration. Inf. Comput. 243: 37-49 (2015) - [j7]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): 33:1-33:16 (2015) - [j6]Yann Disser, Andreas Emil Feldmann
Improving the Hk-bound on the price of stability in undirected Shapley network design games. Theor. Comput. Sci. 562: 557-564 (2015) - [c17]Yann Disser, Max Klimm, Elisabeth Lübbecke:
Scheduling Bidirectional Traffic on a Path. ICALP (1) 2015: 406-418 - [c16]Yann Disser, Martin Skutella:
The Simplex Algorithm is NP-mighty. SODA 2015: 858-872 - [i6]Yann Disser, Max Klimm, Elisabeth Lübbecke:
Scheduling Bidirectional Traffic on a Path. CoRR abs/1504.07129 (2015) - 2014
- [j5]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer:
Mapping a polygon with holes using a compass. Theor. Comput. Sci. 553: 106-113 (2014) - [c15]Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer:
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. ISCO 2014: 208-220 - [c14]Yann Disser, Max Klimm, Nicole Megow
Packing a Knapsack of Unknown Capacity. STACS 2014: 276-287 - [c13]Yann Disser, Stefan Kratsch, Manuel Sorge:
The Minimum Feasible Tileset Problem. WAOA 2014: 144-155 - [i5]Yann Disser, Stefan Kratsch, Manuel Sorge:
The Minimum Feasible Tileset problem. CoRR abs/1409.8524 (2014) - 2013
- [j4]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): 43-59 (2013) - [j3]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): 1287-1307 (2013) - [c12]Davide Bilò
Polygon-Constrained Motion Planning Problems. ALGOSENSORS 2013: 67-82 - [c11]Yann Disser, Andreas Emil Feldmann
Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games. CIAC 2013: 158-169 - [c10]Dariusz Dereniowski
Fast Collaborative Graph Exploration. ICALP (2) 2013: 520-532 - [c9]Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer:
Interval Selection with Machine-Dependent Intervals. WADS 2013: 170-181 - [i4]Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller:
Packing a Knapsack of Unknown Capacity. CoRR abs/1307.2806 (2013) - [i3]Yann Disser, Martin Skutella:
In defense of the Simplex Algorithm's worst-case behavior. CoRR abs/1311.5935 (2013) - 2012
- [j2]Davide Bilò
Reconstructing visibility graphs with simple robots. Theor. Comput. Sci. 444: 52-59 (2012) - [c8]Yann Disser, Subir Kumar Ghosh, Matús Mihalák, Peter Widmayer:
Mapping a Polygon with Holes Using a Compass. ALGOSENSORS 2012: 78-89 - [c7]Yann Disser, Jannik Matuschke:
Degree-Constrained Orientations of Embedded Graphs. ISAAC 2012: 506-516 - [c6]Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Polygons with Agents That Measure Angles. WAFR 2012: 415-425 - [i2]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. CoRR abs/1204.3850 (2012) - [i1]Yann Disser, Andreas Emil Feldmann, Max Klimm, Matús Mihalák:
Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games. CoRR abs/1211.2090 (2012) - 2011
- [b1]Yann Disser:
Mapping Polygons. ETH Zurich, 2011, ISBN 978-3-8325-3023-5, pp. 1-137 - [j1]Yann Disser, Matús Mihalák, Peter Widmayer:
A polygon is determined by its angles. Comput. Geom. 44(8): 418-426 (2011) - [c5]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Telling convex from reflex allows to map a polygon. STACS 2011: 153-164 - 2010
- [c4]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
How Simple Robots Benefit from Looking Back. CIAC 2010: 229-239 - [c3]Yann Disser, Matús Mihalák, Peter Widmayer:
Reconstructing a Simple Polygon from Its Angles. SWAT 2010: 13-24
2000 – 2009
- 2009
- [c2]Davide Bilò
Reconstructing Visibility Graphs with Simple Robots. SIROCCO 2009: 87-99 - 2008
- [c1]Yann Disser, Matthias Müller-Hannemann
Multi-criteria Shortest Paths in Time-Dependent Train Networks. WEA 2008: 347-361
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: