An incremental linear-time algorithm for recognizing interval graphs
SIAM Journal on Computing
An optimal greedy heuristic to color interval graphs
Information Processing Letters
SIAM Journal on Discrete Mathematics
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
SIAM Journal on Computing
A Simple Test for Interval Graphs
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
A New Simple Linear Algorithm to Recognize Interval Graphs
CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
LBFS orderings and cocomparability graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Theoretical Computer Science
Certifying algorithms for recognizing interval graphs and permutation graphs
SODA '03 Proceedings of the fourteenth 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
Recognizing Graphs without Asteroidal Triples
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
Discrete Applied Mathematics
Fast algorithms for identifying maximal common connected sets of interval graphs
Discrete Applied Mathematics
Recognizing and representing proper interval graphs in parallel using merging and sorting
Discrete Applied Mathematics
Discrete Applied Mathematics
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
The clique-separator graph for chordal graphs
Discrete Applied Mathematics
A simple algorithm to find Hamiltonian cycles in proper interval graphs
Information Processing Letters
Discrete Applied Mathematics
On end-vertices of Lexicographic Breadth First Searches
Discrete Applied Mathematics
Approximating bandwidth by mixing layouts of interval graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Referee assignment in sports leagues
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
Max-coloring and online coloring with bandwidths on interval graphs
ACM Transactions on Algorithms (TALG)
Listing chordal graphs and interval graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Algorithms for the extraction of synteny blocks from comparative maps
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Integral mixed unit interval graphs
Discrete Applied Mathematics
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm
INFORMS Journal on Computing
| Hi-index | 0.00 |