Result 1 to 20 of 2900 total
4-coloring $H$-free graphs when $H$ is small. (English)
Discrete Appl. Math. 161, No. 1-2, 140-150 (2013).
1
Normal art galleries: Wall in - all in. (English)
Comput. Geom. 46, No. 1, 7-16 (2013).
2
Castelnuovo-Mumford regularity and computing the de Rham cohomology of smooth projective varieties. (English)
Found. Comput. Math. 12, No. 5, 541-571 (2012).
3
Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. (English)
Numer. Algorithms 61, No. 4, 659-680 (2012).
4
To solving the eigenvalue problem for polynomial matrices of general form. (English)
J. Math. Sci., New York 182, No. 6, 830-833 (2012); translation from Zap. Nauchn. Semin. POMI 395, 154-161 (2011).
5
Maximum regular induced subgraphs in $2P_3$-free graphs. (English)
Theor. Comput. Sci. 460, 26-33 (2012).
6
On edge-sets of bicliques in graphs. (English)
Discrete Appl. Math. 160, No. 18, 2698-2708 (2012).
7
Nash resolution for binomial varieties as Euclidean division. A priori termination bound, polynomial complexity in essential dimension 2. (English)
Adv. Math. 231, No. 6, 3389-3428 (2012).
8
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. (English)
Networks 60, No. 2, 103-119 (2012).
9
Two-machine flow-shop scheduling with rejection. (English)
Comput. Oper. Res. 39, No. 5, 1087-1096 (2012).
10
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one. (English)
Ann. Oper. Res. 196, 247-261 (2012).
11
Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem. (English)
Appl. Numer. Math. 62, No. 12, 1685-1700 (2012).
12
On the recognition of $k$-equistable graphs. (English)
Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26‒28, 2012. Revised selcted papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 286-296 (2012).
13
Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization. (English)
Math. Program. 134, No. 1 (B), 223-257 (2012).
14
A filtered Lanczos procedure for extreme and interior eigenvalue problems. (English)
SIAM J. Sci. Comput. 34, No. 4, A2220-A2246 (2012).
15
Characterization of removable elements with respect to having $k$ disjoint bases in a matroid. (English)
Discrete Appl. Math. 160, No. 16-17, 2445-2451 (2012).
16
Short-step primal-dual target-following algorithms for the convex quadratic problems. (English)
Int. J. Pure Appl. Math. 77, No. 3, 337-348 (2012).
17
Real intersection points of piecewise algebraic curves. (English)
Appl. Math. Lett. 25, No. 10, 1299-1303 (2012).
18
An algorithm for finding a maximum $t$-matching excluding complete partite subgraphs. (English)
Discrete Optim. 9, No. 2, 98-108 (2012).
19
On the complexity of a Mehrotra-type predictor-corrector algorithm. (English)
Murgante, Beniamino (ed.) et al., Computational science and its applications ‒ ICCSA 2012. 12th international conference, Salvador de Bahia, Brazil, June 18‒21, 2012. Proceedings, Part III. Berlin: Springer (ISBN 978-3-642-31136-9/pbk). Lecture Notes in Computer Science 7335, 17-29 (2012).
20
Result 1 to 20 of 2900 total
Start
Contact
Print
General Help
