Recognizing circle graphs in polynomial time
Journal of the ACM (JACM)
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Split decomposition of undirected graphs
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Temporal Constraints: A Survey
Constraints
A Coarse-Grained Parallel Algorithm for Maximal Cliques in Circle Graphs
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Graph theoretic approach to parallel gene assembly
Discrete Applied Mathematics
Weighted interlace polynomials
Combinatorics, Probability and Computing
O(mlogn) split decomposition of strongly-connected graphs
Discrete Applied Mathematics
Computational processes in living cells: gene assembly in ciliates
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Algorithms and complexity for reasoning about time
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Counting hexagonal patches and independent sets in circle graphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Combinatorial models of gene assembly
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Journal of Combinatorial Theory Series B
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
Discrete Applied Mathematics
Hi-index | 0.00 |