


default search action
Theoretical Computer Science, Volume 1065
Volume 1065, 2026
- Yaroslav Shitov:

On the complexity of a problem related to set cover. 115644 - Fengqin Zhang

, Mingzu Zhang
, Eddie Cheng
:
Reliability analysis of the quinary n-cube networks with non-lexicographic order optimal solution of the edge isoperimetric problem. 115700 - Narmina Baghirova

, Antoine Castillon:
Finding proportionally dense subgraphs of maximum size in degree-constrained graphs. 115706 - Domenico Cantone

, Simone Faro
, Arianna Pavone
, Caterina Viola
:
Quantum algorithms for longest common and palindromic substrings in the circuit model. 115716 - M. Gayathri Lakshmi

, T. Kalyani
, D. Gnanaraj Thomas
:
Parallel contextual array insertion-deletion P systems and a variant of array rewriting P systems. 115719 - Mingchao Zhou

, Zhao Zhang
:
Approximation algorithm for fair stochastic maximum coverage problem. 115722 - Zhidan Feng

, Henning Fernau
, Kevin Mann
, Xingqin Qi
:
Offensive alliances in signed graphs. 115724 - Matthias Bentert, Fedor V. Fomin

, Fanny Hauser, Saket Saurabh
:
The parameterized complexity landscape of two-sets cut-uncut. 115726 - Guozhen Zhang

, Tao Wen
, Dajin Wang
:
Extra path-structure connectivity of modified bubble-sort networks. 115728 - Petra Wiederhold

, Tonatiuh Matos Wiederhold
:
Border tracing in oriented adjacency graphs of polygonal tilings. 115729 - Paolo Boldi, Giuseppe Prencipe, Tami Tamir:

Guest editorial - Fun with algorithms 2024. 115742

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














