dblp.uni-trier.dewww.uni-trier.de

Svatopluk Poljak

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

1999
32EEAndrzej 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
30EEMonique 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
28EESvatopluk 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
25EETakao Nishizeki, Svatopluk Poljak: k-Connectivity and Decomposition of Graphs into Forests. Discrete Applied Mathematics 55(3): 295-301 (1994)
24EESvatopluk 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
22EECharles 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)
21EESvatopluk Poljak: On existence theorems. Discrete Mathematics 111(1-3): 423-434 (1993)
20EECharles Delorme, Svatopluk Poljak: Combinatorial Properties and the Complexity of a Max-cut Approximation . Eur. J. Comb. 14(4): 313-333 (1993)
19EEMartin 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
16EEJan Kratochvíl, Svatopluk Poljak: Compatible 2-factors. Discrete Applied Mathematics 36(3): 253-266 (1992)
15EEY. Crama, Martin Loebl, Svatopluk Poljak: A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. Discrete Mathematics 102(2): 143-147 (1992)
14EESvatopluk 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
10EEMartin Loebl, Svatopluk Poljak: A hierarchy of totally unimodular matrices. Discrete Mathematics 76(3): 241-246 (1989)
9EESvatopluk Poljak, Zsolt Tuza: On the maximum number of qualitatively independent partitions. J. Comb. Theory, Ser. A 51(1): 111-116 (1989)
1988
8EEMarek Chrobak, Svatopluk Poljak: On common edges in optimal solutions to traveling salesman and other optimization problems. Discrete Applied Mathematics 20(2): 101-111 (1988)
7EEMartin 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
5EESvatopluk 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
3EESvatopluk Poljak, Daniel Turzík: A note on sticky matroids. Discrete Mathematics 42(1): 119-123 (1982)
1981
2EESvatopluk Poljak, Ales Pultr: On the dimension of trees. Discrete Mathematics 34(2): 165-171 (1981)
1EESvatopluk Poljak, Vojtech Rödl: On set systems determined by intersections. Discrete Mathematics 34(2): 173-184 (1981)

Coauthor Index

1Peter Alles [11]
2Jørgen Bang-Jensen [13]
3Marek Chrobak [8]
4Y. Crama [15]
5Andrzej Czygrinow [32]
6Charles Delorme [18] [20] [22]
7Christoph Helmberg [23] [29]
8Toshihide Ibaraki [12]
9Jan Kratochvíl [16]
10Monique Laurent [17] [27] [30] [31]
11Martin Loebl [7] [10] [15] [19]
12Bojan Mohar [23]
13Jaroslav Nesetril (Jarik Nesetril) [11]
14Takao Nishizeki [25]
15Ales Pultr [2]
16Franz Rendl [23] [28] [29] [31]
17Vojtech Rödl [1] [6] [32]
18Joel H. Spencer (Joel Spencer) [6]
19Miroslav Sura [4]
20Daniel Turzík [3] [5] [14]
21Zsolt Tuza [9] [24]
22Henry Wolkowicz [29]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)