2026 Piotr Berman: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	51	5432	5279	2477	2392	170	7829

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

5432

5279

2477

2392

170

7829

Overview

Piotr Berman is affiliated with Boston University in the United States. Their research primarily spans several fields within computer science, focusing on computational theory and mathematics, artificial intelligence, and computer vision and pattern recognition, among others.

The scientist has contributed notably to the fields of machine learning and algorithms, complexity and algorithms in graphs, and computability, logic, and AI algorithms. Additional areas of interest include optimization and search problems, advanced neural network applications, integrated circuits and semiconductor failure analysis, and computational geometry and mesh generation.

Frequent co-authors collaborating with Piotr Berman include Meiram Murzabulatov, Sofya Raskhodnikova, and Dragos-Florian Ristache, with multiple joint publications recorded.

Publications by Piotr Berman appear in several venues, such as:

Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
ACM Transactions on Algorithms
arXiv (Cornell University)
Algorithmica

Selected recent papers by Piotr Berman include:

Testing Connectedness of Images, 2023, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Tolerant Testers of Image Properties, 2022, published in ACM Transactions on Algorithms
Testing Connectedness of Images, 2023, published in arXiv (Cornell University)
Testing Connectedness of Images, 2024, published in Algorithmica

Best Publications

Bidding Protocols for Deploying Mobile Sensors

G. Wang;Guohong Cao;P. Berman;T.F. La Porta

533
Citations
On Some Tighter Inapproximability Results

Piotr Berman;Marek Karpinski

421
Citations
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

Vineet Bafna;Piotr Berman;Toshihiro Fujito

388
Citations
Improved approximations for the Steiner tree problem

Piotr Berman;Viswanathan Ramaiyer

337
Citations
Power efficient monitoring management in sensor networks

P. Berman;G. Calinescu;C. Shah;A. Zelikovsky

273
Citations
1.375-Approximation Algorithm for Sorting by Reversals

Piotr Berman;Sridhar Hannenhalli;Marek Karpinski

272
Citations
On Some Tighter Inapproximability Results (Extended Abstract)

Piotr Berman;Marek Karpinski

272
Citations
A d /2 approximation for maximum weight independent set in d -claw free graphs

Piotr Berman

214
Citations
Fast Sorting by Reversal

Piotr Berman;Sridhar Hannenhalli

206
Citations
On the complexity of approximating the independent set problem

Piotr Berman;Georg Schnitger

196
Citations
On Approximation Properties of the Independent Set Problem for Low Degree Graphs

Piotr Berman;Toshihiro Fujito

191
Citations
Approximation Hardness of Short Symmetric Instances of MAX-3SAT.

Piotr Berman;Marek Karpinski;Alex D. Scott

190
Citations
8/7-approximation algorithm for (1,2)-TSP

Piotr Berman;Marek Karpinski

177
Citations
HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs

Youngjae Kim;Aayush Gupta;Bhuvan Urgaonkar;Piotr Berman

165
Citations
On-line navigation in a room

E. Bar-Eli;Piotr Berman;A. Fiat;Peiyuan Yan

130
Citations
Approximating maximum independent set in bounded degree graphs

Piotr Berman;Martin Fürer

119
Citations
On-Line Load Balancing for Related Machines

Piotr Berman;Moses Charikar;Marek Karpinski

109
Citations
On approximation properties of the independent set problem for degree 3 graphs

Piotr Berman;Toshihiro Fujito

107
Citations
Optimizing sensor movement planning for energy efficiency

Guiling Wang;M.J. Irwin;P. Berman;Haoying Fu

104
Citations
On-line algorithms for Steiner tree problems (extended abstract)

Piotr Berman;Chris Coulston

98
Citations
Towards Optimal Distributed Consensus (Extended Abstract)

Piotr Berman;Juan A. Garay;Kenneth J. Perry

31
Citations

Frequent Co-Authors

Marek Karpinski University of Bonn

Bhaskar DasGupta University of Illinois at Chicago

Alexander Zelikovsky Georgia State University

Juan A. Garay Texas A&M University

Webb Miller Pennsylvania State University

Ming-Yang Kao Northwestern University

s muthukrishnan Rutgers, The State University of New Jersey

Guiling Wang University of Connecticut

Sridhar Hannenhalli National Institutes of Health

Eduardo D. Sontag Northeastern University

External Links

Personal website of Piotr Berman

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online education can open up diverse pathways in computer science and related fields. For those seeking a fast track, the shortest associate degree program options provide a streamlined route to entry-level roles in tech, allowing students to quickly gain essential skills and credentials.

Aspiring leaders in education or technology may consider advancing with online educational leadership programs. These programs blend management strategies with digital learning, preparing graduates for administration or instructional design roles.

When choosing a program, accreditation is key to ensuring quality and employer recognition. Explore highly accredited online universities to maximize your investment and build a strong educational foundation.

For those interested in creative tech careers, a masters in game design online can lead to opportunities in the booming gaming industry. This specialized degree combines computer science expertise with artistic innovation.