Discrete Applied Mathematics
The k-edge intersection graphs of paths in a tree
Discrete Applied Mathematics
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
Discrete Applied Mathematics
What Is between Chordal and Weakly Chordal Graphs?
Graph-Theoretic Concepts in Computer Science
Intersection models of weakly chordal graphs
Discrete Applied Mathematics
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Approximation algorithms for intersection graphs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Finding intersection models of weakly chordal graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
ACM Transactions on Algorithms (TALG)
Towards a comprehensive theory of conflict-tolerance graphs
Discrete Applied Mathematics
Recognizing vertex intersection graphs of paths on bounded degree trees
Discrete Applied Mathematics
| Hi-index | 0.05 |