Embedding de Bruijn and shuffle-exchange graphs in five pages (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Orderly spanning trees with applications to graph encoding and graph drawing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A genetic algorithm for finding the pagenumber of interconnection networks
Journal of Parallel and Distributed Computing
The longest common subsequence problem for sequences with nested arc annotations
Journal of Computer and System Sciences - Computational biology 2002
Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
Discrete Mathematics
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Degree constrained book embeddings
Journal of Algorithms
Curve-constrained drawings of planar graphs
Computational Geometry: Theory and Applications
Embedding the incomplete hypercube in books
Information Processing Letters
The Linear Layout of the Incomplete Hypercube
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
On simultaneous planar graph embeddings
Computational Geometry: Theory and Applications
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Improved book-embeddings of incomplete hypercubes
Discrete Applied Mathematics
Embedding the incomplete hypercube in books
Information Processing Letters
Computing upward topological book embeddings of upward planar digraphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A metric for rooted trees with unlabeled vertices based on nested parentheses
Theoretical Computer Science
Bijections for Baxter families and related objects
Journal of Combinatorial Theory Series A
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Plane drawings of queue and deque graphs
GD'10 Proceedings of the 18th international conference on Graph drawing
Graph treewidth and geometric thickness parameters
GD'05 Proceedings of the 13th international conference on Graph Drawing
Characterisations and examples of graph classes with bounded expansion
European Journal of Combinatorics
Fixed-parameter algorithms for protein similarity search under mRnA structure constraints
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Planar graphs, via well-orderly maps and trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Characterizations of deque and queue graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Small point sets for simply-nested planar graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
On the page number of upward planar directed acyclic graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
Implementing a partitioned 2-page book embedding testing algorithm
GD'12 Proceedings of the 20th international conference on Graph Drawing
Book drawings of complete bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |