The Hamiltonian circuit problem for circle graphs in NP-complete
Information Processing Letters
The complexity of domination problems in circle graphs
Discrete Applied Mathematics
Independence and domination in polygon graphs
Discrete Applied Mathematics
Journal of Algorithms
Discrete Mathematics
Algorithms for VLSI Physical Design Automation
Algorithms for VLSI Physical Design Automation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Hardness of Approximating Independent Domination in Circle Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On the k-Colouring of Circle-Graphs
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Colouring Circle Graphs (Extended Abstract)
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Acyclic domination on bipartite permutation graphs
Information Processing Letters
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Discrete Applied Mathematics
Minimum weight feedback vertex sets in circle graphs
Information Processing Letters
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
Approximation and Online Algorithms
Analytic Combinatorics
On problems without polynomial kernels
Journal of Computer and System Sciences
Exponential time algorithms for the minimum dominating set problem on some graph classes
ACM Transactions on Algorithms (TALG)
Dynamic programming for graphs on surfaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Domination when the stars are out
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Dominating set is fixed parameter tractable in claw-free graphs
Theoretical Computer Science
Parameterized complexity of independence and domination on geometric graphs
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized complexity in multiple-interval graphs: domination
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Parameterized Complexity
| Hi-index | 0.00 |