Forschungsbericht 2021
Algorithmen und Komplexität E-11
Leitung: Prof. Dr. Matthias Mnich
Institut auf TORE
Institutswebsite
Publikationen
- Parameterized complexity of configuration integer programs - Article
Knop, Dušan; Koutecký, Martin; Levin, Asaf; Mnich, Matthias; Onn, Shmuel
Operations research letters 49(6): 908-913 (2021)
Open Access Publisher DOI
- Hitting weighted even cycles in planar graphs - inProceedings
Göke, Alexander; Koenemann, Jochen; Mnich, Matthias; Sun, Hao
International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2021)
Open Access Publisher DOI
- Cycle spectra of contraction-critically 4-connected planar graphs - Article
Lo, On-Hei Solomon; Schmidt, Jens M.
Graphs and Combinatorics 37 (6): 2129-2137 (2021)
Publisher DOI
- Reachability switching games - Article
Fearnley, John; Gairing, Martin; Mnich, Matthias; Savani, Rahul
Logical methods in computer science 17 (2): 10:1-10:29 (2021-04-22)
Open Access Publisher DOI
- Efficient approximations for many-visits multiple traveling salesman problems - Preprint
Bérczi, Kristóf; Mnich, Matthias; Vincze, Roland
arXiv: 2201.02054 (2021)
- Circumference of essentially 4-connected planar triangulations - Article
Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M.
Journal of graph algorithms and applications 25 (1): 121-132 (2021)
Open Access Publisher DOI
- Approximating sparsest cut in low-treewidth graphs via combinatorial diameter - Preprint
Chalermsook, Parinya; Kaul, Matthias; Mnich, Matthias; Spoerhase, Joachim; Uniyal, Sumedha; Vaz, Daniel
arXiv:2111.06299 (2021)
Open Access
- On short fastest paths in temporal graphs - inProceedings
Danda, Umesh Sandeep; Ramakrishna, G.; Schmidt, Jens M.; Srikanth, M.
International Conference and Workshops on Algorithms and Computation (WALCOM 2021)
Publisher DOI
Projekte