Approximation algorithms for the achromatic number
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On approximating the achromatic number
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of the maximum cut problem
Nordic Journal of Computing
Disjoint paths in circular arc graphs
Nordic Journal of Computing
On the b-Chromatic Number of Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
Efficient approximation algorithms for the achromatic number
Theoretical Computer Science - Approximation and online algorithms
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
Theoretical Computer Science
On the b-continuity property of graphs
Discrete Applied Mathematics
Note: The harmonious coloring problem is NP-complete for interval and permutation graphs
Discrete Applied Mathematics
On the pseudo-achromatic number problem
Theoretical Computer Science
On the Pseudo-achromatic Number Problem
Graph-Theoretic Concepts in Computer Science
Harmonious coloring on subclasses of colinear graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Polar permutation graphs are polynomial-time recognisable
European Journal of Combinatorics
Bounds for the b-chromatic number of G-v
Discrete Applied Mathematics
Computing and counting longest paths on circular-arc graphs in polynomial time
Discrete Applied Mathematics
Hi-index | 0.89 |