„parameterized complexity“

Suchergebnisse

665 Treffer

• Directed Disjoint Paths Remains W[1]-Hard on Acyclic Digraphs Without Large Grid Minors
  Kawarabayashi, Ken-ichi ; Lorenz, Nicola ; Garlet Milani, Marcelo ; Stegemann, Jacob 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 25211)
  Bodirsky, Manuel ; Guruswami, Venkatesan ; Marx, Dániel ; Živný, Stanislav ; Semanišinová, Žaneta
• Computational Complexity of Verifying Parameterized Systems
  Ayikudi Ramachandrakumar, Balasubramanian ; Esparza Estaun, Francisco Javier ; Abdulla, Parosh Aziz ; Bouajjani, Ahmed 2024 Universitätsbibliothek der TU München
• Fine-Grained Parameterized Algorithms on Width Parameters and Beyond
  Hegerfeld, Falko ; Kratsch, Stefan ; Siebertz, Sebastian ; Nederlof, Jesper 2023 Humboldt-Universität zu Berlin
• Parameterized Algorithmics for Graph-Based Data Analysis
  Grüttemeier, Niels ; Komusiewicz, Christian 2022 Philipps-Universität Marburg
• Advanced tools and methods for treewidth-based problem solving
  Hecher, Markus ; Woltran, Stefan ; Schaub, Torsten ; Truszczynski, Mirosław ; Vollmer, Heribert 2021 Universität Potsdam
• Classic graph problems made temporal – a parameterized complexity analysis
  Molter, Hendrik ; Niedermeier, Rolf ; Erlebach, Thomas ; Klasing, Ralf 2020 Universitätsverlag der TU Berlin
• Preprocessing to Deal with Hard Problems
  Hols, Eva-Maria Christiana ; Kratsch, Stefan ; Köbler, Johannes ; Niedermeier, Rolf 2020 Humboldt-Universität zu Berlin
• Counting Problems on Quantum Graphs – Parameterized and Exact Complexity Classifications
  Roth, Marc ; Dell, Holger 2019 Saarländische Universitäts- und Landesbibliothek
• Scheduling and Packing Problems – Algorithms and Complexity
  Kahler, Kai ; Jansen, Klaus ; Klein, Kim-Manuel 2024 Universitätsbibliothek Kiel
• On Algorithms for Multidimensional Packing Problems and on the Complexity of higher dimensional Knapsack
  Grage, Kilian ; Jansen, Klaus ; Megow, Nicole 2024 Universitätsbibliothek Kiel
• Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
  Focke, Jacob ; Hörsch, Florian ; Li, Shaohua ; Marx, Dániel 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Multivariate complexity analysis of team management problems
  Bredereck, Robert ; Niedermeier, Rolf ; Slinko, Arkadii ; Walsh, Toby 2015 Universitätsverlag der TU Berlin
• The simple, little and slow things count – on parameterized counting complexity
  Curticapean, Radu ; Bläser, Markus 2015 Saarländische Universitäts- und Landesbibliothek
• Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants
  Jana, Satyabrata ; Mandal, Soumen ; Rai, Ashutosh ; Saurabh, Saket 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Revisiting Directed Disjoint Paths on Tournaments (And Relatives)
  de C. M. Gomes, Guilherme ; Lopes, Raul ; Sau, Ignasi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages
  Campos, Victor ; Costa, Jonas ; Lopes, Raul ; Sau, Ignasi 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps
  Lopes, Raul ; Sau, Ignasi 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Model-checking problems, machines and parameterized complexity
  Chen, Yijia
• Foreword: Special Issue on Parameterized and Exact Computation
  Guo, Jiong ; Hermelin, Danny