Svatopluk Poljak

Publication Activity (10 Years)

Years Active: 1981-1999
Publications (10 Years): 0

Publications

Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl
Constructive Quasi-Ramsey Numbers and Tournament Ranking. SIAM J. Discret. Math. 12 (1) (1999)
Monique Laurent, Svatopluk Poljak, Franz Rendl
Connections between semidefinite relaxations of the max-cut and stable set problems. Math. Program. 77 (1997)
Monique Laurent, Svatopluk Poljak
Gap Inequalities for the Cut Polytope. Eur. J. Comb. 17 (2-3) (1996)
Monique Laurent, Svatopluk Poljak
On the Facial Structure of the Set of Correlation Matrices. SIAM J. Matrix Anal. Appl. 17 (3) (1996)
Svatopluk Poljak, Franz Rendl
Solving the Max-cut Problem Using Eigenvalues. Discret. Appl. Math. 62 (1-3) (1995)
Gena Hahn, Pavol Hell, Svatopluk Poljak
On the ultimate independence ratio of a graph. Eur. J. Comb. 16 (3) (1995)
Monique Laurent, Svatopluk Poljak
One-third-integrality in the max-cut problem. Math. Program. 71 (1995)
Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
A recipe for semidefinite relaxation for (0, 1)-quadratic programming - In memory of Svata Poljak. J. Glob. Optim. 7 (1) (1995)
Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
Combining Semidefinite and Polyhedral Relaxations for Integer Programs. IPCO (1995)
Svatopluk Poljak, Franz Rendl
Nonpolyhedral Relaxations of Graph-Bisection Problems. SIAM J. Optim. 5 (3) (1995)
Svatopluk Poljak
Integer Linear Programs and Local Search for Max-Cut. SIAM J. Comput. 24 (4) (1995)
Svatopluk Poljak, Henry Wolkowicz
Convex Relaxations of (0, 1)-Quadratic Programming. Math. Oper. Res. 20 (3) (1995)
Takao Nishizeki, Svatopluk Poljak
k-Connectivity and Decomposition of Graphs into Forests. Discret. Appl. Math. 55 (3) (1994)
Svatopluk Poljak, Zsolt Tuza
Bipartite Subgraphs of Triangle-Free Graphs. SIAM J. Discret. Math. 7 (2) (1994)
Svatopluk Poljak, Franz Rendl
Node and edge relaxations of the Max-cut problem. Computing 52 (2) (1994)
Svatopluk Poljak, Zsolt Tuza
The expected relative error of the polyhedral approximation of the max-cut problem. Oper. Res. Lett. 16 (4) (1994)
Martin Loebl, Svatopluk Poljak
Efficient Subgraph Packing. J. Comb. Theory, Ser. B 59 (1) (1993)
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl
A spectral approach to bandwidth and separator problems in graphs. IPCO (1993)
Charles Delorme, Svatopluk Poljak
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Discret. Math. 111 (1-3) (1993)
Charles Delorme, Svatopluk Poljak
Combinatorial Properties and the Complexity of a Max-cut Approximation . Eur. J. Comb. 14 (4) (1993)
Michel Deza, Monique Laurent, Svatopluk Poljak
The cut cone III: On the role of triangle facets. Graphs Comb. 9 (2-4) (1993)
Svatopluk Poljak
On existence theorems. Discret. Math. 111 (1-3) (1993)
Svatopluk Poljak, Jiri Rohn
Checking robust nonsingularity is NP-hard. Math. Control. Signals Syst. 6 (1) (1993)
Charles Delorme, Svatopluk Poljak
Laplacian eigenvalues and the maximum cut problem. Math. Program. 62 (1993)
Svatopluk Poljak, Zsolt Tuza
Maximum cuts and largest bipartite subgraphs. Combinatorial Optimization (1993)
Jan Kratochvíl, Svatopluk Poljak
Compatible 2-factors. Discret. Appl. Math. 36 (3) (1992)
Michel Deza, Monique Laurent, Svatopluk Poljak
The cut cone III: On the role of triangle facets. Graphs Comb. 8 (2) (1992)
Svatopluk Poljak, Daniel Turzík
Max-cut in circulant graphs. Discret. Math. 108 (1-3) (1992)
Yves Crama, Martin Loebl, Svatopluk Poljak
A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. Discret. Math. 102 (2) (1992)
Monique Laurent, Svatopluk Poljak
The Metric Polytope. IPCO (1992)
Toshihide Ibaraki, Svatopluk Poljak
Weak Three-Linking in Eulerian Digraphs. SIAM J. Discret. Math. 4 (1) (1991)
Peter Alles, Jaroslav Nesetril, Svatopluk Poljak
Extendability, Dimensions, and Diagrams of Cycle Orders. SIAM J. Discret. Math. 4 (4) (1991)
Jørgen Bang-Jensen, Svatopluk Poljak
Eulerian trails through a set of terminals in specific, unique and all orders. Graph Structure Theory (1991)
Mikio Kano, Svatopluk Poljak
Graphs with the balas - uhry property. J. Graph Theory 14 (5) (1990)
Martin Loebl, Svatopluk Poljak
A hierarchy of totally unimodular matrices. Discret. Math. 76 (3) (1989)
Peter Alles, Svatopluk Poljak
Long induced paths and cycles in Kneser graphs. Graphs Comb. 5 (1) (1989)
Svatopluk Poljak, Zsolt Tuza
On the maximum number of qualitatively independent partitions. J. Comb. Theory, Ser. A 51 (1) (1989)
Svatopluk Poljak, Vojtech Rödl, Joel Spencer
Tournament Ranking with Expected Profit in Polynomial Time. SIAM J. Discret. Math. 1 (3) (1988)
Marek Chrobak, Svatopluk Poljak
On common edges in optimal solutions to traveling salesman and other optimization problems. Discret. Appl. Math. 20 (2) (1988)
Martin Loebl, Svatopluk Poljak
On matroids induced by packing subgraphs. J. Comb. Theory, Ser. B 44 (3) (1988)
Svatopluk Poljak
Transformations on Graphs and Convexity. Complex Syst. 1 (5) (1987)
Svatopluk Poljak, Zsolt Tuza
Maximum bipartite subgraphs of Kneser graphs. Graphs Comb. 3 (1) (1987)
Svatopluk Poljak, Daniel Turzík
On an application of convexity to discrete systems. Discret. Appl. Math. 13 (1) (1986)
Svatopluk Poljak, Daniel Turzík
On pre-periods of discrete influence systems. Discret. Appl. Math. 13 (1) (1986)
Svatopluk Poljak, Daniel Turzík
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. Discret. Math. 58 (1) (1986)
Svatopluk Poljak, Miroslav Sura
On periodical behavior in societies with symmetric influences. Comb. 3 (1) (1983)
Svatopluk Poljak, Ales Pultr, Vojtech Rödl
On qualitatively independent partitions and related problems. Discret. Appl. Math. 6 (2) (1983)
Svatopluk Poljak, Vojtech Rödl, Ales Pultr
On a product dimension of bipartite graphs. J. Graph Theory 7 (4) (1983)
Svatopluk Poljak, Daniel Turzík
A note on sticky matroids. Discret. Math. 42 (1) (1982)
Svatopluk Poljak, Ales Pultr
On the dimension of trees. Discret. Math. 34 (2) (1981)
Svatopluk Poljak, Vojtech Rödl, Daniel Turzík
Complexity of representation of graphs by set systems. Discret. Appl. Math. 3 (4) (1981)
Jaroslav Nesetril, Svatopluk Poljak, Daniel Turzík
Amalgamation of matroids and its applications. J. Comb. Theory, Ser. B 31 (3) (1981)
Svatopluk Poljak, Vojtech Rödl
On the arc-chromatic number of a digraph. J. Comb. Theory, Ser. B 31 (2) (1981)
Svatopluk Poljak, Vojtech Rödl
On set systems determined by intersections. Discret. Math. 34 (2) (1981)