default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 645
Volume 645, September 2016
- Benoît Libert, Marc Joye, Moti Yung:
Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares. 1-24 - Marthe Bonamy, Lukasz Kowalik
:
A 13k-kernel for planar feedback vertex set via region decomposition. 25-40 - Nir Halman:
A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy. 41-47 - Georgios Konstantinidis, Athanasios Kehagias:
Simultaneously moving cops and robbers. 48-59 - Frank Kammer, Torsten Tholey:
Approximate tree decompositions of planar graphs in linear time. 60-90 - Jia Guo, Mei Lu:
The extra connectivity of bubble-sort star graphs. 91-99 - William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani:
Simultaneous visibility representations of plane st-graphs using L-shapes. 100-111 - Reinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner:
Search-space size in contraction hierarchies. 112-127 - Loïc Mazo, Étienne Baudrier:
Non-local estimators: A new class of multigrid convergent length estimators. 128-146
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 2024-12-22 19:02 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:
