Sorting Using Networks of Queues and Stacks
Journal of the ACM (JACM)
On the pagenumber of planar graphs
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Two tapes are better than one for off-line Turing machines
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The page number of genus g graphs is (g)
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Edge coloring planar graphs with two outerplanar subgraphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The pagenumber of genus g graphs is O(g)
Journal of the ACM (JACM)
Algorithms for the fixed linear crossing number problem
Discrete Applied Mathematics
Compact Routing Tables for Graphs of Bounded Genus
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Approximating the fixed linear crossing number
Discrete Applied Mathematics
Succinct representation of labeled graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Characterizations of deque and queue graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
How to efficiently implement dynamic circuit specialization systems
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |