![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 814
Volume 814, April 2020
- Tshepo Kitso Gobonamang
, Dimane Mpoeleng:
Counter based suffix tree for DNA pattern repeats. 1-12 - Stepan Holub:
Pseudo-solutions of word equations. 13-18 - Chen Guo, Zhifang Xiao, Zhihong Liu, Shuo Peng:
Rg conditional diagnosability: A novel generalized measure of system-level diagnosis. 19-27 - Esther Galby
, Andrea Munaro
, Bernard Ries
:
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. 28-48 - Yuqing Zhu
, Jiejing Wen, Jincheng Zhuang
, Chang Lv, Dongdai Lin:
Refined analysis to the extended tower number field sieve. 49-68 - Jørgen Bang-Jensen
, Thomas Bellitto, William Lochet, Anders Yeo
:
The directed 2-linkage problem with length constraints. 69-73 - MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation algorithms for connected maximum cut and related problems. 74-85 - Robert Bredereck, Piotr Faliszewski
, Rolf Niedermeier, Piotr Skowron
, Nimrod Talmon:
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. 86-105 - Satoru Ohta
:
The number of rearrangements for Clos networks - new results. 106-119 - Jia Lee, Ya-Hui Ye, Xin Huang, Rui-Long Yang:
Binary-decision-diagram-based decomposition of Boolean functions into reversible logic elements. 120-134 - Julien Baste
, Ignasi Sau
, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. 135-152 - Marcin Waniek
, Khaled M. Elbassioni
, Flávio L. Pinheiro
, César A. Hidalgo, Aamena Alshamsi:
Computational aspects of optimal strategic network diffusion. 153-168 - Oscar Defrain
, Lhouari Nourine:
Dualization in lattices given by implicational bases. 169-176 - Charis Papadopoulos
, Spyridon Tzimas:
Subset feedback vertex set on graphs of bounded independent set size. 177-188 - Nahid Juma
, Werner Dietl, Mahesh Tripunitara:
A computational complexity analysis of tunable type inference for Generic Universe Types. 189-209 - Biswajit Sanyal, Subhashis Majumder
, Wing-Kai Hon, Prosenjit Gupta:
Efficient meta-data structure in top-k queries of combinations and multi-item procurement auctions. 210-222 - Yangguang Tian, Yingjiu Li, Binanda Sengupta
, Nan Li
, Chunhua Su:
Leakage-resilient biometric-based remote user authentication with fuzzy extractors. 223-233 - Nir Ailon:
Paraunitary matrices, entropy, algebraic condition number and Fourier computation. 234-248 - Jean-Luc Baril, Vincent Vajnovszki:
Popularity of patterns over d-equivalence classes of words and permutations. 249-258 - Vahideh Keikha
, Maarten Löffler, Ali Mohades
:
A fully polynomial time approximation scheme for the smallest diameter of imprecise points. 259-270
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.