


default search action
Theoretical Computer Science, Volume 958
Volume 958, May 2023
- Mikhail Mrykhin
, Alexander Okhotin:
The hardest language for grammars with context operators. 113829
- Michele Pasqua
, Marino Miculan
:
AbU: A calculus for distributed event-driven programming with attribute-based interaction. 113841
- Michael J. Dinneen
, Alec Henderson
, Radu Nicolescu:
Sublinear P system solutions to NP-complete problems. 113848
- Hong Zhang, Shuming Zhou
, Qifan Zhang, Tao Tian:
Fault tolerance of composite graph based on disc-ring and folded hypercube. 113856 - Anthony Labarre
:
Sorting by prefix block-interchanges. 113857 - Jun Yuan
, Shuyuan Ge, Aixia Liu:
The partial diagnosability of interconnection networks under the Hybrid PMC model. 113859 - Hongwei Qiao, Jixiang Meng:
Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes. 113860 - Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana
, Abhishek Sahu:
Parameterized complexity of perfectly matched sets. 113861 - Sahab Hajebi, Ramin Javadi
:
On the parameterized complexity of the acyclic matching problem. 113862 - Faisal N. Abu-Khzam
, Norma Makarem
, Maryam Shehab:
An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion. 113864
- Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Sergey Verlan
:
Numerical networks of cells. 113873

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.