Disser, Yann ; Günther, Daniel ; Schneider, Thomas ; Stillger, Maximilian ; Wigandt, Arthur ; Yalame, Hossein (2023)
Breaking the Size Barrier: Universal Circuits meet Lookup Tables.
29th International Conference on the Theory and Application of Cryptology and Information Security. Guangzhou, Peoples Republic China (04.12.2023 - 08.12.2023)
doi: 10.1007/978-981-99-8721-4_1
Konferenzveröffentlichung, Bibliographie

Bernstein, Aaron ; Disser, Yann ; Groß, Martin ; Himburg, Sandra (2022)
General Bounds for Incremental Maximization.
In: Mathematical Programming, 191 (2)
doi: 10.1007/s10107-020-01576-0
Artikel, Bibliographie

Chalopin, Jeremie ; Das, Shantanu ; Disser, Yann ; Labourel, Arnaud ; Mihalák, Matus (2021)
Collaborative delivery on a fixed path with homogeneous energy-constrained agents.
In: Theoretical Computer Science, 868
doi: 10.1016/j.tcs.2021.04.004
Artikel, Bibliographie

Disser, Yann ; Feldmann, Andreas Emil ; Klimm, Max ; Könemann, Jochen (2021)
Travelling on Graphs with Small Highway Dimension.
In: Algorithmica, 83 (5)
doi: 10.1007/s00453-020-00785-5
Artikel, Bibliographie

Bjelde, Antje ; Hackfeld, Jan ; Disser, Yann ; Hansknecht, Christoph ; Lipmann, Maarten ; Meißner, Julie ; Schlöter, Miriam ; Schewior, Kevin ; Stougie, Leen (2021)
Tight bounds for online TSP on the line.
In: ACM Transactions on Algorithms, 17 (1)
doi: 10.1145/3422362
Artikel, Bibliographie

Chen, Jiehua ; Czerwinski, Wojciech ; Disser, Yann ; Feldmann, Andreas Emil ; Hermelin, Danny ; Nadara, Wojciech ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Sorge, Manuel ; Wroblewski, Bartlomiej ; Zych-Pawlewicz, Anna (2021)
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.
32nd Annual ACM-SIAM Symposium on Discrete Algorithms. virtual Conference (10.01.2021-13.01.2021)
doi: 10.1137/1.9781611976465.50
Konferenzveröffentlichung, Bibliographie

Disser, Yann ; Klimm, Max ; Weckbecker, David (2021)
Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.
19th Workshop on Approximation and Online Algorithms (WAOA 2021). Lisbon, Portugal (06.09.2021-10.09.2021)
doi: 10.1007/978-3-030-92702-8_13
Konferenzveröffentlichung, Bibliographie

Birx, Alexander ; Disser, Yann (2020)
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.
In: SIAM Journal on Discrete Mathematics, 34 (2)
doi: 10.1137/19M1268513
Artikel, Bibliographie

Bosek, Bartlomiej ; Disser, Yann ; Feldmann, Andreas Emil ; Pawlewicz, Jakub ; Zych-Pawlewicz, Anna (2020)
Recoloring Interval Graphs with Limited Recourse Budget.
17th Scandinavian Symposium and Workshops on Algorithm Theory. Torshavn, Faroe Islands (22.06.2020-24.06.2020)
doi: 10.4230/LIPIcs.SWAT.2020.17
Konferenzveröffentlichung, Bibliographie

Disser, Yann ; Mousset, Frank ; Noever, Andreas ; Škorić, Nemanja ; Steger, Angelika (2020)
A general lower bound for collaborative tree exploration.
In: Theoretical Computer Science, 811
doi: 10.1016/j.tcs.2018.03.006
Artikel, Bibliographie

Bärtschi, Andreas ; Chalopin, Jeremie ; Das, Shantanu ; Disser, Yann ; Geissmann, Barbara ; Graf, Daniel ; Labourel, Arnaud ; Mihalák, Matus (2020)
Collaborative Delivery with Energy-Constrained Mobile Robots.
In: Theoretical Computer Science, 810
doi: 10.1016/j.tcs.2017.04.018
Artikel, Bibliographie

Birx, Alexander ; Disser, Yann ; Hopp, Alexander V. ; Karousatou, Christina (2020)
Improved Lower Bound for Competitive Graph Exploration.
doi: 10.48550/arXiv.2002.10958
Report, Bibliographie

Disser, Yann ; Fearnley, John ; Gairing, Martin ; Göbel, Oliver ; Klimm, Max ; Schmand, Daniel ; Skopalik, Alexander ; Tönnis, Andreas (2020)
Hiring Secretaries over Time: The Benefit of Concurrent Employment.
In: Mathematics of Operations Research, 45 (1)
doi: 10.1287/moor.2019.0993
Artikel, Bibliographie

Disser, Yann ; Matuschke, Jannik (2020)
The Complexity of Computing a Robust Flow.
In: Operations Research Letters, 48 (1)
doi: 10.1016/j.orl.2019.10.012
Artikel, Bibliographie

Disser, Yann ; Hackfeld, Jan ; Klimm, Max (2019)
Tight bounds for undirected graph exploration with pebbles and multiple agents.
In: Journal of the ACM, 66 (6)
doi: 10.1145/3356883
Artikel, Bibliographie

KhudaBukhsh, Wasiur R. ; Auddy, Arnab ; Disser, Yann ; Koeppl, Heinz (2019)
Approximate Lumpability for Markovian Agent-based Models Using Local Symmetries.
In: Jounal of Applied Probability, 56 (3)
doi: 10.1017/jpr.2019.44
Artikel, Bibliographie

