Piotr Berman
Impact in
-
- Computational Geometry and Mesh Generation
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Optimization and Search Problems 22
- Distributed systems and fault tolerance 13
-
- Complexity and Algorithms in Graphs 28
- Advanced Graph Theory Research 18
- Co-authors
- Marek Karpiński (19 shared papers)Bhaskar DasGupta (19 shared papers)Toshihiro Fujito (2 shared papers)Guiling Wang (5 shared papers)Vineet Bafna (1 shared paper)Juan A. Garay (8 shared papers)Thomas La Porta (2 shared papers)Alex Zelikovsky (7 shared papers)
- Journals
- Journal of Algorithms (6 papers)Journal of Computational Biology (4 papers)Algorithmica (4 papers)Journal of Computer and System Sciences (3 papers)Discrete Applied Mathematics (3 papers)
- Partner nations
- United StatesGermanyCanada
In The Last Decade
Piotr Berman
111 papers receiving 2.1k citations
Peers
Comparison fields: 5 of 93
- Computer Graphics and Computer-Aided Design 191
- Computational Theory and Mathematics 864
- Computer Networks and Communications 1.2k
- Industrial and Manufacturing Engineering 208
- Discrete Mathematics and Combinatorics 61
Countries citing papers authored by Piotr Berman
This map shows the geographic impact of Piotr Berman'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 Berman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Piotr Berman more than expected).
Fields of papers citing papers by Piotr Berman
This network shows the impact of papers produced by Piotr Berman. 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 Berman. The network helps show where Piotr Berman may publish in the future.
Co-authors
The 25 scholars most cited alongside Piotr Berman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 113 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2007 | 184 | |
| 2 | 1999 | 164 | |
| 3 | 2004 | 140 | |
| 4 | 1994 | 130 | |
| 5 | On Some Tighter Inapproximability Results | 1998 | 114 |
| 6 | 2011 | 91 | |
| 7 | 1992 | 78 | |
| 8 | Approximation Hardness of Short Symmetric Instances of MAX-3SAT. | 2003 | 68 |
| 9 | 1999 | 60 | |
| 10 | 2005 | 56 | |
| 11 | 1989 | 48 | |
| 12 | 2006 | 47 | |
| 13 | 2000 | 46 | |
| 14 | 1994 | 44 | |
| 15 | 1994 | 42 | |
| 16 | 2000 | 39 | |
| 17 | 1994 | 38 | |
| 18 | 1998 | 38 | |
| 19 | 1993 | 32 | |
| 20 | 1999 | 32 |
About Piotr Berman
Piotr Berman is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Artificial Intelligence, Molecular Biology and Electrical and Electronic Engineering, having authored 113 papers that have together received 2.3k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (28 papers), Optimization and Search Problems (22 papers), Algorithms and Data Compression (20 papers), Advanced Graph Theory Research (18 papers), Computational Geometry and Mesh Generation (14 papers), Distributed systems and fault tolerance (13 papers), Machine Learning and Algorithms (12 papers) and Genomics and Phylogenetic Studies (9 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (191 citations), Computational Theory and Mathematics (864 citations), Computer Networks and Communications (1.2k citations), Industrial and Manufacturing Engineering (208 citations) and Discrete Mathematics and Combinatorics (61 citations). Piotr Berman has collaborated with scholars based in United States, Germany and Canada. Frequent co-authors include Marek Karpiński, Bhaskar DasGupta, Toshihiro Fujito, Guiling Wang, Vineet Bafna, Juan A. Garay, Thomas La Porta, Alex Zelikovsky, Guohong Cao and Georg Schnitger. Their work appears in journals such as Journal of Algorithms, Journal of Computational Biology, Algorithmica, Journal of Computer and System Sciences and Discrete Applied Mathematics.
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.