


default search action
Theoretical Computer Science, Volume 434
Volume 434, May 2012
- Xiaoguang Bao, Zhaohui Liu:

Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. 1-10 - Anthony Bonato, Margaret-Ellen Messinger, Pawel Pralat

:
Fighting constrained fires in graphs. 11-22 - Maxime Crochemore

, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman
, German Tischler, Tomasz Walen
:
Improved algorithms for the range next value problem and applications. 23-34 - George Karakostas

, Jeff Kinne
, Dieter van Melkebeek:
On derandomization and average-case complexity of monotone functions. 35-44 - Ching-Jong Liao, Hsin-Hui Tsou, Kuo-Ling Huang:

Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups. 45-52 - Yun Shang, Xian Lu, Ruqian Lu:

A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata. 53-86 - Kenya Ueno:

A stronger LP bound for formula size lower bounds via clique constraints. 87-97 - Yuichi Yoshida, Yusuke Kobayashi:

Testing the (s, t)-disconnectivity of graphs and digraphs. 98-113

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














