SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Counting H-colorings of partial k-trees
Theoretical Computer Science
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Parameterized Counting Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
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
NLC2-Decomposition in Polynomial Time
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Farrell polynomials on graphs of bounded tree width
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
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
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On finding short resolution refutations and small unsatisfiable subsets
Theoretical Computer Science - Parameterized and exact computation
The relative clique-width of a graph
Journal of Combinatorial Theory Series B
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Fast Counting with Bounded Treewidth
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Connection Matrices for MSOL-Definable Structural Invariants
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
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
A Practical Approach to Courcelle's Theorem
Electronic Notes in Theoretical Computer Science (ENTCS)
Algorithms for propositional model counting
Journal of Discrete Algorithms
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Kernelizations for parameterized counting problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Tree-width in Algebraic Complexity
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Linear recurrence relations for graph polynomials
Pillars of computer science
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the expressive power of CNF formulas of bounded tree- and clique-width
Discrete Applied Mathematics
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Linear-time algorithms for graphs of bounded rankwidt: a fresh look using game theory
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
An extended tree-width notion for directed graphs related to the computation of permanents
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Characterizing arithmetic circuit classes by constraint satisfaction problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The complexity of the cover polynomials for planar graphs of bounded degree
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Automata for monadic second-order model-checking
RP'11 Proceedings of the 5th international conference on Reachability problems
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory
The Multivariate Algorithmic Revolution and Beyond
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A dichotomy theorem for homomorphism polynomials
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the edge cover polynomial of a graph
European Journal of Combinatorics
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
Abstract argumentation via monadic second order logic
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
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
| Hi-index | 0.00 |