![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 700
Volume 700, November 2017
- José Fuentes-Sepúlveda
, Leo Ferres
, Meng He
, Norbert Zeh:
Parallel construction of succinct trees. 1-22 - Shih-Ming Lo, Wu-Hsiung Lin, Chiuyuan Chen, Yu-Chee Tseng:
Optimal coloring for data collection in tree-based wireless sensor networks. 23-36 - Qian Wang, Ji Tian, Ruyan Fu, Xiangjuan Yao:
Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs. 37-44 - Mika Amit, Maxime Crochemore, Gad M. Landau, Dina Sokol:
Locating maximal approximate runs in a string. 45-62 - Vadim V. Lozin
, Dmitriy S. Malyshev
, Raffaele Mosca, Viktor Zamaraev
:
More results on weighted independent domination. 63-74 - Arnab Ganguly
, Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan:
Space-time trade-offs for finding shortest unique substrings and maximal unique matches. 75-88 - Sanjay Jain, Jason Teutsch:
Enumerations including laconic enumerators. 89-95
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.