„parameterized algorithms“

Suchergebnisse

475 Treffer

• Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
  Can Esmer, Barış ; Kulik, Ariel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Bandwidth Parameterized by Cluster Vertex Deletion Number
  Gima, Tatsuya ; Kim, Eun Jung ; Köhler, Noleen ; Melissinos, Nikolaos ; Vasilakis, Manolis
• Extending Partial 1-Planar Drawings
  Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Klute, Fabian ; Nöllenburg, Martin 2020 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
• LP can be a cure for Parameterized Problems
  Narayanaswamy, N.S. ; Raman, Venkatesh ; Ramanujan, M.S. ; Saurabh, Saket 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Para $$^2$$ 2 : parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
  Konnov, Igor ; Lazić, Marijana ; Veith, Helmut ; Widder, Josef
• Parameterized Streaming Algorithms for Min-Ones d-SAT
  Agrawal, Akanksha ; Biswas, Arindam ; Bonnet, Édouard ; Brettell, Nick ; Curticapean, Radu ; Marx, Dániel ; Miltzow, Tillmann ; Raman, Venkatesh ; Saurabh, Saket 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Packing Arc-Disjoint Cycles in Tournaments
  Bessy, Stéphane ; Bougeret, Marin ; Krithika, R. ; Sahu, Abhishek ; Saurabh, Saket ; Thiebaut, Jocelyn ; Zehavi, Meirav 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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
• Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
  Ganian, Robert ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Zehavi, Meirav
• On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
  Di Giacomo, Emilio ; Didimo, Walter ; Liotta, Giuseppe ; Montecchiani, Fabrizio ; Ortali, Giacomo
• Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation
  Golovach, Petr A. ; Zehavi, Meirav
• ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
  Fomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
  Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Kwon, O-joung 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
  Ganian, Robert ; Klute, Fabian ; Ordyniak, Sebastian 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
  Boehmer, Niclas ; Heeger, Klaus ; Niedermeier, Rolf 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• DynASP2.5: Dynamic Programming on Tree Decompositions in Action
  Fichte, Johannes Klaus ; Hecher, Markus ; Morak, Michael ; Woltran, Stefan 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
  Fernau, Henning ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Raible, Daniel ; Saurabh, Saket ; Villanger, Yngve 2009 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Representing Paths in Digraphs
  Dondi, Riccardo ; Popa, Alexandru 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik