default search action
Theoretical Computer Science, Volume 661
Volume 661, January 2017
- Jihui Wang, Jiansheng Cai, Baojian Qiu:
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles. 1-7 - Ricardo C. Corrêa, Pablo Mayckon Silva Farias:
Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence. 8-17 - Martin Birks, Stanley P. Y. Fung:
Temperature aware online algorithms for minimizing flow time. 18-34 - Nathalie Aubrun, Sebastián Barbieri, Mathieu Sablik:
A notion of effectiveness for subshifts on finitely generated groups. 35-55 - Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh:
Parameterized complexity of Strip Packing and Minimum Volume Packing. 56-64
- Farnoosh Khodakarami, Farzad Didehvar, Ali Mohades:
1.5D terrain guarding problem parameterized by guard range. 65-69
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.