default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 448
Volume 448, August 2012
- Lei Chen
, Weiming Zeng, Changhong Lu:
NP-completeness and APX-completeness of restrained domination in graphs. 1-8 - Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis:
Efficient methods for selfish network design. 9-20 - Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach:
Weakly unambiguous morphisms. 21-40 - Pedro García, Damián López, Manuel Vazquez de Parga:
Polynomial characteristic sets for DFA identification. 41-46 - Mehdi Ghiyasvand:
An O(m(m + n log n) log(n C))-time algorithm to solve the minimum cost tension problem. 47-55 - Pascal Koiran:
Arithmetic circuits: The chasm at depth four gets wider. 56-65 - Taishin Y. Nishida:
An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules. 66-79 - Robin Strand, Nicolas Normand:
Distance transform computation for digital distance functions. 80-93
- Bojan Basic:
A note on the paper "On Brlek-Reutenauer conjecture". 94-96
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-12-05 22:36 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:
