


default search action
Theoretical Computer Science, Volume 771
Volume 771, June 2019
- Motahhareh Gharahi

, Shahram Khazaei
:
Optimal linear secret sharing schemes for graph access structures on six participants. 1-8 - Santiago Valdés Ravelo

, Carlos Eduardo Ferreira:
A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem. 9-22 - Irena Rusu:

Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT. 23-38 - Júlio Araújo

, Cláudia Linhares Sales, Ignasi Sau
, Ana Silva
:
Weighted proper orientations of trees and graphs of bounded treewidth. 39-48 - Khin Mi Mi Aung

, Hyung Tae Lee
, Benjamin Hong Meng Tan
, Huaxiong Wang:
Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem. 49-70 - Krishnamoorthy Dinesh

, Jayalal Sarma:
Alternation, sparsity and sensitivity: Bounds and exponential gaps. 71-82 - Boaz Farbstein, Asaf Levin

:
Deadline TSP. 83-92 - Qiang Dong

, Xi Wang:
How many triangles and quadrilaterals are there in an n-dimensional augmented cube? 93-98

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














