Efficient decision procedures for graph properties on context-free graph languages
Journal of the ACM (JACM)
The complexity of connectivity problems on context-free graph languages
Journal of Computer and System Sciences
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
The complexity of approximating pspace-complete problems for hierarchical specifications
Nordic Journal of Computing
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Complexity of Some Basic Problems for Dynamic Process Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
The Expressive Power and Complexity of Dynamic Process Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Information and Computation
The complexity of tree automata and XPath on grammar-compressed trees
Theoretical Computer Science - Implementation and application of automata
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Model-checking hierarchical structures
Journal of Computer and System Sciences
Fixpoint logics on hierarchical structures
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |