default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 615
Volume 615, February 2016
- Marc Hellmuth
, Florian Lehner:
Fast factorization of Cartesian products of (directed) hypergraphs. 1-11 - Karel Klouda, Katerina Medková:
Synchronizing delay for binary uniform morphisms. 12-22 - Bogdan S. Chlebus, Gianluca De Marco, Dariusz R. Kowalski:
Scalable wake-up of multi-channel single-hop radio networks. 23-44 - Jae Hong Seo, Keita Emura:
Revocable hierarchical identity-based encryption via history-free approach. 45-60 - Binay K. Bhattacharya, Subhas C. Nandy, Sasanka Roy:
Space-efficient algorithm for computing a centerpoint of a set of points in R2. 61-70 - Mingzu Zhang, Lianzhu Zhang, Xing Feng:
Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes. 71-77 - Sun-Yuan Hsieh, Hong-Wen Huang, Chia-Wei Lee:
{2, 3}-Restricted connectivity of locally twisted cubes. 78-90 - Eddie Cheng, Justin Kelm, Joseph Renzi:
Strong matching preclusion of (n, k)-star graphs. 91-101 - Sayaka Kamei, Tomoko Izumi, Yukiko Yamauchi:
An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs. 102-119
- Sigve Hortemo Sæther, Martin Vatshelle:
Hardness of computing width parameters based on branch decompositions over the vertex set. 120-125
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-02-05 20:35 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:
