Result 1 to 20 of 410 total
NP-completeness of two pencil puzzles: Yajilin and Country Road. (English)
Util. Math. 88, 237-246 (2012).
1
Computing knapsack solutions with cardinality robustness. (English)
Japan J. Ind. Appl. Math. 29, No. 3, 469-483 (2012).
2
Minimum entropy combinatorial optimization problems. (English)
Theory Comput. Syst. 51, No. 1, 4-21 (2012).
3
On the complexity of the highway problem. (English)
Theor. Comput. Sci. 460, 70-77 (2012).
4
Complexity and parameterized algorithms for cograph editing. (English)
Theor. Comput. Sci. 461, 45-54 (2012).
5
Tile-packing tomography is $\Bbb{NP}$-hard. (English)
Algorithmica 64, No. 2, 267-278 (2012).
6
Exploiting a hypergraph model for finding golomb rulers. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 368-379 (2012).
7
Scheduling coupled-operation jobs with exact time-lags. (English)
Discrete Appl. Math. 160, No. 16-17, 2370-2388 (2012).
8
Tensor-based hardness of the shortest vector problem to within almost polynomial factors. (English)
Theory Comput. 8, Paper No. 23, 513-531, electronic only (2012).
9
Inapproximability of the shortest vector problem: toward a deterministic reduction. (English)
Theory Comput. 8, Paper No. 22, 487-512, electronic only (2012).
10
Improved approximation bounds for the student-project allocation problem with preferences over projects. (English)
J. Discrete Algorithms 13, 59-66 (2012).
11
Complexity of the soundness problem of bounded workflow nets. (English)
Haddad, Serge (ed.) et al., Application and theory of Petri nets. 33rd international conference, PETRI NETS 2012, Hamburg, Germany, June 25‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31130-7/pbk). Lecture Notes in Computer Science 7347, 92-107 (2012).
12
Length 3 edge-disjoint paths is NP-hard. (English)
Comput. Complexity 21, No. 3, 511-513 (2012).
13
The planar $k$-means problem is NP-hard. (English)
Theor. Comput. Sci. 442, 13-21 (2012).
14
Recoverable robust shortest path problems. (English)
Networks 59, No. 1, 181-189 (2012).
15
NP-hardness of the sorting buffer problem on the uniform metric. (English)
Discrete Appl. Math. 160, No. 10-11, 1453-1464 (2012).
16
The complexity of inferring a minimally resolved phylogenetic supertree. (English)
SIAM J. Comput. 41, No. 1, 272-291 (2012).
17
Analysis and approximation for bank selection instruction minimization on partitioned memory architecture. (English)
J. Comb. Optim. 23, No. 2, 274-291 (2012).
18
Watchman tours for polygons with holes. (English)
Comput. Geom. 45, No. 7, 326-333 (2012).
19
The class cover problem with boxes. (English)
Comput. Geom. 45, No. 7, 294-304 (2012).
20
Result 1 to 20 of 410 total
Start
Contact
Print
General Help
