default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 438
Volume 438, June 2012
- Yuji Kobayashi:
The derivational complexity of string rewriting systems. 1-12 - George Christodoulou
, Vahab S. Mirrokni, Anastasios Sidiropoulos:
Convergence and approximation in potential games. 13-27 - Changwook Kim:
On the structure of linear apex NLC graph grammars. 28-33 - George B. Mertzios:
The recognition of triangle graphs. 34-47 - Jørgen Bang-Jensen, Anders Yeo:
Arc-disjoint spanning sub(di)graphs in digraphs. 48-54 - Ming Liu, Feifeng Zheng, Chengbin Chu, Yinfeng Xu:
New results on single-machine scheduling with past-sequence-dependent delivery times. 55-61 - Verónica Becher, Pablo Ariel Heiber:
A linearly computable measure of string complexity. 62-73 - J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct representations of permutations and functions. 74-88
- Marcin Kaminski:
max-cut and containment relations in graphs. 89-95 - Khaled M. Elbassioni, Slobodan Jelic, Domagoj Matijevic:
The relation of Connected Set Cover and Group Steiner Tree. 96-101
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 2025-01-20 22:58 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:
