Hierarchical planarity testing algorithms
Journal of the ACM (JACM)
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
The complexity of approximating pspace-complete problems for hierarchical specifications
Nordic Journal of Computing
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Reachability in Graphs with Bounded Independence Number
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The complexity of membership problems for circuits over sets of integers
Theoretical Computer Science
Linear connectivity problems in directed hypergraphs
Theoretical Computer Science
Easy problems for grid-structured graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Satisfiability of algebraic circuits over sets of natural numbers
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Satisfiability of algebraic circuits over sets of natural numbers
Discrete Applied Mathematics
Computational complexity of long paths and cycles in faulty hypercubes
Theoretical Computer Science
Decidable membership problems for finite recurrent systems over sets of naturals
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Parsing Boolean grammars over a one-letter alphabet using online convolution
Theoretical Computer Science
The complexity of membership problems for circuits over sets of positive numbers
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Equivalence problems for circuits over sets of natural numbers
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Hi-index | 0.00 |