default search action
Theoretical Computer Science, Volume 835
Volume 835, October 2020
- Mengjie Lv, Jianxi Fan, Guo Chen, Baolei Cheng, Jingya Zhou, Jia Yu:
The reliability analysis of k-ary n-cube networks. 1-14 - Yongcheng Song, Xinyi Huang, Yi Mu, Wei Wu, Huaxiong Wang:
A code-based signature scheme from the Lyubashevsky framework. 15-30 - Ioannis G. Tollis, Konstantinos G. Kakoulis:
Algorithms for visualizing phylogenetic networks. 31-43 - Min Xu, Kshirasagar Naik, Krishnaiyan Thulasiraman:
Fault tolerance of hypercube like networks: Spanning laceability under edge faults. 44-57 - Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra, I. Vinod Reddy:
Parameterized complexity of happy coloring problems. 58-81 - Luping Wang, Jie Chen, Kai Zhang, Haifeng Qian:
A post-quantum hybrid encryption based on QC-LDPC codes in the multi-user setting. 82-96 - Anna Lubiw, Debajyoti Mondal:
On compatible triangulations with a minimum number of Steiner points. 97-107 - Tongtong Ding, Pingshan Li, Min Xu:
The component (edge) connectivity of shuffle-cubes. 108-119 - Sergio Cabello, Éric Colin de Verdière:
Hardness of Minimum Barrier Shrinkage and Minimum Installation Path. 120-133 - Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Phablo F. S. Moura, Eduardo C. Xavier:
Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane. 134-155 - Sonia Pérez-Díaz, Li-Yong Shen:
Parameterization of rational translational surfaces. 156-167
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.