Yann Disser

Cited by

	All	Since 2020
Citations	1133	608
h-index	20	14
i10-index	35	22

160

120

200920102011201220132014201520162017201820192020202120222023202420258 12 18 17 45 55 39 54 75 78 107 96 92 110 123 142 42

Public access

View all

28 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Matúš MihalákAssistant Professor, Department of Data Science and Knowledge Engineering, Maastricht UniversityVerified email at maastrichtuniversity.nl
Max KlimmTU BerlinVerified email at tu-berlin.de
Shantanu DasAix-Marseille University, FranceVerified email at lif.univ-mrs.fr
Jérémie ChalopinLIS, CNRS & Aix-Marseille UniversitéVerified email at lis-lab.fr
Andreas Emil FeldmannUniversity of SheffieldVerified email at sheffield.ac.uk
Kevin SchewiorUniversity of Cologne; University of Southern Denmark (on leave)Verified email at sdu.dk
Davide BilòAssociate Professor in C.S., Dipartimento di Ingegneria e Scienze dell'Informazione e MatematicaVerified email at univaq.it
Adrian KosowskiCo-founder, CSO at PathwayVerified email at pathway.com
Dominik PająkWroclaw University of Science and TechnologyVerified email at pwr.edu.pl
Dariusz DereniowskiGdańsk University of TechnologyVerified email at eti.pg.edu.pl
Przemysław UznańskiPathwayVerified email at pathway.com
Manuel SorgeTU WienVerified email at ac.tuwien.ac.at
Alexander V. HoppAI Research Scientist, Merck KGaAVerified email at merckgroup.com
Daniel Wolleb-GrafApple Inc.Verified email at apple.com
Andreas BärtschiScientist, Los Alamos National LaboratoryVerified email at lanl.gov
Leen StougieSenior Researcher CWI, Prof. of Operations Research Vrije Universiteit, AmsterdamVerified email at cwi.nl
David WeckbeckerTU DarmstadtVerified email at mathematik.tu-darmstadt.de
Jannik MatuschkeKU LeuvenVerified email at kuleuven.be
Martin SkutellaEinstein Professor of Mathematics and Computer Science, TU BerlinVerified email at tu-berlin.de
Subhash SuriProfessor of Computer Science, University of California, Santa BarbaraVerified email at cs.ucsb.edu

Yann Disser

Professor for Combinatorial Optimization, Department of Mathematics, TU Darmstadt

Verified email at mathematik.tu-darmstadt.de - Homepage

Combinatorial Optimization Online Algorithms Graph Exploration Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Multi-criteria shortest paths in time-dependent train networks Y Disser, M Müller–Hannemann, M Schnee Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008	167	2008
Fast collaborative graph exploration D Dereniowski, Y Disser, A Kosowski, D Pająk, P Uznański Information and Computation 243, 37-49, 2015	99	2015
Tight bounds for online TSP on the line A Bjelde, J Hackfeld, Y Disser, C Hansknecht, M Lipmann, J Meißner, ... ACM Transactions on Algorithms (TALG) 17 (1), 1-58, 2020	62	2020
The simplex algorithm is NP-mighty Y Disser, M Skutella ACM Transactions on Algorithms (TALG) 15 (1), 1-19, 2018	55	2018
Tight bounds for undirected graph exploration with pebbles and multiple agents Y Disser, J Hackfeld, M Klimm Journal of the ACM (JACM) 66 (6), 1-41, 2019	54*	2019
Collaborative delivery with energy-constrained mobile robots A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ... Theoretical Computer Science 810, 2-14, 2020	33	2020
Energy-efficient delivery by heterogeneous mobile agents A Bärtschi, J Chalopin, S Das, Y Disser, D Graf, J Hackfeld, P Penna Proceedings of the 34th International Symposium on Theoretical Aspects of …, 2017	32	2017
Packing a knapsack of unknown capacity Y Disser, M Klimm, N Megow, S Stiller SIAM Journal on Discrete Mathematics 31 (3), 1477-1497, 2017	31	2017
A general lower bound for collaborative tree exploration Y Disser, F Mousset, A Noever, N Škorić, A Steger International Colloquium on Structural Information and Communication …, 2017	31	2017
A polygon is determined by its angles Y Disser, M Mihalák, P Widmayer Computational Geometry 44 (8), 418-426, 2011	31*	2011
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles J Chen, W Czerwiński, Y Disser, AE Feldmann, D Hermelin, W Nadara, ... arXiv preprint arXiv:2006.00571, 2020	26	2020
Local realism, detection efficiencies, and probability polytopes J Wilms, Y Disser, G Alber, IC Percival Physical Review A—Atomic, Molecular, and Optical Physics 78 (3), 032116, 2008	26	2008
Scheduling transfers of resources over time: Towards car-sharing with flexible drop-offs K Böhmová, Y Disser, M Mihalák, R Šrámek LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016	24	2016
Reconstructing visibility graphs with simple robots D Bilò, Y Disser, M Mihalák, S Suri, E Vicari, P Widmayer Theoretical Computer Science 444, 52-59, 2012	24	2012
Approximate lumpability for Markovian agent-based models using local symmetries WR KhudaBukhsh, A Auddy, Y Disser, H Koeppl Journal of Applied Probability 56 (3), 647-671, 2019	23	2019
An exponential lower bound for Zadeh’s pivot rule Y Disser, O Friedmann, AV Hopp Mathematical Programming 199 (1), 865-936, 2023	22	2023
Mapping simple polygons: How robots benefit from looking back J Chalopin, S Das, Y Disser, M Mihalák, P Widmayer Algorithmica 65, 43-59, 2013	22*	2013
The complexity of computing a robust flow Y Disser, J Matuschke Operations Research Letters 48 (1), 18-23, 2020	20	2020
Mapping simple polygons: The power of telling convex from reflex J Chalopin, S Das, Y Disser, M Mihalák, P Widmayer ACM Transactions on Algorithms (TALG) 11 (4), 1-16, 2015	20*	2015
Improving the Hk-bound on the price of stability in undirected shapley network design games Y Disser, AE Feldmann, M Klimm, M Mihalák Theoretical Computer Science 562, 557-564, 2015	20	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors