„parameterized complexity analysis“

Suchergebnisse

112 Treffer

• Topics in Theoretical Computer Science – The First IFIP WG 1.8 International Conference, TTCS 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers
  Hajiaghayi, Mohammed Taghi ; Mousavi, Mohammad Reza 2016 Springer International Publishing
• On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
  Lokshtanov, Daniel ; Mouawad, Amer E. ; Panolan, Fahad ; Siebertz, Sebastian
• Parameterized Complexity of Superstring Problems
  Bliznets, Ivan ; Fomin, Fedor V. ; Golovach, Petr A. ; Karpov, Nikolay ; Kulikov, Alexander S. ; Saurabh, Saket
• Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
  Korenwein, Viatcheslav ; Nichterlein, André ; Niedermeier, Rolf ; Zschoche, Philipp 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
  Di Giacomo, Emilio ; Didimo, Walter ; Liotta, Giuseppe ; Montecchiani, Fabrizio ; Ortali, Giacomo
• Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation
  Golovach, Petr A. ; Zehavi, Meirav
• Group Activity Selection with Few Agent Types
  Ganian, Robert ; Ordyniak, Sebastian ; Rahul, C. S. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
  Boehmer, Niclas ; Heeger, Klaus ; Niedermeier, Rolf 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Parameterized Complexity View on Collapsing k-Cores
  Luo, Junjie ; Molter, Hendrik ; Suchý, Ondrej 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity of Secluded Connectivity Problems
  Fomin, Fedor V. ; Golovach, Petr A. ; Karpov, Nikolay ; Kulikov, Alexander S.
• On Adaptive Algorithms for Maximum Matching
  Hegerfeld, Falko ; Kratsch, Stefan 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
  Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav
• Parameterized Inapproximability of Independent Set in H-Free Graphs
  Dvořák, Pavel ; Feldmann, Andreas Emil ; Rai, Ashutosh ; Rzążewski, Paweł
• Finding Diverse Strings and Longest Common Subsequences in a Graph
  Shida, Yuto ; Punzi, Giulia ; Kobayashi, Yasuaki ; Uno, Takeaki ; Arimura, Hiroki 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
  Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad ; Ordyniak, Sebastian ; Szeider, Stefan 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Flatness and Complexity of Immediate Observation Petri Nets
  Raskin, Mikhail ; Weil-Kennedy, Chana ; Esparza, Javier 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Parameterized Complexity of Guarding Almost Convex Polygons
  Agrawal, Akanksha ; Knudsen, Kristine V. K. ; Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav
• Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
  Fomin, Fedor V. ; Golovach, Petr A.
• How Hard Is It to Satisfy (Almost) All Roommates?
  Chen, Jiehua ; Hermelin, Danny ; Sorge, Manuel ; Yedidsion, Harel 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Power of Linear-Time Data Reduction for Maximum Matching
  Mertzios, George B. ; Nichterlein, André ; Niedermeier, Rolf 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik