Result 1 to 20 from 91 total
An application of Stahl’s conjecture about the $k$-tuple chromatic numbers of Kneser graphs. (English)
Brams, Steven J. (ed.) et al., The mathematics of preference, choice and order. Essays in honor of Peter C. Fishburn. Berlin: Springer (ISBN 978-3-540-79127-0/hbk; 978-3-540-79128-7/ebook). Studies in Choice and Welfare, 345-352 (2009).
1
Constructive quasi-Ramsey numbers and tournament ranking. (English)
SIAM J. Discrete Math. 12, No.1, 48-63 (1999).
2
Connection between semidefinite relaxations of the max-cut and stable set problems. (English)
Math. Program. 77, No.2 (B), 225-246 (1997).
3
On the facial structure of the set of correlation matrices. (English)
SIAM J. Matrix Anal. Appl. 17, No.3, 530-547 (1996).
4
Gap inequalities for the cut polytope (English)
Eur. J. Comb. 17, No. 2-3, 233-254 (1996).
5
Extremum and convergence of local average degrees in graphs. (English)
Congr. Numerantium 112, 191-198 (1995).
6
One-third-integrality in the max-cut problem. (English)
Math. Program. 71, No.1 (A), 29-50 (1995).
7
Convex relaxations of $(0,1)$-quadratic programming. (English)
Math. Oper. Res. 20, No.3, 550-561 (1995).
8
A spectral approach to bandwidth and separator problems in graphs. (English)
Linear Multilinear Algebra 39, No.1-2, 73-90 (1995).
9
Integer linear programs and local search for max-cut. (English)
SIAM J. Comput. 24, No.4, 822-839 (1995).
10
Nonpolyhedral relaxations of graph-bisection problems. (English)
SIAM J. Optim. 5, No.3, 467-487 (1995).
11
Solving the max-cut problem using eigenvalues. (English)
Discrete Appl. Math. 62, No.1-3, 249-278 (1995).
12
Maximum cuts and large bipartite subgraphs. (English)
Cook, William (ed.) et al., Combinatorial optimization. Papers from the DIMACS special year. Papers from workshops held at DIMACS at Rutgers University, New Brunswick, NJ, USA, Sept. 1992-Aug. 1993. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 20, 181-244 (1995).
13
On a positive semidefinite relaxation of the cut polytope. (English)
Linear Algebra Appl. 223-224, 439-461 (1995).
14
On the ultimate independence ratio of a graph. (English)
Eur. J. Comb. 16, No.3, 253-261 (1995).
15
Combining semidefinite and polyhedral relaxations for integer programs (English)
IPCO, 124-134 (1995).
16
The expected relative error of the polyhedral approximation of the max- cut problem. (English)
Oper. Res. Lett. 16, No.4, 191-198 (1994).
17
$k$-connectivity and decomposition of graphs into forests. (English)
Discrete Appl. Math. 55, No.3, 295-301 (1994).
18
Bipartite subgraphs of triangle-free graphs. (English)
SIAM J. Discrete Math. 7, No.2, 307-313 (1994).
19
Node and edge relaxations of the max-cut problem. (English)
Computing 52, No.2, 123-137 (1994).
20
Result 1 to 20 from 91 total
Start
Contact
Print
General Help
