default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 824-825
Volume 824-825, July 2020
- Alejandro López-Ortiz, Marc P. Renault, Adi Rosén:
Paid exchanges are worth the price. 1-10 - Dominik Barth, Moritz Beck, Titus Dose, Christian Glaßer, Larissa Michler, Marc Technau
:
Emptiness problems for integer circuits. 11-35 - Eurinardo Rodrigues Costa, Victor Lage Pessoa, Rudini M. Sampaio, Ronan Soares:
PSPACE-completeness of two graph coloring games. 36-45 - Yihong Wang, Cheng-Kuan Lin, Xiaoyan Li, Shuming Zhou:
Diagnosability for two families of composition networks. 46-56 - Pingshan Li, Min Xu:
The largest component of faulty star graphs. 57-66 - Zhuowen Pan, Dongqin Cheng:
Structure connectivity and substructure connectivity of the crossed cube. 67-80 - Limei Lin, Yanze Huang, Xiaoding Wang, Li Xu:
Restricted connectivity and good-neighbor diagnosability of split-star networks. 81-91 - Wei Chen, Shang-Hua Teng, Hanrui Zhang:
A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality. 92-111
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 2026-07-24 23:11 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
