Personensuche
X
?
Lecture Notes in Computer Science; Combinatorial Algorithms ,
1
Complexity Framework for Forbidden Subgraphs IV: The Steine..:
, In:
?
Fundamentals of Computation Theory; Lecture Notes in Computer Science ,
2
Computing Subset Vertex Covers in H-Free Graphs:
, In:
?
Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science ,
3
Induced Disjoint Paths and Connected Subgraphs for H-Free G..:
, In:
?
Lecture Notes in Computer Science; Combinatorial Optimization ,
4
Few Induced Disjoint Paths for H-Free Graphs:
, In:
?
Fundamentals of Computation Theory; Lecture Notes in Computer Science ,
5
Streaming Deletion Problems Parameterized by Vertex Cover:
, In:
?
Lecture Notes in Computer Science; Combinatorial Algorithms ,
6
Disjoint Paths and Connected Subgraphs for H-Free Graphs:
, In:
?
LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science ,
7
Steiner Trees for Hereditary Graph Classes:
, In:
?
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms ,
8
Nearly ETH-tight algorithms for planar steiner tree with te..:
, In:
?
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms ,
9
Independence and efficient domination on P6-free graphs:
, In:
?
2014 IEEE 55th Annual Symposium on Foundations of Computer Science ,
10
Network Sparsification for Steiner Problems on Planar and B..:
, In:
?
Proceedings of the twenty-seventh annual symposium on Computational geometry ,
11
Integer representations of convex polygon intersection grap..:
, In:
?
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms ,
12
Approximating geometric coverage problems:
, In:
?
Springer Textbooks in Earth Sciences, Geography and Environment; Data Assimilation Fundamentals ,
15