( en | de | ru )

 

Disambiguation of "van Leeuwen, Erik Jan"

Author of the publication

copydeleteadd this publication to your clipboard
Upper bounding rainbow connection number by forest number.

, , , and . Discret. Math., 345 (7): 112829 (2022)

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)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , and . Algorithmica, 81 (2): 421-438 (2019)Induced Disjoint Paths in Claw-Free Graphs., , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 515-526. Springer, (2012)Solving Partition Problems Almost Always Requires Pushing Many Vertices Around., , , and . SIAM J. Discret. Math., 34 (1): 640-681 (2020)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)Algorithms for diversity and clustering in social networks through dot product graphs., , and . Soc. Networks, (2015)Induced Disjoint Paths in Claw-Free Graphs., , and . SIAM J. Discret. Math., 29 (1): 348-375 (2015)The Complexity of Diameter on H-free graphs., , and . CoRR, (2024)Algorithms and Bounds for Very Strong Rainbow Coloring., , , and . CoRR, (2017)What Graphs are 2-Dot Product Graphs?, , and . CoRR, (2015)