( en | de | ru )

 

Disambiguation of "van Leeuwen, Erik Jan"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of metric dimension on planar graphs.

, , , and . J. Comput. Syst. Sci., 83 (1): 132-158 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Imalina Leeuwen

Jan-Erik Schmutz

Adhäsions- und Abriebuntersuchungen mittels rasterkraftmikroskopischer Techniken auf der Mikro- und Nanoskala. Uni Münster, (2009)

Peter Leeuwen

Jan van Neerven

Jan van Weeren

 

Other publications of authors with the same name

Structure of Polynomial-Time Approximation., and . Theory Comput. Syst., 50 (4): 641-674 (2012)Parameterized Complexity of Induced H-Matching on Claw-Free Graphs., , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 624-635. Springer, (2012)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , and . Algorithmica, 81 (2): 421-438 (2019)Integer Representations of Convex Polygon Intersection Graphs., , and . SIAM J. Discret. Math., 27 (1): 205-231 (2013)Algorithms and Bounds for Very Strong Rainbow Coloring., , , and . CoRR, (2017)What Graphs are 2-Dot Product Graphs?, , and . CoRR, (2015)Solving Partition Problems Almost Always Requires Pushing Many Vertices Around., , , and . SIAM J. Discret. Math., 34 (1): 640-681 (2020)Induced Disjoint Paths in Claw-Free Graphs., , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 515-526. Springer, (2012)Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs., , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 130-140. Springer, (2013)Few induced disjoint paths for H-free graphs., , , and . Theor. Comput. Sci., (2023)