8 citations · 30 across the 29 of their papers we have counts for
3 papers · 1 filter
A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
Parinya Chalermsook, Ly Orgo, Minoo Zarsav
Ferrer dimension, along with the order dimension, is a standard dimensional concept for bipartite graphs. In this paper, we prove that a graph is of Ferrer dimension three (equival…
On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
Parinya Chalermsook, Ly Orgo, Minoo Zarsav
This paper considers the \textit{Zarankiewicz problem} in graphs with low-dimensional geometric representation (i.e., low Ferrers dimension). Our first result reveals a separation…
Shortcuts and Transitive-Closure Spanners Approximation
Parinya Chalermsook, Yonggang Jiang, Sagnik Mukhopadhyay +1
We study polynomial-time approximation algorithms for two closely-related problems, namely computing shortcuts and transitive-closure spanners (TC spanners). For a directed unweigh…