An O(n2) time algorithm for the 2-chain cover problem and related problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Bipartite graphs without a skew star
Discrete Mathematics
Decompositions for the edge colouring of reduced indifference graphs
Theoretical Computer Science - Latin American theoretical informatics
On variations of P4-sparse graphs
Discrete Applied Mathematics
Induced matchings in asteroidal triple-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Information Processing Letters
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics
Probe threshold and probe trivially perfect graphs
Theoretical Computer Science
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
Information Processing Letters
Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The black-and-white coloring problem on distance-hereditary graphs and strongly chordal graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Black-and-white threshold graphs
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
On minimal forbidden subgraph characterizations of balanced graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |