Bogdan Oporowski

678 total citations
21 papers, 317 citations indexed

About

Bogdan Oporowski is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Bogdan Oporowski has authored 21 papers receiving a total of 317 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 8 papers in Electrical and Electronic Engineering and 5 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Bogdan Oporowski's work include Advanced Graph Theory Research (21 papers), Graph Labeling and Dimension Problems (13 papers) and graph theory and CDMA systems (8 papers). Bogdan Oporowski is often cited by papers focused on Advanced Graph Theory Research (21 papers), Graph Labeling and Dimension Problems (13 papers) and graph theory and CDMA systems (8 papers). Bogdan Oporowski collaborates with scholars based in United States, Canada and Mexico. Bogdan Oporowski's co-authors include Guoli Ding, Dirk Vertigan, James Oxley, Daniel P. Sanders, Robin Thomas, Noga Alon, Paul Seymour, Matt DeVos, Bruce Reed and David Zhao and has published in prestigious journals such as Discrete Mathematics, Journal of Combinatorial Theory Series B and COMBINATORICA.

In The Last Decade

Bogdan Oporowski

21 papers receiving 286 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Bogdan Oporowski United States	9	300	143	76	56	55	21	317
Gabriel Semanišin Slovakia	8	286 1.0×	123 0.9×	79 1.0×	85 1.5×	27 0.5×	31	327
Louis Esperet France	11	315 1.1×	183 1.3×	64 0.8×	30 0.5×	41 0.7×	51	344
John Gimbel United States	9	242 0.8×	86 0.6×	46 0.6×	18 0.3×	33 0.6×	30	266
Ko‐Wei Lih Taiwan	10	206 0.7×	110 0.8×	63 0.8×	30 0.5×	17 0.3×	24	260
Heinz‐Jürgen Voss Germany	10	223 0.7×	127 0.9×	45 0.6×	36 0.6×	36 0.7×	22	269
V. E. Alekseev Russia	9	242 0.8×	97 0.7×	54 0.7×	78 1.4×	16 0.3×	24	297
Izak Broere South Africa	9	289 1.0×	150 1.0×	98 1.3×	30 0.5×	20 0.4×	47	320
André Kündgen United States	10	292 1.0×	199 1.4×	80 1.1×	16 0.3×	23 0.4×	30	329
Daniel Gonçalves France	7	231 0.8×	47 0.3×	32 0.4×	47 0.8×	46 0.8×	38	254
Najiba Sbihi Morocco	6	297 1.0×	118 0.8×	60 0.8×	55 1.0×	18 0.3×	7	309

Countries citing papers authored by Bogdan Oporowski

Since Specialization

Citations

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

Fields of papers citing papers by Bogdan Oporowski

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Bogdan Oporowski

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

Ding, Guoli, et al.. (2024). Unavoidable induced subgraphs of infinite 2-connected graphs. Discrete Mathematics. 348(4). 114346–114346. 1 indexed citations

Ding, Guoli, et al.. (2023). Unavoidable Induced Subgraphs of Large 2-Connected Graphs. SIAM Journal on Discrete Mathematics. 37(2). 684–698. 1 indexed citations

Bokal, Drago, Bogdan Oporowski, R. Bruce Richter, & Gelasio Salazar. (2015). Characterizing 2-crossing-critical graphs. Advances in Applied Mathematics. 74. 23–208. 7 indexed citations

Mayhew, Dillon, Bogdan Oporowski, James Oxley, & Geoff Whittle. (2011). The excluded minors for the class of matroids that are binary or ternary. European Journal of Combinatorics. 32(6). 891–930. 2 indexed citations

Ding, Guoli, Bogdan Oporowski, Robin Thomas, & Dirk Vertigan. (2010). Large non-planar graphs and an application to crossing-critical graphs. Journal of Combinatorial Theory Series B. 101(2). 111–121. 3 indexed citations

Oporowski, Bogdan & David Zhao. (2008). Coloring graphs with crossings. Discrete Mathematics. 309(9). 2948–2951. 6 indexed citations

Ding, Guoli, et al.. (2008). Unavoidable parallel minors of 4‐connected graphs. Journal of Graph Theory. 60(4). 313–326. 6 indexed citations

DeVos, Matt, Guoli Ding, Bogdan Oporowski, et al.. (2004). Excluding any graph as a minor allows a low tree-width 2-coloring. Journal of Combinatorial Theory Series B. 91(1). 25–41. 41 indexed citations

Alon, Noga, Guoli Ding, Bogdan Oporowski, & Dirk Vertigan. (2003). Partitioning into graphs with only small components. Journal of Combinatorial Theory Series B. 87(2). 231–243. 49 indexed citations

10.

Oporowski, Bogdan. (2002). Partitioning Matroids with Only Small Cocircuits. Combinatorics Probability Computing. 11(2). 191–197. 1 indexed citations

11.

Oporowski, Bogdan, et al.. (2002). Unavoidable minors of graphs of large type. Discrete Mathematics. 248(1-3). 27–67. 2 indexed citations

12.

Ding, Guoli, Bogdan Oporowski, Daniel P. Sanders, & Dirk Vertigan. (2000). Surfaces, Tree-Width, Clique-Minors, and Partitions. Journal of Combinatorial Theory Series B. 79(2). 221–246. 23 indexed citations

13.

Oporowski, Bogdan. (1999). Minor-equivalence for infinite graphs. Discrete Mathematics. 195(1-3). 203–227. 1 indexed citations

14.

Ding, Guoli, Bogdan Oporowski, James Oxley, & Dirk Vertigan. (1997). Unavoidable Minors of Large 3-Connected Matroids. Journal of Combinatorial Theory Series B. 71(2). 244–293. 24 indexed citations

15.

Ding, Guoli & Bogdan Oporowski. (1996). On tree-partitions of graphs. Discrete Mathematics. 149(1-3). 45–58. 18 indexed citations

16.

Ding, Guoli, Bogdan Oporowski, James Oxley, & Dirk Vertigan. (1996). Unavoidable Minors of Large 3-Connected Binary Matroids. Journal of Combinatorial Theory Series B. 66(2). 334–360. 26 indexed citations

17.

Oporowski, Bogdan, et al.. (1995). On Infinite Antichains of Matroids. Journal of Combinatorial Theory Series B. 63(1). 21–40. 8 indexed citations

18.

Ding, Guoli & Bogdan Oporowski. (1995). Some results on tree decomposition of graphs. Journal of Graph Theory. 20(4). 481–499. 32 indexed citations

19.

Oporowski, Bogdan, James Oxley, & Robin Thomas. (1993). Typical Subgraphs of 3- and 4-Connected Graphs. Journal of Combinatorial Theory Series B. 57(2). 239–257. 43 indexed citations

20.

Oporowski, Bogdan. (1990). A counterexample to Seymour's self‐minor conjecture. Journal of Graph Theory. 14(5). 521–524. 4 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