Result 1 to 20 of 83 total
Minimax trees in linear time with applications. (English)
Eur. J. Comb. 34, No. 1, 82-90 (2013).
1
Some results on harmonic mean graphs. (English)
Int. J. Contemp. Math. Sci. 7, No. 1-4, 197-208 (2012).
2
On quasigroups with few associative triples. (English)
Des. Codes Cryptography 64, No. 1-2, 221-227 (2012).
3
Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem. (English)
J. Optim. Theory Appl. 152, No. 2, 450-467 (2012).
4
Hamiltonian cycle problem and Markov chains. (English)
International Series in Operations Research \& Management Science 171. New York, NY: Springer (ISBN 978-1-4614-3231-9/hbk; 978-1-4614-3232-6/ebook). xiv, 201~p. EUR~99.95/net; SFR~133.50; \sterling~90.00; \$~129.00/hbk (2012).
5
Graph algorithms. Edited by Guy Even. With a foreword by Richard M. Karp. 2nd ed. (English)
Cambridge: Cambridge University Press (ISBN 978-0-521-73653-4/pbk; 978-0-521-51718-8/hbk; 978-1-139-21056-0/ebook). xii, 189~p. \sterling~19.99; \$~32.99/pbk; \sterling~55.00; \$~90.00/hbk (2012).
6
Design and analysis of approximation algorithms. (English)
Springer Optimization and Its Applications 62. New York, NY: Springer (ISBN 978-1-4614-1700-2/hbk; 978-1-4614-1701-9/ebook). xi, 440~p. EUR~59.95/net; SFR~80.00; \sterling~53.99; \$~74.95 (2012).
7
Arbitrarily large jumps of the Golovach function for trees. (English)
Vestn. St. Petersbg. Univ., Math. 44, No. 1, 59-65 (2011); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 2011, No. 1, 84-93 (2011).
8
A polynomial time OPT + 1 algorithm for the cutting stock problem with a constant number of object lengths. (English)
Math. Oper. Res. 36, No. 4, 743-753 (2011).
9
Complexity of variants of Tseng’s modified F-B splitting and Korpelevich’s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems. (English)
SIAM J. Optim. 21, No. 4, 1688-1720 (2011).
10
Global optimality conditions and optimization methods for quadratic knapsack problems. (English)
J. Optim. Theory Appl. 151, No. 2, 241-259 (2011).
11
Complex graph algorithms. (English)
Kepner, Jeremy (ed.) et al., Graph algorithms in the language of linear algebra. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898719-90-1/hbk). Software - Environments - Tools 22, 59-84 (2011).
12
Graphs and matrices. (English)
Kepner, Jeremy (ed.) et al., Graph algorithms in the language of linear algebra. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898719-90-1/hbk). Software - Environments - Tools 22, 3-12 (2011).
13
Some constructions of integral graphs. (English)
Linear Multilinear Algebra 59, No. 11, 1269-1279 (2011).
14
Least-squares approximations in geometric buildup for solving distance geometry problems. (English)
J. Optim. Theory Appl. 149, No. 3, 580-598 (2011).
15
Metric clustering via consistent labeling. (English)
Theory Comput. 7, Paper No. 5, 49-74, electronic only (2011).
16
A new variant of Elgamal’s encryption and signatures schemes. (English)
JP J. Algebra Number Theory Appl. 20, No. 1, 21-39 (2011).
17
Connections in combinatorial optimization. (English)
Oxford Lecture Series in Mathematics and Its Applications 38. Oxford: Oxford University Press (ISBN 978-0-19-920527-1/hbk). xxiii, 639~p. \sterling~75.00 (2011).
18
Nontrivial discontinuities of the Golovach functions for trees. (English)
Vestn. St. Petersbg. Univ., Math. 43, No. 3, 123-130 (2010); translation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 2010, No. 3, 3-12 (2010).
19
Cordial labeling and arbitrary super subdivision of some graphs. (English)
Int. J. Inf. Sci. Comput. Math. 2, No. 1, 51-60 (2010).
20
Result 1 to 20 of 83 total
Start
Contact
Print
General Help
