Boris Brimkov

Home Publications Teaching Resources CV

Peer-reviewed journal publications

Boris Brimkov, Illya V. Hicks: Complexity and computation of connected zero forcing. Discrete Applied Mathematics 229: 31-45 (2017). [link]

Boris Brimkov, Jennifer Edmond, Robert Lazar, Bernard Lidicky, Kacy Messerschmidt, Shanise Walker: Injective choosability of subcubic planar graphs with girth 6. Discrete Mathematics 340: 2538-2549 (2017). [link]

Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock, Xavier Martinez-Rivera, Suil O, Sung-Yell Song, Jason Williford: On the Wiener index, distance cospectrality and transmission-regular graphs. Discrete Applied Mathematics (2017). [link]

Boris Brimkov, Illya V. Hicks: Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs. Discrete Applied Mathematics 204: 13-21 (2015). [link]

Boris Brimkov, Illya V. Hicks: Memory efficient algorithms for cactus graphs and block graphs. Discrete Applied Mathematics 216: 393-407 (2015). [link]

Boris Brimkov: Geometric approach to string analysis for biosequence classification. J. Integrative Bioinformatics 11(3) (2014). [link]

Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov: Connected distance-based rasterization of objects in arbitrary dimension. Graphical Models 73(6): 323-334 (2011). [link]

Peer-reviewed conference publications

Boris Brimkov: On Sets of Line Segments Featuring a Cactus Structure. IWCIA 2017: 30-39. [link]

Boris Brimkov, Valentin E. Brimkov: Geometric Approach to Biosequence Analysis. PACBB 2014: 97-104. [link]

Boris Brimkov: Memory Efficient Shortest Path Algorithms for Cactus Graphs. ISVC 2013: 476-485. [link]

Boris Brimkov, Jae-Hun Jung, Jim Kotary, Xinwei Liu, Jing Zheng: A spectral and radial basis function hybrid method for visualizing vascular flows. CompIMAGE 2012: 205-208. [link]

Kamen Kanev, Nikolay Mirenkov, Boris Brimkov, Kanio Dimitrov: Semantic Surfaces for Business Applications. S3T 2009: 36-43. [link]

Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov: Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD. DGCI 2009: 337-349. [link]

Valentin E. Brimkov, Reneta P. Barneva, Boris Brimkov, Francois de Vieilleville: Offset Approach to Defining 3D Digital Lines. ISVC 2008: 678-687. [link]

Peer-reviewed educational contributions

R. P. Barneva, K. Kanev, B. Kapralos, M. Jenkin, B. Brimkov: Integrating technology-enhanced collaborative surfaces and gamification for the next generation classroom. Journal of Educational Technology Systems 45(3): 309-325 (2017). [link]

B. Brimkov: Emphasizing space efficiency in a computer science curriculum. Journal of Computing Sciences in Colleges 31(6): 55-57 (2016). [link]

R. P. Barneva, B. Brimkov: How computer science develops mathematical skills. Journal of Computing Sciences in Colleges 26(6): 170-172 (2011). [link]

Technical reports

B. Brimkov, C. C. Fast, I. V. Hicks: Computational Approaches for Zero Forcing and Related Problems. arXiv:1704.02065 (2017). [link]

B. Brimkov, C. C. Fast, I. V. Hicks: Graphs with Extremal Connected Forcing Numbers. arXiv:1701.08500 (2017). [link]

D. Amos, J. Asplund, B. Brimkov, R. Davila: The sub-k-domination number of a graph with applications to k-domination. arXiv:1611.02379 (2016). [link]

B. Brimkov, R. Davila: Characterizations of the connected forcing number of a graph. arXiv:1604.00740 (2016). [link]

B. Brimkov: On the logspace shortest path problem. Electronic Colloquium on Computational Complexity (ECCC) 23:3 (2016). [link]

B. Brimkov: A note on the clique number of complete k-partite graphs. arXiv:1507.01613 (2015). [link]

B. Brimkov: A reduction of the logspace shortest path problem to biconnected graphs. arXiv:1511.07100 (2015). [link]

B. Brimkov, V.E. Brimkov: Geometric approach to string analysis: deviation from linearity and its use for biosequence classification. arXiv:1308.2885 (2013). [link]

Master's thesis

Boris Brimkov: Efficient computation of graph polynomials. Master's Thesis, Rice University, May 2015. [link]

Ongoing work

Redistricting with optimal minority representation.

Chromatic polynomials of some grid graphs.

A matching-based heuristic for the traveling salesman problem.

On the connected forcing number of a graph.

Select presentations

"Connected Zero Forcing of a Graph", INFORMS Annual Meeting, Nashville, Nov 2016.

"Structural and Extremal Results on Connected Zero Forcing", AMS Sectional Meeting, Denver, Oct 2016.

"Space Efficient Algorithms for Large Scale Graph Problems", ACM Richard Tapia Celebration of Diversity in Computing Conference, Austin, Sept 2016.

"Characterizing Chromatic and Flow Polynomials of Graphs", Graduate Research Workshop in Combinatorics, Laramie, July 2016.

"Emphasizing Space Efficiency in a Computer Science Curriculum" (poster), Consortium for Computing Sciences in Colleges, Hamilton College, Clinton, April 2016.

"Logspace shortest path algorithms", Computer Science Graduate Seminar, Rice University, Houston, Nov 2015.

"Efficient Computation of Chromatic and Flow Polynomials", INFORMS Annual Meeting, Philadelphia, Nov 2015.

"A space-efficient shortest path algorithm for block graphs", Computational and Applied Mathematics Graduate Seminar, Rice University, Houston, Sept 2015.

"Efficient computations of certain graph polynomials", Seminar of Algebra Department, University of Sofia St. Kliment Ohridski, Sofia, Bulgaria, June 2015.

"Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs", Computational and Applied Mathematics Graduate Seminar, Rice University, Houston, March 2015.

"Geometric approach to string analysis", Computational and Applied Mathematics Graduate Seminar, Rice University, Houston, Oct 2013.

"2D Modality Classification" (won third prize), Summer School on Image Processing, Vienna, Austria, July 2012.

"A Novel Hybrid Method and Library Interpolation for Rapid CFD of Vascular Flows" (poster), Council on Undergraduate Research Posters on the Hill, Washington DC, April 2012.

"Optimizing the Performance of a Hybrid Method for Numerically Solving and Visualizing Vascular Flows" (poster), Laurier Centennial Conference: Applied Mathematics, Modeling, and Computer Science, Waterloo, Canada, July 2011.

"Proposing a Hybrid Method to Simulate Irregular Vascular Flows", Mathematical Developments and Applications: Radial Basis Functions, UMass Dartmouth, Dartmouth, June 2011.

"Offset approach to defining 3D digital lines", International Symposium on Visual Computing, Las Vegas, Dec 2008.