Svatopluk Poljak - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 53 from 53

1999

Constructive Quasi-Ramsey Numbers and Tournament RankingAndrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl. siamdm, 12(1):48-63, 1999. [doi]

1997

Connections between semidefinite relaxations of the max-cut and stable set problemsMonique Laurent, Svatopluk Poljak, Franz Rendl. mp, 77:225-246, 1997.

1996

Gap Inequalities for the Cut PolytopeMonique Laurent, Svatopluk Poljak. ejc, 17(2-3):233-254, 1996. [doi]

On the Facial Structure of the Set of Correlation MatricesMonique Laurent, Svatopluk Poljak. siammax, 17(3):530-547, 1996. [doi]

1995

On the ultimate independence ratio of a graphGena Hahn, Pavol Hell, Svatopluk Poljak. ejc, 16(3):253-261, 1995. [doi]

Combining Semidefinite and Polyhedral Relaxations for Integer ProgramsChristoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz. ipco 1995: 124-134

One-third-integrality in the max-cut problemMonique Laurent, Svatopluk Poljak. mp, 71:29-50, 1995.

Solving the Max-cut Problem Using EigenvaluesSvatopluk Poljak, Franz Rendl. DAM, 62(1-3):249-278, 1995. [doi]

Integer Linear Programs and Local Search for Max-CutSvatopluk Poljak. SICOMP, 24(4):822-839, 1995.

Nonpolyhedral Relaxations of Graph-Bisection ProblemsSvatopluk Poljak, Franz Rendl. siamjo, 5(3):467-487, 1995. [doi]

A recipe for semidefinite relaxation for (0, 1)-quadratic programming - In memory of Svata PoljakSvatopluk Poljak, Franz Rendl, Henry Wolkowicz. jgo, 7(1):51-73, 1995. [doi]

Convex Relaxations of (0, 1)-Quadratic ProgrammingSvatopluk Poljak, Henry Wolkowicz. mor, 20(3):550-561, 1995. [doi]

1994

k-Connectivity and Decomposition of Graphs into ForestsTakao Nishizeki, Svatopluk Poljak. DAM, 55(3):295-301, 1994. [doi]

Node and edge relaxations of the Max-cut problemSvatopluk Poljak, Franz Rendl. computing, 52(2):123-137, 1994. [doi]

Bipartite Subgraphs of Triangle-Free GraphsSvatopluk Poljak, Zsolt Tuza. siamdm, 7(2):307-313, 1994. [doi]

The expected relative error of the polyhedral approximation of the max-cut problemSvatopluk Poljak, Zsolt Tuza. orl, 16(4):191-198, 1994. [doi]

1993

Combinatorial Properties and the Complexity of a Max-cut Approximation Charles Delorme, Svatopluk Poljak. ejc, 14(4):313-333, 1993. [doi]

Laplacian eigenvalues and the maximum cut problemCharles Delorme, Svatopluk Poljak. mp, 62:557-574, 1993.

The performance of an eigenvalue bound on the max-cut problem in some classes of graphsCharles Delorme, Svatopluk Poljak. DM, 111(1-3):145-156, 1993. [doi]

The cut cone III: On the role of triangle facetsMichel Deza, Monique Laurent, Svatopluk Poljak. gc, 9(2-4):135-152, 1993. [doi]

A spectral approach to bandwidth and separator problems in graphsChristoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl. ipco 1993: 183-194

Efficient Subgraph PackingMartin Loebl, Svatopluk Poljak. JCT, 59(1):106-121, 1993. [doi]

On existence theoremsSvatopluk Poljak. DM, 111(1-3):423-434, 1993. [doi]

Checking robust nonsingularity is NP-hardSvatopluk Poljak, Jiri Rohn. mcss, 6(1):1-9, 1993. [doi]

Maximum cuts and largest bipartite subgraphsSvatopluk Poljak, Zsolt Tuza. dimacs 1995: 181-244

1992

A decomposition of strongly unimodular matrices into incidence matrices of diagraphsY. Crama, Martin Loebl, Svatopluk Poljak. DM, 102(2):143-147, 1992. [doi]

