Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Theoretical Computer Science
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Existential second-order logic over graphs: Charting the tractability frontier
Journal of the ACM (JACM)
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Graphs of bounded treewidth can be canonized in AC1
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
Hi-index | 0.00 |