„subexponential time algorithms“

Suchergebnisse

20 Treffer

• Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ Pt -Free and Broom-Free Graphs
  Bacsó, Gábor ; Lokshtanov, Daniel ; Marx, Dániel ; Pilipczuk, Marcin ; Tuza, Zsolt ; van Leeuwen, Erik Jan
• 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
• Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set
  Berthe, Gaétan ; Bougeret, Marin ; Gonçalves, Daniel ; Raymond, Jean-Florent 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Robust Contraction Decomposition for Minor-Free Graphs and Its Applications
  Bandyapadhyay, Sayan ; Lochet, William ; Lokshtanov, Daniel ; Marx, Dániel ; Misra, Pranabendu ; Neuen, Daniel ; Saurabh, Saket ; Tale, Prafullkumar ; Xue, Jie 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
  Novotná, Jana ; Okrasa, Karolina ; Pilipczuk, Michał ; Rzążewski, Paweł ; Leeuwen, Erik Jan van ; Walczak, Bartosz
• Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
  Novotná, Jana ; Okrasa, Karolina ; Pilipczuk, Michał ; Rzążewski, Paweł ; van Leeuwen, Erik Jan ; Walczak, Bartosz 2019 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
• A Tight Subexponential-Time Algorithm for Two-Page Book Embedding
  Ganian, Robert ; Müller, Haiko ; Ordyniak, Sebastian ; Paesani, Giacomo ; Rychlicki, Mateusz 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• List Locally Surjective Homomorphisms in Hereditary Graph Classes
  Dvořák, Pavel ; Masařík, Tomáš ; Novotná, Jana ; Krawczyk, Monika ; Rzążewski, Paweł ; Żuk, Aneta 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms
  Bacsó, Gábor ; Marx, Dániel ; Tuza, Zsolt 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Subexponential Time Algorithms for Embedding H-Minor Free Graphs
  Bodlaender, Hans L. ; Nederlof, Jesper ; van der Zanden, Tom C. 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
  Marx, Dániel ; Miltzow, Tillmann 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Constructing elliptic curve isogenies in quantum subexponential time
  Childs, Andrew ; Jao, David ; Soukharev, Vladimir
• A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
  Jao, David ; LeGrow, Jason ; Leonardi, Christopher ; Ruiz-Lopez, Luis
• BPP has subexponential time simulations unlessEXPTIME has publishable proofs
  Babai, Lźszló ; Fortnow, Lance ; Nisan, Noam ; Wigderson, Avi
• The searching over separators strategy to solve some NP-hard problems in subexponential time
  Hwang, R. Z. ; Chang, R. C. ; Lee, R. C. T.
• Counting connected components of a semialgebraic set in subexponential time
  Grigor'ev, D. Yu ; Vorobjov, N. N.
• Counting Cycles on Planar Graphs in Subexponential Time
  Cai, Jin-Yi ; Maran, Ashwin
• Subexponential-Time Algorithms for Sparse PCA
  Ding, Yunzi ; Kunisky, Dmitriy ; Wein, Alexander S. ; Bandeira, Afonso S.
• On Subexponential and FPT-Time Inapproximability
  Bonnet, Edouard ; Escoffier, Bruno ; Kim, Eun Jung ; Paschos, Vangelis Th