Hypergraph languages of bounded degree
Journal of Computer and System Sciences
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Node rewriting in graphs and hypergraphs: a categorical framework
Theoretical Computer Science
The complexity of the Kn,n-problem for node replacement graph languages
Information and Computation
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
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
Automatic Graphs and Graph D0L-Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On a Generalization of Bi-Complement Reducible Graphs
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
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
Hyperedge Substitution in Basic Atom-Replacement Languages
ICGT '02 Proceedings of the First International Conference on Graph Transformation
On the Clique-Width of Perfect Graph Classes
WG '99 Proceedings of the 25th 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
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
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
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"
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
Automatic graphs and D0L-sequences of finite graphs
Journal of Computer and System Sciences
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Normal forms for context-free node-rewriting hypergraph grammars
Mathematical Structures in Computer Science
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)
On preservation under homomorphisms and unions of conjunctive queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theoretical Computer Science
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Exact Algorithms for a Loading Problem with Bounded Clique Width
INFORMS Journal on Computing
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
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
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
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)
Stability number of bull- and chair-free graphs revisited
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 a disparity between relative cliquewidth and relative NLC-width
Discrete Applied Mathematics
NLC-2 graph recognition and isomorphism
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Graphs of linear clique-width at most 3
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Reasoning in Argumentation Frameworks of Bounded Clique-Width
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Algorithms and theory of computation handbook
Faster algorithms on branch and clique decompositions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
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
On prime inductive classes of graphs
European Journal of Combinatorics
Graph grammars with string-regulated rewriting
Theoretical Computer Science
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd 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
Graphs of separability at most 2
Discrete Applied Mathematics
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
Towards fixed-parameter tractable algorithms for abstract argumentation
Artificial Intelligence
Survey: A survey of the algorithmic aspects of modular decomposition
Computer Science Review
Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
European Journal of Combinatorics
Mike fellows: weaving the web of mathematics and adventure
The Multivariate Algorithmic Revolution and Beyond
MSO decidability of multi-pushdown systems via split-width
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A SAT approach to clique-width
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.01 |