default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 535
Volume 535, May 2014
- Ferdinando Cicalese, Gennaro Cordasco
, Luisa Gargano, Martin Milanic, Ugo Vaccaro:
Latency-bounded target set selection in social networks. 1-15 - Sang-il Oum, Sigve Hortemo Sæther, Martin Vatshelle:
Faster algorithms for vertex partitioning problems parameterized by clique-width. 16-24 - Yinglei Song:
An improved parameterized algorithm for the independent feedback vertex set problem. 25-30 - Lowell Abrams, Dena S. Cowen-Morton:
A family of Nim-like arrays: The Locator Theorem. 31-37 - Lunzhi Deng, Jiwen Zeng:
Two new identity-based threshold ring signature schemes. 38-45 - Fu-Tao Hu, Moo Young Sohn:
The algorithmic complexity of bondage and reinforcement problems in bipartite graphs. 46-53
- Yaping Zhang, Yishuo Shi, Zhao Zhang:
Approximation algorithm for the minimum weight connected k-subgraph cover problem. 54-58 - Mahsa Allahbakhshi:
Computing degree and class degree. 59-64
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:
