The following pages link to Svatopluk Poljak (Q685306):
Displayed 50 items.
- Combinatorial properties and the complexity of a max-cut approximation (Q685307) (← links)
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs (Q686456) (← links)
- On existence theorems (Q686508) (← links)
- A hierarchy of totally unimodular matrices (Q802628) (← links)
- On qualitatively independent partitions and related problems (Q1051639) (← links)
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound (Q1071037) (← links)
- A remark on max-cut problem with an application to digital-analogue convertors (Q1071657) (← links)
- Social influence models with ranking alternatives and local election rules (Q1072418) (← links)
- On an application of convexity to discrete systems (Q1073750) (← links)
- On pre-periods of discrete influence systems (Q1087853) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- Maximum bipartite subgraphs of Kneser graphs (Q1121290) (← links)
- On the maximum number of qualitative independent partitions (Q1121889) (← links)
- On the arc-chromatic number of a digraph (Q1158161) (← links)
- Amalgamation of matroids and its applications (Q1158433) (← links)
- Complexity of representation of graphs by set systems (Q1158768) (← links)
- On set systems determined by intersections (Q1159217) (← links)
- A note on sticky matroids (Q1167176) (← links)
- Minimum spectral radius of a weighted graph (Q1188417) (← links)
- A decomposition of strongly unimodular matrices into incidence matrices of digraphs (Q1193711) (← links)
- Compatible 2-factors (Q1193724) (← links)
- Max-cut in circulant graphs (Q1201272) (← links)
- Long induced paths and cycles in Kneser graphs (Q1263600) (← links)
- Item:Q685306 (redirect page) (← links)
- Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
- Efficient subgraphs packing (Q1321999) (← links)
- \(k\)-connectivity and decomposition of graphs into forests (Q1343147) (← links)
- Connection between semidefinite relaxations of the max-cut and stable set problems (Q1373736) (← links)
- Checking robust nonsingularity is NP-hard (Q1802197) (← links)
- The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
- On the ultimate independence ratio of a graph (Q1893949) (← links)
- On a positive semidefinite relaxation of the cut polytope (Q1894508) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Gap inequalities for the cut polytope (Q1911843) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- On periodical behaviour in societies with symmetric influences (Q2266658) (← links)
- (Q3039398) (← links)
- Computing the generic jordan canonical form (Q3203922) (← links)
- (Q3298209) (← links)
- (Q3309851) (← links)
- On a product dimension of bipartite graphs (Q3312264) (← links)
- (Q3331232) (← links)
- (Q3346343) (← links)
- Maximum Rank of Powers of a Matrix of a Given Pattern (Q3470496) (← links)
- (Q3478438) (← links)
- On the generic dimension of controllable subspaces (Q3483152) (← links)
- (Q3682496) (← links)
- (Q3688439) (← links)
- (Q3697057) (← links)