S. Poljak
- Computational Theory and Mathematics top 2%
- Numerical Analysis top 5%
- Computer Networks and Communications top 10%
- Electrical and Electronic Engineering
- Discrete Mathematics and Combinatorics top 5%
- Co-authors
- Charles DelormeFranz RendlHenry WolkowiczV. RödlMartin LoeblKazuo MurotaAndrzej CzygrinowMonique Laurent
- Topics
- Advanced Graph Theory Research (11 papers)Limits and Structures in Graph Theory (8 papers)Complexity and Algorithms in Graphs (6 papers)
In The Last Decade
S. Poljak
20 papers receiving 429 citations
Peers
Comparison fields: 5 of 55
- Computational Theory and Mathematics 311
- Numerical Analysis 130
- Computer Networks and Communications 106
- Electrical and Electronic Engineering 77
- Discrete Mathematics and Combinatorics 61
Countries citing papers authored by S. Poljak
This map shows the geographic impact of S. Poljak's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by S. Poljak with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. Poljak more than expected).
Fields of papers citing papers by S. Poljak
This network shows the impact of papers produced by S. Poljak. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by S. Poljak. The network helps show where S. Poljak may publish in the future.
Co-authorship network of co-authors of S. Poljak
This figure shows the co-authorship network connecting the top 25 collaborators of S. Poljak. A scholar is included among the top collaborators of S. Poljak based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with S. Poljak. S. Poljak is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Connections between semidefinite relaxations of the max-cut and stable set problems | 1 |
| 2 | On the facial structure of the set of correlation matrices | 2 |
| 3 | 124 | |
| 4 | 11 | |
| 5 | 24 | |
| 6 | 30 | |
| 7 | 111 | |
| 8 | One-third-integrality in the metric polytope | 3 |
| 9 | 3 | |
| 10 | 10 | |
| 11 | 2 | |
| 12 | 1 | |
| 13 | 53 | |
| 14 | 29 | |
| 15 | 3 | |
| 16 | 0 | |
| 17 | 2 | |
| 18 | 1 | |
| 19 | 44 | |
| 20 | 3 |
About S. Poljak
S. Poljak is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Numerical Analysis, having authored 21 papers that have together received 474 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (11 papers), Limits and Structures in Graph Theory (8 papers) and Complexity and Algorithms in Graphs (6 papers). The work is most often cited by research in Numerical Analysis (130 citations), Computational Theory and Mathematics (311 citations) and Discrete Mathematics and Combinatorics (61 citations). S. Poljak has collaborated with scholars based in Czechia, Austria and Japan. Frequent co-authors include Charles Delorme, Franz Rendl, Henry Wolkowicz, V. Rödl, Martin Loebl, Kazuo Murota, Andrzej Czygrinow, Monique Laurent, Marek Chrobák and Aleš Pultr. Their work appears in journals such as IEEE Transactions on Automatic Control, Mathematical Programming and Discrete Applied Mathematics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.