| 1999 |
|---|
| 32 | EE | Andrzej Czygrinow,
Svatopluk Poljak,
Vojtech Rödl:
Constructive Quasi-Ramsey Numbers and Tournament Ranking.
SIAM J. Discrete Math. 12(1): 48-63 (1999) |
| 1997 |
|---|
| 31 | | Monique Laurent,
Svatopluk Poljak,
Franz Rendl:
Connections between semidefinite relaxations of the max-cut and stable set problems.
Math. Program. 77: 225-246 (1997) |
| 1996 |
|---|
| 30 | EE | Monique Laurent,
Svatopluk Poljak:
Gap Inequalities for the Cut Polytope.
Eur. J. Comb. 17(2-3): 233-254 (1996) |
| 1995 |
|---|
| 29 | | Christoph Helmberg,
Svatopluk Poljak,
Franz Rendl,
Henry Wolkowicz:
Combining Semidefinite and Polyhedral Relaxations for Integer Programs.
IPCO 1995: 124-134 |
| 28 | EE | Svatopluk Poljak,
Franz Rendl:
Solving the Max-cut Problem Using Eigenvalues.
Discrete Applied Mathematics 62(1-3): 249-278 (1995) |
| 27 | | Monique Laurent,
Svatopluk Poljak:
One-third-integrality in the max-cut problem.
Math. Program. 71: 29-50 (1995) |
| 26 | | Svatopluk Poljak:
Integer Linear Programs and Local Search for Max-Cut.
SIAM J. Comput. 24(4): 822-839 (1995) |
| 1994 |
|---|
| 25 | EE | Takao Nishizeki,
Svatopluk Poljak:
k-Connectivity and Decomposition of Graphs into Forests.
Discrete Applied Mathematics 55(3): 295-301 (1994) |
| 24 | EE | Svatopluk Poljak,
Zsolt Tuza:
Bipartite Subgraphs of Triangle-Free Graphs.
SIAM J. Discrete Math. 7(2): 307-313 (1994) |
| 1993 |
|---|
| 23 | | Christoph Helmberg,
Bojan Mohar,
Svatopluk Poljak,
Franz Rendl:
A spectral approach to bandwidth and separator problems in graphs.
IPCO 1993: 183-194 |
| 22 | EE | Charles Delorme,
Svatopluk Poljak:
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs.
Discrete Mathematics 111(1-3): 145-156 (1993) |
| 21 | EE | Svatopluk Poljak:
On existence theorems.
Discrete Mathematics 111(1-3): 423-434 (1993) |
| 20 | EE | Charles Delorme,
Svatopluk Poljak:
Combinatorial Properties and the Complexity of a Max-cut Approximation .
Eur. J. Comb. 14(4): 313-333 (1993) |
| 19 | EE | Martin Loebl,
Svatopluk Poljak:
Efficient Subgraph Packing.
J. Comb. Theory, Ser. B 59(1): 106-121 (1993) |
| 18 | | Charles Delorme,
Svatopluk Poljak:
Laplacian eigenvalues and the maximum cut problem.
Math. Program. 62: 557-574 (1993) |
| 1992 |
|---|
| 17 | | Monique Laurent,
Svatopluk Poljak:
The Metric Polytope.
IPCO 1992: 274-286 |
| 16 | EE | Jan Kratochvíl,
Svatopluk Poljak:
Compatible 2-factors.
Discrete Applied Mathematics 36(3): 253-266 (1992) |
| 15 | EE | Y. Crama,
Martin Loebl,
Svatopluk Poljak:
A decomposition of strongly unimodular matrices into incidence matrices of diagraphs.
Discrete Mathematics 102(2): 143-147 (1992) |
| 14 | EE | Svatopluk Poljak,
Daniel Turzík:
Max-cut in circulant graphs.
Discrete Mathematics 108(1-3): 379-392 (1992) |
| 1991 |
|---|
| 13 | | Jørgen Bang-Jensen,
Svatopluk Poljak:
Eulerian trails through a set of terminals in specific, unique and all orders.
Graph Structure Theory 1991: 247-258 |
| 12 | | Toshihide Ibaraki,
Svatopluk Poljak:
Weak Three-Linking in Eulerian Digraphs.
SIAM J. Discrete Math. 4(1): 84-98 (1991) |
| 11 | | Peter Alles,
Jaroslav Nesetril,
Svatopluk Poljak:
Extendability, Dimensions, and Diagrams of Cycle Orders.
SIAM J. Discrete Math. 4(4): 453-471 (1991) |
| 1989 |
|---|
| 10 | EE | Martin Loebl,
Svatopluk Poljak:
A hierarchy of totally unimodular matrices.
Discrete Mathematics 76(3): 241-246 (1989) |
| 9 | EE | Svatopluk Poljak,
Zsolt Tuza:
On the maximum number of qualitatively independent partitions.
J. Comb. Theory, Ser. A 51(1): 111-116 (1989) |
| 1988 |
|---|
| 8 | EE | Marek Chrobak,
Svatopluk Poljak:
On common edges in optimal solutions to traveling salesman and other optimization problems.
Discrete Applied Mathematics 20(2): 101-111 (1988) |
| 7 | EE | Martin Loebl,
Svatopluk Poljak:
On matroids induced by packing subgraphs.
J. Comb. Theory, Ser. B 44(3): 338-354 (1988) |
| 6 | | Svatopluk Poljak,
Vojtech Rödl,
Joel Spencer:
Tournament Ranking with Expected Profit in Polynomial Time.
SIAM J. Discrete Math. 1(3): 372-376 (1988) |
| 1986 |
|---|
| 5 | EE | Svatopluk Poljak,
Daniel Turzík:
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound.
Discrete Mathematics 58(1): 99-104 (1986) |
| 1983 |
|---|
| 4 | | Svatopluk Poljak,
Miroslav Sura:
On periodical behavior in societies with symmetric influences.
Combinatorica 3(1): 119-121 (1983) |
| 1982 |
|---|
| 3 | EE | Svatopluk Poljak,
Daniel Turzík:
A note on sticky matroids.
Discrete Mathematics 42(1): 119-123 (1982) |
| 1981 |
|---|
| 2 | EE | Svatopluk Poljak,
Ales Pultr:
On the dimension of trees.
Discrete Mathematics 34(2): 165-171 (1981) |
| 1 | EE | Svatopluk Poljak,
Vojtech Rödl:
On set systems determined by intersections.
Discrete Mathematics 34(2): 173-184 (1981) |
