# List of publications

**Journal papers**- Edge Contractions in Subclasses of Chordal Graphs

(with Pinar Heggernes and Pim van’t Hof)

Discrete Applied Mathematics 160(7–8), pp. 999-1010 (2012) [doi] [preprint] - Graph Classes with Structured Neighborhood and Algorithmic Applications

(with Martin Vatshelle)

Theoretical Computer Science 511, pp.54-65 (2013) [doi] [preprint] - Characterizing Graphs of Small Carving-Width

(with Pim van’t Hof, Marcin Kaminski, Daniel Paulusma and Dimitrios Thilikos)

Discrete Applied Mathematics 161(13–14), pp. 1888-1893 (2013) [doi] [preprint] - Detecting fixed patterns in chordal graphs in polynomial time

(with Petr A. Golovach, Pinar Heggernes, Pim van’t Hof, Marcin Kamiński

and Daniël Paulusma)

Algorithmica 69(3), pp. 501-521 (2014) [doi] [preprint] - Ramsey numbers for graph classes

(with Pinar Heggernes, Pim van’t Hof, Arash Rafiey and Reza Saei)

Discrete Applied Mathematics 173, pp. 16-27 (2014) [doi] [preprint] - Parameterized Complexity of Three Edge Contraction Problems with Degree Constraints

(with Petr A. Golovach, Pim van’t Hof and Daniel Paulusma)

Acta Informatica 51(7): 473-497 (2014) [doi] [preprint]

- Edge Contractions in Subclasses of Chordal Graphs
- Submitted:
- The Price of Connectivity for Feedback Vertex Set [preprint]

(with Petr A. Golovach, Pim van’t Hof and Daniel Paulusma) - Polynomial-time approximability of the k-Sink Location problem [preprint]

(with Yuya Higashikawa, Naoki Katoh and Yoshio Okamoto)

- The Price of Connectivity for Feedback Vertex Set [preprint]
**Conference papers**- Edge Contractions in Subclasses of Chordal Graphs

(with Pinar Heggernes and Pim van’t Hof)

In Proceedings of TAMC 2011 [doi] - Graph Classes with Structured Neighborhood and Algorithmic Applications

(with Martin Vatshelle)

In Proceedings of WG 2011 [doi]

Best Student Paper Award - Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths

(with Petr A. Golovach, Pinar Heggernes, Pim van’t Hof, Marcin Kamiński

and Daniël Paulusma)

In Proceedings of ISAAC 2011 [doi] - Ramsey numbers for line graphs and perfect graphs

(with Pinar Heggernes, Pim van’t Hof and Reza Saei)

In Proceedings of COCOON 2012 [doi] - Characterizing Graphs of Small Carving-Width

(with Pim van’t Hof, Marcin Kaminski, Daniel Paulusma and Dimitrios Thilikos)

In Proceedings of COCOA 2012 [doi] - Induced Immersions

(with Pim van’t Hof, Marcin Kaminski)

In Proceedings of ISAAC 2012 [doi] [preprint] - The Price of Connectivity for Feedback Vertex Set

(with Pim van’t Hof, Marcin Kaminski and Daniel Paulusma)

In Proceedings of Eurocomb 2013 [doi] - Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints

(with Petr A. Golovach, Pim van’t Hof and Daniel Paulusma)

In Proceedings of IPEC 2013 [doi] - Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set

(with Pim van’t Hof, Marcin Kaminski and Daniel Paulusma)

In Proceedings of MFCS 2014 [doi] - Induced Minor Free Graphs: Isomorphism and Clique-width

(with Yota Otachi and Pascal Schweitzer)

Accepted at WG 2015 - Metric Dimension of Bounded Width Graphs

(with Fedor Fomin, Petr A. Golovach and M.S. Ramanoujan)

In proceedings of MFCS 2015 [doi]

Best Paper Award

- Edge Contractions in Subclasses of Chordal Graphs
**Theses**

You can also get pretty much the same kind of information from DBLP.