default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 732
Volume 732, July 2018
- Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme
:
Leaf realization problem, caterpillar graphs and prefix normal words. 1-13 - Martijn van Ee, René Sitters:
Approximation and complexity of multi-target graph search and the Canadian traveler problem. 14-25 - Chuangyin Dang, Yinyu Ye:
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering. 26-45 - Graham Farr, Nhan Bao Ho:
The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games. 46-59 - Sándor Vágvölgyi:
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy. 60-72 - Michel Dekking:
The Frobenius problem for homomorphic embeddings of languages into the integers. 73-79 - Erik D. Demaine, Mikhail Rudoy:
A simple proof that the (n2 - 1)-puzzle is hard. 80-84 - Vesa Halava, Tero Harju, Esa Sahla:
On fixed points of rational transductions. 85-88
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 2024-12-18 18:28 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
