default search action
Theoretical Computer Science, Volume 725
Volume 725, May 2018
- Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio:
Spy-game on graphs: Complexity and simple topologies. 1-15 - Ankush Acharyya, Subhas C. Nandy, Sasanka Roy:
Minimum width color spanning annulus. 16-30 - Alejandro Flores-Lamas, José Alberto Fernández-Zepeda, Joel Antonio Trejo-Sánchez:
Algorithm to find a maximum 2-packing set in a cactus. 31-51 - Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
Game comparison through play. 52-63 - Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang:
Near-linear time approximation schemes for geometric maximum coverage. 64-78 - Seok-Hee Hong, Hiroshi Nagamochi:
Simpler algorithms for testing two-page book embedding of partitioned graphs. 79-98
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.