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
-
- Computational Geometry and Mesh Generation 14
-
- Complexity and Algorithms in Graphs 28
- Advanced Graph Theory Research 18
- Co-authors
- Marek KarpińskiBhaskar DasGuptaToshihiro FujitoGuiling WangVineet BafnaJuan A. GarayThomas La PortaAlex Zelikovsky
- Journals
- Journal of Algorithms (6 papers)Algorithmica (4 papers)Journal of Computational Biology (4 papers)Discrete Applied Mathematics (3 papers)Journal of Computer and System Sciences (3 papers)
- Partner nations
- United StatesGermanyCanada
In The Last Decade
Piotr Berman
108 papers receiving 2.1k citations
Peers
Comparison fields: 5 of 92
- Computer Graphics and Computer-Aided Design 188
- Computational Theory and Mathematics 860
- Computer Networks and Communications 1.2k
- Industrial and Manufacturing Engineering 205
- 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-authorship network
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
| # | Work | ||
|---|---|---|---|
| 1 | 2022 | 2 | |
| 2 | 2016 | 1 | |
| 3 | 2006 | 46 | |
| 4 | Tight approximability results for test set problems in bioinformatics | 2004 | 1 |
| 5 | 2003 | 6 | |
| 6 | Approximation Hardness of Short Symmetric Instances of MAX-3SAT. | 2003 | 66 |
| 7 | 2002 | 5 | |
| 8 | 2002 | 5 | |
| 9 | 2001 | 4 | |
| 10 | On-Line Load Balancing for Related Machines | 2000 | 1 |
| 11 | On Some Tighter Inapproximability Results, Further Improvements | 1998 | 15 |
| 12 | On-line algorithms for Steiner tree problems | 1997 | 20 |
| 13 | 1996 | 27 | |
| 14 | 1994 | 38 | |
| 15 | Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract) | 1991 | 4 |
| 16 | Fast consensus in networks of bounded degree (extended abstract) | 1991 | 2 |
| 17 | 1990 | 19 | |
| 18 | Towards Optimal Distributed Consensus (Extended Abstract) | 1989 | 8 |
| 19 | Learning One-Counter Languages in Polynomial .Time (Extended Abstract) | 1987 | 4 |
| 20 | Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version) | 1983 | 1 |
About Piotr Berman
Piotr Berman is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computer Networks and Communications, Industrial and Manufacturing Engineering and Artificial Intelligence, having authored 110 papers that have together received 2.2k 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), Machine Learning and Algorithms (12 papers), Distributed systems and fault tolerance (12 papers) and Genomics and Phylogenetic Studies (10 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (188 citations), Computational Theory and Mathematics (860 citations), Computer Networks and Communications (1.2k citations), Industrial and Manufacturing Engineering (205 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, Algorithmica, Journal of Computational Biology, Discrete Applied Mathematics and Journal of Computer and System Sciences.
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.