Complexity of graph partition problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
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
List matrix partitions of chordal graphs
Theoretical Computer Science - Graph colorings
Journal of Algorithms
Note: A note on the computational complexity of graph vertex partition
Discrete Applied Mathematics
On the minimum monochromatic or multicolored subgraph partition problems
Theoretical Computer Science
Journal of Algorithms
Discrete Applied Mathematics
Fixed-Parameter algorithms for cochromatic number and disjoint rectangle stabbing
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Complexity of cycle transverse matching problems
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Two fixed-parameter algorithms for the cocoloring problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
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
Graph partitions with prescribed patterns
European Journal of Combinatorics
Information and Computation
Fixed-parameter algorithms for the cocoloring problem
Discrete Applied Mathematics
| Hi-index | 0.06 |