Search the dblp DataBase

Publications of Author

1. Jørgen Bang-Jensen, Svatopluk Poljak
   Eulerian trails through a set of terminals in specific, unique and all orders. [Citation Graph (0, 0)][DBLP]
   Graph Structure Theory, 1991, pp:247-258 [Conf]
   
2. Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl
   A spectral approach to bandwidth and separator problems in graphs. [Citation Graph (0, 0)][DBLP]
   IPCO, 1993, pp:183-194 [Conf]
   
3. Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz
   Combining Semidefinite and Polyhedral Relaxations for Integer Programs. [Citation Graph (0, 0)][DBLP]
   IPCO, 1995, pp:124-134 [Conf]
   
4. Monique Laurent, Svatopluk Poljak
   The Metric Polytope. [Citation Graph (0, 0)][DBLP]
   IPCO, 1992, pp:274-286 [Conf]
   
5. Svatopluk Poljak, Miroslav Sura
   On periodical behavior in societies with symmetric influences. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1983, v:3, n:1, pp:119-121 [Journal]
   
6. Takao Nishizeki, Svatopluk Poljak
   k-Connectivity and Decomposition of Graphs into Forests. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:55, n:3, pp:295-301 [Journal]
   
7. Svatopluk Poljak, Franz Rendl
   Solving the Max-cut Problem Using Eigenvalues. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:249-278 [Journal]
   
8. Charles Delorme, Svatopluk Poljak
   Combinatorial Properties and the Complexity of a Max-cut Approximation . [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1993, v:14, n:4, pp:313-333 [Journal]
   
9. Monique Laurent, Svatopluk Poljak
   Gap Inequalities for the Cut Polytope. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 1996, v:17, n:2-3, pp:233-254 [Journal]
   
10. Martin Loebl, Svatopluk Poljak
    On matroids induced by packing subgraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:3, pp:338-354 [Journal]
    
11. Martin Loebl, Svatopluk Poljak
    Efficient Subgraph Packing. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:59, n:1, pp:106-121 [Journal]
    
12. Svatopluk Poljak, Zsolt Tuza
    On the maximum number of qualitatively independent partitions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:51, n:1, pp:111-116 [Journal]
    
13. Charles Delorme, Svatopluk Poljak
    Laplacian eigenvalues and the maximum cut problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:62, n:, pp:557-574 [Journal]
    
14. Monique Laurent, Svatopluk Poljak
    One-third-integrality in the max-cut problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:29-50 [Journal]
    
15. Monique Laurent, Svatopluk Poljak, Franz Rendl
    Connections between semidefinite relaxations of the max-cut and stable set problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1997, v:77, n:, pp:225-246 [Journal]
    
16. Svatopluk Poljak
    Integer Linear Programs and Local Search for Max-Cut. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:822-839 [Journal]
    
17. Peter Alles, Jaroslav Nesetril, Svatopluk Poljak
    Extendability, Dimensions, and Diagrams of Cycle Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:4, pp:453-471 [Journal]
    
18. Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl
    Constructive Quasi-Ramsey Numbers and Tournament Ranking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:1, pp:48-63 [Journal]
    
19. Toshihide Ibaraki, Svatopluk Poljak
    Weak Three-Linking in Eulerian Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:84-98 [Journal]
    
20. Svatopluk Poljak, Vojtech Rödl, Joel Spencer
    Tournament Ranking with Expected Profit in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:372-376 [Journal]
    
21. Svatopluk Poljak, Zsolt Tuza
    Bipartite Subgraphs of Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:2, pp:307-313 [Journal]
    
22. Svatopluk Poljak, Vojtech Rödl
    On set systems determined by intersections. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:2, pp:173-184 [Journal]
    
23. Svatopluk Poljak, Ales Pultr
    On the dimension of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:2, pp:165-171 [Journal]
    
24. Svatopluk Poljak, Daniel Turzík
    A note on sticky matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:1, pp:119-123 [Journal]
    
25. Svatopluk Poljak, Daniel Turzík
    A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:99-104 [Journal]
    
26. Martin Loebl, Svatopluk Poljak
    A hierarchy of totally unimodular matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:3, pp:241-246 [Journal]
    
27. Y. Crama, Martin Loebl, Svatopluk Poljak
    A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:2, pp:143-147 [Journal]
    
28. Svatopluk Poljak, Daniel Turzík
    Max-cut in circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:379-392 [Journal]
    
29. Charles Delorme, Svatopluk Poljak
    The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:145-156 [Journal]
    
30. Svatopluk Poljak
    On existence theorems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:423-434 [Journal]
    
31. 
    Node and edge relaxations of the Max-cut problem. [Citation Graph (, )][DBLP]
    
    
32. 
    Compatible 2-factors. [Citation Graph (, )][DBLP]
    
    
33. 
    On common edges in optimal solutions to traveling salesman and other optimization problems. [Citation Graph (, )][DBLP]