„parameterised complexity“

Suchergebnisse

29 Treffer

• Parameterised Counting in Logspace
  Haak, Anselm ; Meier, Arne ; Prakash, Om ; Rao B. V., Raghavendra 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterised Counting in Logspace
  Haak, Anselm ; Meier, Arne ; Prakash, Om ; Rao, B. V. Raghavendra 2023 Gottfried Wilhelm Leibniz Universität Hannover
• Consensus Strings with Small Maximum Distance and Small Distance Sum
  Bulteau, Laurent ; Schmid, Markus L. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The HOMFLY-PT Polynomial is Fixed-Parameter Tractable
  Burton, Benjamin A. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs
  Eickmeyer, Kord ; Kawarabayashi, Ken-ichi 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Parameterised Complexity of Computing the Maximum Modularity of a Graph
  Meeks, Kitty ; Skerman, Fiona
• On the Parameterised Complexity of String Morphism Problems
  Fernau, Henning ; Schmid, Markus L. ; Villanger, Yngve
• Parameterised complexity of model checking and satisfiability in propositional dependence logic
  Mahmood, Yasir ; Meier, Arne 2021 Gottfried Wilhelm Leibniz Universität Hannover
• The parameterised complexity of counting even and odd induced subgraphs
  Jerrum, Mark ; Meeks, Kitty