Personensuche
X
?
Lecture Notes in Computer Science; Combinatorial Algorithms ,
1
Complexity Framework for Forbidden Subgraphs IV: The Steine..:
, In:
?
WALCOM: Algorithms and Computation; Lecture Notes in Computer Science ,
4
From the W-hierarchy to XNLP: Classes of Fixed Parameter In..:
, In:
?
Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science ,
5
Problems Hard for Treewidth but Easy for Stable Gonality:
, In:
?
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) ,
6
Parameterized Problems Complete for Nondeterministic FPT ti..:
, In:
?
WALCOM: Algorithms and Computation; Lecture Notes in Computer Science ,
10
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to I..:
, In:
?
Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science ,
13
Parameterized Complexity of Bandwidth of Caterpillars and W..:
, In:
?
Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science ,
14