Tobias Mömke - RankMe

85 papers A* 10A 6B 10C 5Misc 2Journal 42Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Approximating Graphic Multi-Path TSP and Graphic Ordered TSP. SOSA Morteza Alimi, Niklas Dahlmeier, Tobias Mömke, Philipp Pabst, Laura Vargas Koch
2026	J	`jnl`	Online knapsack with removal and recourse. J. Comput. Syst. Sci. Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
2025	J	`jnl`	Approximating Graphic Multi-Path TSP and Graphic Ordered TSP. CoRR Morteza Alimi, Niklas Dahlmeier, Tobias Mömke, Philipp Pabst, Laura Vargas Koch
2025	J	`jnl`	Approximating Maximum Edge 2-Coloring by Normalizing Graphs. Discret. Math. Theor. Comput. Sci. Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze
2025	J	`jnl`	Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding. CoRR Zachary Friggstad, Tobias Mömke
2025	B	`conf`	Approximating Prize-Collecting Variants of TSP. MFCS Morteza Alimi, Tobias Mömke, Michael Ruderer
2025	A*	`conf`	Approximating Traveling Salesman Problems Using a Bridge Lemma. SODA Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase
2025	J	`jnl`	Hardness of SetCover Reoptimization. CoRR Klaus Jansen, Tobias Mömke, Björn Schumacher
2025	A	`conf`	Improved Approximation Algorithms for (1, 2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model. STACS Sharareh Alipour, Ermiya Farokhnejad, Tobias Mömke
2025	J	`jnl`	Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model. CoRR Sharareh Alipour, Ermiya Farokhnejad, Tobias Mömke
2025	—	`conf`	Polynomial-Time Algorithms for Path Cover on Trees and Graphs of Bounded Treewidth. CALDAM Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi
2025	J	`jnl`	Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth. CoRR Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi
2024	J	`jnl`	A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time. Math. Program. Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
2024	J	`jnl`	A Linear Time Gap-ETH-Tight Approximation Scheme for TSP in the Euclidean Plane. CoRR Tobias Mömke, Hang Zhou
2024	J	`jnl`	Approximating Maximum Edge 2-Coloring by Normalizing Graphs. CoRR Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze
2024	J	`jnl`	Approximating Prize-Collecting Variants of TSP. CoRR Morteza Alimi, Tobias Mömke, Michael Ruderer
2024	J	`jnl`	Approximating TSP Variants Using a Bridge Lemma. CoRR Martin Böhm, Zachary Friggstad, Tobias Mömke, Joachim Spoerhase
2024	J	`jnl`	Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms. Discret. Appl. Math. Mariia Anapolska, Tabea Brandt, Christina Büsing, Tobias Mömke
2023	B	`conf`	Approximating Maximum Edge 2-Coloring by Normalizing Graphs. WAOA Tobias Mömke, Alexandru Popa, Aida Roshany-Tabrizi, Michael Ruderer, Roland Vincze
2023	—	`conf`	Capacitated Vehicle Routing in Graphic Metrics. SOSA Tobias Mömke, Hang Zhou
2023	C	`conf`	Online Knapsack with Removal and Recourse. IWOCA Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner
2022	B	`conf`	A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. IPCO Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
2022	A*	`conf`	A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. SODA Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
2022	A*	`conf`	A PTAS for unsplittable flow on a path. STOC Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
2022	J	`jnl`	Capacitated Vehicle Routing in Graphic Metrics. CoRR Tobias Mömke, Hang Zhou
2022	C	`conf`	Coworking Scheduling with Network Flows. INOC Mariia Anapolska, Christina Büsing, Tabea Krabs, Tobias Mömke
2022	J	`jnl`	Randomized Online Computation with High Probability Guarantees. Algorithmica Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2022	A*	`conf`	Unsplittable Flow on a Path: The Game!. SODA Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
2021	J	`jnl`	A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. CoRR Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo
2021	J	`jnl`	A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. CoRR Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
2021	A	`conf`	Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
2020	A*	`conf`	Breaking the Barrier of 2 for the Storage Allocation Problem. ICALP Tobias Mömke, Andreas Wiese
2020	J	`jnl`	Managing Fleets of LEO Satellites: Nonlinear, Optimal, Efficient, Scalable, Usable, and Robust. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Gregory Stock, Juan A. Fraire, Tobias Mömke, Holger Hermanns, Fakhri Babayev, Eduardo Cruz
2020	J	`jnl`	Robust Reoptimization of Steiner Trees. Algorithmica Keshav Goyal, Tobias Mömke
2019	J	`jnl`	Breaking the Barrier of 2 for the Storage Allocation Problem. CoRR Tobias Mömke, Andreas Wiese
2018	A*	`conf`	A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. STOC Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
2018	—	`conf`	A Modern View on Stability of Approximation. Adventures Between Lower Bounds and Higher Altitudes Ralf Klasing, Tobias Mömke
2018	A	`conf`	A QPTAS for Gapless MEC. ESA Shilpa Garg, Tobias Mömke
2018	J	`jnl`	A QPTAS for Gapless MEC. CoRR Shilpa Garg, Tobias Mömke
2018	A	`conf`	Approximating Airports and Railways. STACS Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mömke
2018	J	`jnl`	Improved integrality gap upper bounds for traveling salesperson problems with distances one and two. Eur. J. Oper. Res. Matthias Mnich, Tobias Mömke
2018	J	`jnl`	Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
2017	J	`jnl`	Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2017	J	`jnl`	Improved analysis of the online set cover problem with advice. Theor. Comput. Sci. Stefan Dobrev, Jeff Edmonds, Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke
2017	A*	`conf`	Maximum Scatter TSP in Doubling Metrics. SODA László Kozma, Tobias Mömke
2017	J	`jnl`	Online algorithms with advice: The tape model. Inf. Comput. Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2017	A*	`conf`	To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. SODA Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
2016	A	`conf`	Airports and Railways: Facility Location Meets Network Design. STACS Anna Adamaszek, Antonios Antoniadis, Tobias Mömke
2016	J	`jnl`	Removing and Adding Edges for the Traveling Salesman Problem. J. ACM Tobias Mömke, Ola Svensson
2016	B	`conf`	Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
2016	B	`conf`	The Complexity of Paging Against a Probabilistic Adversary. SOFSEM Stefan Dobrev, Juraj Hromkovic, Dennis Komm, Richard Královic, Rastislav Královic, Tobias Mömke
2015	—	`conf`	A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem. ICALP (1) Tobias Mömke, Andreas Wiese
2015	J	`jnl`	A PTAS for Euclidean Maximum Scatter TSP. CoRR László Kozma, Tobias Mömke
2015	J	`jnl`	An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality. Inf. Process. Lett. Tobias Mömke
2015	B	`conf`	Complexity and Approximability of Parameterized MAX-CSPs. IPEC Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2015	J	`jnl`	Complexity and Approximability of Parameterized MAX-CSPs. CoRR Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
2015	A*	`conf`	New Approximation Schemes for Unsplittable Flow on a Path. SODA Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese
2015	—	`conf`	Robust Reoptimization of Steiner Trees. FSTTCS Keshav Goyal, Tobias Mömke
2014	J	`jnl`	An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality. CoRR Tobias Mömke
2014	A	`conf`	Randomized Online Algorithms with High Probability Guarantees. STACS Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2013	J	`jnl`	A Competitive Ratio Approximation Scheme for the k-Server Problem in Fixed Finite Metrics CoRR Tobias Mömke
2013	J	`jnl`	Improved approximations for TSP with simple precedence constraints. J. Discrete Algorithms Hans-Joachim Böckenhauer, Tobias Mömke, Monika Steinová
2013	J	`jnl`	Improved integrality gap upper bounds for TSP with distances one and two. CoRR Matthias Mnich, Tobias Mömke
2013	J	`jnl`	Randomized online computation with high probability guarantees CoRR Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2012	Misc	`conf`	On the Advice Complexity of the Set Cover Problem. CSR Dennis Komm, Richard Královic, Tobias Mömke
2012	J	`jnl`	Size complexity of rotating and sweeping automata. J. Comput. Syst. Sci. Christos A. Kapoutsis, Richard Královic, Tobias Mömke
2012	J	`jnl`	Steiner tree reoptimization in graphs with sharpened triangle inequality. J. Discrete Algorithms Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
2011	J	`jnl`	Approximating Graphic TSP by Matchings CoRR Tobias Mömke, Ola Svensson
2011	A*	`conf`	Approximating Graphic TSP by Matchings. FOCS Tobias Mömke, Ola Svensson
2011	—	`conf`	Improved Approximations for Hard Optimization Problems via Problem Instance Classification. Rainbow of Computer Science Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke
2011	J	`jnl`	Reoptimization of the Shortest Common Superstring Problem. Algorithmica Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
2011	B	`conf`	Structural Properties of Hard Metric TSP Inputs - (Extended Abstract). SOFSEM Tobias Mömke
2010	C	`conf`	Improved Approximations for TSP with Simple Precedence Constraints. CIAC Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová
2010	C	`conf`	The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. CIAC Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen
2009	—	`—`	Algorithmic Approaches for Solving Hard Problems: Approximation and Complexity. Tobias Mömke
2009	B	`conf`	On the Advice Complexity of Online Problems. ISAAC Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke
2009	J	`jnl`	On the power of randomization for job shop scheduling with k-units length tasks. RAIRO Theor. Informatics Appl. Tobias Mömke
2009	J	`jnl`	Reoptimization of Steiner trees: Changing the terminal set. Theor. Comput. Sci. Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith
2009	B	`conf`	Reoptimization of the Shortest Common Superstring Problem. CPM Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych
2008	B	`conf`	On the Hardness of Reoptimization. SOFSEM Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer
2008	C	`conf`	On the Size Complexity of Rotating and Sweeping Automata. Developments in Language Theory Christos A. Kapoutsis, Richard Královic, Tobias Mömke
2008	—	`conf`	Reoptimization of Steiner Trees. SWAT Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych
2007	—	`conf`	An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA Christos A. Kapoutsis, Richard Královic, Tobias Mömke
2007	Misc	`conf`	Efficient Algorithms for the Spoonerism Problem. FUN Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel
2007	J	`jnl`	Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Oper. Res. Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer