3 papers
cs.DS2026
Online Interval Selection on a Simple Chain
Yaqiao Li, Ali Mohammad Lavasani, Denis Pankratov
A set of intervals forms a simple chain if, for every , interval overlaps only with and . We show that a…
cs.DS2026
On the Online Weighted Non-Crossing Matching Problem
Joan Boyar, Shahin Kamali, Kim S. Larsen +3
We introduce and study the weighted version of an online matching problem in the Euclidean plane with non-crossing constraints: points with non-negative weights arrive online, and…
cs.CC2024
Newman's theorem via Carathéodory
Yaqiao Li, Ali Mohammad Lavasani, Mehran Shakerinava
We give a streamlined short proof of Newman's theorem in communication complexity by applying the classical and the approximate Carathéodory's theorems.