


default search action
Theoretical Computer Science, Volume 707
Volume 707, January 2018
- Enver Kayaaslan, Thomas Lambert, Loris Marchal

, Bora Uçar
:
Scheduling series-parallel task graphs to minimize peak memory. 1-23 - Thibault Godin, Ines Klimann:

On bireversible Mealy automata and the Burnside problem. 24-35 - Behrooz Alizadeh

, Roghayeh Etemad:
Optimal algorithms for inverse vertex obnoxious center location problems on graphs. 36-45 - Sharareh Alipour, Mohammad Ghodsi, Amir Jafari:

Randomized approximation algorithms for planar visibility counting problem. 46-55 - Pingshan Li

, Min Xu:
Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes. 56-68 - Nicolas Almeida Martins, Rudini M. Sampaio

:
Locally identifying coloring of graphs with few P4s. 69-76
- Michal Karpinski

:
Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency. 77-81 - Jie-Meng Zhang, Yingjun Guo, Zhi-Xiong Wen:

On the regularity of {⌊logb(αn+ β)⌋}n ≥0. 82-88 - Marcin Bienkowski

, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski
, Jirí Sgall
, Aleksandra Spyra, Pavel Veselý
:
Logarithmic price of buffer downscaling on line metrics. 89-93 - Wangwei Li, Xianhua Li:

On two problems of almost synchronizing groups. 94-95 - Litao Guo:

Reliability analysis of twisted cubes. 96-101

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














