معرفی
Blair Sullivan is a Professor at the Kahlert School of Computing, University of Utah. Her research focuses on graph algorithms, parameterized complexity, and network analysis. She has contributed to theoretical advancements in clustering, graph decomposition, and algorithmic efficiency with applications in robotics, bioinformatics, and social networks.
Education details are not explicitly stated in the provided text, but her affiliation indicates a terminal degree in Computer Science or a related field. Her work frequently intersects with interdisciplinary domains such as computational biology and quantum computing.
Research interests emphasize algorithm design for large-scale networks, with a focus on graph-based problems such as clustering, coloring, and structural optimization. Recent publications explore hypergraph clustering, robotic motion planning, and fairness in network information access. Her work often bridges theoretical computer science with practical applications, including biomedical data analysis and quantum program compilation.
Publications since 2023 reflect a sustained focus on graph-theoretic challenges such as parameterized complexity, edge augmentation for fairness, and decomposition techniques. Notable themes include algorithmic approaches to gerrymandering, genetic association analysis, and hyperbolicity in networks.
No scientific awards or grants are listed in the provided text. She is affiliated with the University of Utah’s Kahlert School of Computing, where she contributes to research and education in computational theory and applications.
