Paweł Winter

2.6k total citations · 2 hit papers
41 papers, 1.4k citations indexed

About

Paweł Winter is a scholar working on Electrical and Electronic Engineering, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Paweł Winter has authored 41 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Electrical and Electronic Engineering, 13 papers in Computational Theory and Mathematics and 11 papers in Computer Networks and Communications. Recurrent topics in Paweł Winter's work include VLSI and FPGA Design Techniques (24 papers), Advanced Graph Theory Research (11 papers) and Computational Geometry and Mesh Generation (10 papers). Paweł Winter is often cited by papers focused on VLSI and FPGA Design Techniques (24 papers), Advanced Graph Theory Research (11 papers) and Computational Geometry and Mesh Generation (10 papers). Paweł Winter collaborates with scholars based in Denmark, United States and Australia. Paweł Winter's co-authors include Frank K. Hwang, Dana Richards, Martin Zachariasen, J. MacGregor Smith, Rasmus Fonseca, David M. Warme, Marcus Brazil, Jens Cosedis Nielsen, Peter L. Hammer and Alexander Kogan and has published in prestigious journals such as Annals of Operations Research, Networks and Journal of Computational Biology.

In The Last Decade

Paweł Winter

40 papers receiving 1.3k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

The Steiner Tree Problem

1992 547 citations Paweł Winter et al. profile →
Steiner problem in networks: A survey

1987 417 citations Paweł Winter Networks profile →

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Paweł Winter Denmark	14	753	621	455	204	147	41	1.4k
K. Thulasiraman United States	17	500 0.7×	579 0.9×	227 0.5×	54 0.3×	200 1.4×	101	1.1k
Piotr Berman United States	25	470 0.6×	1.2k 2.0×	860 1.9×	188 0.9×	110 0.7×	110	2.2k
Robert W. Leland United States	9	493 0.7×	520 0.8×	228 0.5×	88 0.4×	350 2.4×	14	1.2k
Reuven Bar-Yehuda Israel	23	290 0.4×	1.2k 2.0×	757 1.7×	294 1.4×	34 0.2×	58	1.9k
Isao Shirakawa Japan	14	391 0.5×	258 0.4×	327 0.7×	98 0.5×	196 1.3×	154	1.1k
Jayme L. Szwarcfiter Brazil	20	204 0.3×	398 0.6×	1.2k 2.7×	128 0.6×	41 0.3×	187	1.7k
Alan Gibbons United Kingdom	9	423 0.6×	346 0.6×	240 0.5×	35 0.2×	255 1.7×	33	1.1k
Lawrence T. Kou United States	6	368 0.5×	656 1.1×	225 0.5×	33 0.2×	90 0.6×	9	1.0k
Dov Harel United States	7	245 0.3×	644 1.0×	517 1.1×	100 0.5×	272 1.9×	9	1.2k
Jordi Petit Spain	12	164 0.2×	310 0.5×	264 0.6×	67 0.3×	81 0.6×	43	763

Countries citing papers authored by Paweł Winter

Since Specialization

Citations

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

Fields of papers citing papers by Paweł Winter

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Paweł Winter

This figure shows the co-authorship network connecting the top 25 collaborators of Paweł Winter. A scholar is included among the top collaborators of Paweł Winter 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 Paweł Winter. Paweł Winter 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

1.

Warme, David M., et al.. (2018). The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. Mathematical Programming Computation. 10(4). 487–532. 27 indexed citations

2.

Winter, Paweł & Rasmus Fonseca. (2011). Adjustable Chain Trees for Proteins. Journal of Computational Biology. 19(1). 83–99. 1 indexed citations

3.

Fonseca, Rasmus, et al.. (2011). Ranking Beta Sheet Topologies with Applications to Protein Structure Prediction. Journal of Mathematical Modelling and Algorithms. 10(4). 357–369. 7 indexed citations

4.

Winter, Paweł, et al.. (2009). Alpha Shapes and Proteins. Research at the University of Copenhagen (University of Copenhagen). 15. 217–224. 4 indexed citations

5.

Hamelryck, Thomas, et al.. (2006). Reconstructing protein structure from solvent exposure using tabu search. Algorithms for Molecular Biology. 1(1). 20–20. 7 indexed citations

6.

Abrahamson, Jeff, et al.. (2005). Euclidean TSP between two nested convex obstacles. Information Processing Letters. 95(2). 370–375. 7 indexed citations

7.

Brazil, Marcus, et al.. (2004). Rotationally optimal spanning and Steiner trees in uniform orientation metrics. Computational Geometry. 29(3). 251–263. 1 indexed citations

8.

Winter, Paweł, et al.. (2002). An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. Research at the University of Copenhagen (University of Copenhagen). 3 indexed citations

9.

Winter, Paweł. (2002). Optimal Steiner hull algorithm. Computational Geometry. 23(2). 163–169. 1 indexed citations

10.

Winter, Paweł, Martin Zachariasen, & Jens Cosedis Nielsen. (2002). Short trees in polygons. Discrete Applied Mathematics. 118(1-2). 55–72. 11 indexed citations

11.

Hammer, Peter L., et al.. (1999). Distance-Based Classification Methods. INFOR Information Systems and Operational Research. 37(3). 337–352. 13 indexed citations

12.

Zachariasen, Martin & Paweł Winter. (1999). Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica. 25(4). 418–437. 17 indexed citations

13.

Winter, Paweł & Martin Zachariasen. (1997). Euclidean Steiner minimum trees: An improved exact algorithm. Networks. 30(3). 149–166. 13 indexed citations

14.

Winter, Paweł & Maciej M. Sysło. (1994). Maximal outerplanar graphs with perfect face-independent vertex covers. Discrete Applied Mathematics. 54(2-3). 267–280. 1 indexed citations

15.

Winter, Paweł. (1993). Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs. Discrete Applied Mathematics. 47(2). 187–206. 13 indexed citations

16.

Winter, Paweł & J. MacGregor Smith. (1991). Steiner minimal trees for three points with one convex polygonal obstacle. Annals of Operations Research. 33(7). 577–599. 6 indexed citations

17.

Sysło, Maciej M. & Paweł Winter. (1990). In-trees and plane embeddings of outerplanar graphs. BIT Numerical Mathematics. 30(1). 83–90. 2 indexed citations

18.

Winter, Paweł. (1987). Steiner problem in Halin networks. Discrete Applied Mathematics. 17(3). 281–294. 19 indexed citations

19.

Winter, Paweł. (1986). An algorithm for the enumeration of spanning trees. BIT Numerical Mathematics. 26(1). 44–62. 9 indexed citations

20.

Winter, Paweł. (1985). Generalized steiner problem in outerplanar networks. BIT Numerical Mathematics. 25(3). 485–496. 17 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