Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Erik Jan van
    Last name: Leeuwen
    DBLP: 52/269
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 63  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen.
    Shortcutting directed and undirected networks with a degree constraint.
    Discrete Applied Mathematics 2017, Volume 220 (0) 2017
    Journal article
    Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen.
    Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna.
    Polynomial Kernelization for Removing Induced Claws and Diamonds.
    Theory Comput. Syst. 2017, Volume 60 (0) 2017
    Conference paper
    L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen.
    Algorithms and Bounds for Very Strong Rainbow Coloring.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Josep Díaz, Olli Pottonen, Maria J. Serna, Erik Jan van Leeuwen.
    Complexity of metric dimension on planar graphs.
    J. Comput. Syst. Sci. 2017, Volume 83 (0) 2017
    Journal article
    Matthias Mnich, Erik Jan van Leeuwen.
    Polynomial kernels for deletion to classes of acyclic digraphs.
    Discrete Optimization 2017, Volume 25 (0) 2017
    Journal article
    Wanchote Jiamjitrak, Erik Jan van Leeuwen.
    Co-Bipartite Neighborhood Edge Elimination Orderings.
    Electronic Notes in Discrete Mathematics 2017, Volume 61 (0) 2017
    Journal article
    Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen.
    The Firefighter problem on graph classes.
    Theor. Comput. Sci. 2016, Volume 613 (0) 2016
    Conference paper
    Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen.
    Independence and Efficient Domination on
    Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016 2016 (0) 2016
    Conference paper
    Matthias Mnich, Erik Jan van Leeuwen.
    Polynomial Kernels for Deletion to Classes of Acyclic Digraphs.
    33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France 2016 (0) 2016
    Conference paper
    Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen.
    Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs.
    15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland 2016 (0) 2016
    Conference paper
    Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen.
    Parameterized complexity dichotomy for Steiner Multicut.
    J. Comput. Syst. Sci. 2016, Volume 82 (0) 2016
    Journal article
    Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen.
    Induced disjoint paths in circular-arc graphs in linear time.
    Theor. Comput. Sci. 2016, Volume 640 (0) 2016
    Conference paper
    Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese.
    Approximation and parameterized algorithms for geometric independent set with shrinking.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen.
    Parameterized Complexity Dichotomy for Steiner Multicut.
    32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany 2015 (0) 2015
    Journal article
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna.
    Polynomial kernelization for removing induced claws and diamonds.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen.
    Induced Disjoint Paths in Claw-Free Graphs.
    SIAM J. Discrete Math. 2015, Volume 29 (0) 2015
    Journal article
    Matthew Johnson 0002, Daniël Paulusma, Erik Jan van Leeuwen.
    Algorithms for diversity and clustering in social networks through dot product graphs.
    Social Networks 2015, Volume 41 (0) 2015
    Journal article
    Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei.
    Finding Disjoint Paths in Split Graphs.
    Theory Comput. Syst. 2015, Volume 57 (0) 2015
    Conference paper
    Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen.
    Independence and Efficient Domination on P
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Matthew Johnson 0002, Erik Jan van Leeuwen, Daniël Paulusma.
    What Graphs are 2-Dot Product Graphs?
    Electronic Notes in Discrete Mathematics 2015, Volume 49 (0) 2015
    Conference paper
    Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna.
    Polynomial Kernelization for Removing Induced Claws and Diamonds.
    Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers 2016 (0) 2015
    Conference paper
    Matthew Johnson 0002, Daniël Paulusma, Erik Jan van Leeuwen.
    What Graphs are 2-Dot Product Graphs?
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Pinar Heggernes, Pim van 't Hof, Erik Jan van Leeuwen, Reza Saei.
    Finding Disjoint Paths in Split Graphs.
    SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings 2014 (0) 2014
    Journal article
    Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen.
    Induced Disjoint Paths in Circular-Arc Graphs in Linear Time.
    CoRR 2014, Volume 0 (0) 2014
    Show item 1 to 25 of 63  

    Your query returned 63 matches in the database.