


default search action
Theoretical Computer Science, Volume 907
Volume 907, March 2022
- Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov, Kim Thang Nguyen:

A simple rounding scheme for multistage optimization. 1-10 - Antonio Fariña

, Travis Gagie
, Szymon Grabowski, Giovanni Manzini, Gonzalo Navarro, Alberto Ordóñez Pereira:
Efficient and compact representations of some non-canonical prefix-free codes. 11-25 - Luyi Li, Xueliang Li:

Rainbow edge-pancyclicity of strongly edge-colored graphs. 26-33 - Daniel Krenn, Jeffrey O. Shallit

:
Decidability and k-regular sequences. 34-44 - Björn Feldkord, Till Knollmann

, Friedhelm Meyer auf der Heide:
Online facility location with mobile facilities. 45-61 - Mohamad Abdallah, Eddie Cheng

:
Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks. 62-81 - Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:

Constructing light spanners deterministically in near-linear time. 82-112 - Ajinkya Gaikwad, Soumen Maity, Shuvam Kant Tripathi:

Parameterized complexity of satisfactory partition problem. 113-127

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














