


default search action
Theoretical Computer Science, Volume 898
Volume 898, January 2022
- Xiangyu Liu, Shengli Liu, Shuai Han, Dawu Gu:

Tightly CCA-secure inner product functional encryption scheme. 1-19 - Arman Boyaci, Tínaz Ekim, Mordechai Shalom:

On the maximum cardinality cut problem in proper interval graphs and related graph classes. 20-29 - Jun Yuan

, Huijuan Qiao, Aixia Liu:
The Rg-conditional diagnosability of international networks. 30-43 - Markus Chimani, Philipp Kindermann

, Fabrizio Montecchiani, Pavel Valtr:
Crossing numbers of beyond-planar graphs. 44-49 - Rüdiger Reischuk:

The kangaroo problem. 50-58 - Walter Kern, Barnaby Martin, Daniël Paulusma

, Siani Smith
, Erik Jan van Leeuwen:
Disjoint paths and connected subgraphs for H-free graphs. 59-68 - Prafullkumar Tale

:
Sparsification lower bound for linear spanners in directed graphs. 69-74 - Raul Lopes

, Ignasi Sau:
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps. 75-91 - Florian Bridoux:

Sequentialization and procedural complexity in automata networks. 92-109 - Peter Kostolányi

:
Determinisability of unary weighted automata over the rational numbers. 110-131 - Abdullah Almethen, Othon Michail, Igor Potapov

:
On efficient connectivity-preserving transformations in a grid. 132-148 - Seyed Naser Hosseini, Leila Yeganeh:

Partial pullback complement rewriting along admissible matches. 149-179

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