Birx, Alexander ; Disser, Yann ; Schewior, Kevin
Hrsg.: Achlioptas, Dimitris ; Végh‬, ‪László (2019)
Improved Bounds for Open Online Dial-a-Ride on the Line.
22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM 2019). Cambridge, USA (20.09.2019-22.09.2019)
doi: 10.4230/LIPIcs.APPROX-RANDOM.2019.21
Konferenzveröffentlichung, Bibliographie

Disser, Yann ; Feldmann, Andreas Emil ; Klimm, Max ; Koenemann, Jochen (2019)
Travelling on Graphs with Small Highway Dimension.
45th International Workshop on Graph-Theoretic Concepts in Computer Science. Vall de Nuria, Spain (19.06.2019-21.06.2019)
doi: 10.1007/978-3-030-30786-8_14
Konferenzveröffentlichung, Bibliographie

Chalopin, Jeremie ; Das, Shantanu ; Disser, Yann ; Labourel, Arnaud ; Mihalák, Matus (2019)
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots.
26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019). l'Aquila, Italy (01.07.2019-04.07.2019)
Konferenzveröffentlichung, Bibliographie

Disser, Yann ; Schmitt, Sören (2019)
Evacuating Two Robots from a Disk: A Second Cut.
26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019). l'Aquila, Italy (01.07.2019-04.07.2019)
doi: 10.1007/978-3-030-24922-9_14
Konferenzveröffentlichung, Bibliographie

Disser, Yann ; Kratsch, Stefan ; Sorge, Manuel (2019)
The Minimum Feasible Tileset Problem.
In: Algorithmica, 81 (3)
doi: 10.1007/s00453-018-0460-3
Artikel, Bibliographie

Birx, Alexander ; Disser, Yann
Hrsg.: Niedermeier, Rolf ; Paul, Christophe (2019)
Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line.
36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Berlin, Germany (13.03.2020-16.03.2020)
doi: 10.4230/LIPIcs.STACS.2019.15
Konferenzveröffentlichung, Bibliographie

Abed, Fidda ; Chen, Lin ; Disser, Yann ; Groß, Martin ; Megow, Nicole ; Meißner, Julie ; Richter, Alexander T. ; Rischke, Roman (2019)
Scheduling maintenance jobs in networks.
In: Theoretical Computer Science, 754
doi: 10.1016/j.tcs.2018.02.020
Artikel, Bibliographie

Disser, Yann ; Skutella, Martin (2019)
The Simplex Algorithm is NP-Mighty.
In: ACM Transactions on Algorithms, 15 (1)
doi: 10.1145/3280847
Artikel, Bibliographie

Bernstein, Aaron ; Däubel, Karl ; Disser, Yann ; Klimm, Max ; Mütze, Torsten ; Smolny, Frieder (2019)
Distance-Preserving Graph Contractions.
In: SIAM Journal on Discrete Mathematics, 33 (3)
doi: 10.1137/18M1169382
Artikel, Bibliographie

Bernstein, Aaron ; Däubel, Karl ; Disser, Yann ; Klimm, Max ; Mütze, Torsten ; Smolny, Frieder (2018)
Distance-preserving graph contractions : [erweitertes Abstract].
9th Innovations in Theoretical Computer Science conference (ITCS 2018). Cambridge, USA (11.01.2018-14.01.2018)
doi: 10.4230/LIPIcs.ITCS.2018.51
Konferenzveröffentlichung, Bibliographie

Disser, Yann ; Hopp, Alexander V. (2018)
On Friedmann's subexponential lower bound for Zadeh's pivot rule.
Report, Erstveröffentlichung

Disser, Yann ; Mousset, Frank ; Noever, Andreas ; Škorić, Nemanja ; Steger, Angelika (2017)
A general lower bound for collaborative tree exploration.
24th International Colloquium on Structural Information and Communication Complexity. Porquerolles, France (19.06.2017-22.06.2017)
doi: 10.1007/978-3-319-72050-0_8
Konferenzveröffentlichung, Bibliographie

Bernstein, Aaron ; Disser, Yann ; Groß, Martin (2017)
General Bounds for Incremental Maximization.
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Warsaw, Poland (10.07.2017-14.07.2017)
doi: 10.4230/LIPIcs.ICALP.2017.43
Konferenzveröffentlichung, Bibliographie

Bjelde, Antje ; Disser, Yann ; Hackfeld, Jan ; Hansknecht, Christoph ; Lipmann, Maarten ; Meißner, Julie ; Schewior, Kevin ; Schlöter, Miriam ; Stougie, Leen (2017)
Tight bounds for online TSP on the line.
28th Annual ACM-SIAM Symposium on Discrete Algorithms. Barcelona, Spain (16.01.2017-19.01.2017)
doi: 10.1137/1.9781611974782.63
Konferenzveröffentlichung, Bibliographie

Bärtschi, Andreas ; Chalopin, Jeremie ; Das, Shantanu ; Disser, Yann ; Geissmann, Barbara ; Graf, Daniel ; Labourel, Arnaud ; Mihalák, Matus (2016)
Collaborative Delivery with Energy-Constrained Mobile Robots.
23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016). Helsinki, Finnland (19.07.2016-21.07.2016)
doi: 10.1007/978-3-319-48314-6_17
Konferenzveröffentlichung, Bibliographie