default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 469
Volume 469, January 2013
- Man Ho Au
, Joseph K. Liu, Willy Susilo, Tsz Hon Yuen:
Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction. 1-14 - Andreas Brandstädt, Synara Brito, Sulamita Klein, Loana Tito Nogueira, Fábio Protti:
Cycle transversals in perfect graphs and cographs. 15-23 - Dominic Dumrauf, Burkhard Monien:
On the PLS-complexity of maximum constraint assignment. 24-52 - Paola Flocchini, Bernard Mans, Nicola Santoro:
On the exploration of time-varying networks. 53-68 - Kaoru Fujioka:
Morphic characterizations with insertion systems controlled by a context of length one. 69-76 - Ondrej Turek:
Abelian complexity and abelian co-decomposition. 77-91 - Mingyu Xiao, Hiroshi Nagamochi:
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs. 92-104 - Mingyu Xiao, Takuro Fukunaga, Hiroshi Nagamochi:
FPTASs for trimming weighted trees. 105-118 - Xiaojiang Yu:
Certain discrete dynamical systems, number systems and related integral self-affine sets. 119-126 - Fuxiang Yu, Ker-I Ko:
On logarithmic-space computable real numbers. 127-133
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-01-08 20:19 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:
