default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 591
Volume 591, August 2015
- Maurice Nivat:
The true story of TCS. 1-2 - Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella
:
TCS in the 21st century. 3-4
- Taisuke Izumi, Tomoko Izumi, Hirotaka Ono, Koichi Wada:
Approximability of minimum certificate dispersal with tree structures. 5-14 - Sven Köhler, Volker Turau:
Self-stabilizing local k-placement of replicas with local minimum variance. 15-27 - Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski:
The searchlight problem for road networks. 28-59 - Ferdinando Cicalese, Martin Milanic, Romeo Rizzi:
On the complexity of the vector connectivity problem. 60-71 - Petr A. Golovach:
Editing to a Graph of Given Degrees. 72-84 - Klaus Meer, Ameen Naif:
Generalized finite automata over real and complex numbers. 85-98 - Ching-Chi Lin, Hai-Lun Tu:
A linear-time algorithm for paired-domination on circular-arc graphs. 99-105 - Christophe Reutenauer:
Studies on finite Sturmian words. 106-133 - Mikhail Barash, Alexander Okhotin:
Two-sided context specifications in formal grammars. 134-153
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.
last updated on 2026-08-09 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
