Result 1 to 20 of 4427 total
Spanning cactus of a graph: Existence, extension, optimization, and approximation. (English)
Discrete Appl. Math. 161, No. 1-2, 167-175 (2013).
1
Parallel dedicated machines scheduling with chain precedence constraints. (English)
Eur. J. Oper. Res. 221, No. 2, 296-305 (2012).
2
Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases. (English)
Japan J. Ind. Appl. Math. 29, No. 3, 385-400 (2012).
3
Evaluating geometric queries using few arithmetic operations. (English)
Appl. Algebra Eng. Commun. Comput. 23, No. 3-4, 179-193 (2012).
4
The price of multi-organization constraint in unrelated parallel machine scheduling. (English)
Parallel Process. Lett. 22, No. 2, Paper No. 1250006, 17 p. (2012).
5
On the computational complexity of routing in faulty $k$-ary $n$-cubes and hypercubes. (English)
Parallel Process. Lett. 22, No. 1, Paper No. 1250003, 13 p. (2012).
6
Inseparability and strong hypotheses for disjoint NP pairs. (English)
Theory Comput. Syst. 51, No. 2, 229-247 (2012).
7
Collapsing and separating completeness notions under average-case and worst-case hypotheses. (English)
Theory Comput. Syst. 51, No. 2, 248-265 (2012).
8
On the expression complexity of equivalence and isomorphism of primitive positive formulas. (English)
Theory Comput. Syst. 50, No. 2, 329-353 (2012).
9
The navigational power of web browsers. (English)
Theory Comput. Syst. 50, No. 2, 213-240 (2012).
10
Coalition structure generation over graphs. (English)
J. Artif. Intell. Res. (JAIR) 45, 165-196 (2012).
11
The tractability of CSP classes defined by forbidden patterns. (English)
J. Artif. Intell. Res. (JAIR) 45, 47-78 (2012).
12
Boolean autoencoders and hypercube clustering complexity. (English)
Des. Codes Cryptography 65, No. 3, 383-403 (2012).
13
EXPTIME-completeness of thorough refinement on modal transition systems. (English)
Inf. Comput. 218, 54-68 (2012).
14
Hardness results on the gapped consecutive-ones property problem. (English)
Discrete Appl. Math. 160, No. 18, 2760-2768 (2012).
15
ML with PTIME complexity guarantees. (English)
Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3‒6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPICS ‒ Leibniz International Proceedings in Informatics 16, 198-212, electronic only (2012).
16
Equivalence constraint satisfaction problems. (English)
Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3‒6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPICS ‒ Leibniz International Proceedings in Informatics 16, 122-136, electronic only (2012).
17
Multivariate complexity analysis of Swap Bribery. (English)
Algorithmica 64, No. 1, 126-151 (2012).
18
An algorithm of automatic workflow optimization. (English)
Program. Comput. Softw. 38, No. 1, 43-56 (2012); translation from Programmirovanie 38, No. 1 (2012).
19
Scheduling problems with position dependent job processing times: computational complexity results. (English)
Ann. Oper. Res. 196, 491-516 (2012).
20
Result 1 to 20 of 4427 total
Start
Contact
Print
General Help
