„parameterized Complexity“

Suchergebnisse

665 Treffer

• Kernelization in Almost Linear Time for Clustering into Bounded Vertex Cover Components
  Bhyravarapu, Sriram ; Kumar, Pritesh ; Kundu, Madhumita ; Roy, Shivesh K. ; Saurabh, Saket ; Sahiba 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms and Discrete Applied Mathematics – Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings
  Govindarajan, Sathish ; Maheshwari, Anil 2016 Springer International Publishing
• 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
• The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
  Ganian, Robert ; Hamm, Thekla ; Korchemna, Viktoriia ; Okrasa, Karolina ; Simonov, Kirill 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs
  Fischer, Nick ; Künnemann, Marvin ; Redžić, Mirza ; Stieß, Julian 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computing Distances on Graph Associahedra Is Fixed-Parameter Tractable
  Cunha, Luís Felipe I. ; Sau, Ignasi ; Souza, Uéverton S. ; Valencia-Pabon, Mario 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Guessing Efficiently for Constrained Subspace Approximation
  Bhaskara, Aditya ; Mahabadi, Sepideh ; Pittu, Madhusudhan Reddy ; Vakilian, Ali ; Woodruff, David P. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Mim-Width Is paraNP-Complete
  Bergougnoux, Benjamin ; Bonnet, Édouard ; Duron, Julien 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
  Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad ; Ramanujan, M. S. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
  Bentert, Matthias ; Fomin, Fedor V. ; Golovach, Petr A. ; Ramanujan, M. S. ; Saurabh, Saket 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Structural Parameterizations of the Edge Disjoint Paths Problem
  Ganian, Robert ; Ordyniak, Sebastian ; Sridharan, Ramanujan 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators
  Majumdar, Diptapriyo ; Raman, Venkatesh ; Saurabh, Saket 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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
• Parameterized Complexity of PCA (Invited Talk)
  Fomin, Fedor V. ; Golovach, Petr A. ; Simonov, Kirill 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized complexity of candidate nomination for elections based on positional scoring rules
  Schlotter, Ildikó ; Cechlárová, Katarína ; Trellová, Diana
• Parameterized Complexity of Conflict-Free Set Cover
  Jacob, Ashwin ; Majumdar, Diptapriyo ; Raman, Venkatesh
• 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
• Covering Vectors by Spaces: Regular Matroids
  Fomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Saurabh, Saket 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
  Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Zehavi, Meirav