default search action
Theoretical Computer Science, Volume 866
Volume 866, April 2021
- Matthew Dippel, Ravi Sundaram, Akshar Varma:
Realization problems on reachability sequences. 1-13 - Stepan Holub, Stepán Starosta:
Binary intersection formalized. 14-24 - Giuseppa Castiglione, Gabriele Fici, Antonio Restivo:
Primitive sets of words. 25-36 - Yan Li, Yusheng Li, Ye Wang:
Star-critical Ramsey number of large cycle and book of different orders. 37-42 - Xuehou Tan:
The touring rays and related problems. 43-55 - James D. Currie, Lucas Mol:
The undirected repetition threshold and undirected pattern avoidance. 56-69 - Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Shortest covers of all cyclic shifts of a string. 70-81 - Hyeyun Yang, Antoine Vigneron:
Matching sets of line segments. 82-95 - Anik Sarker, Wing-Kin Sung, M. Sohel Rahman:
A linear time algorithm for the r-gathering problem on the line. 96-106 - Stefan Klootwijk, Bodo Manthey, Sander K. Visser:
Probabilistic analysis of optimization problems on generalized random shortest path metrics. 107-122 - Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Complexity and approximability of the happy set problem. 123-144 - Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological stability of kinetic k-centers. 145-159 - Vincent Chau, Chi Kit Ken Fong, Shengxin Liu, Elaine Yinling Wang, Yong Zhang:
Minimizing energy on homogeneous processors with shared memory. 160-170
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.