default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 626
Volume 626, May 2016
- Olivier Hudry, Antoine Lobstein:
More results on the complexity of identifying problems in graphs. 1-12 - Michel de Rougemont, Adrien Vieilleribière:
Approximate consistency for transformations on words and trees. 13-39 - Alain Cournier, Ajoy Kumar Datta, Stéphane Devismes
, Franck Petit, Vincent Villain:
The expressive power of snap-stabilization. 40-66 - Amaury Pouly, Daniel Silva Graça:
Computational complexity of solving polynomial differential equations over unbounded domains. 67-82 - Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan:
Tree-automatic scattered linear orders. 83-96 - Manuel Radons:
Direct solution of piecewise linear systems. 97-109 - Ajoy Kumar Datta, Stéphane Devismes, Karel Heurtefeux, Lawrence L. Larmore, Yvan Rivierre:
Competitive self-stabilizing k-clustering. 110-133 - Alexander Reich:
Complexity of the maximum leaf spanning tree problem on planar and regular graphs. 134-143 - Jun Yuan, Aixia Liu, Xiao Qin, Jifu Zhang, Jing Li:
g-Good-neighbor conditional diagnosability measures for 3-ary n-cube networks. 144-162
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-12 01:09 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:
