| Publication | Date of Publication | Type |
|---|
Vector connectivity in graphs
Networks | 2018-05-23 | Paper |
| Editing to Eulerian graphs | 2017-04-25 | Paper |
The price of connectivity for feedback vertex set
Discrete Applied Mathematics | 2017-03-15 | Paper |
Editing to a planar graph of given degrees
Journal of Computer and System Sciences | 2016-12-28 | Paper |
On the computational complexity of vertex integrity and component order connectivity
Algorithmica | 2016-12-21 | Paper |
Maximal induced matchings in triangle-free graphs
Journal of Graph Theory | 2016-11-16 | Paper |
Editing to Eulerian graphs
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Editing to a planar graph of given degrees
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Editing to a planar graph of given degrees
Lecture Notes in Computer Science | 2015-10-20 | Paper |
On the computational complexity of vertex integrity and component order connectivity
Lecture Notes in Computer Science | 2015-09-11 | Paper |
Hadwiger number of graphs with small chordality
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Maximal induced matchings in triangle-free graphs
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Finding disjoint paths in split graphs
Theory of Computing Systems | 2015-09-04 | Paper |
On the parameterized complexity of finding separators with non-hereditary properties
Algorithmica | 2015-09-02 | Paper |
Hadwiger number of graphs with small chordality
SIAM Journal on Discrete Mathematics | 2015-08-17 | Paper |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Theoretical Computer Science | 2015-06-10 | Paper |
Computing the metric dimension for chain graphs
Information Processing Letters | 2015-06-02 | Paper |
Modifying a graph using vertex elimination
Algorithmica | 2015-05-21 | Paper |
Finding disjoint paths in split graphs
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Induced subgraph isomorphism on proper interval and bipartite permutation graphs
Theoretical Computer Science | 2014-12-02 | Paper |
Parameterized complexity of three edge contraction problems with degree constraints
Acta Informatica | 2014-11-14 | Paper |
Forbidden induced subgraphs and the price of connectivity for feedback vertex set
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Graph classes and Ramsey numbers
Discrete Applied Mathematics | 2014-08-22 | Paper |
Detecting fixed patterns in chordal graphs in polynomial time
Algorithmica | 2014-07-03 | Paper |
| scientific article; zbMATH DE number 6302975 (Why is no real title available?) | 2014-06-11 | Paper |
Contracting chordal graphs and bipartite graphs to paths and trees
Discrete Applied Mathematics | 2014-05-05 | Paper |
Characterizing graphs of small carving-width
Discrete Applied Mathematics | 2014-04-22 | Paper |
Obtaining a bipartite graph by contracting few edges
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Contracting graphs to paths and trees
Algorithmica | 2014-03-25 | Paper |
Induced subtrees in interval graphs
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical Computer Science | 2014-01-13 | Paper |
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Theoretical Computer Science | 2013-12-11 | Paper |
Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints
Parameterized and Exact Computation | 2013-12-10 | Paper |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Contracting chordal graphs and bipartite graphs to paths and trees
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Vector connectivity in graphs
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Proper interval vertex deletion
Algorithmica | 2013-05-16 | Paper |
Obtaining planarity by contracting few edges
Theoretical Computer Science | 2013-04-17 | Paper |
Induced immersions
Algorithms and Computation | 2013-03-21 | Paper |
Choosability on \(H\)-free graphs
Information Processing Letters | 2013-03-20 | Paper |
Exact algorithms for finding longest cycles in claw-free graphs
Algorithmica | 2013-03-05 | Paper |
Computing the cutwidth of bipartite permutation graphs in linear time
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
On the parameterized complexity of finding separators with non-hereditary properties
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
How to eliminate a graph
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Characterizing Graphs of Small Carving-Width
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Ramsey numbers for line graphs and perfect graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Obtaining planarity by contracting few edges
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Obtaining planarity by contracting few edges
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Computing role assignments of proper interval graphs in polynomial time
Journal of Discrete Algorithms | 2012-09-13 | Paper |
| Obtaining a bipartite graph by contracting few edges | 2012-08-31 | Paper |
Computing minimum geodetic sets of proper interval graphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Contracting graphs to paths and trees
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Edge contractions in subclasses of chordal graphs
Discrete Applied Mathematics | 2012-05-30 | Paper |
On graph contractions and induced minors
Discrete Applied Mathematics | 2012-05-11 | Paper |
Finding induced paths of given parity in claw-free graphs
Algorithmica | 2012-04-26 | Paper |
Finding contractions and induced minors in chordal graphs via disjoint paths
Algorithms and Computation | 2011-12-16 | Paper |
Parameterized complexity of vertex deletion into perfect graph classes
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Edge contractions in subclasses of chordal graphs
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Computing role assignments of proper interval graphs in polynomial time
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Constructing fair round robin tournaments with a minimum number of breaks
Operations Research Letters | 2010-12-23 | Paper |
Computing the cutwidth of bipartite permutation graphs in linear time
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Computing role assignments of chordal graphs
Theoretical Computer Science | 2010-10-11 | Paper |
A new characterization of \(P_{6}\)-free graphs
Discrete Applied Mathematics | 2010-05-25 | Paper |
On contracting graphs to fixed pattern graphs
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Fast exact algorithms for Hamiltonicity in claw-free graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Finding induced paths of given parity in claw-free graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Partitioning graphs into connected parts
Theoretical Computer Science | 2009-11-06 | Paper |
Computing Role Assignments of Chordal Graphs
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Partitioning Graphs into Connected Parts
Computer Science - Theory and Applications | 2009-08-18 | Paper |
A New Characterization of P 6-Free Graphs
Lecture Notes in Computer Science | 2008-07-10 | Paper |
