Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
van Leeuwen, Erik Jan
85  Ergebnisse:
Buchkapitel (Online) X
?
1

Complexity Framework for Forbidden Subgraphs IV: The Steine..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Bodlaender, Hans L. ; Johnson, Matthew ; Martin, Barnaby... - p. 206-217 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Computing Subset Vertex Covers in H-Free Graphs:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,
Brettell, Nick ; Oostveen, Jelle J. ; Pandey, Sukanya.. - p. 88-102 , 2023
Link: https://doi.org/10.1007/..
 
?
3

Induced Disjoint Paths and Connected Subgraphs for H-Free G..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani. - p. 398-411 , 2022
Link: https://doi.org/10.1007/..
 
?
4

Few Induced Disjoint Paths for H-Free Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Optimization,
Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani. - p. 89-101 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Streaming Deletion Problems Parameterized by Vertex Cover:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,
Oostveen, Jelle J. ; van Leeuwen, Erik Jan - p. 413-426 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Disjoint Paths and Connected Subgraphs for H-Free Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Kern, Walter ; Martin, Barnaby ; Paulusma, Daniël.. - p. 414-427 , 2021
Link: https://doi.org/10.1007/..
 
?
7

Steiner Trees for Hereditary Graph Classes:

, In: LATIN 2020: Theoretical Informatics; Lecture Notes in Computer Science,
Bodlaender, Hans L. ; Brettell, Nick ; Johnson, Matthew... - p. 613-624 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Nearly ETH-tight algorithms for planar steiner tree with te..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Kisfaludi-Bak, Sándor ; Nederlof, Jesper ; van Leeuwen, Erik Jan - p. 1015-1034 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

Independence and efficient domination on P6-free graphs:

, In: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms,
Lokshtanov, Daniel ; Pilipczuk, Marcin ; van Leeuwen, Erik Jan - p. 1784-1803 , 2016
Link: https://dl.acm.org/doi/1..
 
?
10

Network Sparsification for Steiner Problems on Planar and B..:

, In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science,
Pilipczuk, Marcin ; Pilipczuk, Michal ; Sankowski, Piotr. - p. 276-285 , 2014
Link: https://doi.org/10.1109/..
 
?
11

Integer representations of convex polygon intersection grap..:

, In: Proceedings of the twenty-seventh annual symposium on Computational geometry,
Müller, Tobias ; van Leeuwen, Erik Jan ; van Leeuwen, Jan - p. 300-307 , 2011
Link: https://dl.acm.org/doi/1..
 
?
12

Approximating geometric coverage problems:

, In: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms,
Erlebach, Thomas ; van Leeuwen, Erik Jan - p. 1267-1276 , 2008
Link: https://dl.acm.org/doi/1..
 
?
13

17. Chain Line Pattern Matching and Rembrandt's Prints:

, In: Rembrandt and his Circle,
Johnson, C. Richard ; Sethares, William A. ; Ellis, Margaret Holben... - p. 319-334 , 2017
Link: https://doi.org/10.1515/..
 
?
14

Chain Line Pattern Matching and Rembrandt's Prints:

, In: Rembrandt and his Circle,
Johnson, C. Richard ; Sethares, William A. ; Ellis, Margaret Holben... - p. 319-334 , 2017
Link: https://doi.org/10.2307/..
 
?
15

Weak Constraint 4DVar:

, In: Springer Textbooks in Earth Sciences, Geography and Environment; Data Assimilation Fundamentals,
Evensen, Geir ; Vossepoel, Femke C. ; van Leeuwen, Peter Jan - p. 49-61 , 2022
Link: https://doi.org/10.1007/..
 
1-15