Andrzej Proskurowski

4.1k total citations · 1 hit paper
63 papers, 1.9k citations indexed

About

Andrzej Proskurowski is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Andrzej Proskurowski has authored 63 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 49 papers in Computational Theory and Mathematics, 19 papers in Computer Networks and Communications and 11 papers in Electrical and Electronic Engineering. Recurrent topics in Andrzej Proskurowski's work include Advanced Graph Theory Research (44 papers), Complexity and Algorithms in Graphs (17 papers) and Graph Labeling and Dimension Problems (15 papers). Andrzej Proskurowski is often cited by papers focused on Advanced Graph Theory Research (44 papers), Complexity and Algorithms in Graphs (17 papers) and Graph Labeling and Dimension Problems (15 papers). Andrzej Proskurowski collaborates with scholars based in United States, Canada and Sweden. Andrzej Proskurowski's co-authors include Stefan Arnborg, Derek G. Corneil, Jan Arne Telle, Arthur M. Farley, Frank Ruskey, Stephen T. Hedetniemi, S. Mitchell, Detlef Seese, Bruno Courcelle and Jan Kratochvı́l and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Andrzej Proskurowski

60 papers receiving 1.7k 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.

Complexity of Finding Embeddings in a k-Tree

1987 605 citations Stefan Arnborg, Derek G. Corneil et al. SIAM Journal on Algebraic and Discrete Methods profile →

Peers

Countries citing papers authored by Andrzej Proskurowski

Since Specialization

Citations

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

Fields of papers citing papers by Andrzej Proskurowski

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Andrzej Proskurowski

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

#	Work	Indexed citations
1	Defensive domination in proper interval graphs 2023 ·Discrete Applied Mathematics ·Tınaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom	1
2	Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs 2011 ·Theoretical Computer Science ·Pinar Heggernes, Daniel Meister, Andrzej Proskurowski	3
3	Coloring mixed hypertrees 2005 ·Discrete Applied Mathematics ·Daniel Král͏̌, Jan Kratochvı́l, Andrzej Proskurowski, Heinz‐Jürgen Voss	8
4	Systems of distant representatives 2004 ·Discrete Applied Mathematics ·Jiřı́ Fiala, Jan Kratochvı́l, Andrzej Proskurowski	22
5	Structural decompositions, width parameters, and graph labelings 2004 ·Discrete Applied Mathematics ·Jan Kratochvı́l, Andrzej Proskurowski, Oriol Serra	0
6	Multi-source spanning trees: algorithms for minimizing source eccentricities 2003 ·Discrete Applied Mathematics ·H. Brendan McMahan, Andrzej Proskurowski	6
7	Multicoloring trees 2003 ·Information and Computation ·Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, (unknown), Hadas Shachnai, Jan Arne Telle	13
8	Disjoint and unfolding domination in graphs. 1998 ·Australas. J Comb. ·Jan Kratochvı́l, Paul Manuel, Mirka Miller, Andrzej Proskurowski	3
9	Minimum-time multidrop broadcast 1998 ·Discrete Applied Mathematics ·Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski	0
10	Covering Regular Graphs 1997 ·Journal of Combinatorial Theory Series B ·Jan Kratochvı́l, Andrzej Proskurowski, Jan Arne Telle	21
11	A generalization of line graphs: ( X, Y )-intersection graphs 1996 ·Journal of Graph Theory ·Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski	2
12	Characterization and complexity of uniformly nonprimitive labeled 2-structures 1996 ·Theoretical Computer Science ·Joost Engelfriet, Tero Harju, Andrzej Proskurowski, Grzegorz Rozenberg	10
13	Forbidden minors characterization of partial 3-trees 1990 ·Discrete Mathematics ·Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil	63
14	Linear time algorithms for NP-hard problems restricted to partial k-trees 1989 ·Discrete Applied Mathematics ·Stefan Arnborg, Andrzej Proskurowski	277
15	Efficient Vertex- and Edge-Coloring of Outerplanar Graphs 1986 ·SIAM Journal on Algebraic and Discrete Methods ·Andrzej Proskurowski, Maciej M. Sysło	15
16	Problems on graphs with bounded decomposability. 1985 ·Bulletin of the European Association for Theoretical Computer Science ·Stefan Arnborg, Andrzej Proskurowski	2
17	Interior graphs of maximal outerplane graphs 1985 ·Journal of Combinatorial Theory Series B ·Sandra M. Hedetniemi, Andrzej Proskurowski, Maciej M. Sysło	8
18	Separating subgraphs in k-trees: Cables and caterpillars 1984 ·Discrete Mathematics ·Andrzej Proskurowski	37
19	Computation of the center and diameter of outerplanar graphs 1980 ·Discrete Applied Mathematics ·Arthur M. Farley, Andrzej Proskurowski	25
20	Minimum broadcast graphs 1979 ·Discrete Mathematics ·Arthur M. Farley, Stephen T. Hedetniemi, S. Mitchell, Andrzej Proskurowski	72

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