default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 628
Volume 628, May 2016
- Stephan Kreutzer
, Sebastian Ordyniak:
Complexity and monotonicity results for domination games. 1-29 - Wen Chean Teh, Adrian Atanasiu:
On a conjecture about Parikh matrices. 30-39 - Yuval Carmel, Boaz Patt-Shamir:
Comparison-based interactive collaborative filtering. 40-49 - André Grahl Pereira, Marcus Ritt, Luciana S. Buriol:
Pull and PushPull are PSPACE-complete. 50-61 - Maximilien Gadouleau, Adrien Richard:
Simple dynamics on graphs. 62-77 - Hui Cui, Yi Mu, Man Ho Au:
Relations between robustness and RKA security under public-key encryption. 78-91 - Mujiangshan Wang, Yuqing Lin, Shiying Wang:
The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM⁎ model. 92-100
- Stasys Jukna, Georg Schnitger:
On the optimality of Bellman-Ford-Moore shortest path algorithm. 101-109 - Lukasz Kowalik, Juho Lauri:
On finding rainbow and colorful paths. 110-114
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-10-22 02:16 CEST 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:
