Svatopluk Poljak

According to our database, Svatopluk Poljak authored at least 53 papers between 1981 and 1999.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

1999

Constructive Quasi-Ramsey Numbers and Tournament Ranking.

Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl

SIAM J. Discret. Math., 1999

1997

Connections between semidefinite relaxations of the max-cut and stable set problems.

Monique Laurent, Svatopluk Poljak, Franz Rendl

Math. Program., 1997

1996

On the Facial Structure of the Set of Correlation Matrices.

Monique Laurent, Svatopluk Poljak

SIAM J. Matrix Anal. Appl., 1996

Gap Inequalities for the Cut Polytope.

Monique Laurent, Svatopluk Poljak

Eur. J. Comb., 1996

1995

Nonpolyhedral Relaxations of Graph-Bisection Problems.

Svatopluk Poljak, Franz Rendl

SIAM J. Optim., 1995

Integer Linear Programs and Local Search for Max-Cut.

Svatopluk Poljak

SIAM J. Comput., 1995

One-third-integrality in the max-cut problem.

Monique Laurent, Svatopluk Poljak

Math. Program., 1995

Convex Relaxations of (0, 1)-Quadratic Programming.

Svatopluk Poljak, Henry Wolkowicz

Math. Oper. Res., 1995

A recipe for semidefinite relaxation for (0, 1)-quadratic programming - In memory of Svata Poljak.

Svatopluk Poljak, Franz Rendl, Henry Wolkowicz

J. Glob. Optim., 1995

On the ultimate independence ratio of a graph.

Gena Hahn, Pavol Hell, Svatopluk Poljak

Eur. J. Comb., 1995

Solving the Max-cut Problem Using Eigenvalues.

Svatopluk Poljak, Franz Rendl

Discret. Appl. Math., 1995

Combining Semidefinite and Polyhedral Relaxations for Integer Programs.

Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Bipartite Subgraphs of Triangle-Free Graphs.

Svatopluk Poljak, Zsolt Tuza

SIAM J. Discret. Math., 1994

The expected relative error of the polyhedral approximation of the max-cut problem.

Svatopluk Poljak, Zsolt Tuza

Oper. Res. Lett., 1994

k-Connectivity and Decomposition of Graphs into Forests.

Takao Nishizeki, Svatopluk Poljak

Discret. Appl. Math., 1994

Node and edge relaxations of the Max-cut problem.

Svatopluk Poljak, Franz Rendl

Computing, 1994

1993

Laplacian eigenvalues and the maximum cut problem.

Charles Delorme, Svatopluk Poljak

Math. Program., 1993

Checking robust nonsingularity is NP-hard.

Svatopluk Poljak, Jiri Rohn

Math. Control. Signals Syst., 1993

Efficient Subgraph Packing.

Martin Loebl, Svatopluk Poljak

J. Comb. Theory B, 1993

The cut cone III: On the role of triangle facets.

Michel Deza, Monique Laurent, Svatopluk Poljak

Graphs Comb., 1993

Combinatorial Properties and the Complexity of a Max-cut Approximation .

Charles Delorme, Svatopluk Poljak

Eur. J. Comb., 1993

On existence theorems.

Svatopluk Poljak

Discret. Math., 1993

The performance of an eigenvalue bound on the max-cut problem in some classes of graphs.

Charles Delorme, Svatopluk Poljak

Discret. Math., 1993

A spectral approach to bandwidth and separator problems in graphs.

Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Maximum cuts and largest bipartite subgraphs.

Svatopluk Poljak, Zsolt Tuza

Proceedings of the Combinatorial Optimization, 1993

1992

Max-cut in circulant graphs.

Svatopluk Poljak, Daniel Turzík

Discret. Math., 1992

A decomposition of strongly unimodular matrices into incidence matrices of diagraphs.

Yves Crama, Martin Loebl, Svatopluk Poljak

Discret. Math., 1992

Compatible 2-factors.

Jan Kratochvíl, Svatopluk Poljak

Discret. Appl. Math., 1992

The Metric Polytope.

Monique Laurent, Svatopluk Poljak

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991

Weak Three-Linking in Eulerian Digraphs.

Toshihide Ibaraki, Svatopluk Poljak

SIAM J. Discret. Math., 1991

Extendability, Dimensions, and Diagrams of Cycle Orders.

Peter Alles, Jaroslav Nesetril, Svatopluk Poljak

SIAM J. Discret. Math., 1991

Eulerian trails through a set of terminals in specific, unique and all orders.

Jørgen Bang-Jensen, Svatopluk Poljak

Proceedings of the Graph Structure Theory, 1991

1990

Graphs with the balas - uhry property.

Mikio Kano, Svatopluk Poljak

J. Graph Theory, 1990

1989

On the maximum number of qualitatively independent partitions.

Svatopluk Poljak, Zsolt Tuza

J. Comb. Theory A, 1989

Long induced paths and cycles in Kneser graphs.

Peter Alles, Svatopluk Poljak

Graphs Comb., 1989

A hierarchy of totally unimodular matrices.

Martin Loebl, Svatopluk Poljak

Discret. Math., 1989

1988

Tournament Ranking with Expected Profit in Polynomial Time.

Svatopluk Poljak, Vojtech Rödl, Joel Spencer

SIAM J. Discret. Math., 1988

On matroids induced by packing subgraphs.

Martin Loebl, Svatopluk Poljak

J. Comb. Theory B, 1988

On common edges in optimal solutions to traveling salesman and other optimization problems.

Marek Chrobak, Svatopluk Poljak

Discret. Appl. Math., 1988

1987

Maximum bipartite subgraphs of Kneser graphs.

Svatopluk Poljak, Zsolt Tuza

Graphs Comb., 1987

Transformations on Graphs and Convexity.

Svatopluk Poljak

Complex Syst., 1987

1986

A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound.

Svatopluk Poljak, Daniel Turzík

Discret. Math., 1986

On pre-periods of discrete influence systems.

Svatopluk Poljak, Daniel Turzík

Discret. Appl. Math., 1986

On an application of convexity to discrete systems.

Svatopluk Poljak, Daniel Turzík

Discret. Appl. Math., 1986

1983

On a product dimension of bipartite graphs.

Svatopluk Poljak, Vojtech Rödl, Ales Pultr

J. Graph Theory, 1983

On qualitatively independent partitions and related problems.

Svatopluk Poljak, Ales Pultr, Vojtech Rödl

Discret. Appl. Math., 1983

On periodical behavior in societies with symmetric influences.

Svatopluk Poljak, Miroslav Sura

Comb., 1983

1982

A note on sticky matroids.

Svatopluk Poljak, Daniel Turzík

Discret. Math., 1982

1981

On the arc-chromatic number of a digraph.

Svatopluk Poljak, Vojtech Rödl

J. Comb. Theory B, 1981

Amalgamation of matroids and its applications.

Jaroslav Nesetril, Svatopluk Poljak, Daniel Turzík

J. Comb. Theory B, 1981

On set systems determined by intersections.

Svatopluk Poljak, Vojtech Rödl

Discret. Math., 1981

On the dimension of trees.

Svatopluk Poljak, Ales Pultr

Discret. Math., 1981

Complexity of representation of graphs by set systems.

Svatopluk Poljak, Vojtech Rödl, Daniel Turzík

Discret. Appl. Math., 1981