


default search action
Theoretical Computer Science, Volume 690
Volume 690, August 2017
- Xueling Zhong

, Jinwen Ou:
Parallel machine scheduling with restricted job rejection. 1-11 - Wing-Kai Hon

, Sharma V. Thankachan, Bojian Xu:
In-place algorithms for exact and approximate shortest unique substring problems. 12-25 - Fatemeh Keshavarz-Kohjerdi

, Alireza Bagheri
:
A linear-time algorithm for finding Hamiltonian (s, t)-paths in even-sized rectangular grid graphs with a rectangular hole. 26-58 - Mei-Mei Gu

, Rong-Xia Hao
, Jun-Ming Xu, Yan-Quan Feng
:
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs. 59-72 - Loïc Mazo

, Étienne Baudrier:
Non-local length estimators and concave functions. 73-90 - Didem Gözüpek, Sibel Özkan

, Christophe Paul
, Ignasi Sau
, Mordechai Shalom
:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. 91-103 - Sounaka Mishra, Shijin Rajakrishnan, Saket Saurabh:

On approximability of optimization problems related to Red/Blue-split graphs. 104-113 - Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin:

Applying clique-decomposition for computing Gromov hyperbolicity. 114-139

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














