Search Results - "van Leeuwen, Erik Jan"

Few induced disjoint paths for H-free graphs by Martin, Barnaby, Paulusma, Daniël, Smith, Siani, van Leeuwen, Erik Jan

“…Paths P1,…,Pk in a graph G=(V,E) are mutually induced if any two distinct Pi and Pj have neither common vertices nor adjacent vertices. For a fixed integer k,…”
Get full text

Parameterized Complexity of Streaming Diameter and Connectivity Problems by Oostveen, Jelle J., van Leeuwen, Erik Jan

“…We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the streaming paradigm. On the positive end, we show that knowing…”
Get full text

Algorithms for the rainbow vertex coloring problem on graph classes by Lima, Paloma T., van Leeuwen, Erik Jan, van der Wegen, Marieke

“…Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected…”
Get full text

Subexponential-Time Algorithms for Maximum Independent Set in P t -Free and Broom-Free Graphs by Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan

“…In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on Pt-free graphs, that is, on…”
Get full text

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs by Martin, Barnaby, Paulusma, Daniël, Smith, Siani, van Leeuwen, Erik Jan

“…Paths P 1 , … , P k in a graph G = ( V , E ) are mutually induced if any two distinct P i and P j have neither common vertices nor adjacent vertices. The…”
Get full text

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs by Pilipczuk, Michał, van Leeuwen, Erik Jan, Wiese, Andreas

“…We consider two optimization problems in planar graphs. In Maximum Weight Independent Set of Objects we are given a graph G and a family D of objects , each…”
Get full text

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs by Novotná, Jana, Okrasa, Karolina, Pilipczuk, Michał, Rzążewski, Paweł, van Leeuwen, Erik Jan, Walczak, Bartosz

“…Let C and D be hereditary graph classes. Consider the following problem: given a graph G ∈ D , find a largest, in terms of the number of vertices, induced…”
Get full text

Parameterized Complexity of the Spanning Tree Congestion Problem by Bodlaender, Hans L., Fomin, Fedor V., Golovach, Petr A., Otachi, Yota, van Leeuwen, Erik Jan

“…We study the problem of determining the spanning tree congestion of a graph. We present some sharp contrasts in the parameterized complexity of this problem…”
Get full text

Spanners of bounded degree graphs by Fomin, Fedor V., Golovach, Petr A., van Leeuwen, Erik Jan

“…A k-spanner of a graph G is a spanning subgraph of G in which the distance between any pair of vertices is at most k times the distance in G. We prove that for…”
Get full text

Streaming deletion problems parameterized by vertex cover by Oostveen, Jelle J., van Leeuwen, Erik Jan

“…Streaming is a model where an input graph is provided one edge at a time, instead of being able to inspect it at will. In this work, we take a parameterized…”
Get full text

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs by Pilipczuk, Marcin, Pilipczuk, Michal, Sankowski, Piotr, Van Leeuwen, Erik Jan

“…We propose polynomial-time algorithms that sparsify planar and bounded-genus graphs while preserving optimal or near-optimal solutions to Steiner problems. Our…”
Get full text

The Parameterized Complexity of the Survivable Network Design Problem by Feldmann, Andreas Emil, Mukherjee, Anish, van Leeuwen, Erik Jan

Get full text

Maximal induced matchings in K4-free and K5-free graphs by Basavaraju, Manu, van Leeuwen, Erik Jan, Saei, Reza

“…An induced matching in a graph is a set of edges whose endpoints induce a 1-regular subgraph. It is known that every graph on n vertices has at most…”
Get full text

Maximal induced matchings in K 4 -free and K 5 -free graphs by Basavaraju, Manu, van Leeuwen, Erik Jan, Saei, Reza

Get full text

Disjoint paths and connected subgraphs for H-free graphs by Kern, Walter, Martin, Barnaby, Paulusma, Daniël, Smith, Siani, van Leeuwen, Erik Jan

“…The well-known Disjoint Paths problem is to decide if a graph contains k pairwise disjoint paths, each connecting a different terminal pair from a set of k…”
Get full text

Induced Disjoint Paths in AT-free graphs by Golovach, Petr A., Paulusma, Daniël, van Leeuwen, Erik Jan

“…Paths P1,…,Pk are mutually induced if any two distinct Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The…”
Get full text

Polynomial kernels for deletion to classes of acyclic digraphs by Mnich, Matthias, van Leeuwen, Erik Jan

“…We consider the problem to find a set X of vertices (or arcs) with |X|≤k in a given digraph G such that D=G−X is an acyclic digraph. In its generality, this is…”
Get full text

Upper bounding rainbow connection number by forest number by Sunil Chandran, L., Issac, Davis, Lauri, Juho, van Leeuwen, Erik Jan

“…A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between…”
Get full text

Steiner trees for hereditary graph classes: A treewidth perspective by Bodlaender, Hans L., Brettell, Nick, Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël, van Leeuwen, Erik Jan

“…We consider the classical problems (Edge) Steiner Tree and Vertex Steiner Tree after restricting the input to some class of graphs characterized by a small set…”
Get full text

Complexity of metric dimension on planar graphs by Diaz, Josep, Pottonen, Olli, Serna, Maria, van Leeuwen, Erik Jan

“…•In Metric Dimension, we distinguish all pairs of vertices by few selected landmarks.•We show that Metric Dimension is NP-complete on planar graphs.•We show…”
Get full text