91 Einträge gefunden

1. Recent advances in practical data reduction

   1. Abu-Khzam, Faisal N.
   2. Lamm, Sebastian
   3. Mnich, Matthias
   4. Noe, Alexander
   5. Schulz, Christian
   6. Strash, Darren

   2023 - TUHH Open Research - frei zugänglich
2. High multiplicity N-fold IP via configuration LP

   1. Knop, Dušan
   2. Koutecký, Martin
   3. Levin, Asaf
   4. Mnich, Matthias
   5. Onn, Shmuel

   2022 - TUHH Open Research - frei zugänglich
3. A 3/2-approximation for the metric many-visits path TSP

   1. Bérczi, Kristóf
   2. Mnich, Matthias
   3. Vincze, Roland

   2022 - TUHH Open Research - frei zugänglich
4. Approximations for many-visits multiple traveling salesman problems

   1. Bérczi, Kristóf
   2. Mnich, Matthias
   3. Vincze, Roland

   2022 - TUHH Open Research - frei zugänglich
5. A survey on graph problems parameterized above and below guaranteed values

   1. Gutin, Gregory Z.
   2. Mnich, Matthias

   2022 - TUHH Open Research - frei zugänglich
6. Parameterized algorithms for generalizations of directed feedback vertex set  

   1. Göke, Alexander
   2. Marx, Dániel
   3. Mnich, Matthias

   2022 - TUHH Open Research - frei zugänglich
7. Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling

   1. Fischer, David
   2. Golak, Julian
   3. Mnich, Matthias

   2022 - TUHH Open Research - frei zugänglich
8. An asymptotic (4/3+epsilon)-approximation for the 2-dimensional vector bin packing problem

   1. Kulik, Ariel
   2. Mnich, Matthias
   3. Shachnai, Hadas

   2022 - TUHH Open Research - frei zugänglich
9. Hitting weighted even cycles in planar graphs

   1. Göke, Alexander
   2. Koenemann, Jochen
   3. Mnich, Matthias
   4. Sun, Hao

   2022 - TUHH Open Research - frei zugänglich
10. Efficient approximations for many-visits multiple traveling salesman problems

    1. Bérczi, Kristóf
    2. Mnich, Matthias
    3. Vincze, Roland

    2021 - TUHH Open Research - frei zugänglich
11. Reachability switching games

    1. Fearnley, John
    2. Gairing, Martin
    3. Mnich, Matthias
    4. Savani, Rahul

    2021 - TUHH Open Research - frei zugänglich
12. Approximating sparsest cut in low-treewidth graphs via combinatorial diameter

    1. Chalermsook, Parinya
    2. Kaul, Matthias
    3. Mnich, Matthias
    4. Spoerhase, Joachim
    5. Uniyal, Sumedha
    6. Vaz, Daniel

    2021 - TUHH Open Research - frei zugänglich
13. Hitting weighted even cycles in planar graphs

    1. Göke, Alexander
    2. Koenemann, Jochen
    3. Mnich, Matthias
    4. Sun, Hao

    2021 - TUHH Open Research - frei zugänglich
14. Parameterized complexity of configuration integer programs

    1. Knop, Dušan
    2. Koutecký, Martin
    3. Levin, Asaf
    4. Mnich, Matthias
    5. Onn, Shmuel

    2021 - TUHH Open Research - frei zugänglich
15. Engineering kernelization for maximum cut

    1. Ferizovic, Damir
    2. Hespe, Demian
    3. Lamm, Sebastian
    4. Mnich, Matthias
    5. Schulz, Christian
    6. Strash, Darren

    2020 - TUHH Open Research
16. Stable matchings with covering constraints: a complete computational trichotomy

    1. Mnich, Matthias
    2. Schlotter, Ildikó

    2020 - TUHH Open Research - frei zugänglich
17. Solving packing problems with few small items using rainbow matchings

    1. Bannach, Max
    2. Berndt, Sebastian
    3. Maack, Marten
    4. Mnich, Matthias
    5. Lassota, Alexandra
    6. Rau, Malin
    7. Skambath, Malte

    2020 - TUHH Open Research - frei zugänglich
18. Recent advances in practical data reduction

    1. Abu-Khzam, Faisal
    2. Lamm, Sebastian
    3. Mnich, Matthias
    4. Noe, Alexander
    5. Schulz, Christian
    6. Strash, Darren

    2020 - TUHH Open Research - frei zugänglich
19. Dense Steiner problems: approximation algorithms and inapproximability

    1. Karpinski, Marek
    2. Lewandowski, Mateusz
    3. Meesum, Syed Mohammad
    4. Mnich, Matthias

    2020 - TUHH Open Research
20. Odd multiway cut in directed acyclic graphs

    1. Chandrasekaran, Karthekeyan
    2. Mnich, Matthias
    3. Mozaffari, Sahand

    2020 - TUHH Open Research