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
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Information Processing Letters
From a simple elimination ordering to a strong elimination ordering in linear time
Information Processing Letters
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science
Generating effective symmetry-breaking predicates for search problems
Discrete Applied Mathematics
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science
Discrete Applied Mathematics
Probe Matrix Problems: Totally Balanced Matrices
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Theoretical Computer Science
A linear-time algorithm for paired-domination problem in strongly chordal graphs
Information Processing Letters
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Recognizing bipartite tolerance graphs in linear time
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Discrete Applied Mathematics
On the complexity and completeness of static constraints for breaking row and column symmetry
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A good characterization of squares of strongly chordal split graphs
Information Processing Letters
On the Complexity of Finding a Sun in a Graph
SIAM Journal on Discrete Mathematics
The multiple domination and limited packing problems in graphs
Information Processing Letters
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Discrete Applied Mathematics
Complexity of distance paired-domination problem in graphs
Theoretical Computer Science
Rainbow domination and related problems on strongly chordal graphs
Discrete Applied Mathematics
On opposition graphs, coalition graphs, and bipartite permutation graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |