default search action
Theoretical Computer Science, Volume 839
Volume 839, November 2020
- Tami Tamir:
The power of one evil secret agent. 1-12 - Hans L. Bodlaender, Tom C. van der Zanden:
On the exact complexity of polyomino packing. 13-20 - Matteo Almanza, Stefano Leucci, Alessandro Panconesi:
Tracks from hell - When finding a proof may be easier than checking it. 21-29 - Michael J. Coulombe, Jayson Lynch:
Cooperating in video games? Impossible! Undecidability of Team Multiplayer Games. 30-40 - Zachary Abel, Jeffrey Bosboom, Michael J. Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, Clemens Thielen:
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible. 41-102 - Naoki Kitamura, Yuya Kawabata, Taisuke Izumi:
Uniform distribution for Pachinko. 103-121 - Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade:
A faster cryptographer's Conspiracy Santa. 122-134 - Tatsuya Sasaki, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone:
Efficient card-based zero-knowledge proof for Sudoku. 135-142 - Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer:
A tight lower bound for the capture time of the Cops and Robbers game. 143-163 - Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos:
Edge degeneracy: Algorithmic and structural results. 164-175 - Sebastian Brandt, Klaus-Tycho Foerster, Jonathan Maurer, Roger Wattenhofer:
Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs. 176-185 - Masood Masjoody, Ladislav Stacho:
Cops and robbers on graphs with a set of forbidden induced subgraphs. 186-194 - Akitoshi Kawamura, Makoto Soejima:
Simple strategies versus optimal schedules in multi-agent patrolling. 195-206
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.