


default search action
Theoretical Computer Science, Volume 842
Volume 842, November 2020
- Wantao Ning:

Connectivity and super connectivity of the divide-and-swap cube. 1-5 - Alexandros A. Voudouris

:
Simple combinatorial auctions with budget constraints. 6-17 - Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi:

Complexity of the multi-service center problem. 18-27 - Hu Ding:

Faster balanced clusterings in high dimension. 28-40 - Han Xiao

, Qizhi Fang, Ding-Zhu Du:
Population monotonic allocation schemes for vertex cover games. 41-49 - Benyamin M.-Alizadeh, Amir Hashemi:

Deterministic normal position transformation and its applications. 50-64 - Angelo Monti, Blerina Sinaimeri:

String factorisations with maximum or minimum dimension. 65-73 - Raphael Yuster:

A 2O(k)n algorithm for k-cycle in minor-closed graph families. 74-85 - Péter Burcsi, Gabriele Fici

, Zsuzsanna Lipták
, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. 86-99 - Akinori Hosoyamada, Yu Sasaki, Seiichiro Tani, Keita Xagawa

:
Quantum algorithm for the multicollision problem. 100-117 - Yong Cui, Qian Liu, Guo Chen, Hujun Zhang:

A general method for decomposing self-intersecting polygon to normal based on self-intersection points. 118-129 - Faith Ellen, Luís Rodrigues:

Preface. 130 - Hiro Ito, Stefano Leonardi, Linda Pagli, Giuseppe Prencipe

:
FUN editorial. 131 - Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney

, Richard J. Nowakowski:
Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325]. 133-135

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














