List of publications
- Journal papers
- Edge Contractions in Subclasses of Chordal Graphs
(with Pinar Heggernes and Pim van’t Hof)
In Discrete Applied Mathematics [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, to appear [doi] [preprint] - Graph Classes with Structured Neighborhood and Algorithmic Applications
(with Martin Vatshelle)
Theoretical Computer Science, to appear [doi] [preprint] - Characterizing Graphs of Small Carving-Width
(with Pim van’t Hof, Marcin Kaminski, Daniel Paulusma and Dimitrios Thilikos)
Discrete Applied Mathematics, to appear [preprint]
- Edge Contractions in Subclasses of Chordal Graphs
- Submitted:
- Ramsey numbers for graph classes [preprint]
(with Pinar Heggernes, Pim van’t Hof, Arash Rafiey and Reza Saei)
- Ramsey numbers for graph classes [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)
To appear in Proceedings of Eurocomb 2013
Best Paper Award
- Edge Contractions in Subclasses of Chordal Graphs
- Theses
- Master thesis : Boolean-width of special graph classes: Applications for solving NP-hard problems on graph classes in polynomial time (pdf)
You can also get pretty much the same kind of information from DBLP.
