default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTobias Mömke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Mariia Anapolska
, Tabea Brandt, Christina Büsing, Tobias Mömke:
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms. Discret. Appl. Math. 358: 230-253 (2024)- [j18]Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo:
A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time. Math. Program. 206(1): 479-495 (2024) - [i14]Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze:
Approximating Maximum Edge 2-Coloring by Normalizing Graphs. CoRR abs/2403.06691 (2024) - [i13]Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase:
Approximating TSP Variants Using a Bridge Lemma. CoRR abs/2405.12876 (2024) - 2023
- [c37]Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner:
Online Knapsack with Removal and Recourse. IWOCA 2023: 123-135 - [c36]Tobias Mömke, Hang Zhou:
Capacitated Vehicle Routing in Graphic Metrics. SOSA 2023: 114-123 - [c35]Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze:
Approximating Maximum Edge 2-Coloring by Normalizing Graphs. WAOA 2023: 29-44 - 2022
- [j17]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized Online Computation with High Probability Guarantees. Algorithmica 84(5): 1357-1384 (2022) - [c34]Mariia Anapolska, Christina Büsing, Tabea Krabs, Tobias Mömke:
Coworking Scheduling with Network Flows. INOC 2022: 1-6 - [c33]Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo:
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. IPCO 2022: 112-125 - [c32]Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese:
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. SODA 2022: 894-905 - [c31]Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
Unsplittable Flow on a Path: The Game!. SODA 2022: 906-926 - [c30]Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
A PTAS for unsplittable flow on a path. STOC 2022: 289-302 - [i12]Tobias Mömke, Hang Zhou:
Capacitated Vehicle Routing in Graphic Metrics. CoRR abs/2210.09806 (2022) - 2021
- [c29]Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA 2021: 49:1-49:15 - [i11]Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese:
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. CoRR abs/2106.00623 (2021) - [i10]Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo:
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. CoRR abs/2111.06163 (2021) - 2020
- [j16]Keshav Goyal, Tobias Mömke:
Robust Reoptimization of Steiner Trees. Algorithmica 82(7): 1966-1988 (2020) - [j15]Gregory Stock, Juan A. Fraire, Tobias Mömke, Holger Hermanns, Fakhri Babayev, Eduardo Cruz:
Managing Fleets of LEO Satellites: Nonlinear, Optimal, Efficient, Scalable, Usable, and Robust. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(11): 3762-3773 (2020) - [c28]Tobias Mömke, Andreas Wiese:
Breaking the Barrier of 2 for the Storage Allocation Problem. ICALP 2020: 86:1-86:19
2010 – 2019
- 2019
- [i9]Tobias Mömke, Andreas Wiese:
Breaking the Barrier of 2 for the Storage Allocation Problem. CoRR abs/1911.10871 (2019) - 2018
- [j14]Matthias Mnich, Tobias Mömke:
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two. Eur. J. Oper. Res. 266(2): 436-457 (2018) - [j13]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172(1-2): 231-248 (2018) - [c27]Ralf Klasing, Tobias Mömke:
A Modern View on Stability of Approximation. Adventures Between Lower Bounds and Higher Altitudes 2018: 393-408 - [c26]Shilpa Garg, Tobias Mömke:
A QPTAS for Gapless MEC. ESA 2018: 34:1-34:14 - [c25]Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mömke:
Approximating Airports and Railways. STACS 2018: 5:1-5:13 - [c24]Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou:
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. STOC 2018: 607-619 - [i8]Shilpa Garg, Tobias Mömke:
A QPTAS for Gapless MEC. CoRR abs/1804.10930 (2018) - 2017
- [j12]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79(1): 230-250 (2017) - [j11]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Online algorithms with advice: The tape model. Inf. Comput. 254: 59-83 (2017) - [j10]Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke:
Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. 689: 96-107 (2017) - [c23]László Kozma, Tobias Mömke:
Maximum Scatter TSP in Doubling Metrics. SODA 2017: 143-153 - [c22]Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou:
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. SODA 2017: 2411-2422 - 2016
- [j9]Tobias Mömke, Ola Svensson:
Removing and Adding Edges for the Traveling Salesman Problem. J. ACM 63(1): 2:1-2:28 (2016) - [c21]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO 2016: 152-163 - [c20]Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke:
The Complexity of Paging Against a Probabilistic Adversary. SOFSEM 2016: 265-276 - [c19]Anna Adamaszek, Antonios Antoniadis, Tobias Mömke:
Airports and Railways: Facility Location Meets Network Design. STACS 2016: 6:1-6:14 - 2015
- [j8]Tobias Mömke:
An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality. Inf. Process. Lett. 115(11): 866-871 (2015) - [c18]Keshav Goyal, Tobias Mömke:
Robust Reoptimization of Steiner Trees. FSTTCS 2015: 10-24 - [c17]Tobias Mömke, Andreas Wiese:
A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem. ICALP (1) 2015: 973-984 - [c16]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. IPEC 2015: 294-306 - [c15]Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese:
New Approximation Schemes for Unsplittable Flow on a Path. SODA 2015: 47-58 - [i7]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. CoRR abs/1511.05546 (2015) - [i6]László Kozma, Tobias Mömke:
A PTAS for Euclidean Maximum Scatter TSP. CoRR abs/1512.02963 (2015) - 2014
- [c14]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized Online Algorithms with High Probability Guarantees. STACS 2014: 470-481 - [i5]Tobias Mömke:
An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality. CoRR abs/1412.6755 (2014) - 2013
- [j7]Hans-Joachim Böckenhauer, Tobias Mömke, Monika Steinová:
Improved approximations for TSP with simple precedence constraints. J. Discrete Algorithms 21: 32-40 (2013) - [i4]Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized online computation with high probability guarantees. CoRR abs/1302.2805 (2013) - [i3]Tobias Mömke:
A Competitive Ratio Approximation Scheme for the k-Server Problem in Fixed Finite Metrics. CoRR abs/1303.2963 (2013) - [i2]Matthias Mnich, Tobias Mömke:
Improved integrality gap upper bounds for TSP with distances one and two. CoRR abs/1312.2502 (2013) - 2012
- [j6]Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
Size complexity of rotating and sweeping automata. J. Comput. Syst. Sci. 78(2): 537-558 (2012) - [j5]Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen:
Steiner tree reoptimization in graphs with sharpened triangle inequality. J. Discrete Algorithms 11: 73-86 (2012) - [c13]Dennis Komm, Richard Královic, Tobias Mömke:
On the Advice Complexity of the Set Cover Problem. CSR 2012: 241-252 - 2011
- [j4]Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych:
Reoptimization of the Shortest Common Superstring Problem. Algorithmica 61(2): 227-251 (2011) - [c12]Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke:
Improved Approximations for Hard Optimization Problems via Problem Instance Classification. Rainbow of Computer Science 2011: 3-19 - [c11]Tobias Mömke, Ola Svensson:
Approximating Graphic TSP by Matchings. FOCS 2011: 560-569 - [c10]Tobias Mömke:
Structural Properties of Hard Metric TSP Inputs - (Extended Abstract). SOFSEM 2011: 394-405 - [i1]Tobias Mömke, Ola Svensson:
Approximating Graphic TSP by Matchings. CoRR abs/1104.3090 (2011) - 2010
- [c9]Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová:
Improved Approximations for TSP with Simple Precedence Constraints. CIAC 2010: 61-72 - [c8]Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen:
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. CIAC 2010: 180-191
2000 – 2009
- 2009
- [b1]Tobias Mömke:
Algorithmic Approaches for Solving Hard Problems: Approximation and Complexity. ETH Zurich, Zürich, Switzerland, 2009 - [j3]Tobias Mömke:
On the power of randomization for job shop scheduling with k-units length tasks. RAIRO Theor. Informatics Appl. 43(2): 189-207 (2009) - [j2]Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith:
Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. 410(36): 3428-3435 (2009) - [c7]Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych:
Reoptimization of the Shortest Common Superstring Problem. CPM 2009: 78-91 - [c6]Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
On the Advice Complexity of Online Problems. ISAAC 2009: 331-340 - 2008
- [c5]Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
On the Size Complexity of Rotating and Sweeping Automata. Developments in Language Theory 2008: 455-466 - [c4]Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer:
On the Hardness of Reoptimization. SOFSEM 2008: 50-65 - [c3]Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych:
Reoptimization of Steiner Trees. SWAT 2008: 258-269 - 2007
- [j1]Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer:
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Oper. Res. 2(1) (2007) - [c2]Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel:
Efficient Algorithms for the Spoonerism Problem. FUN 2007: 78-92 - [c1]Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA 2007: 130-141
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
