


default search action
Theoretical Computer Science, Volume 670
Volume 670, March 2017
- Laurent Gourvès, Jérôme Monnot, Fanny Pascual, Daniel Vanderpooten

:
Bi-objective matchings with the triangle inequality. 1-10 - Spyros Angelopoulos, Diogo Arsénio

, Christoph Dürr:
Infinite linear programming and online searching with turn cost. 11-22 - Yan Wang, Hong Shen, Jianxi Fan:

Edge-independent spanning trees in augmented cubes. 23-32 - Jianer Chen, Chao Xu, Jianxin Wang

:
Dealing with 4-variables by resolution: An improved MaxSAT algorithm. 33-44 - Tzu-Liang Kung

, Chun-Nan Hung:
Estimating the subsystem reliability of bubblesort networks. 45-55 - Barnaby Martin

, András Pongrácz
, Michal Wrona:
The complexity of counting quantifiers on equality languages. 56-67 - Zsuzsa Mészáros-Karkus:

Hardness results for stable exchange problems. 68-78
- Yan Lan, Xin Han, Yinling Wang, Min Ge, He Guo, Xin Chen:

Flowshop problem F2 → D|v = 1, c ≥ 1|Cmax revisited. 79-85

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














