


default search action
Theoretical Computer Science, Volume 779
Volume 779, August 2019
- Mohammad Ali Abam, Sharareh Alipour

, Mohammad Ghodsi, Mohammad Mahdian:
Visibility testing and counting for uncertain segments. 1-7 - Guozhen Zhang, Shangwei Lin

:
Path and cycle fault tolerance of bubble-sort graph networks. 8-16 - Serafino Cicerone

, Gabriele Di Stefano:
Approximation algorithms for decomposing octilinear polygons. 17-36 - Amine Mohabeddine, Mourad Boudhar

:
New results in two identical machines scheduling with agreement graphs. 37-46 - Shuai Han, Shengli Liu, Lin Lyu

:
QANIZK for adversary-dependent languages and their applications. 47-71 - Sayan Bhattacharya, Monika Henzinger

, Stefan Neumann
:
New amortized cell-probe lower bounds for dynamic problems. 72-87

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














