% csauthors.net - beta - BibTeX bibliography of Yann Disser
@inproceedings{conf/wea/DisserMS08,
title = {Multi-criteria Shortest Paths in Time-Dependent Train Networks.},
year = {2008},
booktitle = {WEA},
author = {{Yann Disser} and {Matthias Müller-Hannemann} and {Mathias Schnee}},
publisher = {Springer},
booktitle = {Experimental Algorithms, 7th International Workshop, WEA 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings}
}
@inproceedings{conf/ciac/ChalopinDDMW10,
title = {How Simple Robots Benefit from Looking Back.},
year = {2010},
booktitle = {CIAC},
author = {{Jérémie Chalopin} and {Shantanu Das 001} and {Yann Disser} and {Matús Mihalák} and {Peter Widmayer}},
publisher = {Springer},
booktitle = {Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings}
}
@inproceedings{conf/swat/DisserMW10,
title = {Reconstructing a Simple Polygon from Its Angles.},
year = {2010},
booktitle = {SWAT},
author = {{Yann Disser} and {Matús Mihalák} and {Peter Widmayer}},
publisher = {Springer},
booktitle = {Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings}
}
@inproceedings{conf/stacs/ChalopinDDMW11,
title = {Telling convex from reflex allows to map a polygon.},
year = {2011},
booktitle = {STACS},
author = {{Jérémie Chalopin} and {Shantanu Das 001} and {Yann Disser} and {Matús Mihalák} and {Peter Widmayer}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany}
}
@article{journals/comgeo/DisserMW11,
title = {A polygon is determined by its angles.},
year = {2011},
journal = {Comput. Geom.},
author = {{Yann Disser} and {Matús Mihalák} and {Peter Widmayer}}
}
@phdthesis{phd/ch/Disser2011,
title = {Mapping Polygons.},
year = {2011},
isbn = {978-3-8325-3023-5},
author = {{Yann Disser}}
}
@inproceedings{conf/wafr/DisserMW12,
title = {Mapping Polygons with Agents That Measure Angles.},
year = {2012},
booktitle = {WAFR},
author = {{Yann Disser} and {Matús Mihalák} and {Peter Widmayer}},
publisher = {Springer},
booktitle = {Algorithmic Foundations of Robotics X - Proceedings of the Tenth Workshop on the Algorithmic Foundations of Robotics, WAFR 2012, MIT, Cambridge, Massachusetts, USA, June 13-15 2012}
}
@article{journals/corr/abs-1211-2090,
title = {Improving the \$H_k\$-Bound on the Price of Stability in Undirected Shapley Network Design Games},
year = {2012},
journal = {CoRR},
author = {{Yann Disser} and {Andreas Emil Feldmann} and {Max Klimm} and {Matús Mihalák}}
}
@article{journals/tcs/BiloDMSVW12,
title = {Reconstructing visibility graphs with simple robots.},
year = {2012},
journal = {Theor. Comput. Sci.},
author = {{Davide Bilò} and {Yann Disser} and {Matús Mihalák} and {Subhash Suri} and {Elias Vicari} and {Peter Widmayer}}
}
@inproceedings{conf/algosensors/BiloDGMPW13,
title = {Polygon-Constrained Motion Planning Problems.},
year = {2013},
booktitle = {ALGOSENSORS},
author = {{Davide Bilò} and {Yann Disser} and {Luciano Gualà} and {Matús Mihalák} and {Guido Proietti} and {Peter Widmayer}},
publisher = {Springer},
booktitle = {Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}
}
@inproceedings{conf/ciac/DisserFKM13,
title = {Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games.},
year = {2013},
booktitle = {CIAC},
author = {{Yann Disser} and {Andreas Emil Feldmann} and {Max Klimm} and {Matús Mihalák}},
publisher = {Springer},
booktitle = {Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings}
}
@inproceedings{conf/wads/BohmovaDMW13,
title = {Interval Selection with Machine-Dependent Intervals.},
year = {2013},
booktitle = {WADS},
author = {{Katerina Böhmová} and {Yann Disser} and {Matús Mihalák} and {Peter Widmayer}},
publisher = {Springer},
booktitle = {Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings}
}
@article{journals/algorithmica/Chalopin0DMW13,
title = {Mapping Simple Polygons: How Robots Benefit from Looking Back.},
year = {2013},
journal = {Algorithmica},
author = {{Jérémie Chalopin} and {Shantanu Das 001} and {Yann Disser} and {Matús Mihalák} and {Peter Widmayer}}
}
@article{journals/corr/DisserS13,
title = {In defense of the Simplex Algorithm's worst-case behavior.},
year = {2013},
journal = {CoRR},
author = {{Yann Disser} and {Martin Skutella}}
}
@article{journals/dam/Chalopin0DMW13,
title = {Simple agents learn to find their way: An introduction on mapping polygons.},
year = {2013},
journal = {Discret. Appl. Math.},
author = {{Jérémie Chalopin} and {Shantanu Das 001} and {Yann Disser} and {Matús Mihalák} and {Peter Widmayer}}
}
@inproceedings{conf/iscopt/DisserMMW14,
title = {Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.},
year = {2014},
booktitle = {ISCO},
author = {{Yann Disser} and {Matús Mihalák} and {Sandro Montanari} and {Peter Widmayer}},
publisher = {Springer},
booktitle = {Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers}
}
@article{journals/tcs/DisserGMW14,
title = {Mapping a polygon with holes using a compass.},
year = {2014},
journal = {Theor. Comput. Sci.},
author = {{Yann Disser} and {Subir Kumar Ghosh} and {Matús Mihalák} and {Peter Widmayer}}
}
@inproceedings{conf/icalp/DisserKL15,
title = {Scheduling Bidirectional Traffic on a Path.},
year = {2015},
booktitle = {ICALP (1)},
author = {{Yann Disser} and {Max Klimm} and {Elisabeth Lübbecke}},
publisher = {Springer},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I}
}
@article{journals/iandc/DereniowskiDKPU15,
title = {Fast collaborative graph exploration.},
year = {2015},
journal = {Inf. Comput.},
author = {{Dariusz Dereniowski} and {Yann Disser} and {Adrian Kosowski} and {Dominik Pajak} and {Przemyslaw Uznanski}}
}
@article{journals/talg/Chalopin0DMW15,
title = {Mapping Simple Polygons: The Power of Telling Convex from Reflex.},
year = {2015},
journal = {ACM Trans. Algorithms},
author = {{Jérémie Chalopin} and {Shantanu Das 001} and {Yann Disser} and {Matús Mihalák} and {Peter Widmayer}}
}
@article{journals/tcs/DisserFKM15,
title = {Improving the Hk-bound on the price of stability in undirected Shapley network design games.},
year = {2015},
journal = {Theor. Comput. Sci.},
author = {{Yann Disser} and {Andreas Emil Feldmann} and {Max Klimm} and {Matús Mihalák}}
}
@inproceedings{conf/latin/BohmovaDMS16,
title = {Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.},
year = {2016},
booktitle = {LATIN},
author = {{Katerina Böhmová} and {Yann Disser} and {Matús Mihalák} and {Rastislav Srámek}},
publisher = {Springer},
booktitle = {LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings}
}
@inproceedings{conf/soda/DisserHK16,
title = {Undirected Graph Exploration with ⊝(log log n) Pebbles.},
year = {2016},
booktitle = {SODA},
author = {{Yann Disser} and {Jan Hackfeld} and {Max Klimm}},
publisher = {SIAM},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016}
}
@article{journals/jco/DisserM16,
title = {Degree-constrained orientations of embedded graphs.},
year = {2016},
journal = {J. Comb. Optim.},
author = {{Yann Disser} and {Jannik Matuschke}}
}
@inproceedings{conf/icalp/BernsteinDG17,
title = {General Bounds for Incremental Maximization.},
year = {2017},
booktitle = {ICALP},
author = {{Aaron Bernstein} and {Yann Disser} and {Martin Groß 001}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland}
}
@inproceedings{conf/stacs/BartschiC0D0HP17,
title = {Energy-Efficient Delivery by Heterogeneous Mobile Agents.},
year = {2017},
booktitle = {STACS},
author = {{Andreas Bärtschi} and {Jérémie Chalopin} and {Shantanu Das 001} and {Yann Disser} and {Daniel Graf 001} and {Jan Hackfeld} and {Paolo Penna}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany}
}
@inproceedings{conf/stacs/DisserK17,
title = {Robust and Adaptive Search.},
year = {2017},
booktitle = {STACS},
author = {{Yann Disser} and {Stefan Kratsch}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany}
}
@article{journals/corr/DaubelDKMS17,
title = {Distance-preserving graph contractions.},
year = {2017},
journal = {CoRR},
author = {{Karl Däubel} and {Yann Disser} and {Max Klimm} and {Torsten Mütze} and {Frieder Smolny}}
}
@article{journals/siamdm/DisserKMS17,
title = {Packing a Knapsack of Unknown Capacity.},
year = {2017},
journal = {SIAM J. Discret. Math.},
author = {{Yann Disser} and {Max Klimm} and {Nicole Megow} and {Sebastian Stiller}}
}
@inproceedings{conf/ipco/DisserH19,
title = {On Friedmann's Subexponential Lower Bound for Zadeh's Pivot Rule.},
year = {2019},
booktitle = {IPCO},
author = {{Yann Disser} and {Alexander V. Hopp}},
publisher = {Springer},
booktitle = {Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings}
}
@inproceedings{conf/sirocco/DisserS19,
title = {Evacuating Two Robots from a Disk: A Second Cut.},
year = {2019},
booktitle = {SIROCCO},
author = {{Yann Disser} and {Sören Schmitt}},
publisher = {Springer},
booktitle = {Structural Information and Communication Complexity - 26th International Colloquium, SIROCCO 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings}
}
@article{journals/algorithmica/DisserKS19,
title = {The Minimum Feasible Tileset Problem.},
year = {2019},
journal = {Algorithmica},
author = {{Yann Disser} and {Stefan Kratsch} and {Manuel Sorge}}
}
@article{journals/jacm/DisserHK19,
title = {Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents.},
year = {2019},
journal = {J. ACM},
author = {{Yann Disser} and {Jan Hackfeld} and {Max Klimm}}
}
@article{journals/jap/KhudaBukhshADK19,
title = {Approximate lumpability for Markovian agent-based models using local symmetries.},
year = {2019},
journal = {J. Appl. Probab.},
author = {{Wasiur R. KhudaBukhsh} and {Arnab Auddy} and {Yann Disser} and {Heinz Koeppl}}
}
@article{journals/siamdm/BernsteinDDKMS19,
title = {Distance-Preserving Graph Contractions.},
year = {2019},
journal = {SIAM J. Discret. Math.},
author = {{Aaron Bernstein} and {Karl Däubel} and {Yann Disser} and {Max Klimm} and {Torsten Mütze} and {Frieder Smolny}}
}
@article{journals/talg/DisserS19,
title = {The Simplex Algorithm Is NP-Mighty.},
year = {2019},
journal = {ACM Trans. Algorithms},
author = {{Yann Disser} and {Martin Skutella}}
}
@article{journals/tcs/AbedCDGMMRR19,
title = {Scheduling maintenance jobs in networks.},
year = {2019},
journal = {Theor. Comput. Sci.},
author = {{Fidaa Abed} and {Lin Chen 009} and {Yann Disser} and {Martin Groß 001} and {Nicole Megow} and {Julie Meißner} and {Alexander T. Richter} and {Roman Rischke}}
}
@inproceedings{conf/swat/BosekDFPZ20,
title = {Recoloring Interval Graphs with Limited Recourse Budget.},
year = {2020},
booktitle = {SWAT},
author = {{Bartlomiej Bosek} and {Yann Disser} and {Andreas Emil Feldmann} and {Jakub Pawlewicz} and {Anna Zych-Pawlewicz}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands.}
}
@article{journals/corr/abs-2002-10958,
title = {Improved Lower Bound for Competitive Graph Exploration.},
year = {2020},
journal = {CoRR},
author = {{Alexander Birx} and {Yann Disser} and {Alexander V. Hopp} and {Christina Karousatou}}
}
@article{journals/corr/abs-2006-00571,
title = {On Dynamic Parameterized k-Path.},
year = {2020},
journal = {CoRR},
author = {{Jiehua Chen 001} and {Wojciech Czerwinski} and {Yann Disser} and {Andreas Emil Feldmann} and {Danny Hermelin} and {Wojciech Nadara} and {Michal Pilipczuk} and {Marcin Pilipczuk} and {Manuel Sorge} and {Bartlomiej Wróblewski 002} and {Anna Zych-Pawlewicz}}
}
@article{journals/mor/DisserFGGKSST20,
title = {Hiring Secretaries over Time: The Benefit of Concurrent Employment.},
year = {2020},
journal = {Math. Oper. Res.},
author = {{Yann Disser} and {John Fearnley} and {Martin Gairing} and {Oliver Göbel 002} and {Max Klimm} and {Daniel Schmand} and {Alexander Skopalik} and {Andreas Tönnis}}
}
@article{journals/orl/DisserM20,
title = {The complexity of computing a robust flow.},
year = {2020},
journal = {Oper. Res. Lett.},
author = {{Yann Disser} and {Jannik Matuschke}}
}
@article{journals/siamdm/BirxD20,
title = {Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.},
year = {2020},
journal = {SIAM J. Discret. Math.},
author = {{Alexander Birx} and {Yann Disser}}
}
@article{journals/tcs/BartschiCDDGGLM20,
title = {Collaborative delivery with energy-constrained mobile robots.},
year = {2020},
journal = {Theor. Comput. Sci.},
author = {{Andreas Bärtschi} and {Jérémie Chalopin} and {Shantanu Das 001} and {Yann Disser} and {Barbara Geissmann} and {Daniel Graf 001} and {Arnaud Labourel} and {Matús Mihalák}}
}
@article{journals/tcs/DisserMNSS20,
title = {A general lower bound for collaborative tree exploration.},
year = {2020},
journal = {Theor. Comput. Sci.},
author = {{Yann Disser} and {Frank Mousset} and {Andreas Noever} and {Nemanja Skoric} and {Angelika Steger}}
}
@inproceedings{conf/soda/ChenCDFHNPPSWZ21,
title = {Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.},
year = {2021},
booktitle = {SODA},
author = {{Jiehua Chen 001} and {Wojciech Czerwinski} and {Yann Disser} and {Andreas Emil Feldmann} and {Danny Hermelin} and {Wojciech Nadara} and {Marcin Pilipczuk} and {Michal Pilipczuk} and {Manuel Sorge} and {Bartlomiej Wróblewski 002} and {Anna Zych-Pawlewicz}},
publisher = {SIAM},
booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021}
}
@inproceedings{conf/waoa/DisserKW21,
title = {Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.},
year = {2021},
booktitle = {WAOA},
author = {{Yann Disser} and {Max Klimm} and {David Weckbecker}},
publisher = {Springer},
booktitle = {Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers}
}
@article{journals/algorithmica/DisserFKK21,
title = {Travelling on Graphs with Small Highway Dimension.},
year = {2021},
journal = {Algorithmica},
author = {{Yann Disser} and {Andreas Emil Feldmann} and {Max Klimm} and {Jochen Könemann}}
}
@article{journals/talg/BjeldeHDHLMSSS21,
title = {Tight Bounds for Online TSP on the Line.},
year = {2021},
journal = {ACM Trans. Algorithms},
author = {{Antje Bjelde} and {Jan Hackfeld} and {Yann Disser} and {Christoph Hansknecht} and {Maarten Lipmann} and {Julie Meißner} and {Miriam Schlöter} and {Kevin Schewior} and {Leen Stougie}}
}
@article{journals/tcs/BirxDHK21,
title = {An improved lower bound for competitive graph exploration.},
year = {2021},
journal = {Theor. Comput. Sci.},
author = {{Alexander Birx} and {Yann Disser} and {Alexander V. Hopp} and {Christina Karousatou}}
}
@article{journals/tcs/ChalopinDDLM21,
title = {Collaborative delivery on a fixed path with homogeneous energy-constrained agents.},
year = {2021},
journal = {Theor. Comput. Sci.},
author = {{Jérémie Chalopin} and {Shantanu Das 001} and {Yann Disser} and {Arnaud Labourel} and {Matús Mihalák}}
}
@incollection{books/sp/22/DisserK22,
title = {The Space Complexity of Undirected Graph Exploration.},
year = {2022},
booktitle = {Algorithms for Big Data},
author = {{Yann Disser} and {Max Klimm}},
publisher = {Springer},
booktitle = {Algorithms for Big Data - DFG Priority Program 1736}
}
@inproceedings{conf/iwpec/0001DF0Z22,
title = {On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension.},
year = {2022},
booktitle = {IPEC},
author = {{Johannes Blum 001} and {Yann Disser} and {Andreas Emil Feldmann} and {Siddharth Gupta 002} and {Anna Zych-Pawlewicz}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany.}
}
@inproceedings{conf/waoa/BaligacsDMW22,
title = {An Improved Algorithm for Open Online Dial-a-Ride.},
year = {2022},
booktitle = {WAOA},
author = {{Júlia Baligács} and {Yann Disser} and {Nils Mosis} and {David Weckbecker}},
publisher = {Springer},
booktitle = {Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings}
}
@article{journals/corr/abs-2210-13850,
title = {Tight analysis of lazy: an improved algorithm for open online dial-a-ride.},
year = {2022},
journal = {CoRR},
author = {{Júlia Baligács} and {Yann Disser} and {David Weckbecker}}
}
@article{journals/iacr/DisserGSSWY22,
title = {Improved Universal Circuits using Lookup Tables.},
year = {2022},
journal = {IACR Cryptol. ePrint Arch.},
author = {{Yann Disser} and {Daniel Günther 004} and {Thomas Schneider 003} and {Maximilian Stillger} and {Arthur Wigandt} and {Hossein Yalame}}
}
@article{journals/mp/BernsteinD0H22,
title = {General bounds for incremental maximization.},
year = {2022},
journal = {Math. Program.},
author = {{Aaron Bernstein} and {Yann Disser} and {Martin Groß 001} and {Sandra Himburg}}
}
@inproceedings{conf/asiacrypt/DisserGSSWY23,
title = {Breaking the Size Barrier: Universal Circuits Meet Lookup Tables.},
year = {2023},
booktitle = {ASIACRYPT (1)},
author = {{Yann Disser} and {Daniel Günther 004} and {Thomas Schneider 003} and {Maximilian Stillger} and {Arthur Wigandt} and {Hossein Yalame}},
publisher = {Springer},
booktitle = {Advances in Cryptology - ASIACRYPT 2023 - 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4-8, 2023, Proceedings, Part I}
}
@inproceedings{conf/esa/BaligacsDHS23,
title = {Exploration of Graphs with Excluded Minors.},
year = {2023},
booktitle = {ESA},
author = {{Júlia Baligács} and {Yann Disser} and {Irene Heinrich} and {Pascal Schweitzer}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands}
}
@inproceedings{conf/icalp/DisserKSW23,
title = {Incremental Maximization via Continuization.},
year = {2023},
booktitle = {ICALP},
author = {{Yann Disser} and {Max Klimm} and {Kevin Schewior} and {David Weckbecker}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany}
}
@inproceedings{conf/isaac/DisserM23,
title = {A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules.},
year = {2023},
booktitle = {ISAAC},
author = {{Yann Disser} and {Nils Mosis}},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
booktitle = {34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan}
}
@inproceedings{conf/wads/BaligacsDSW23,
title = {Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride.},
year = {2023},
booktitle = {WADS},
author = {{Júlia Baligács} and {Yann Disser} and {Farehe Soheil} and {David Weckbecker}},
publisher = {Springer},
booktitle = {Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings}
}
@article{journals/anor/EmdeZD23,
title = {Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition.},
year = {2023},
month = {March},
journal = {Ann. Oper. Res.},
author = {{Simon Emde} and {Shohre Zehtabian} and {Yann Disser}}
}
@article{journals/algorithmica/BirxDS23,
title = {Improved Bounds for Open Online Dial-a-Ride on the Line.},
year = {2023},
month = {May},
journal = {Algorithmica},
author = {{Alexander Birx} and {Yann Disser} and {Kevin Schewior}}
}
@article{journals/mp/DisserFH23,
title = {An exponential lower bound for Zadeh's pivot rule.},
year = {2023},
month = {May},
journal = {Math. Program.},
author = {{Yann Disser} and {Oliver Friedmann} and {Alexander V. Hopp}}
}
@article{journals/corr/abs-2402-13938,
title = {A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP.},
year = {2024},
journal = {CoRR},
author = {{Júlia Baligács} and {Yann Disser} and {Andreas Emil Feldmann} and {Anna Zych-Pawlewicz}}
}
@article{journals/siamdm/DisserKLW24,
title = {Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows.},
year = {2024},
month = {March},
journal = {SIAM J. Discret. Math.},
author = {{Yann Disser} and {Max Klimm} and {Annette Lutz} and {David Weckbecker}}
}
@article{journals/siamdm/DisserW24,
title = {Unified Greedy Approximability beyond Submodular Maximization.},
year = {2024},
month = {March},
journal = {SIAM J. Discret. Math.},
author = {{Yann Disser} and {David Weckbecker}}
}