The interlace polynomial: a new graph polynomial
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The interlace polynomial of a graph
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
APX-hardness of domination problems in circle graphs
Information Processing Letters
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Discrete Applied Mathematics
Intersection representations of matrices by subtrees and unicycles on graphs
Journal of Discrete Algorithms
Minimum weight feedback vertex sets in circle graphs
Information Processing Letters
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
APX-hardness of domination problems in circle graphs
Information Processing Letters
Interlace polynomials: Enumeration, unimodality and connections to codes
Discrete Applied Mathematics
Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Counting hexagonal patches and independent sets in circle graphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Coloring a graph using split decomposition
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Collective additive tree spanners for circle graphs and polygonal graphs
Discrete Applied Mathematics
Parameterized domination in circle graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
Discrete Applied Mathematics
Parameterized Domination in Circle Graphs
Theory of Computing Systems
Hi-index | 0.00 |