Representing point sets on the plane as permutations

DOI10.1016/J.IPL.2021.106228MaRDI QIDQ2059910zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 14 December 2021

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2021.106228

zbMATH Keywords

cryptographyencodingspartial orderspermutationspoint sets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 3997796
• On the heaviest increasing or decreasing subsequence of a permutation, and paths and matchings on weighted point sets
• Generating permutations with given ups and downs
• scientific article; zbMATH DE number 3880704
• scientific article; zbMATH DE number 2038722

Cites work

• A decomposition theorem for partially ordered sets
• A Simple Proof of a Theorem of Erdös and Szekeres^*
• Algorithmic graph theory and perfect graphs
• scientific article; zbMATH DE number 795114 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• On computing the length of longest increasing subsequences

Cited in

(1)

• scientific article; zbMATH DE number 7731164 (Why is no real title available?)

This page was built for publication: Representing point sets on the plane as permutations

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