„Parameterized Algorithms“

Suchergebnisse

475 Treffer

• Fine-Grained Classification of Detecting Dominating Patterns
  Dransfeld, Jonathan ; Künnemann, Marvin ; Redzic, Mirza 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Approximability for Modular Linear Equations
  Dabrowski, Konrad K. ; Jonsson, Peter ; Ordyniak, Sebastian ; Osipov, George ; Wahlström, Magnus 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
  Lill, Jonas ; Petrova, Kalina ; Weber, Simon
• Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
  Depian, Thomas ; Fink, Simon D. ; Ganian, Robert ; Surianarayanan, Vaishali 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Recursive Backdoors for SAT
  Mählmann, Nikolas ; Siebertz, Sebastian ; Vigny, Alexandre 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem
  Mathew, Rogers ; Panolan, Fahad ; Seshikanth 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk)
  Fomin, Fedor V. ; Golovach, Petr A. ; Sagunov, Danil ; Simonov, Kirill 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Novel Complexity Results for Temporal Separators with Deadlines
  Dondi, Riccardo ; Lafond, Manuel 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Streaming Algorithms for Topological Sorting
  Chen, Ho-Lin ; Lin, Peng-Ting ; Tsai, Meng-Tsung 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Crossing and Independent Families Among Polygons
  Brötzner, Anna ; Ganian, Robert ; Hamm, Thekla ; Klute, Fabian ; Parada, Irene 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation and Parameterized Algorithms for Covering with Disks of Two Types of Radii
  Bandyapadhyay, Sayan ; Mitchell, Eli 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Exact and parameterized algorithms for choosability
  Bliznets, Ivan ; Nederlof, Jesper
• 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
• Sparse Grids and Applications - Miami 2016
  Garcke, Jochen ; Pflüger, Dirk ; Webster, Clayton G. ; Zhang, Guannan 2018 Springer International Publishing
• Informed Normalized Gradient Flow Method for Parameterized Schrödinger Operators: A Case Study on Photonic Graphene
  Guo, Hailong ; Lorin, Emmanuel ; Noxon, Charlotte ; Yang, Xu
• Faster parameterized algorithms for variants of 3-Hitting Set
  Tsur, Dekel
• Treewidth Parameterized by Feedback Vertex Number
  Molter, Hendrik ; Zehavi, Meirav ; Zivan, Amit 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns
  Lassota, Alexandra ; Ligthart, Koen 2025 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