Abraham M. Illickan

collaborators

3 papers

cs.CG2025

Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness

David Eppstein, Michael T. Goodrich, Abraham M. Illickan +1

We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a meas…

math.CO2024

Maximal Independent Sets in Planar Triangulations

P. Francis, Abraham M. Illickan, Lijo M. Jose +1

We show that every planar triangulation on $n$ vertices has a maximal independent set of size at most $n /3$ . This affirms a conjecture by Botler, Fernandes and Gutiérrez [Electron.…

math.CO2024

Face-hitting Dominating Sets in Planar Graphs

P. Francis, Abraham M. Illickan, Lijo M. Jose +1

A dominating set of a graph $G$ is a subset $S$ of its vertices such that each vertex of $G$ not in $S$ has a neighbor in $S$ . A face-hitting set of a plane graph $G$ is a set $T$ …