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.
SNDlib 1.0—Survivable Network Design Library
2009659 citationsMichał Pióro, Artur Tomaszewski et al.Networksprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Artur Tomaszewski
Since
Specialization
Citations
This map shows the geographic impact of Artur Tomaszewski'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 Artur Tomaszewski with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Artur Tomaszewski more than expected).
Fields of papers citing papers by Artur Tomaszewski
This network shows the impact of papers produced by Artur Tomaszewski. 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 Artur Tomaszewski. The network helps show where Artur Tomaszewski may publish in the future.
Co-authorship network of co-authors of Artur Tomaszewski
This figure shows the co-authorship network connecting the top 25 collaborators of Artur Tomaszewski.
A scholar is included among the top collaborators of Artur Tomaszewski 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 Artur Tomaszewski. Artur Tomaszewski is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Żotkiewicz, Mateusz, Michał Pióro, & Artur Tomaszewski. (2008). Complexity of resilient network optimization. Lund University Publications (Lund University).2 indexed citations
Tomaszewski, Artur, et al.. (2007). Valid inequalities for a shortest-path routing optimization problem. Lund University Publications (Lund University).13 indexed citations
16.
Pióro, Michał & Artur Tomaszewski. (2007). Feasibility issues in shortest-path routing with traffic flow split. Lund University Publications (Lund University).4 indexed citations
17.
Tomaszewski, Artur, et al.. (2005). Optimization of administrative weights in IP networks using branch-and-cut approach. Lund University Publications (Lund University).15 indexed citations
Pióro, Michał, et al.. (2005). Optimization of administrative weights in single path networks with OSPF routing. Lund University Publications (Lund University).1 indexed citations
20.
Tomaszewski, Artur, et al.. (2001). Internet a sieci nowej generacji. Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne. 326–330.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.