( en | de | ru )

 

Disambiguation of "van Leeuwen, Erik Jan"

Author of the publication

copydeleteadd this publication to your clipboard
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs.

, , , , , and . SWAT, volume 294 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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

Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces., , and . CoRR, (2018)Structure of Polynomial-Time Approximation., and . Theory Comput. Syst., 50 (4): 641-674 (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)Planar Multiway Cut with Terminals on Few Faces., and . SODA, page 2032-2063. SIAM, (2022)What Graphs are 2-Dot Product Graphs?, , and . Electron. Notes Discret. Math., (2015)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)Induced Disjoint Paths in Claw-Free Graphs., , and . SIAM J. Discret. Math., 29 (1): 348-375 (2015)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)Separator Theorem and Algorithms for Planar Hyperbolic Graphs., , , , and . CoRR, (2023)