„parameterized complexity analysis“

Suchergebnisse

112 Treffer

• Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
  Bonnet, Édouard ; Brettell, Nick ; Kwon, O-joung ; Marx, Dániel
• Classic graph problems made temporal - a parameterized complexity analysis
  Molter, Hendrik 2020 Universitätsverlag der TU Berlin
• Metric Dimension Parameterized By Treewidth
  Bonnet, Édouard ; Purohit, Nidhi
• Parameterized Counting of Partially Injective Homomorphisms
  Roth, Marc
• Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation
  Paul, Christophe ; Pilipczuk, Michał
• Parameterized Complexity of Independent Set in H-Free Graphs
  Bonnet, Édouard ; Bousquet, Nicolas ; Charbit, Pierre ; Thomassé, Stéphan ; Watrigant, Rémi
• Parameterized Leaf Power Recognition via Embedding into Graph Products
  Eppstein, David ; Havvaei, Elham
• Independent Set Reconfiguration Parameterized by Modular-Width
  Belmonte, Rémy ; Hanaka, Tesshu ; Lampis, Michael ; Ono, Hirotaka ; Otachi, Yota
• Parameterized Complexity of Conflict-Free Matchings and Paths
  Agrawal, Akanksha ; Jain, Pallavi ; Kanesh, Lawqueen ; Saurabh, Saket
• The Parameterized Hardness of the k-Center Problem in Transportation Networks
  Feldmann, Andreas Emil ; Marx, Dániel
• Parameterized Orientable Deletion
  Hanaka, Tesshu ; Katsikarelis, Ioannis ; Lampis, Michael ; Otachi, Yota ; Sikora, Florian
• Dynamic Parameterized Problems
  Krithika, R. ; Sahu, Abhishek ; Tale, Prafullkumar
• Editor’s Note: Special Issue on Parameterized and Exact Computation
• 12th International Symposium on Parameterized and Exact Computation (IPEC 2017)
  Lokshtanov, Daniel ; Nishimura, Naomi 2018 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• Parameterized Complexity of Asynchronous Border Minimization
  Ganian, Robert ; Kronegger, Martin ; Pfandler, Andreas ; Popa, Alexandru
• Parameterized Complexity of Length-bounded Cuts and Multicuts
  Dvořák, Pavel ; Knop, Dušan
• Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity
  Bodlaender, Hans L. ; Ono, Hirotaka ; Otachi, Yota
• Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs
  Bang-Jensen, Jørgen ; Saurabh, Saket ; Simonsen, Sven
• A Parameterized Study of Maximum Generalized Pattern Matching Problems
  Ordyniak, Sebastian ; Popa, Alexandru
• Solving Linear Equations Parameterized by Hamming Weight
  Arvind, V. ; Köbler, Johannes ; Kuhnert, Sebastian ; Torán, Jacobo