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
Deciding Clique-Width for Graphs of Bounded Tree-Width
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Theoretical Computer Science
Tree-width and the monadic quantifier hierarchy
Theoretical Computer Science - Logic and complexity in computer science
Fusion in relational structures and the verification of monadic second-order properties
Mathematical Structures in Computer Science
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Journal of Combinatorial Theory Series B
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Vertex-minor reductions can simulate edge contractions
Discrete Applied Mathematics
Polynomial algorithms for protein similarity search for restricted mRNA structures
Information Processing Letters
Counting truth assignments of formulas of bounded tree-width or 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
Graph operations characterizing rank-width
Discrete Applied Mathematics
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
A Complete Characterisation of the Linear Clique-Width of Path Powers
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
New Plain-Exponential Time Classes for Graph Homomorphism
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On a disparity between relative cliquewidth and relative NLC-width
Discrete Applied Mathematics
Graph operations and monadic second-order logic: a survey
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Finding branch-decompositions and rank-decompositions
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Dynamic distance hereditary graphs using split decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Graphs of linear clique-width at most 3
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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
Maximal matching and path matching counting in polynomial time for graphs of bounded clique width
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Minimizing nLC-width is nP-complete
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Exploiting restricted linear structure to cope with the hardness of clique-width
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Discrete Applied Mathematics
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
European Journal of Combinatorics
| Hi-index | 0.00 |