S. Poljak
Impact in
- Numerical Analysis top 5%
- Advanced Optimization Algorithms Research
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 11
- Complexity and Algorithms in Graphs 6
- Graph Labeling and Dimension Problems 5
- Matrix Theory and Algorithms 3
-
- Limits and Structures in Graph Theory 8
- Co-authors
- Charles Delorme (2 shared papers)Franz Rendl (3 shared papers)Henry Wolkowicz (1 shared paper)V. Rödl (2 shared papers)Martin Loebl (2 shared papers)Kazuo Murota (1 shared paper)Andrzej Czygrinow (1 shared paper)Monique Laurent (3 shared papers)
In The Last Decade
S. Poljak
20 papers receiving 429 citations
Peers
Comparison fields: 5 of 55
- Numerical Analysis 130
- Computational Theory and Mathematics 311
- Discrete Mathematics and Combinatorics 61
- Computer Graphics and Computer-Aided Design 31
- Geometry and Topology 50
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-authors
The 13 scholars most cited alongside S. Poljak, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 21 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1995 | 124 | |
| 2 | 1993 | 111 | |
| 3 | 1990 | 53 | |
| 4 | 1981 | 44 | |
| 5 | 1993 | 30 | |
| 6 | 1990 | 29 | |
| 7 | 1993 | 24 | |
| 8 | 1999 | 17 | |
| 9 | 1994 | 11 | |
| 10 | 1992 | 10 | |
| 11 | One-third-integrality in the metric polytope | 1992 | 3 |
| 12 | 1988 | 3 | |
| 13 | 1981 | 3 | |
| 14 | 1992 | 3 | |
| 15 | 1985 | 2 | |
| 16 | On the facial structure of the set of correlation matrices | 1995 | 2 |
| 17 | 1991 | 2 | |
| 18 | 1983 | 1 | |
| 19 | 1990 | 1 | |
| 20 | Connections between semidefinite relaxations of the max-cut and stable set problems | 1995 | 1 |
About S. Poljak
S. Poljak is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Numerical Analysis and Control and Systems Engineering, 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), Complexity and Algorithms in Graphs (6 papers), Graph Labeling and Dimension Problems (5 papers), Stability and Control of Uncertain Systems (3 papers), Graph theory and applications (3 papers), Advanced Optimization Algorithms Research (3 papers) and Matrix Theory and Algorithms (3 papers). The work is most often cited by research in Numerical Analysis (130 citations), Computational Theory and Mathematics (311 citations), Discrete Mathematics and Combinatorics (61 citations), Computer Graphics and Computer-Aided Design (31 citations) and Geometry and Topology (50 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, Aleš Pultr and Marek Chrobák. Their work appears in journals such as IEEE Transactions on Automatic Control, Discrete Mathematics, SIAM Journal on Discrete Mathematics, Journal of Combinatorial Theory Series B and Journal of Graph Theory.
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.