On the Complexity of (k, l)-Graph Sandwich Problems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
The list partition problem for graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Partitioning chordal graphs into independent sets and cliques
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
On decision and optimization (k, l)-graph sandwich problems
Discrete Applied Mathematics
Note: A note on the computational complexity of graph vertex partition
Discrete Applied Mathematics
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics
Partitions of graphs into trees
GD'06 Proceedings of the 14th international conference on Graph drawing
Discrete Applied Mathematics
Partitioning cographs into cliques and stable sets
Discrete Optimization
Partitioning extended P4-laden graphs into cliques and stable sets
Information Processing Letters
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
Cycle transversals in perfect graphs and cographs
Theoretical Computer Science
| Hi-index | 0.05 |