default search action
Theoretical Computer Science, Volume 821
Volume 821, June 2020
- Kai Wang:
Calibration scheduling with time slot cost. 1-14 - Yong Zhang, Francis Y. L. Chin, Sheung-Hung Poon, Hing-Fung Ting, Dachuan Xu, Dongxiao Yu:
Offline and online algorithms for single-minded selling problem. 15-22 - Chuangen Gao, Shuyang Gu, Ruiqi Yang, Jiguo Yu, Weili Wu, Dachuan Xu:
Interaction-aware influence maximization and iterated sandwich method. 23-33 - Daniel R. Page, Roberto Solis-Oba:
Makespan minimization on unrelated parallel machines with a few bags. 34-44 - András Faragó, Rupei Xu:
A new algorithm design technique for hard problems. 45-56 - Thomas Lidbetter, Kyle Y. Lin:
A search game on a hypergraph with booby traps. 57-70 - Jung-Heum Park, Hyeong-Seok Lim:
Characterization of interval graphs that are unpaired 2-disjoint path coverable. 71-86 - Silvère Gangloff, Alexandre Talon:
Asymptotic growth rate of square grids dominating sets: A symbolic dynamics approach. 87-101 - Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman:
List-coloring - Parameterizing from triviality. 102-110 - Nikhil Balaji, Andreas Krebs, Nutan Limaye:
Skew circuits of small width. 111-123
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.