An Efficient Algorithm for All-Pairs Bounded Edge Connectivity by Akmal, Shyan, Jin, Ce

“…In: 46th international colloquium on automata, languages, and programming, ICALP 2019, July 9–12, 2019, Patras, Greece, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2019]. …”
Get full text

One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile by Demaine, Erik D, Demaine, Martin L, Fekete, Sándor P., Patitz, Matthew J., Schweller, Robert T., Winslow, Andrew, Woods, Damien

Get full text

The Complexity of Hex and the Jordan Curve Theorem by Adler, Aviv, Daskalakis, Konstantinos, Demaine, Erik D

Get full text
Get full text
Get full text
Get full text

Towards optimal set-disjointness and set-intersection data structures by Kopelowitz, Tsvi, Williams, Virginia Vassilevska

“…© Tsvi Kopelowitz and Virginia Vassilevska Williams; licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). …”
Get full text

Conditionally optimal approximation algorithms for the girth of a directed graph by Dalirrooyfard, Mina, Williams, Virginia Vassilevska

“…© Mina Dalirrooyfard and Virginia Vassilevska Williams; licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). …”
Get full text