search result

Cover von Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs

Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs

a Complete Complexity Characterization
Year: 2018
Media group: LIPIcs
Cover von H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms

H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms

Year: 2017
Media group: LIPIcs
Cover von Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs

Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs

Year: 2016
Media group: LIPIcs
Cover von Routing with Congestion in Acyclic Digraphs

Routing with Congestion in Acyclic Digraphs

Year: 2016
Media group: LIPIcs
Cover von Fixed-Parameter Approximability of Boolean MinCSPs

Fixed-Parameter Approximability of Boolean MinCSPs

Year: 2016
Media group: LIPIcs
Cover von Peeling and Nibbling the Cactus

Peeling and Nibbling the Cactus

Subexponential-Time Algorithms for Counting Triangulations and Related Problems
Year: 2016
Media group: LIPIcs
Cover von Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)

Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)

Year: 2014
Media group: LIPIcs
Cover von Robust Contraction Decomposition for Minor-Free Graphs and Its Applications

Robust Contraction Decomposition for Minor-Free Graphs and Its Applications

Year: 2025
Media group: LIPIcs
Cover von Optimality and tight results in parameterized complexity; 11
pp. 1-21
Search for this author
Year: 2015
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 11
Media group: DAGSTUHL REPORT
Cover von List Homomorphisms by Deleting Edges and Vertices

List Homomorphisms by Deleting Edges and Vertices

Tight Complexity Bounds for Bounded-Treewidth Graphs
Year: 2024
Media group: LIPIcs
OPEN V 11.1.0.0