Svatopluk Poljak

According to our database1, Svatopluk Poljak authored at least 52 papers between 1981 and 1999.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Constructive Quasi-Ramsey Numbers and Tournament Ranking.
SIAM J. Discrete Math., 1999

Connections between semidefinite relaxations of the max-cut and stable set problems.
Math. Program., 1997

On the Facial Structure of the Set of Correlation Matrices.
SIAM J. Matrix Analysis Applications, 1996

Gap Inequalities for the Cut Polytope.
Eur. J. Comb., 1996

Nonpolyhedral Relaxations of Graph-Bisection Problems.
SIAM Journal on Optimization, 1995

Integer Linear Programs and Local Search for Max-Cut.
SIAM J. Comput., 1995

One-third-integrality in the max-cut problem.
Math. Program., 1995

Convex Relaxations of (0, 1)-Quadratic Programming.
Math. Oper. Res., 1995

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

On the ultimate independence ratio of a graph.
Eur. J. Comb., 1995

Solving the Max-cut Problem Using Eigenvalues.
Discrete Applied Mathematics, 1995

Combining Semidefinite and Polyhedral Relaxations for Integer Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995

Bipartite Subgraphs of Triangle-Free Graphs.
SIAM J. Discrete Math., 1994

The expected relative error of the polyhedral approximation of the max-cut problem.
Oper. Res. Lett., 1994

k-Connectivity and Decomposition of Graphs into Forests.
Discrete Applied Mathematics, 1994

Node and edge relaxations of the Max-cut problem.
Computing, 1994

Laplacian eigenvalues and the maximum cut problem.
Math. Program., 1993

Checking robust nonsingularity is NP-hard.
MCSS, 1993

Efficient Subgraph Packing.
J. Comb. Theory, Ser. B, 1993

The cut cone III: On the role of triangle facets.
Graphs and Combinatorics, 1993

Combinatorial Properties and the Complexity of a Max-cut Approximation .
Eur. J. Comb., 1993

On existence theorems.
Discrete Mathematics, 1993

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

A spectral approach to bandwidth and separator problems in graphs.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Maximum cuts and largest bipartite subgraphs.
Proceedings of the Combinatorial Optimization, 1993

The cut cone III: On the role of triangle facets.
Graphs and Combinatorics, 1992

Max-cut in circulant graphs.
Discrete Mathematics, 1992

A decomposition of strongly unimodular matrices into incidence matrices of diagraphs.
Discrete Mathematics, 1992

Compatible 2-factors.
Discrete Applied Mathematics, 1992

The Metric Polytope.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

Weak Three-Linking in Eulerian Digraphs.
SIAM J. Discrete Math., 1991

Extendability, Dimensions, and Diagrams of Cycle Orders.
SIAM J. Discrete Math., 1991

Eulerian trails through a set of terminals in specific, unique and all orders.
Proceedings of the Graph Structure Theory, 1991

Graphs with the balas - uhry property.
Journal of Graph Theory, 1990

On the maximum number of qualitatively independent partitions.
J. Comb. Theory, Ser. A, 1989

Long induced paths and cycles in Kneser graphs.
Graphs and Combinatorics, 1989

A hierarchy of totally unimodular matrices.
Discrete Mathematics, 1989

Tournament Ranking with Expected Profit in Polynomial Time.
SIAM J. Discrete Math., 1988

On matroids induced by packing subgraphs.
J. Comb. Theory, Ser. B, 1988

On common edges in optimal solutions to traveling salesman and other optimization problems.
Discrete Applied Mathematics, 1988

Maximum bipartite subgraphs of Kneser graphs.
Graphs and Combinatorics, 1987

Transformations on Graphs and Convexity.
Complex Systems, 1987

A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound.
Discrete Mathematics, 1986

On pre-periods of discrete influence systems.
Discrete Applied Mathematics, 1986

On an application of convexity to discrete systems.
Discrete Applied Mathematics, 1986

On a product dimension of bipartite graphs.
Journal of Graph Theory, 1983

On qualitatively independent partitions and related problems.
Discrete Applied Mathematics, 1983

On periodical behavior in societies with symmetric influences.
Combinatorica, 1983

A note on sticky matroids.
Discrete Mathematics, 1982

On set systems determined by intersections.
Discrete Mathematics, 1981

On the dimension of trees.
Discrete Mathematics, 1981

Complexity of representation of graphs by set systems.
Discrete Applied Mathematics, 1981