![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Matthias Mnich
TU Hamburg, Institute for Algorithms and Complexity, Germany
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 141 matches
- 2024
- Parinya Chalermsook
, Matthias Kaul
, Matthias Mnich
, Joachim Spoerhase
, Sumedha Uniyal
, Daniel Vaz
:
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20(1): 6:1-6:20 (2024) - Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. ICALP 2024: 83:1-83:17 - Sebastian Berndt
, Matthias Mnich
, Tobias Stamm
:
New Support Size Bounds and Proximity Bounds for Integer Linear Programming. SOFSEM 2024: 82-95 - Susanne Armbruster, Matthias Mnich, Martin Nägele:
A (3/2+1/e)-Approximation Algorithm for Ordered TSP. CoRR abs/2405.06244 (2024) - 2023
- Dusan Knop, Martin Koutecký
, Asaf Levin, Matthias Mnich, Shmuel Onn:
High-multiplicity N-fold IP via configuration LP. Math. Program. 200(1): 199-227 (2023) - Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA 2023: 18:1-18:18 - Max Deppert, Matthias Kaul
, Matthias Mnich:
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. ESA 2023: 39:1-39:15 - Ariel Kulik, Matthias Mnich, Hadas Shachnai:
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS 2023: 1366-1376 - Christian Dietrich
, Tim-Marek Thomas
, Matthias Mnich
:
Checkpoint Placement for Systematic Fault-Injection Campaigns. ICCAD 2023: 1-9 - Sebastian Berndt, Hauke Brinkop
, Klaus Jansen, Matthias Mnich, Tobias Stamm:
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. ISAAC 2023: 13:1-13:18 - Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm:
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. CoRR abs/2305.08432 (2023) - Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR abs/2307.01285 (2023) - Max Deppert, Matthias Kaul, Matthias Mnich:
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. CoRR abs/2307.07180 (2023) - Christian Dietrich, Tim-Marek Thomas, Matthias Mnich:
Checkpoint Placement for Systematic Fault-Injection Campaigns. CoRR abs/2308.05521 (2023) - Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. CoRR abs/2308.12593 (2023) - 2022
- Alexander Göke, Dániel Marx, Matthias Mnich
:
Parameterized algorithms for generalizations of Directed Feedback Vertex Set. Discret. Optim. 46: 100740 (2022) - Kristóf Bérczi, Matthias Mnich
, Roland Vincze
:
A 3/2-Approximation for the Metric Many-Visits Path TSP. SIAM J. Discret. Math. 36(4): 2995-3030 (2022) - Alexander Göke, Jochen Könemann, Matthias Mnich
, Hao Sun
:
Hitting Weighted Even Cycles in Planar Graphs. SIAM J. Discret. Math. 36(4): 2830-2862 (2022) - Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. Algorithms for Big Data 2022: 97-133 - Kristóf Bérczi, Matthias Mnich, Roland Vincze:
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems. CoRR abs/2201.02054 (2022) - David Fischer, Julian Golak, Matthias Mnich:
Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling. CoRR abs/2203.03600 (2022) - Ariel Kulik, Matthias Mnich, Hadas Shachnai:
An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR abs/2205.12828 (2022) - Gregory Z. Gutin, Matthias Mnich:
A Survey on Graph Problems Parameterized Above and Below Guaranteed Values. CoRR abs/2207.12278 (2022) - Kristóf Bérczi, Alexander Göke, Lydia Mirabel Mendoza Cadena
, Matthias Mnich:
Resolving Infeasibility of Linear Systems: A Parameterized Approach. CoRR abs/2209.02017 (2022) - 2021
- John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. Log. Methods Comput. Sci. 17(2) (2021) - Dusan Knop
, Martin Koutecký
, Asaf Levin
, Matthias Mnich, Shmuel Onn
:
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49(6): 908-913 (2021) - Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. APPROX-RANDOM 2021: 25:1-25:23 - Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. CoRR abs/2107.04763 (2021) - Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR abs/2111.06299 (2021) - 2020
- Matthias Mnich
, Ildikó Schlotter
:
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Algorithmica 82(5): 1136-1188 (2020)
skipping 111 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 06:06 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint