SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
On the complexity of the maximum cut problem
Nordic Journal of Computing
Deciding Clique-Width for Graphs of Bounded Tree-Width
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Relationship between Clique-Width and Treewidth
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
log n-Approximative NLCk-Decomposition in O(n2k+1) Time
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
NLC2-Decomposition in Polynomial Time
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
On the relationship between NLC-width and linear NLC-width
Theoretical Computer Science
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Vertex disjoint paths on clique-width bounded graphs
Theoretical Computer Science
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Note: Characterizations for restricted graphs of NLC-width 2
Theoretical Computer Science
Exact Algorithms for a Loading Problem with Bounded Clique Width
INFORMS Journal on Computing
On powers of graphs of bounded NLC-width (clique-width)
Discrete Applied Mathematics
Approximating rank-width and clique-width quickly
ACM Transactions on Algorithms (TALG)
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The NLC-width and clique-width for powers of graphs of bounded tree-width
Discrete Applied Mathematics
Graph operations characterizing rank-width
Discrete Applied Mathematics
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
On a disparity between relative cliquewidth and relative NLC-width
Discrete Applied Mathematics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Graph operations characterizing rank-width and balanced graph expressions
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The clique-width of tree-power and leaf-power graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
NLC-2 graph recognition and isomorphism
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Finding branch-decompositions and rank-decompositions
ESA'07 Proceedings of the 15th annual European conference on Algorithms
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Minimizing nLC-width is nP-complete
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics
On switching classes, NLC-width, cliquewidth and treewidth
Theoretical Computer Science
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
When trees grow low: shrubs and fast MSO1
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A SAT approach to clique-width
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |