


default search action
Theoretical Computer Science, Volume 651
Volume 651, October 2016
- Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen:

Space-efficient path-reporting approximate distance oracles. 1-10 - Paolo D'Arco, Roberto De Prisco

:
Secure computation without computers. 11-36 - Arash Haddadan, Takehiro Ito, Amer E. Mouawad

, Naomi Nishimura, Hirotaka Ono
, Akira Suzuki
, Youcef Tebbal:
The complexity of dominating set reconfiguration. 37-49 - Klaus Wehmuth

, Eric Fleury, Artur Ziviani
:
On MultiAspect graphs. 50-61 - Danny Hermelin

, Moshe Kaspi
, Christian Komusiewicz
, Barak Navon:
Parameterized complexity of critical node cuts. 62-75 - Xingchao Deng, Hengzhe Li

, Guiying Yan:
Algorithm on rainbow connection for maximal outerplanar graphs. 76-86
- Kung-Jui Pai, Jou-Ming Chang

, Jinn-Shyong Yang, Ro-Yu Wu:
Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65]. 87-88

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














