Ali Mohammad Lavasani

activity

20212026

collaborators

5 papers

cs.DS2026

Online Interval Selection on a Simple Chain

Yaqiao Li, Ali Mohammad Lavasani, Denis Pankratov

A set of intervals $I = {I_{1}, I_{2}, \dots, I_{n}}$ forms a simple chain if, for every $2 \leq i \leq n - 1$ , interval $I_{i}$ overlaps only with $I_{i - 1}$ and $I_{i + 1}$ . 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.

cs.CG2022

Maximum Weight Convex Polytope

Mohammad Ali Abam, Ali Mohammad Lavasani, Denis Pankratov

We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only kno…

cs.CG2021

Advice Complexity of Online Non-Crossing Matching

Ali Mohammad Lavasani, Denis Pankratov

We study online matching in the Euclidean $2$ -dimesional plane with non-crossing constraint. The offline version was introduced by Atallah in 1985 and the online version was introd…