World's Best Scientists 2026 revealed!
Svatopluk Poljak

Svatopluk Poljak

Overview

Svatopluk Poljak is affiliated with Emory University in the United States. This association connects the scientist to a well-established institution known for its research activities across multiple disciplines.

Detailed data about specific research papers, co-authors, publication venues, book publications, fields of study, subfields, and main research topics for Svatopluk Poljak are not available at this time.

There is no record of awards linked to this scientist, and no information about deceased status, indicating that they are currently active in their professional role.

Given the absence of specific publication or research topic data, further insights into the scientist's contributions to their field cannot be provided based on the current available information.

Best Publications

  • Checking robust nonsingularity is NP-hard

    Svatopluk Poljak;Jiří Rohn

  • On the complexity of the subgraph problem

    Jaroslav Nešetřil;Svatopluk Poljak

  • A recipe for semidefinite relaxation for (0,1)-quadratic programming: In memory of Svata Poljak

    Svatopluk Poljak;Franz Rendl;Henry Wolkowicz

  • Laplacian eigenvalues and the maximum cut problem

    C. Delorme;S. Poljak

  • Eigenvalues in Combinatorial Optimization

    Bojan Mohar;Svatopluk Poljak

  • Maximum cuts and largest bipartite subgraphs.

    Svatopluk Poljak;Zsolt Tuza

  • On a positive semidefinite relaxation of the cut polytope

    Monique Laurent;Svatopluk Poljak

  • Nonpolyhedral Relaxations of Graph-Bisection Problems

    Svatopluk Poljak;Franz Rendl

  • Solving the max-cut problem using eigenvalues

    Svatopluk Poljak;Franz Rendl

  • On the arc-chromatic number of a digraph

    Svatopluk Poljak;Vojtech Rödl

  • On the facial structure of the set of correlation matrices

    Monique Laurent;Svatopluk Poljak

  • Eigenvalues and the max-cut problem

    Bojan Mohar;Svatopluk Poljak

  • Connections between semidefinite relaxations of the max-cut and stable set problems

    Monique Laurent;Svatopluk Poljak;Franz Rendl

  • Combinatorial properties and complexity of a max-cut approximation

    Charles Delorme;Svatopluk Poljak

  • Convex Relaxations of 0, 1-Quadratic Programming

    Svatopluk Poljak;Henry Wolkowicz

  • On the maximum number of qualitatively independent partitions

    S. Poljak;Z. Tuza

  • On the generic dimension of controllable subspaces

    S. Poljak

  • Bipartite Subgraphs of Triangle-Free Graphs

    Svatopluk Poljak;Zsolt Tuza

  • A spectral approach to bandwidth and separator problems in graphs

    Christoph Helmberg;Franz Rendl;Bojan Mohar;Svatopluk Poljak

  • A spectral approach to bandwidth and separator problems in graphs.

    Christoph Helmberg;Bojan Mohar;Svatopluk Poljak;Franz Rendl

Frequent Co-Authors

Monique Laurent
Monique Laurent Centrum Wiskunde & Informatica
Franz Rendl
Franz Rendl University of Klagenfurt
Zsolt Tuza
Zsolt Tuza University of Pannonia
Henry Wolkowicz
Henry Wolkowicz University of Waterloo
Vojtěch Rödl
Vojtěch Rödl Emory University
Bojan Mohar
Bojan Mohar Simon Fraser University
Pavol Hell
Pavol Hell Simon Fraser University
Takao Nishizeki
Takao Nishizeki Tohoku University
Joel Spencer
Joel Spencer Courant Institute of Mathematical Sciences
Kazuo Murota
Kazuo Murota Tokyo Metropolitan University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, expanding into related fields through online degrees can open diverse career opportunities. A masters in data analytics is a popular choice, combining mathematical skills with data interpretation to thrive in sectors like finance, technology, and healthcare.

Alternatively, those interested in leadership roles might explore business administration degrees. Finding an easy mba programs to get into can provide a quicker pathway to managerial positions without compromising quality education.

Online learning options make it even more convenient to advance. Many students opt for easy online mba programs to balance studies with work or personal commitments.

For those aiming at executive roles, researching the cheapest online dba programs can make doctoral education more accessible, further boosting career prospects in academia, consulting, or corporate strategy.

Best Scientists Citing Svatopluk Poljak