Result 101 to 120 of 410 total
On the complexity of constructing Golomb rulers. (English)
Discrete Appl. Math. 157, No. 4, 738-748 (2009).
101
Stable marriage with ties and bounded length preference lists. (English)
J. Discrete Algorithms 7, No. 2, 213-219 (2009).
102
Norm statistics and the complexity of clustering problems. (English)
Discrete Appl. Math. 157, No. 8, 1831-1839 (2009).
103
Hardness of lazy packing and covering. (English)
Oper. Res. Lett. 37, No. 2, 89-92 (2009).
104
Cardinality constrained and multicriteria (multi)cut problems. (English)
J. Discrete Algorithms 7, No. 1, 102-111 (2009).
105
On the complexity of crossings in permutations. (English)
Discrete Math. 309, No. 7, 1813-1823 (2009).
106
Parallel machine scheduling problems with proportionally deteriorating jobs. (English)
Int. J. Syst. Sci. 40, No. 1, 53-57 (2009).
107
$\mathcal{NP}$-hardness of pure Nash equilibrium in scheduling and connection games. (English)
Nielsen, Mogens (ed.) et al., SOFSEM 2009: Theory and practice of computer science. 35th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 24‒30, 2009. Proceedings. Berlin: Springer (ISBN 978-3-540-95890-1/pbk). Lecture Notes in Computer Science 5404, 413-424 (2009).
108
Hardness of approximate two-level logic minimization and PAC learning with membership queries. (English)
J. Comput. Syst. Sci. 75, No. 1, 13-26 (2009).
109
Matching points with rectangles and squares. (English)
Comput. Geom. 42, No. 2, 93-108 (2009).
110
Nash equilibria solutions in the competitive salesmen problem on a network. (English)
Appl. Comput. Math. 7, No. 1, 54-65 (2008).
111
An approximation algorithm for solving shortest path improvement problem under Hamming distance. (Chinese)
J. Lanzhou Univ. Technol. 34, No. 4, 98-100 (2008).
112
Minimizing the number of late jobs in a stochastic setting using a chance constraint. (English)
J. Sched. 11, No. 1, 59-69 (2008).
113
Improvement of shortest path of arborescent network in the case of Hamming distance. (Chinese)
J. Lanzhou Univ. Technol. 34, No. 2, 84-86 (2008).
114
On minimum $k$-modal partitions of permutations. (English)
J. Discrete Algorithms 6, No. 3, 381-392 (2008).
115
Reconfigurations in graphs and grids. (English)
SIAM J. Discrete Math. 22, No. 1, 124-138 (2008).
116
Identification and signatures based on NP-hard problems of indefinite quadratic forms. (English)
J. Math. Cryptol. 2, No. 4, 327-341 (2008).
117
Student-project allocation with preferences over projects. (English)
J. Discrete Algorithms 6, No. 4, 553-560 (2008).
118
Approximating the metric TSP in linear time. (English)
Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30‒July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 43-54 (2008).
119
The complexity of equilibria: Hardness results for economies via a correspondence with games. (English)
Theor. Comput. Sci. 408, No. 2-3, 188-198 (2008).
120
Result 101 to 120 of 410 total
Start
Contact
Print
General Help
