SEARCH

SEARCH BY CITATION

Cited in:

CrossRef

This article has been cited by:

  1. 1
    Pinar Heggernes, Pim van ’t Hof, Benjamin Lévêque, Christophe Paul, Contracting chordal graphs and bipartite graphs to paths and trees, Discrete Applied Mathematics, 2014, 164, 444

    CrossRef

  2. 2
    Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma, Detecting Fixed Patterns in Chordal Graphs in Polynomial Time, Algorithmica, 2013,

    CrossRef

  3. 3
    Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Detecting induced minors in AT-free graphs, Theoretical Computer Science, 2013, 482, 20

    CrossRef

  4. 4
    Petr A. Golovach, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos, Increasing the minimum degree of a graph by contractions, Theoretical Computer Science, 2013, 481, 74

    CrossRef

  5. 5
    Pinar Heggernes, Pim Van 'T Hof, Daniel Lokshtanov, Christophe Paul, Obtaining a Bipartite Graph by Contracting Few Edges, SIAM Journal on Discrete Mathematics, 2013, 27, 4, 2143

    CrossRef

  6. 6
    Petr A. Golovach, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos, Containment relations in split graphs, Discrete Applied Mathematics, 2012, 160, 1-2, 155

    CrossRef

  7. 7
    Jiří Fiala, Marcin Kamiński, Daniël Paulusma, Detecting induced star-like minors in polynomial time, Journal of Discrete Algorithms, 2012, 17, 74

    CrossRef

  8. 8
    Rémy Belmonte, Pinar Heggernes, Pim van ’t Hof, Edge contractions in subclasses of chordal graphs, Discrete Applied Mathematics, 2012, 160, 7-8, 999

    CrossRef

  9. 9
    Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos, On graph contractions and induced minors, Discrete Applied Mathematics, 2012, 160, 6, 799

    CrossRef

  10. 10
    Pinar Heggernes, Pim van ʼt Hof, Benjamin Lévêque, Paul Christophe, Contracting chordal graphs and bipartite graphs to paths and trees, Electronic Notes in Discrete Mathematics, 2011, 37, 87

    CrossRef

  11. 11
    Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos, Contracting planar graphs to contractions of triangulations, Journal of Discrete Algorithms, 2011, 9, 3, 299

    CrossRef

  12. 12
    Svetlana Artemova, Sergei Grudinin, Stephane Redon, Fast construction of assembly trees for molecular graphs, Journal of Computational Chemistry, 2011, 32, 8
  13. 13
    Asaf Levin, Daniel Paulusma, Gerhard J. Woeginger, The computational complexity of graph contractions II: Two tough polynomially solvable cases, Networks, 2008, 52, 1