


default search action
Theoretical Computer Science, Volume 886
Volume 886, September 2021
- Feng Shi, Jie You, Zhen Zhang, Jingyi Liu, Jianxin Wang:
Fixed-parameter tractability for the Tree Assembly problem. 3-12 - Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa:
The assignment problem. 13-26 - Bapi Chatterjee
, Ivan Walulya, Philippas Tsigas
:
Concurrent linearizable nearest neighbour search in LockFree-kD-tree. 27-48 - Damien Imbs, Achour Mostéfaoui, Matthieu Perrin
, Michel Raynal:
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects. 49-68 - Timothée Martinod, Valentin Pollet, Benoît Darties, Rodolphe Giroudeau, Jean-Claude König:
Complexity and inapproximability results for balanced connected subgraph problem. 69-83 - Garima Agrawal, Soumen Maity:
The Small Set Vertex Expansion Problem. 84-93 - Hua Chen, Lin Chen, Guochuan Zhang
, Vincent Chau:
Scheduling with variable-length calibrations: Two agreeable variants. 94-105 - Vipin Singh Sehrawat
, Foo Yee Yeo, Yvo Desmedt:
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification. 106-138 - Boting Yang, Tanzina Akter:
One-visibility cops and robber on trees. 139-156 - Yunyun Deng, Longkun Guo, Kewen Liao
, Yi Chen:
On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms. 157-168 - Xiaozhou He
, Wenfeng Lai, Binhai Zhu, Peng Zou:
Dispersing and grouping points on planar segments. 169-177

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.