„Exact exponential algorithms“

Suchergebnisse

1.000+ Treffer

• Exact Exponential Algorithms for Clustering Problems
  Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay ; Purohit, Nidhi ; Saurabh, Saket 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Amortized Analysis of Exponential Time- and Parameterized Algorithms: Measure & Conquer and Reference Search Trees
  Binkele-Raible, Daniel ; Fernau, Henning 2010 Universität Trier
• The domatic number problem: Boolean hierarchy completeness and exact exponential time algorithms
  Riege, Tobias
• Parameterized and Exact Computation – 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings
  2010 Springer Berlin Heidelberg
• Parameterized and Exact Computation – First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004. Proceedings
  Raman, Venkatesh ; Saurabh, Saket 2004 Springer Berlin Heidelberg
• Treewidth Parameterized by Feedback Vertex Number
  Molter, Hendrik ; Zehavi, Meirav ; Zivan, Amit 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact Algorithms for Terrain Guarding
  Ashok, Pradeesha ; Fomin, Fedor V. ; Kolay, Sudeshna ; Saurabh, Saket ; Zehavi, Meirav 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Stable Matching Games: Manipulation via Subgraph Isomorphism
  Gupta, Sushmita ; Roy, Sanjukta 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Complexity of Grammar-Based Compression over Fixed Alphabets
  Casel, Katrin ; Fernau, Henning ; Gaspers, Serge ; Gras, Benjamin ; Schmid, Markus L. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Mihajlin, Ivan ; Saurabh, Saket ; Zehavi, Meirav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Path Contraction Faster Than 2^n
  Agrawal, Akanksha ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket ; Tale, Prafullkumar 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
  C. M. Gomes, Guilherme ; Juliano, Emanuel ; Martins, Gabriel ; Santos, Vinicius ˜dosœ 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Quantum Algorithms for One-Sided Crossing Minimization
  Caroppo, Susanna ; Da Lozzo, Giordano ; Di Battista, Giuseppe 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 10441 Abstracts Collection – Exact Complexity of NP-hard Problems
  Husfeldt, Thore ; Kratsch, Dieter ; Paturi, Ramamohan ; Sorkin, Gregory B.
• 08431 Executive Summary – Moderately Exponential Time Algorithms
  Fomin, Fedor V. ; Iwama, Kazuo ; Kratsch, Dieter
• Breaking the All Subsets Barrier for Min k-Cut
  Lokshtanov, Daniel ; Saurabh, Saket ; Surianarayanan, Vaishali 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• CNF Satisfiability in a Subspace and Related Problems
  Arvind, Vikraman ; Guruswami, Venkatesan 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact Exponential Algorithms for Two Poset Problems
  Kozma, László 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact and Approximate Digraph Bandwidth
  Jain, Pallavi ; Kanesh, Lawqueen ; Lochet, William ; Saurabh, Saket ; Sharma, Roohani 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Enumeration of Preferred Extensions in Almost Oriented Digraphs
  Gaspers, Serge ; Li, Ray 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik