Articles with public access mandates - Tobias MömkeLearn more
Not available anywhere: 1
The complexity of paging against a probabilistic adversary
S Dobrev, J Hromkovič, D Komm, R Královič, R Královič, T Mömke
International Conference on Current Trends in Theory and Practice of …, 2016
Mandates: Swiss National Science Foundation, German Research Foundation
Available somewhere: 36
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
Mandates: US National Institutes of Health
Removing and adding edges for the traveling salesman problem
T Mömke, O Svensson
Journal of the ACM (JACM) 63 (1), 1-28, 2016
Mandates: German Research Foundation, European Commission
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
Mandates: Swiss National Science Foundation
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
Mandates: German Research Foundation
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
Mandates: Swiss National Science Foundation
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
Mandates: German Research Foundation, European Commission
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
Mandates: Swiss National Science Foundation, German Research Foundation, European …
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
Mandates: Swiss National Science Foundation
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
Mandates: Swiss National Science Foundation
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
Mandates: Swiss National Science Foundation, German Research Foundation, European …
Managing fleets of LEO satellites: Nonlinear, optimal, efficient, scalable, usable, and robust
G Stock, JA Fraire, T Mömke, H Hermanns, F Babayev, E Cruz
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2020
Mandates: German Research Foundation
A PTAS for unsplittable flow on a path
F Grandoni, T Mömke, A Wiese
Proceedings of the 54th annual ACM SIGACT symposium on theory of computing …, 2022
Mandates: Swiss National Science Foundation, German Research Foundation
Maximum scatter TSP in doubling metrics
L Kozma, T Mömke
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
Mandates: German Research Foundation
Unsplittable flow on a path: The game!
F Grandoni, T Mömke, A Wiese
Proceedings of the 2022 annual ACM-SIAM symposium on discrete algorithms …, 2022
Mandates: Swiss National Science Foundation, German Research Foundation
Robust reoptimization of Steiner trees
K Goyal, T Mömke
Mandates: German Research Foundation
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
M Mnich, T Mömke
European journal of operational research 266 (2), 436-457, 2018
Mandates: German Research Foundation, European Commission
Improved analysis of the online set cover problem with advice
S Dobrev, J Edmonds, D Komm, R Královič, R Královič, S Krug, T Mömke
Theoretical Computer Science 689, 96-107, 2017
Mandates: Swiss National Science Foundation, German Research Foundation
Randomized online algorithms with high probability guarantees
D Komm, R Královič, R Královič, T Mömke
Mandates: Swiss National Science Foundation, German Research Foundation
Semidefinite and linear programming integrality gaps for scheduling identical machines
A Kurpisz, M Mastrolilli, C Mathieu, T Mömke, V Verdugo, A Wiese
Mathematical Programming 172, 231-248, 2018
Mandates: Swiss National Science Foundation, German Research Foundation
Publication and funding information is determined automatically by a computer program