Follow
Tobias Mömke
Tobias Mömke
Professor, Computer Science, University of Augsburg
Verified email at informatik.uni-augsburg.de - Homepage
Title
Cited by
Cited by
Year
Online algorithms with advice: The tape model
HJ Böckenhauer, D Komm, R Královič, R Královič, T Mömke
Information and Computation 254, 59-83, 2017
181*2017
Removing and adding edges for the traveling salesman problem
T Mömke, O Svensson
Journal of the ACM (JACM) 63 (1), 1-28, 2016
177*2016
Chromosome-scale, haplotype-resolved assembly of human genomes
S Garg, AA Fungtammasan, A Carroll, M Chou, A Schmitt, X Zhou, S Mac, ...
Nature Biotechnology, 2020
155*2020
On the hardness of reoptimization
HJ Böckenhauer, J Hromkovič, T Mömke, P Widmayer
SOFSEM 2008: Theory and Practice of Computer Science: 34th Conference on …, 2008
1052008
Reoptimization of Steiner trees
D Bilò, HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Widmayer, ...
Algorithm Theory–SWAT 2008: 11th Scandinavian Workshop on Algorithm Theory …, 2008
592008
Reoptimization of Steiner trees: Changing the terminal set
HJ Böckenhauer, J Hromkovič, R Královič, T Mömke, P Rossmanith
Theoretical computer science 410 (36), 3428-3435, 2009
512009
Reoptimization of the shortest common superstring problem
D Bilò, HJ Böckenhauer, D Komm, R Královič, T Mömke, S Seibert, A Zych
Algorithmica 61, 227-251, 2011
492011
Size complexity of rotating and sweeping automata
C Kapoutsis, R Královič, T Mömke
Journal of Computer and System Sciences 78 (2), 537-558, 2012
48*2012
New approximation schemes for unsplittable flow on a path
J Batra, N Garg, A Kumar, T Mömke, A Wiese
Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete …, 2014
462014
On the advice complexity of the set cover problem
D Komm, R Královič, T Mömke
International Computer Science Symposium in Russia, 241-252, 2012
382012
A (5/3+ ε)-approximation for unsplittable flow on a path: placing small tasks into boxes
F Grandoni, T Mömke, A Wiese, H Zhou
Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018
302018
Steiner tree reoptimization in graphs with sharpened triangle inequality
HJ Böckenhauer, K Freiermuth, J Hromkovič, T Mömke, A Sprock, ...
Journal of Discrete Algorithms 11, 73-86, 2012
27*2012
Improved approximations for TSP with simple precedence constraints
HJ Böckenhauer, R Klasing, T Mömke, M Steinová
International Conference on Algorithms and Complexity, 61-72, 2010
272010
A 3-approximation algorithm for maximum independent set of rectangles
W Gálvez, A Khan, M Mari, T Mömke, MR Pittu, A Wiese
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
252022
Job shop scheduling with unit length tasks: bounds and algorithms
J Hromkovič, T Mömke, K Steinhöfel, P Widmayer
Algorithmic Operations Research 2 (1), 1-14, 2007
25*2007
To augment or not to augment: Solving unsplittable flow on a path by creating slack
F Grandoni, T Mömke, A Wiese, H Zhou
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
232017
A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles
W Gálvez, A Khan, M Mari, T Mömke, M Reddy, A Wiese
arXiv preprint arXiv:2106.00623, 2021
172021
Breaking the barrier of 2 for the storage allocation problem
T Mömke, A Wiese
arXiv preprint arXiv:1911.10871, 2019
132019
Maximum scatter TSP in doubling metrics
L Kozma, T Mömke
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
13*2017
Robust reoptimization of Steiner trees
K Goyal, T Mömke
35th IARCS Annual Conference on Foundations of Software Technology and …, 2015
132015
The system can't perform the operation now. Try again later.
Articles 1–20