Norbert Polat

511 total citations
53 papers, 285 citations indexed

About

Norbert Polat is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Norbert Polat has authored 53 papers receiving a total of 285 indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 32 papers in Geometry and Topology and 20 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Norbert Polat's work include Advanced Graph Theory Research (33 papers), Limits and Structures in Graph Theory (15 papers) and Graph theory and applications (14 papers). Norbert Polat is often cited by papers focused on Advanced Graph Theory Research (33 papers), Limits and Structures in Graph Theory (15 papers) and Graph theory and applications (14 papers). Norbert Polat collaborates with scholars based in France, Canada and Hungary. Norbert Polat's co-authors include Gert Sabidussi, François Laviolette, Mark E. Watkins, E. C. Milner and Péter Komjáth and has published in prestigious journals such as Mathematische Zeitschrift, Discrete Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Norbert Polat

50 papers receiving 273 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Norbert Polat France	10	247	161	86	33	31	53	285
Martin Tancer Czechia	7	167 0.7×	63 0.4×	88 1.0×	38 1.2×	28 0.9×	38	199
Norbert Sauer Canada	10	346 1.4×	174 1.1×	226 2.6×	43 1.3×	8 0.3×	30	406
Maya Stein Chile	9	259 1.0×	139 0.9×	159 1.8×	21 0.6×	6 0.2×	58	290
Balázs Patkós Hungary	9	176 0.7×	145 0.9×	204 2.4×	17 0.5×	5 0.2×	59	276
Jérémie Chalopin France	8	92 0.4×	41 0.3×	24 0.3×	19 0.6×	18 0.6×	31	134
Juan José Montellano‐Ballesteros Mexico	8	213 0.9×	106 0.7×	185 2.2×	5 0.2×	9 0.3×	42	250
Hian Poh Yap Singapore	9	220 0.9×	86 0.5×	200 2.3×	11 0.3×	12 0.4×	21	286
Heinz‐Jürgen Voss Germany	10	223 0.9×	45 0.3×	127 1.5×	8 0.2×	36 1.2×	22	269
André Kündgen United States	10	292 1.2×	80 0.5×	199 2.3×	4 0.1×	23 0.7×	30	329
John Gimbel United States	9	242 1.0×	46 0.3×	86 1.0×	3 0.1×	33 1.1×	30	266

Countries citing papers authored by Norbert Polat

Since Specialization

Citations

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

Fields of papers citing papers by Norbert Polat

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Norbert Polat

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

Polat, Norbert. (2011). Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity. Discrete Mathematics. 312(1). 47–60. 1 indexed citations

Polat, Norbert. (2009). Netlike partial cubes, V: Completion and netlike classes. Discrete Mathematics. 309(13). 4362–4376. 3 indexed citations

Polat, Norbert. (2008). Netlike partial cubes, IV: Fixed finite subgraph theorems. European Journal of Combinatorics. 30(5). 1194–1204. 10 indexed citations

Polat, Norbert. (2008). Netlike partial cubes III. The median cycle property. Discrete Mathematics. 309(8). 2119–2133. 4 indexed citations

Polat, Norbert. (2008). Netlike partial cubes II. Retracts and netlike subgraphs. Discrete Mathematics. 309(8). 1986–1998. 9 indexed citations

Polat, Norbert & Gert Sabidussi. (2008). On the geodesic pre-hull number of a graph. European Journal of Combinatorics. 30(5). 1205–1220. 7 indexed citations

Polat, Norbert. (2007). Netlike partial cubes I. General properties. Discrete Mathematics. 307(22). 2704–2722. 17 indexed citations

Polat, Norbert, et al.. (2006). On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs. Discrete Mathematics. 306(13). 1272–1284. 2 indexed citations

Polat, Norbert, et al.. (2006). On geodesic structures of weakly median graphs—II: Compactness, the role of isometric rays. Discrete Mathematics. 306(16). 1846–1861. 2 indexed citations

10.

Laviolette, François, et al.. (2000). On constructible graphs, infinite bridged graphs and weakly cop-win graphs. Discrete Mathematics. 224(1-3). 61–78. 14 indexed citations

11.

Laviolette, François & Norbert Polat. (1999). Spanning trees of countable graphs omitting sets of dominated ends. Discrete Mathematics. 194(1-3). 151–172. 1 indexed citations

12.

Polat, Norbert. (1996). Ends and Multi-Endings, I. Journal of Combinatorial Theory Series B. 67(1). 86–110. 13 indexed citations

13.

Polat, Norbert. (1996). Ends and Multi-endings, II. Journal of Combinatorial Theory Series B. 68(1). 56–86. 12 indexed citations

14.

Polat, Norbert. (1992). A minimax theorem for infinite graphs with ideal points. Discrete Mathematics. 103(1). 57–65.

15.

Polat, Norbert. (1991). A mengerian theorem for infinite graphs with ideal points. Journal of Combinatorial Theory Series B. 51(2). 248–255. 6 indexed citations

16.

Polat, Norbert. (1991). Asymmetrization of infinite trees. Discrete Mathematics. 95(1-3). 291–301. 2 indexed citations

17.

Komjáth, Péter, E. C. Milner, & Norbert Polat. (1988). A compactness theorem for perfect matchings in matroids. Journal of Combinatorial Theory Series B. 44(3). 253–262. 2 indexed citations

18.

Komjáth, Péter, E. C. Milner, & Norbert Polat. (1987). A compactness theorem for perfect matchings in matroids. Journal of Combinatorial Theory Series A. 44(3). 253–262. 1 indexed citations

19.

Polat, Norbert. (1987). A compactness result for perfect matchings. Discrete Mathematics. 64(2-3). 229–237. 3 indexed citations

20.

Polat, Norbert. (1983). Sur une Extension du Théorème de Menger aux Graphes Infinis. European Journal of Combinatorics. 4(4). 359–365. 1 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