Sorting Using Networks of Queues and Stacks

Cited in

(74)

Stack and queue numbers of graphs revisited
Klein book embeddings
Passing through a stack \(k\) times with reversals
Regular closed sets of permutations.
Two first-order logics of permutations
Sorting with a popqueue
On the page number of upward planar directed acyclic graphs
Upper bounds on the queue number of \(k\)-ary \(n\)-cubes
Planar graphs of bounded degree have bounded queue number
Restricted permutations
Pattern-avoiding permutations and Brownian excursion. I: Shapes and fluctuations.
Enumerating permutations sortable by k passes through a pop-stack
The enumeration of permutations sortable by pop stacks in parallel
Packing sets of patterns
Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
Pattern matching for permutations
Sorting via shuffles with a cut after the longest increasing prefix
Pattern matching for permutations
Forbidden substructures and combinatorial dichotomies: WQO and universality
On the upward book thickness problem: combinatorial and complexity results
132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
Sorting with networks of data structures
Book embeddings of regular graphs
Sorting using networks of deques
Permutations of a multiset avoiding permutations of length 3
An infinite antichain of planar tanglegrams
A survey on book-embedding of planar graphs
Characterization and enumeration of preimages under the \texttt{Queuesort} algorithm
Parameterized algorithms for queue layouts
Stack sorting with increasing and decreasing stacks
Approximating the fixed linear crossing number
Labelled well-quasi-order for permutation classes
Succinct representation of labeled graphs
2-stack sorting is polynomial
Passing through a stack k times
Queue layouts of iterated line directed graphs
Operators of equivalent sorting power and related Wilf-equivalences
Enumerating permutations sortable by \(k\) passes through a pop-stack
Improving order with queues
Foot-sorting for socks
Embedding planar graphs in four pages
Geometric parameters of bipartite suspensions
Permutations sortable by deques and by two stacks in parallel
An analysis of some linear graph layout heuristics
Finding and counting permutations via CSPs
Permutations sortable by two stacks in parallel and quarter plane walks
On the stack layouts of toroidal grids
Optimum embedding of complete graphs in books
On the least exponential growth admitting uncountably many closed permutation classes
Signed enumeration of upper-right corners in path shuffles
Average-case analysis of algorithms using Kolmogorov complexity
Permutations generated by stacks and deques
Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
Graph layouts via layered separators
Permutations generated by token passing in graphs
Stieltjes moment sequences for pattern-avoiding permutations
Queue layouts of planar 3-trees
Queue layouts of planar 3-trees
Algorithms for the fixed linear crossing number problem
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms
Permutation pattern avoidance and the Catalan triangle
Almost avoiding permutations
Using Euler’s Formula to Find the Lower Bound of the Page Number
Sorting by shuffling methods and a queue
Priority queues with binary priorities
New equivalences for pattern avoiding involutions
How to sort by walking and swapping on paths and trees
Patterns in random permutations avoiding some other patterns
Succinct Representation of Labeled Graphs
Smooth heaps and a dual view of self-adjusting data structures
Preimages under the Queuesort algorithm
Two-stack-sorting with pop stacks
Sorting with two ordered stacks in series.
Parameterized Algorithms for Queue Layouts

This page was built for publication: Sorting Using Networks of Queues and Stacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5654999)