Darren Strash

Darren Strash is an Associate Professor and Chair of the Computer Science department at Hamilton College. His research focuses on solving computationally challenging graph problems, including cliques, independent sets, and cuts, by integrating algorithm theory, combinatorial optimization, and operations research. He holds a Ph.D. and M.S. from the University of California, Irvine, and a B.S. from Cal Poly Pomona. Prior to Hamilton, he was a visiting professor at Colgate University and worked as a postdoctoral researcher at Karlsruhe Institute of Technology in Germany, followed by a career as a software engineer at Intel.

Strash’s research interests emphasize practical data reduction techniques for graph problems, computational geometry, and dynamic data structures. His work often bridges theoretical foundations with real-world applications, such as maximum independent set algorithms and distributed graph generation. He has contributed to open-source projects like OpenStreetMap and teaches courses including Algorithms, Computational Geometry, and Design Principles.

His recent publications highlight advancements in exact algorithms for edge clique cover, vertex clique cover, and scalable kernelization for maximum independent sets. He has advised students on topics like synergistic data reduction and exact solutions for graph problems. His work has been featured in conferences like ESA and ALENEX, and journals such as the ACM Journal of Experimental Algorithmics and SIAM proceedings.