default search action
Svatopluk Poljak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
- [j49]Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl:
Constructive Quasi-Ramsey Numbers and Tournament Ranking. SIAM J. Discret. Math. 12(1): 48-63 (1999) - 1997
- [j48]Monique Laurent, Svatopluk Poljak, Franz Rendl:
Connections between semidefinite relaxations of the max-cut and stable set problems. Math. Program. 77: 225-246 (1997) - 1996
- [j47]Monique Laurent, Svatopluk Poljak:
Gap Inequalities for the Cut Polytope. Eur. J. Comb. 17(2-3): 233-254 (1996) - [j46]Monique Laurent, Svatopluk Poljak:
On the Facial Structure of the Set of Correlation Matrices. SIAM J. Matrix Anal. Appl. 17(3): 530-547 (1996) - 1995
- [j45]Svatopluk Poljak, Franz Rendl:
Solving the Max-cut Problem Using Eigenvalues. Discret. Appl. Math. 62(1-3): 249-278 (1995) - [j44]Gena Hahn, Pavol Hell, Svatopluk Poljak:
On the ultimate independence ratio of a graph. Eur. J. Comb. 16(3): 253-261 (1995) - [j43]Svatopluk Poljak, Franz Rendl, Henry Wolkowicz:
A recipe for semidefinite relaxation for (0, 1)-quadratic programming - In memory of Svata Poljak. J. Glob. Optim. 7(1): 51-73 (1995) - [j42]Svatopluk Poljak, Henry Wolkowicz:
Convex Relaxations of (0, 1)-Quadratic Programming. Math. Oper. Res. 20(3): 550-561 (1995) - [j41]Monique Laurent, Svatopluk Poljak:
One-third-integrality in the max-cut problem. Math. Program. 71: 29-50 (1995) - [j40]Svatopluk Poljak:
Integer Linear Programs and Local Search for Max-Cut. SIAM J. Comput. 24(4): 822-839 (1995) - [j39]Svatopluk Poljak, Franz Rendl:
Nonpolyhedral Relaxations of Graph-Bisection Problems. SIAM J. Optim. 5(3): 467-487 (1995) - [c5]Christoph Helmberg, Svatopluk Poljak, Franz Rendl, Henry Wolkowicz:
Combining Semidefinite and Polyhedral Relaxations for Integer Programs. IPCO 1995: 124-134 - 1994
- [j38]Svatopluk Poljak, Franz Rendl:
Node and edge relaxations of the Max-cut problem. Computing 52(2): 123-137 (1994) - [j37]Takao Nishizeki, Svatopluk Poljak:
k-Connectivity and Decomposition of Graphs into Forests. Discret. Appl. Math. 55(3): 295-301 (1994) - [j36]Svatopluk Poljak, Zsolt Tuza:
The expected relative error of the polyhedral approximation of the max-cut problem. Oper. Res. Lett. 16(4): 191-198 (1994) - [j35]Svatopluk Poljak, Zsolt Tuza:
Bipartite Subgraphs of Triangle-Free Graphs. SIAM J. Discret. Math. 7(2): 307-313 (1994) - 1993
- [j34]Charles Delorme, Svatopluk Poljak:
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. Discret. Math. 111(1-3): 145-156 (1993) - [j33]Svatopluk Poljak:
On existence theorems. Discret. Math. 111(1-3): 423-434 (1993) - [j32]Charles Delorme, Svatopluk Poljak:
Combinatorial Properties and the Complexity of a Max-cut Approximation . Eur. J. Comb. 14(4): 313-333 (1993) - [j31]Michel Deza, Monique Laurent, Svatopluk Poljak:
The cut cone III: On the role of triangle facets. Graphs Comb. 9(2-4): 135-152 (1993) - [j30]Martin Loebl, Svatopluk Poljak:
Efficient Subgraph Packing. J. Comb. Theory B 59(1): 106-121 (1993) - [j29]Svatopluk Poljak, Jiri Rohn:
Checking robust nonsingularity is NP-hard. Math. Control. Signals Syst. 6(1): 1-9 (1993) - [j28]Charles Delorme, Svatopluk Poljak:
Laplacian eigenvalues and the maximum cut problem. Math. Program. 62: 557-574 (1993) - [c4]Svatopluk Poljak, Zsolt Tuza:
Maximum cuts and largest bipartite subgraphs. Combinatorial Optimization 1993: 181-244 - [c3]Christoph Helmberg, Bojan Mohar, Svatopluk Poljak, Franz Rendl:
A spectral approach to bandwidth and separator problems in graphs. IPCO 1993: 183-194 - 1992
- [j27]Jan Kratochvíl, Svatopluk Poljak:
Compatible 2-factors. Discret. Appl. Math. 36(3): 253-266 (1992) - [j26]Yves Crama, Martin Loebl, Svatopluk Poljak:
A decomposition of strongly unimodular matrices into incidence matrices of diagraphs. Discret. Math. 102(2): 143-147 (1992) - [j25]Svatopluk Poljak, Daniel Turzík:
Max-cut in circulant graphs. Discret. Math. 108(1-3): 379-392 (1992) - [j24]Michel Deza, Monique Laurent, Svatopluk Poljak:
The cut cone III: On the role of triangle facets. Graphs Comb. 8(2): 125-142 (1992) - [c2]Monique Laurent, Svatopluk Poljak:
The Metric Polytope. IPCO 1992: 274-286 - 1991
- [j23]Toshihide Ibaraki, Svatopluk Poljak:
Weak Three-Linking in Eulerian Digraphs. SIAM J. Discret. Math. 4(1): 84-98 (1991) - [j22]Peter Alles, Jaroslav Nesetril, Svatopluk Poljak:
Extendability, Dimensions, and Diagrams of Cycle Orders. SIAM J. Discret. Math. 4(4): 453-471 (1991) - [c1]Jørgen Bang-Jensen, Svatopluk Poljak:
Eulerian trails through a set of terminals in specific, unique and all orders. Graph Structure Theory 1991: 247-258 - 1990
- [j21]Mikio Kano, Svatopluk Poljak:
Graphs with the balas - uhry property. J. Graph Theory 14(5): 623-628 (1990)
1980 – 1989
- 1989
- [j20]Martin Loebl, Svatopluk Poljak:
A hierarchy of totally unimodular matrices. Discret. Math. 76(3): 241-246 (1989) - [j19]Peter Alles, Svatopluk Poljak:
Long induced paths and cycles in Kneser graphs. Graphs Comb. 5(1): 303-306 (1989) - [j18]Svatopluk Poljak, Zsolt Tuza:
On the maximum number of qualitatively independent partitions. J. Comb. Theory A 51(1): 111-116 (1989) - 1988
- [j17]Marek Chrobak, Svatopluk Poljak:
On common edges in optimal solutions to traveling salesman and other optimization problems. Discret. Appl. Math. 20(2): 101-111 (1988) - [j16]Martin Loebl, Svatopluk Poljak:
On matroids induced by packing subgraphs. J. Comb. Theory B 44(3): 338-354 (1988) - [j15]Svatopluk Poljak, Vojtech Rödl, Joel Spencer:
Tournament Ranking with Expected Profit in Polynomial Time. SIAM J. Discret. Math. 1(3): 372-376 (1988) - 1987
- [j14]Svatopluk Poljak:
Transformations on Graphs and Convexity. Complex Syst. 1(5) (1987) - [j13]Svatopluk Poljak, Zsolt Tuza:
Maximum bipartite subgraphs of Kneser graphs. Graphs Comb. 3(1): 191-199 (1987) - 1986
- [j12]Svatopluk Poljak, Daniel Turzík:
On an application of convexity to discrete systems. Discret. Appl. Math. 13(1): 27-32 (1986) - [j11]Svatopluk Poljak, Daniel Turzík:
On pre-periods of discrete influence systems. Discret. Appl. Math. 13(1): 33-39 (1986) - [j10]Svatopluk Poljak, Daniel Turzík:
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. Discret. Math. 58(1): 99-104 (1986) - 1983
- [j9]Svatopluk Poljak, Miroslav Sura:
On periodical behavior in societies with symmetric influences. Comb. 3(1): 119-121 (1983) - [j8]Svatopluk Poljak, Ales Pultr, Vojtech Rödl:
On qualitatively independent partitions and related problems. Discret. Appl. Math. 6(2): 193-205 (1983) - [j7]Svatopluk Poljak, Vojtech Rödl, Ales Pultr:
On a product dimension of bipartite graphs. J. Graph Theory 7(4): 475-486 (1983) - 1982
- [j6]Svatopluk Poljak, Daniel Turzík:
A note on sticky matroids. Discret. Math. 42(1): 119-123 (1982) - 1981
- [j5]Svatopluk Poljak, Vojtech Rödl, Daniel Turzík:
Complexity of representation of graphs by set systems. Discret. Appl. Math. 3(4): 301-312 (1981) - [j4]Svatopluk Poljak, Ales Pultr:
On the dimension of trees. Discret. Math. 34(2): 165-171 (1981) - [j3]Svatopluk Poljak, Vojtech Rödl:
On set systems determined by intersections. Discret. Math. 34(2): 173-184 (1981) - [j2]Svatopluk Poljak, Vojtech Rödl:
On the arc-chromatic number of a digraph. J. Comb. Theory B 31(2): 190-198 (1981) - [j1]Jaroslav Nesetril, Svatopluk Poljak, Daniel Turzík:
Amalgamation of matroids and its applications. J. Comb. Theory B 31(3): 9-22 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint