Boris Brimkov

Papers

Total Citations

H-Index

About

Boris Brimkov is a mathematician and computer scientist whose research focuses on graph theory, combinatorial optimization, and algorithm design. His work is particularly concerned with developing memory-efficient algorithms for special classes of graphs, such as cactus graphs and block graphs, which have applications in network analysis, computational biology, and scheduling. In his most-cited paper, "Memory efficient algorithms for cactus graphs and block graphs" (2015), Brimkov introduced novel algorithmic techniques that significantly reduce memory usage while maintaining computational efficiency, addressing a critical bottleneck in processing large-scale graph structures. This contribution has been cited 8 times and serves as a foundation for further research in resource-constrained computing environments. Brimkov’s broader impact lies in bridging theoretical graph properties with practical algorithmic solutions, making complex graph problems more tractable for real-world systems. His work is notable for its clarity and applicability, often providing explicit constructions and proofs that advance both theory and implementation. As a researcher, Brimkov continues to explore the intersection of graph theory and algorithm engineering, with ongoing contributions to the design of efficient, scalable methods for graph-based problems.