Sorting Using Networks of Queues and Stacks

Cited in

(74)

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

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)