Construction of probe interval models
SODA '02 Proceedings of the thirteenth 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
Signed and minus clique-transversal functions on graphs
Information Processing Letters
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On the complexity of signed and minus total domination in graphs
Information Processing Letters
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
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Discrete Applied Mathematics
Arboricity, h-index, and dynamic algorithms
Theoretical Computer Science
Efficiently computing a linear extension of the sub-hierarchy of a concept lattice
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Very fast instances for concept generation
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Complexity of distance paired-domination problem in graphs
Theoretical Computer Science
Rainbow domination and related problems on strongly chordal graphs
Discrete Applied Mathematics
| Hi-index | 0.90 |