SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The evaluation of first-order substitution is monadic second-order compatible
Theoretical Computer Science
Information Processing Letters
Bipartite graphs without a skew star
Discrete Mathematics
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,
On the Clique-Width of Graphs in Hereditary Classes
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Learnability and Definability in Trees and Similar Structures
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Ground Tree Rewriting Graphs of Bounded Tree Width
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Clique-Width of Perfect Graph Classes
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
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
New Graph Classes of Bounded Clique-Width
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On Robust Algorithms for the Maximum Weight Stable Set Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters
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
Independent domination in finitely defined classes of graphs
Theoretical Computer Science
Tree-width and the monadic quantifier hierarchy
Theoretical Computer Science - Logic and complexity in computer science
On variations of P4-sparse graphs
Discrete Applied Mathematics
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Fusion in relational structures and the verification of monadic second-order properties
Mathematical Structures in Computer Science
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree 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
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science - Parameterized and exact computation
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Recognizability, hypergraph operations, and logical types
Information and Computation
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
Branch-width, parse trees, and monadic second-order logic for matroids
Journal of Combinatorial Theory Series B
Vertex disjoint paths on clique-width bounded graphs
Theoretical Computer Science
Linear-time algorithms for the Hamiltonian problems on distance-hereditary 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
The relative clique-width of a graph
Journal of Combinatorial Theory Series B
On powers of graphs of bounded NLC-width (clique-width)
Discrete Applied Mathematics
Digraph measures: Kelly decompositions, games, and orderings
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
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
Boundary classes of planar graphs
Combinatorics, Probability and Computing
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
Efficient First-Order Model-Checking Using Short Labels
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Approximating rank-width and clique-width quickly
ACM Transactions on Algorithms (TALG)
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Efficient algorithms for Roman domination on some classes of graphs
Discrete Applied Mathematics
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Most General Edge Elimination Polynomial
Graph-Theoretic Concepts in Computer Science
Evaluations of Graph Polynomials
Graph-Theoretic Concepts in Computer Science
Connection Matrices for MSOL-Definable Structural Invariants
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
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
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
An extension of the bivariate chromatic polynomial
European Journal of Combinatorics
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)
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Recognizability, hypergraph operations, and logical types
Information and Computation
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Graph operations and monadic second-order logic: a survey
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Tree-width and optimization in bounded degree graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in 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
Finding branch-decompositions and rank-decompositions
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Graphs of linear clique-width at most 3
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Linear recurrence relations for graph polynomials
Pillars of computer science
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Rank-width and tree-width of H-minor-free graphs
European Journal of Combinatorics
Reasoning in Argumentation Frameworks of Bounded Clique-Width
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Faster algorithms on branch and clique decompositions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Compact labelings for efficient first-order model-checking
Journal of Combinatorial Optimization
The tree width of auxiliary storage
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Colouring vertices of triangle-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Theoretical Computer Science
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
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
The enumeration of vertex induced subgraphs with respect to the number of components
European Journal of Combinatorics
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
F-rank-width of (edge-colored) graphs
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Satisfiability of acyclic and almost acyclic CNF formulas (II)
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
On prime inductive classes of graphs
European Journal of Combinatorics
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing the tutte polynomial on graphs of bounded clique-width
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
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
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Clique-width for four-vertex forbidden subgraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Polynomial-time recognition of clique-width ≤3 graphs
Discrete Applied Mathematics
On the model-checking of monadic second-order formulas with edge set quantifications
Discrete Applied Mathematics
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
Discrete Applied Mathematics
On the OBDD size for graphs of bounded tree- and clique-width
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On switching classes, NLC-width, cliquewidth and treewidth
Theoretical Computer Science
Efficient algorithms for network localization using cores of underlying graphs
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Journal of Graph Theory
The packing coloring problem for (q,q-4) graphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Cluster vertex deletion: a parameterization between vertex cover and clique-width
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
When trees grow low: shrubs and fast MSO1
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
MSO decidability of multi-pushdown systems via split-width
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
A SAT approach to clique-width
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Model checking lower bounds for simple graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
FO model checking of interval graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Clique-width and edge contraction
Information Processing Letters
Colouring of graphs with Ramsey-type forbidden subgraphs
Theoretical Computer Science
Obstructions for linear rank-width at most 1
Discrete Applied Mathematics
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics
| Hi-index | 0.06 |