Rollercoasters and Caterpillars
From MaRDI portal
Publication:5002684
DOI10.4230/LIPIcs.ICALP.2018.18zbMath1499.68418arXiv1801.08565OpenAlexW2963026159MaRDI QIDQ5002684
Ahmad Biniaz, Dirk Nowotka, Florin Manea, Robert Cummings, Anna Lubiw, Therese C. Biedl, Jeffrey O. Shallit
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1801.08565
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms on strings (68W32)
Related Items (4)
Longest common rollercoasters ⋮ Longest bordered and periodic subsequences ⋮ Unnamed Item ⋮ Fast and longest rollercoasters
Cites Work
- Patterns in permutations and words.
- Counting and generating permutations in regular classes
- On computing the length of longest increasing subsequences
- Preserving order in a forest in less than logarithmic time and linear space
- Descent pattern avoidance
- Fast computation of a longest increasing subsequence and application
- Orthogeodesic point-set embedding of trees
- The Surprising Mathematics of Longest Increasing Subsequences
- Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Rollercoasters and Caterpillars