


default search action
Theoretical Computer Science, Volume 665
Volume 665, February 2017
- Petr A. Golovach

, George B. Mertzios
:
Graph editing to a given degree sequence. 1-12 - Artur Jez

, Alexander Okhotin
:
Unambiguous conjunctive grammars over a one-symbol alphabet. 13-39 - Ioannis Giotis, Lefteris M. Kirousis

, Kostas I. Psaromiligkos, Dimitrios M. Thilikos:
Acyclic edge coloring through the Lovász Local Lemma. 40-50 - Ajoy K. Datta, Stéphane Devismes

, Lawrence L. Larmore:
Self-stabilizing silent disjunction in an anonymous network. 51-72 - Giuseppe Lancia

, Luke Mathieson
, Pablo Moscato
:
Separating sets of strings by finding matching patterns is almost always hard. 73-86 - Omar I. Al-Bataineh

, Mark Reynolds
, Tim French
:
Finding minimum and maximum termination time of timed automata models with cyclic behaviour. 87-104

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














