The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Four pages are necessary and sufficient for planar graphs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Discrete Mathematics - Kleitman and combinatorics: a celebration
Algorithms for the fixed linear crossing number problem
Discrete Applied Mathematics
Sorting with two ordered stacks in series
Theoretical Computer Science
Restricted permutations and the wreath product
Discrete Mathematics
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Average-Case Complexity of Shellsort
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Algorithms for Pattern Involvement in Permutations
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Degree constrained book embeddings
Journal of Algorithms
Computing permutations with double-ended queues, parallel stacks and parallel queues
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Regular closed sets of permutations
Theoretical Computer Science
Generalized Stack Permutations
Combinatorics, Probability and Computing
A self-stabilizing algorithm for bridge finding
Distributed Computing
132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
Discrete Applied Mathematics
On the least exponential growth admitting uncountably many closed permutation classes
Theoretical Computer Science
An analysis of some linear graph layout heuristics
Journal of Heuristics
Queue layouts of iterated line directed graphs
Discrete Applied Mathematics
Approximating the fixed linear crossing number
Discrete Applied Mathematics
The Complexity of Sorting with Networks of Stacks and Queues
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Interconnection networks: a survey and assessment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
The enumeration of permutations sortable by pop stacks in parallel
Information Processing Letters
Queue Layout of Bipartite Graph Subdivisions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
European Journal of Combinatorics
Upper bounds on the queuenumber of k-ary n-cubes
Information Processing Letters
Succinct representation of labeled graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Sorting with networks of data structures
Discrete Applied Mathematics
On the page number of upward planar directed acyclic graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
Testing planarity by switching trains
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.01 |