Svatopluk Poljak

From MaRDI portal
Person:685306

Available identifiers

zbMath Open poljak.svatoplukMaRDI QIDQ685306

List of research outcomes





PublicationDate of PublicationType
Combining semidefinite and polyhedral relaxations for integer programs2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q32982092020-07-21Paper
https://portal.mardi4nfdi.de/entity/Q42341421999-09-15Paper
Constructive Quasi-Ramsey Numbers and Tournament Ranking1999-06-27Paper
Connection between semidefinite relaxations of the max-cut and stable set problems1998-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43907021998-05-26Paper
On the Facial Structure of the Set of Correlation Matrices1997-02-04Paper
One-third-integrality in the max-cut problem1997-02-03Paper
Gap inequalities for the cut polytope1996-10-29Paper
Convex Relaxations of (0, 1)-Quadratic Programming1996-09-16Paper
A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming1996-08-19Paper
Solving the max-cut problem using eigenvalues1996-05-30Paper
https://portal.mardi4nfdi.de/entity/Q48407741996-03-31Paper
Integer Linear Programs and Local Search for Max-Cut1996-01-28Paper
On the ultimate independence ratio of a graph1996-01-07Paper
A spectral approach to bandwidth and separator problems in graphs1995-12-11Paper
Nonpolyhedral Relaxations of Graph-Bisection Problems1995-11-01Paper
The expected relative error of the polyhedral approximation of the max- cut problem1995-10-25Paper
On a positive semidefinite relaxation of the cut polytope1995-07-24Paper
https://portal.mardi4nfdi.de/entity/Q42813121995-02-19Paper
Bipartite Subgraphs of Triangle-Free Graphs1995-02-13Paper
\(k\)-connectivity and decomposition of graphs into forests1995-02-01Paper
Efficient subgraphs packing1994-08-28Paper
Laplacian eigenvalues and the maximum cut problem1994-04-12Paper
Checking robust nonsingularity is NP-hard1994-01-26Paper
https://portal.mardi4nfdi.de/entity/Q42738481994-01-06Paper
The performance of an eigenvalue bound on the max-cut problem in some classes of graphs1993-12-20Paper
On existence theorems1993-12-20Paper
Combinatorial properties and the complexity of a max-cut approximation1993-12-05Paper
On the gap between the structural controllability of time-varying and time-invariant systems1993-08-12Paper
The cut cone. III: On the role of triangle facets1993-08-11Paper
https://portal.mardi4nfdi.de/entity/Q40271751993-02-21Paper
Max-cut in circulant graphs1993-01-17Paper
The cut cone. III: On the role of triangle facets1993-01-16Paper
A decomposition of strongly unimodular matrices into incidence matrices of digraphs1992-09-27Paper
Compatible 2-factors1992-09-27Paper
Minimum spectral radius of a weighted graph1992-08-13Paper
https://portal.mardi4nfdi.de/entity/Q39902251992-06-28Paper
Extendability, Dimensions, and Diagrams of Cyclic Orders1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q47117541992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39720101992-06-25Paper
Computing the generic jordan canonical form1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52022091990-01-01Paper
Note on a graph-theoretic criterion for structural output controllability1990-01-01Paper
On the generic dimension of controllable subspaces1990-01-01Paper
Maximum Rank of Powers of a Matrix of a Given Pattern1989-01-01Paper
On the maximum number of qualitative independent partitions1989-01-01Paper
Long induced paths and cycles in Kneser graphs1989-01-01Paper
A hierarchy of totally unimodular matrices1989-01-01Paper
Tournament Ranking with Expected Profit in Polynomial Time1988-01-01Paper
On matroids induced by packing subgraphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34784381988-01-01Paper
On a facet of the balanced subgraph polytope1987-01-01Paper
Maximum bipartite subgraphs of Kneser graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38206371987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37611941987-01-01Paper
A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound1986-01-01Paper
On pre-periods of discrete influence systems1986-01-01Paper
On an application of convexity to discrete systems1986-01-01Paper
A remark on max-cut problem with an application to digital-analogue convertors1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36884391985-01-01Paper
Social influence models with ranking alternatives and local election rules1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37924901985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37840881985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36824961984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36970571984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33463431984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33312321984-01-01Paper
On periodical behaviour in societies with symmetric influences1983-01-01Paper
On a product dimension of bipartite graphs1983-01-01Paper
On qualitatively independent partitions and related problems1983-01-01Paper
On classes of graphs determined by forbidden subgraphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33098511983-01-01Paper
A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem1982-01-01Paper
A note on sticky matroids1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39594431982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47399301982-01-01Paper
On the arc-chromatic number of a digraph1981-01-01Paper
On the dimension of trees1981-01-01Paper
Complexity of representation of graphs by set systems1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39330301981-01-01Paper
Amalgamation of matroids and its applications1981-01-01Paper
On set systems determined by intersections1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39330281981-01-01Paper
A note on dimension of $P^n_3$1981-01-01Paper
Orthogonal partitions and covering of graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38639201979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41545971978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41018231976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47704111974-01-01Paper

Research outcomes over time

This page was built for person: Svatopluk Poljak