1 citations · 1 across the 2 of their papers we have counts for
3 papers
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak +3
Greedy BST (or simply Greedy) is an online self-adjusting binary search tree defined in the geometric view ([Lucas, 1988; Munro, 2000; Demaine, Harmon, Iacono, Kane, Patrascu, SODA…
Simplicity in Eulerian Circuits: Uniqueness and Safety
Nidia Obscura Acosta, Alexandru I. Tomescu
An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecting if a graph has a unique Eulerian circuit can be done in polynomial time v…
On Minimum Generalized Manhattan Connections
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook +5
We consider minimum-cardinality Manhattan connected sets with arbitrary demands: Given a collection of points in the plane, together with a subset of pairs of points in (wh…