Svatopluk Poljak

2.4k total citations
53 papers, 1.2k citations indexed

About

Svatopluk Poljak is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Svatopluk Poljak has authored 53 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Computational Theory and Mathematics, 18 papers in Electrical and Electronic Engineering and 12 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Svatopluk Poljak's work include Advanced Graph Theory Research (30 papers), graph theory and CDMA systems (16 papers) and Graph Labeling and Dimension Problems (14 papers). Svatopluk Poljak is often cited by papers focused on Advanced Graph Theory Research (30 papers), graph theory and CDMA systems (16 papers) and Graph Labeling and Dimension Problems (14 papers). Svatopluk Poljak collaborates with scholars based in Czechia, France and Germany. Svatopluk Poljak's co-authors include Monique Laurent, Franz Rendl, Jaroslav Nešetřil, Źsolt Tuza, Bojan Mohar, Henry Wolkowicz, Charles Delorme, Aleš Pultr, Vojtěch Rödl and Martin Loebl and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and SIAM Journal on Optimization.

In The Last Decade

Svatopluk Poljak

51 papers receiving 1.1k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Svatopluk Poljak Czechia	18	850	225	223	215	209	53	1.2k
Alexander Barvinok United States	20	632 0.7×	375 1.7×	230 1.0×	125 0.6×	107 0.5×	63	1.5k
Robert G. Bland United States	10	506 0.6×	81 0.4×	254 1.1×	219 1.0×	183 0.9×	22	1.1k
T. S. Motzkin United States	19	810 1.0×	187 0.8×	401 1.8×	129 0.6×	97 0.5×	57	1.6k
E. G. Straus United States	24	809 1.0×	297 1.3×	257 1.2×	177 0.8×	55 0.3×	102	1.9k
Monique Laurent Netherlands	24	1.5k 1.8×	192 0.9×	829 3.7×	358 1.7×	188 0.9×	125	2.2k
Marie-Françoise Roy France	17	1.5k 1.7×	147 0.7×	183 0.8×	71 0.3×	77 0.4×	57	2.1k
Saugata Basu United States	15	1.3k 1.5×	147 0.7×	171 0.8×	74 0.3×	83 0.4×	76	1.9k
Rekha R. Thomas United States	17	573 0.7×	77 0.3×	216 1.0×	96 0.4×	43 0.2×	56	1.1k
Jesús A. De Loera United States	19	573 0.7×	346 1.5×	124 0.6×	104 0.5×	56 0.3×	84	1.1k
N. S. Mendelsohn Canada	17	436 0.5×	169 0.8×	48 0.2×	500 2.3×	85 0.4×	81	1.1k

Countries citing papers authored by Svatopluk Poljak

Since Specialization

Citations

This map shows the geographic impact of Svatopluk 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 Svatopluk Poljak with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Svatopluk Poljak more than expected).

Fields of papers citing papers by Svatopluk Poljak

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Svatopluk 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 Svatopluk Poljak. The network helps show where Svatopluk Poljak may publish in the future.

Co-authorship network of co-authors of Svatopluk Poljak

This figure shows the co-authorship network connecting the top 25 collaborators of Svatopluk Poljak. A scholar is included among the top collaborators of Svatopluk 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 Svatopluk Poljak. Svatopluk Poljak is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Laurent, Monique & Svatopluk Poljak. (1996). Gap Inequalities for the Cut Polytope. European Journal of Combinatorics. 17(2-3). 233–254. 15 indexed citations

Poljak, Svatopluk & Franz Rendl. (1995). Solving the max-cut problem using eigenvalues. Discrete Applied Mathematics. 62(1-3). 249–278. 40 indexed citations

Poljak, Svatopluk & Franz Rendl. (1995). Nonpolyhedral Relaxations of Graph-Bisection Problems. SIAM Journal on Optimization. 5(3). 467–487. 47 indexed citations

Laurent, Monique & Svatopluk Poljak. (1995). On a positive semidefinite relaxation of the cut polytope. Linear Algebra and its Applications. 223-224. 439–461. 69 indexed citations

Hahn, Geňa, Pavol Hell, & Svatopluk Poljak. (1995). On the ultimate independence ratio of a graph. European Journal of Combinatorics. 16(3). 253–261. 15 indexed citations

Poljak, Svatopluk, et al.. (1993). Checking robust nonsingularity is NP-hard. Mathematics of Control Signals and Systems. 6(1). 1–9. 192 indexed citations

Delorme, Charles & Svatopluk Poljak. (1993). Combinatorial Properties and the Complexity of a Max-cut Approximation. European Journal of Combinatorics. 14(4). 313–333. 36 indexed citations

Poljak, Svatopluk & M. Schlegel. (1991). Computing the generic jordan canonical form. Linear and Multilinear Algebra. 28(4). 241–249. 1 indexed citations

Mohar, Bojan & Svatopluk Poljak. (1990). Eigenvalues and the max-cut problem. Czechoslovak Mathematical Journal. 40(2). 343–352. 54 indexed citations

10.

Poljak, Svatopluk. (1989). Maximum Rank of Powers of a Matrix of a Given Pattern. Proceedings of the American Mathematical Society. 106(4). 1137–1137. 6 indexed citations

11.

Poljak, Svatopluk. (1989). Maximum rank of powers of a matrix of a given pattern. Proceedings of the American Mathematical Society. 106(4). 1137–1144. 26 indexed citations

12.

Poljak, Svatopluk & Źsolt Tuza. (1989). On the maximum number of qualitatively independent partitions. Journal of Combinatorial Theory Series A. 51(1). 111–116. 36 indexed citations

13.

Loebl, Martin & Svatopluk Poljak. (1987). On matroids induced by packing subgraphs. Journal of Combinatorial Theory Series A. 44(3). 338–354. 1 indexed citations

14.

Pelant, Jan, et al.. (1987). Limit behaviour of trajectories involving subgradients of convex functions. Commentationes Mathematicae Universitatis Carolinae. 28(3). 457–466. 2 indexed citations

15.

Poljak, Svatopluk. (1987). Transformations on Graphs and Convexity.. Complex Systems. 1. 5 indexed citations

16.

Nešetřil, Jaroslav & Svatopluk Poljak. (1985). On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae. 26(2). 415–419. 98 indexed citations

17.

Poljak, Svatopluk, et al.. (1983). On qualitatively independent partitions and related problems. Discrete Applied Mathematics. 6(2). 193–205. 33 indexed citations

18.

Poljak, Svatopluk & Aleš Pultr. (1981). Representing graphs by means of strong and weak products. Commentationes Mathematicae Universitatis Carolinae. 22(3). 449–466. 3 indexed citations

19.

Poljak, Svatopluk & Vojtěch Rödl. (1981). On set systems determined by intersections. Discrete Mathematics. 34(2). 173–184. 1 indexed citations

20.

Poljak, Svatopluk. (1974). A note on stable sets and colorings of graphs. Commentationes Mathematicae Universitatis Carolinae. 15(2). 307–309. 77 indexed citations

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.

Explore authors with similar magnitude of impact