„parameterized algorithms“

Suchergebnisse

1.000+ Treffer

• Parameterized Geometric Graph Modification with Disk Scaling
  Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay ; Saurabh, Saket ; Zehavi, Meirav 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth
  Kowalik, Łukasz ; Mucha, Marcin ; Nadara, Wojciech ; Pilipczuk, Marcin ; Sorge, Manuel ; Wygocki, Piotr 2020 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
• Parameterized algorithms for block-structured integer programs with large entries
  Cslovjecsek, Jana ; Koutecký, Martin ; Lassota, Alexandra ; Pilipczuk, Michał ; Polak, Adam
• Parameterized Algorithms and Kernels for Rainbow Matching
  Gupta, Sushmita ; Roy, Sanjukta ; Saurabh, Saket ; Zehavi, Meirav 2017 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
• The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration
  Dell, Holger ; Komusiewicz, Christian ; Talmon, Nimrod ; Weller, Mathias 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms and computation – 6th international workshop ; proceedings
  Rahman, Md. Saidur ; Nakano, Shin-ichi 2012 Springer
• Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
  Pilipczuk, Marcin ; Pilipczuk, Michal ; Sankowski, Piotr ; van Leeuwen, Erik Jan 2013 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
  Bentert, Matthias ; Heeger, Klaus ; Koana, Tomohiro 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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
• Parameterized Complexity of Small Weight Automorphisms and Isomorphisms
  Arvind, V. ; Köbler, Johannes ; Kuhnert, Sebastian ; Torán, Jacobo
• Approximation and Parameterized Algorithms for Scheduling Problems
  Fischer, David Simon ; Jansen, Klaus ; Verschae, José 2025 Universitätsbibliothek Kiel
• Parameterized Algorithms for List K-Cycle
  Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav
• Parameterized Algorithms and Kernels for Rainbow Matching
  Gupta, Sushmita ; Roy, Sanjukta ; Saurabh, Saket ; Zehavi, Meirav
• An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions
  Bulteau, Laurent ; Jones, Mark ; Niedermeier, Rolf ; Tantau, Till 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik