Piotr Sankowski

2.2k total citations
78 papers, 832 citations indexed

About

Piotr Sankowski is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Materials Chemistry. According to data from OpenAlex, Piotr Sankowski has authored 78 papers receiving a total of 832 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 34 papers in Computer Networks and Communications and 14 papers in Materials Chemistry. Recurrent topics in Piotr Sankowski's work include Complexity and Algorithms in Graphs (38 papers), Advanced Graph Theory Research (28 papers) and Optimization and Search Problems (25 papers). Piotr Sankowski is often cited by papers focused on Complexity and Algorithms in Graphs (38 papers), Advanced Graph Theory Research (28 papers) and Optimization and Search Problems (25 papers). Piotr Sankowski collaborates with scholars based in Poland, Italy and United States. Piotr Sankowski's co-authors include Marcin Mucha, P. Kacman, Stefano Leonardi, Christian Wulff‐Nilsen, Jakub Łącki, Jacek A. Majewski, T. Dietl, Amos Fiat, Yahav Nussbaum and Marcin Pilipczuk and has published in prestigious journals such as Journal of Applied Physics, Physical Review B and Human Reproduction.

In The Last Decade

Piotr Sankowski

72 papers receiving 812 citations

Peers

Piotr Sankowski

CTM

CNC

EEE

H. A. Kierstead United States

Adolfo Piperno Italy

Johannes J. Schneider Germany

Daniel Berend Israel

Catherine C. McGeoch United States

R.B. Bapat India

Keith H. Randall United States

T-H. Hubert Chan Hong Kong

Wayne Pullan Australia

Dana Randall United States

H. A. Kierstead United States

Piotr Sankowski

1.5k ×3.7

CTM

181 ×0.6

CNC

82 ×0.6

94 ×0.7

220 ×2.1

EEE

Citations per year, relative to Piotr Sankowski Piotr Sankowski (= 1×) peers H. A. Kierstead

Countries citing papers authored by Piotr Sankowski

Since Specialization

Citations

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

Fields of papers citing papers by Piotr Sankowski

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Piotr Sankowski

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

Jaszkiewicz, Andrzej, et al.. (2025). Implicit modeling of equivariant tensor basis with Euclidean turbulence closure neural network. Physics of Fluids. 37(2). 1 indexed citations

Łukasik, Szymon, et al.. (2024). LLM generated responses to mitigate the impact of hate speech. 15860–15876. 3 indexed citations

Sankowski, Piotr, et al.. (2023). P-225 Trustworthy AI algorithm for embryo ranking. Human Reproduction. 38(Supplement_1). 1 indexed citations

Sankowski, Piotr, et al.. (2023). Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form. 3595. 1745–1756. 4 indexed citations

Gabow, Harold N. & Piotr Sankowski. (2021). Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors. SIAM Journal on Computing. 50(2). 440–486. 2 indexed citations

Łącki, Jakub, Krzysztof Onak, Piotr Sankowski, & Slobodan Mitrović. (2020). Walking Randomly, Massively, and Efficiently. DSpace@MIT (Massachusetts Institute of Technology). 8 indexed citations

Grandoni, Fabrizio, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, & Shay Solomon. (2019). (1 + ε-Approximate incremental matching in constant deterministic amortized time. Symposium on Discrete Algorithms. 1886–1898. 2 indexed citations

Sankowski, Piotr. (2018). NC Algorithms for Weighted Planar Perfect Matching and Related Problems. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 3 indexed citations

Cygan, Marek, Artur Czumaj, Marcin Mucha, & Piotr Sankowski. (2018). Online Facility Location with Deletions. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 1 indexed citations

10.

Cygan, Marek, Marcin Mucha, Piotr Sankowski, & Qiang Zhang. (2016). Online pricing with impatient bidders. Symposium on Discrete Algorithms. 190–201.

11.

Cygan, Marek, et al.. (2016). Algorithmic complexity of power law networks. Symposium on Discrete Algorithms. 1306–1325. 3 indexed citations

12.

Monaco, Gianpiero, Piotr Sankowski, & Qiang Zhang. (2015). Revenue maximization envy-free pricing for homogeneous resources. International Conference on Artificial Intelligence. 90–96. 10 indexed citations

13.

Fanelli, Angelo, et al.. (2014). The ring design game with fair cost allocation. Theoretical Computer Science. 562. 90–100. 2 indexed citations

14.

Łącki, Jakub, et al.. (2013). Dynamic Steiner Tree in Planar Graphs.. arXiv (Cornell University). 2 indexed citations

15.

Murlak, Filip & Piotr Sankowski. (2011). Mathematical foundations of computer science 2011 : 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 2 indexed citations

16.

Sankowski, Piotr, et al.. (2011). Crystal and electronic structure of PbTe/CdTe nanostructures. Nanoscale Research Letters. 6(1). 126–126. 11 indexed citations

17.

Sankowski, Piotr. (2009). Maximum weight bipartite matching in matrix multiplication time. Theoretical Computer Science. 410(44). 4480–4488. 30 indexed citations

18.

Sankowski, Piotr. (2007). Faster dynamic matchings and vertex connectivity. Symposium on Discrete Algorithms. 118–126. 34 indexed citations

19.

Sankowski, Piotr, P. Kacman, Jacek A. Majewski, & T. Dietl. (2006). Theory of spin‐dependent tunneling and resonant tunneling in layered structures based on (Ga,Mn)As. Physica status solidi. C, Conferences and critical reviews/Physica status solidi. C, Current topics in solid state physics. 3(12). 4188–4191. 1 indexed citations

20.

Sankowski, Piotr & P. Kacman. (2003). Interlayer Coupling in EuS-Based Superlattices (Dependence on the Energy Structure of Non-Magnetic Layer). Acta Physica Polonica A. 103(6). 621–628. 5 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