scientific article; zbMATH DE number 3997796
From MaRDI portal
Publication:4724636
Recommendations
Cited in
(29)- On minimum \(k\)-modal partitions of permutations
- Decomposing a set of points into chains, with applications to permutation and circle graphs
- Partitioning a sequence into few monotone subsequences
- The smallest upravel
- On cocolourings and cochromatic numbers of graphs
- Approximating minimum cocolorings.
- A framework for adaptive sorting
- Partitioning permutations into increasing and decreasing subsequences
- Decomposing sets of inversions
- Representing point sets on the plane as permutations
- The mixed page number of graphs
- The Preisach graph and longest increasing subsequences
- On the longest upsequence problem for permutations
- Compositions of positive integers n viewed as alternating sequences of increasing/decreasing partitions.
- scientific article; zbMATH DE number 3880704 (Why is no real title available?)
- On Minimum k-Modal Partitions of Permutations
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
- scientific article; zbMATH DE number 4031700 (Why is no real title available?)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- On increasing subsequences of minimal Erdős-Szekeres permutations
- On the heaviest increasing or decreasing subsequence of a permutation, and paths and matchings on weighted point sets
- Sorting shuffled monotone sequences
- scientific article; zbMATH DE number 5204618 (Why is no real title available?)
- Optimality program in segment and string graphs
- Generalized coloring of permutations
- A note on a Ramsey-type problem for sequences
- On partitions and presortedness of sequences
- Partitioning permutations into monotone subsequences
- A tutorial on the use of graph coloring for some problems in robotics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4724636)