The cut cone III: On the role of triangle facetsMichel Deza, Monique Laurent, Svatopluk Poljak. gc, 8(2):125-142, 1992. [doi]

Compatible 2-factorsJan Kratochvíl, Svatopluk Poljak. DAM, 36(3):253-266, 1992. [doi]

The Metric PolytopeMonique Laurent, Svatopluk Poljak. ipco 1992: 274-286

Max-cut in circulant graphsSvatopluk Poljak, Daniel Turzík. DM, 108(1-3):379-392, 1992. [doi]

1991

Extendability, Dimensions, and Diagrams of Cycle OrdersPeter Alles, Jaroslav Nesetril, Svatopluk Poljak. siamdm, 4(4):453-471, 1991.

Eulerian trails through a set of terminals in specific, unique and all ordersJørgen Bang-Jensen, Svatopluk Poljak. gst 1993: 247-258

Weak Three-Linking in Eulerian DigraphsToshihide Ibaraki, Svatopluk Poljak. siamdm, 4(1):84-98, 1991.

1990

Graphs with the balas - uhry propertyM. Kano, Svatopluk Poljak. jgt, 14(5):623-628, 1990. [doi]

1989

Long induced paths and cycles in Kneser graphsPeter Alles, Svatopluk Poljak. gc, 5(1):303-306, 1989. [doi]

A hierarchy of totally unimodular matricesMartin Loebl, Svatopluk Poljak. DM, 76(3):241-246, 1989. [doi]

On the maximum number of qualitatively independent partitionsSvatopluk Poljak, Zsolt Tuza. JCT, 51(1):111-116, 1989. [doi]

1988

On common edges in optimal solutions to traveling salesman and other optimization problemsMarek Chrobak, Svatopluk Poljak. DAM, 20(2):101-111, 1988. [doi]

On matroids induced by packing subgraphsMartin Loebl, Svatopluk Poljak. JCT, 44(3):338-354, 1988. [doi]

Tournament Ranking with Expected Profit in Polynomial TimeSvatopluk Poljak, Vojtech Rödl, Joel Spencer. siamdm, 1(3):372-376, 1988.

1987

Transformations on Graphs and ConvexitySvatopluk Poljak. compsys, 1(5), 1987. [doi]

Maximum bipartite subgraphs of Kneser graphsSvatopluk Poljak, Zsolt Tuza. gc, 3(1):191-199, 1987. [doi]

1986

A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case boundSvatopluk Poljak, Daniel Turzík. DM, 58(1):99-104, 1986. [doi]

On an application of convexity to discrete systemsSvatopluk Poljak, Daniel Turzík. DAM, 13(1):27-32, 1986. [doi]

On pre-periods of discrete influence systemsSvatopluk Poljak, Daniel Turzík. DAM, 13(1):33-39, 1986. [doi]

1983

On periodical behavior in societies with symmetric influencesSvatopluk Poljak, Miroslav Sura. combinatorica, 3(1):119-121, 1983.

On qualitatively independent partitions and related problemsSvatopluk Poljak, Ales Pultr, Vojtech Rödl. DAM, 6(2):193-205, 1983. [doi]

On a product dimension of bipartite graphsSvatopluk Poljak, Vojtech Rödl, Ales Pultr. jgt, 7(4):475-486, 1983. [doi]

1982

A note on sticky matroidsSvatopluk Poljak, Daniel Turzík. DM, 42(1):119-123, 1982. [doi]

1981

On the dimension of treesSvatopluk Poljak, Ales Pultr. DM, 34(2):165-171, 1981. [doi]

On set systems determined by intersectionsSvatopluk Poljak, Vojtech Rödl. DM, 34(2):173-184, 1981. [doi]

On the arc-chromatic number of a digraphSvatopluk Poljak, Vojtech Rödl. jctb, 31(2):190-198, 1981. [doi]

Complexity of representation of graphs by set systemsSvatopluk Poljak, Vojtech Rödl, Daniel Turzík. DAM, 3(4):301-312, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL