Recognizing circle graphs in polynomial time
Journal of the ACM (JACM)
Split decomposition of undirected graphs
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
O(m logn) Split Decomposition of Strongly Connected Graphs
Graph Theory, Computational Intelligence and Thought
Weighted interlace polynomials
Combinatorics, Probability and Computing
O(mlogn) split decomposition of strongly-connected graphs
Discrete Applied Mathematics
F-rank-width of (edge-colored) graphs
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Resources required for preparing graph states
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the minimum degree up to local complementation: bounds and complexity
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |