default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 888
Volume 888, October 2021
- Jean R. S. Blair
, Christophe Crespelle:
On the effectiveness of the incremental approach to minimal chordal edge modification. 1-12 - Jianchang Lai, Ge Wu, Peng Jiang, Zhen Zhao, Willy Susilo, Fuchun Guo:
Generic construction for tightly-secure signatures from discrete log. 13-21 - Peiyan Zhou, Haitao Jiang, Daming Zhu, Binhai Zhu:
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs. 22-30 - Sandip Das, Harmender Gahlawat, Uma Kant Sahoo, Sagnik Sen:
Cops and Robber on some families of oriented graphs. 31-40 - Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Léo Robert, Tatsuya Sasaki, Hideaki Sone:
How to construct physical zero-knowledge proofs for puzzles with a "single loop" condition. 41-55 - Zheng Chen, Zhaoquan Gu, Yuexuan Wang:
Which is the fairest allocation in the max-min fairness-based coalitional game? 56-69 - Oleksii Omelchenko, Andrei A. Bulatov:
Satisfiability threshold for power law random 2-SAT in configuration model. 70-94 - Jiafei Liu, Shuming Zhou, Eddie Cheng, Qianru Zhou, Xiaoqing Liu:
Reliability analysis of the cactus-based networks. 95-107 - Yuxing Yang, Jing Li:
Hybrid fault-tolerant prescribed hyper-hamiltonian laceability of hypercubes. 108-116 - Júlio Araújo, Alexandre A. Cezar, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos, Ana Silva:
On the proper orientation number of chordal graphs. 117-132
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-03-01 15:12 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:
