„subexponential parameterized complexity“

Suchergebnisse

9 Treffer

• Tight bounds for Parameterized Complexity of Cluster Editing
  Fomin, Fedor V. ; Kratsch, Stefan ; Pilipczuk, Marcin ; Pilipczuk, Michal ; Villanger, Yngve 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Algorithms for Partial Cover Problems
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, Saket 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
  Fomin, Fedor V. ; Golovach, Petr A. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
  Fomin, Fedor V. ; Golovach, Petr A.
• Fast Biclustering by Dual Parameterization
  Drange, Pål Grønås ; Reidl, Felix ; Sanchez Villaamil, Fernando ; Sikdar, Somnath 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exploring Subexponential Parameterized Complexity of Completion Problems
  Drange, Pal Gronas ; Fomin, Fedor V. ; Pilipczuk, Michal ; Villanger, Yngve 2014 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity in the Polynomial Hierarchy – Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy
  Haan, Ronald ˜deœ 2019 Springer International Publishing
• Parameterized complexity in the polynomial hierarchy – extending parameterized complexity theory to higher levels of the hierarchy
  Haan, Ronald ˜deœ 2019 Springer