Svatopluk Poljak

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