On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets

DOI10.1007/978-3-642-34191-5_17zbMath1374.05011OpenAlexW1865970549MaRDI QIDQ4899276

Jorge Urrutia, Toshinori Sakai

Publication date: 7 January 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34191-5_17

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Long non-crossing configurations in the plane
• On unimodal subsequences
• Ramsey-type results for geometric graphs. I
• Monotonic Polygons and Paths in Weighted Point Sets
• The Quest of the Perfect Square

This page was built for publication: On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets