Erik Jan van Leeuwen

From MaRDI portal
Person:295636

Available identifiers

zbMath Open van-leeuwen.erik-janMaRDI QIDQ295636

List of research outcomes

PublicationDate of PublicationType
Streaming deletion problems Parameterized by vertex cover2023-10-26Paper
Induced disjoint paths and connected subgraphs for \(H\)-free graphs2023-09-27Paper
Few induced disjoint paths for \(H\)-free graphs2023-08-03Paper
Induced disjoint paths and connected subgraphs for \(H\)-free graphs2023-05-05Paper
https://portal.mardi4nfdi.de/entity/Q58755572023-02-03Paper
Few induced disjoint paths for \(H\)-free graphs2022-11-17Paper
Steiner trees for hereditary graph classes2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50892352022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50904892022-07-18Paper
Streaming deletion problems parameterized by vertex cover2022-05-20Paper
Upper bounding rainbow connection number by forest number2022-05-17Paper
https://portal.mardi4nfdi.de/entity/Q50757632022-05-11Paper
Disjoint paths and connected subgraphs for \(H\)-free graphs2022-03-22Paper
What Graphs are 2-Dot Product Graphs?2022-02-01Paper
Disjoint paths and connected subgraphs for \(H\)-free graphs2021-12-01Paper
Induced disjoint paths in AT-free graphs2021-11-25Paper
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs2021-11-04Paper
Algorithms for the rainbow vertex coloring problem on graph classes2021-09-27Paper
https://portal.mardi4nfdi.de/entity/Q50051872021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50096152021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50096272021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50096322021-08-04Paper
Subexponential-time algorithms for finding large induced sparse subgraphs2021-07-26Paper
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces2021-05-03Paper
Steiner trees for hereditary graph classes: a treewidth perspective2021-04-15Paper
Disconnected cuts in claw-free graphs2020-06-09Paper
https://portal.mardi4nfdi.de/entity/Q51112572020-05-26Paper
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs2020-04-14Paper
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around2020-03-11Paper
Algorithms and bounds for very strong rainbow coloring2020-02-12Paper
Complexity of independency and cliquy trees2019-12-30Paper
Domination When the Stars Are Out2019-11-25Paper
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces2019-10-15Paper
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs2019-03-28Paper
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs2019-02-14Paper
Independence and Efficient Domination on P 6 -free Graphs2018-11-12Paper
Independence and Efficient Domination on P6-free Graphs2018-07-16Paper
Polynomial kernels for deletion to classes of acyclic digraphs2018-05-24Paper
https://portal.mardi4nfdi.de/entity/Q46019072018-01-24Paper
Co-bipartite neighborhood edge elimination orderings2018-01-18Paper
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs2017-11-14Paper
https://portal.mardi4nfdi.de/entity/Q53695162017-10-17Paper
Polynomial kernelization for removing induced claws and diamonds2017-08-15Paper
Algorithms and Bounds for Very Strong Rainbow Coloring2017-03-01Paper
Shortcutting directed and undirected networks with a degree constraint2017-02-06Paper
https://portal.mardi4nfdi.de/entity/Q29578972017-01-30Paper
https://portal.mardi4nfdi.de/entity/Q29549922017-01-24Paper
Polynomial Kernelization for Removing Induced Claws and Diamonds2016-10-21Paper
What graphs are 2-dot product graphs?2016-10-14Paper
Complexity of metric dimension on planar graphs2016-09-16Paper
Induced disjoint paths in circular-arc graphs in linear time2016-07-05Paper
Parameterized complexity dichotomy for \textsc{Steiner Multicut}2016-06-13Paper
The firefighter problem on graph classes2015-12-28Paper
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time2015-09-09Paper
Finding disjoint paths in split graphs2015-09-04Paper
Induced Disjoint Paths in Claw-Free Graphs2015-05-20Paper
Parameterized complexity of induced graph matching on claw-free graphs2015-01-19Paper
Finding Disjoint Paths in Split Graphs2015-01-13Paper
Parameterized complexity of firefighting2014-06-10Paper
Integer representations of convex polygon intersection graphs2014-03-24Paper
https://portal.mardi4nfdi.de/entity/Q53966942014-02-03Paper
Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs2014-01-14Paper
Integer Representations of Convex Polygon Intersection Graphs2013-06-27Paper
Spanners of bounded degree graphs2013-04-04Paper
Structure of polynomial-time approximation2012-12-06Paper
Parameterized complexity of the spanning tree congestion problem2012-11-21Paper
Reducing a Target Interval to a Few Exact Queries2012-09-25Paper
On the Complexity of Metric Dimension2012-09-25Paper
Induced Disjoint Paths in Claw-Free Graphs2012-09-25Paper
Parameterized Complexity of Induced H-Matching on Claw-Free Graphs2012-09-25Paper
Induced disjoint paths in AT-free graphs2012-08-14Paper
k-Gap Interval Graphs2012-06-29Paper
Parameterized Complexity of Firefighting Revisited2012-06-15Paper
Domination When the Stars Are Out2011-07-06Paper
Convex Polygon Intersection Graphs2011-02-11Paper
Complexity Results for the Spanning Tree Congestion Problem2010-11-16Paper
PTAS for Weighted Set Cover on Unit Squares2010-09-10Paper
Faster Algorithms on Branch and Clique Decompositions2010-09-03Paper
https://portal.mardi4nfdi.de/entity/Q35794372010-08-06Paper
Domination in Geometric Intersection Graphs2008-04-15Paper
Better Approximation Schemes for Disk Graphs2007-09-07Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Erik Jan van Leeuwen