default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 815
Volume 815, May 2020
- Stavros S. Cosmadakis
, Dimitris J. Kavvadias, Lina Panagopoulou:
Resolution based algorithms for the transversal hypergraph generation problem. 1-10 - Yinxia Sun, Yi Mu, Willy Susilo, Futai Zhang, Anmin Fu:
Revocable identity-based encryption with server-aided ciphertext evolution. 11-24 - Mohammad Ali, Javad Mohajeri, Mohammad-Reza Sadeghi, Ximeng Liu:
A fully distributed hierarchical attribute-based encryption scheme. 25-46 - Di Wang, Jinhui Xu:
Tight lower bound of sparse covariance matrix estimation in the local differential privacy model. 47-59 - Huilan Chang, Han-Min Chu:
Error-tolerant nonadaptive interval group testing with density-based tests. 60-68 - Shou-Fu Lo, Kuo-Tsung Tseng, Chang-Biau Yang, Kuo-Si Huang:
A diagonal-based algorithm for the longest common increasing subsequence problem. 69-78 - Wei-Yuan Hsu, Chu-Ling Ko, Jr-Chang Chen, Ting-Han Wei, Chu-Hsuan Hsueh, I-Chen Wu:
On solving the 7, 7, 5-game and the 8, 8, 5-game. 79-94 - Lise Rommel Romero Navarrete, Guilherme P. Telles:
Practical regular expression constrained sequence alignment. 95-108 - Mingyu Xiao, Zimo Sheng:
Improved parameterized algorithms and kernels for mixed domination. 109-120 - Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen:
Recognizing hyperelliptic graphs in polynomial time. 121-146 - Andreas Darmann, Janosch Döcker:
On a simple hard variant of Not-All-Equal 3-Sat. 147-152 - Takeharu Shiraga:
The cover time of deterministic random walks for general transition probabilities. 153-162 - Salma Sadat Mahdavi, Saeed Seddighin, Mohammad Ghodsi:
Covering orthogonal polygons with sliding k-transmitters. 163-181 - Lars Jaffke, Paloma T. Lima:
A complexity dichotomy for critical values of the b-chromatic number of graphs. 182-196 - Javier T. Akagi, Carlos F. Gaona, Fabricio Mendoza, Manjil P. Saikia, Marcos Villagra:
Hard and easy instances of L-tromino tilings. 197-212 - Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu, Buddhadeb Sau:
Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. 213-227 - Tiziana Calamoneri, Valentino Di Donato, Diego Mariottini, Maurizio Patrignani:
Visualizing co-phylogenetic reconciliations. 228-245 - Aniello Murano, Sasha Rubin:
Preface. 246 - Nicola Gigante, Angelo Montanari, Andrea Orlandini, Marta Cialdea Mayer, Mark Reynolds:
On timeline-based games and their complexity. 247-269 - Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma:
Computing coverage kernels under restricted settings. 270-288 - Jannik Castenow, Matthias Fischer, Jonas Harbig, Daniel Jung, Friedhelm Meyer auf der Heide:
Gathering Anonymous, Oblivious Robots on a Grid. 289-309 - Alessandro Aldini, Marco Bernardo:
The Italian Conference on Theoretical Computer Science. 310
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.
last updated on 2025-04-01 00:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
