„Parameterized Complexity“

Suchergebnisse

1.000+ Treffer

• Kernels for Deletion to Classes of Acyclic Digraphs
  Agrawal, Akanksha ; Saurabh, Saket ; Sharma, Roohani ; Zehavi, Meirav 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterization Above a Multiplicative Guarantee
  Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals
  Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized complexity of weighted team definability
  Kontinen, Juha ; Mahmood, Yasir ; Meier, Arne ; Vollmer, Heribert 2024 Gottfried Wilhelm Leibniz Universität Hannover
• Temporal Graph Realization from Fastest Paths
  Klobas, Nina ; Mertzios, George B. ; Molter, Hendrik ; Spirakis, Paul G. 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithmic aspects of manipulation and anonymization in social choice and social networks
  Talmon, Nimrod ; Niedermeier, Rolf ; Rosenschein, Jeffrey S. ; Shachnai, Hadas 2016 Universitätsverlag der TU Berlin
• Combinatorial Optimization and Graph Algorithms – Communications of NII Shonan Meetings
  Fukunaga, Takuro ; Kawarabayashi, Ken-ichi 2017 Springer Singapore
• Simultaneous Feedback Edge Set: A Parameterized Perspective
  Agrawal, Akanksha ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simultaneous Feedback Edge Set: A Parameterized Perspective
  Agrawal, Akanksha ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav
• Parameterized algorithms for block-structured integer programs with large entries
  Cslovjecsek, Jana ; Koutecký, Martin ; Lassota, Alexandra ; Pilipczuk, Michał ; Polak, Adam
• Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability)
  Inamdar, Tanmay ; Lokshtanov, Daniel ; Saurabh, Saket ; Surianarayanan, Vaishali 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exploiting Dense Structures in Parameterized Complexity
  Lochet, William ; Lokshtanov, Daniel ; Saurabh, Saket ; Zehavi, Meirav 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Simultaneous Feedback Vertex Set: A Parameterized Perspective
  Agrawal, Akanksha ; Lokshtanov, Daniel ; Mouawad, Amer E. ; Saurabh, Saket 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Aspects of Strong Subgraph Closure
  Golovach, Petr A. ; Heggernes, Pinar ; Konstantinidis, Athanasios L. ; Lima, Paloma T. ; Papadopoulos, Charis
• Parameterized Complexity of Directed Spanner Problems
  Fomin, Fedor V. ; Golovach, Petr A. ; Lochet, William ; Misra, Pranabendu ; Saurabh, Saket ; Sharma, Roohani
• Algorithms and computation – 6th international workshop ; proceedings
  Rahman, Md. Saidur ; Nakano, Shin-ichi 2012 Springer
• Parameterized Complexity (Dagstuhl Seminar 01311)
  Downey, R. G. ; Fellows, Michael R. ; Niedermeier, Rolf ; Rossmanith, Peter 2002 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition (Dagstuhl Seminar 24411)
  Fomin, Fedor V. ; Marx, Dániel ; Saurabh, Saket ; Sharma, Roohani ; Kundu, Madhumita
• Packing Cycles Faster Than Erdos-Posa
  Lokshtanov, Daniel ; Mouawad, Amer E. ; Saurabh, Saket ; Zehavi, Meirav 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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