Ph.D. student wins PACE Challenge
KAUST · · Notable
Summary
KAUST Ph.D. student Lukas Larisch won the Parameterized Algorithms and Computational Experiments (PACE) 2017 Challenge in the Optimal Tree Decomposition Challenge, solving more instances than competitors. He received the award at the International Symposium on Parameterized and Exact Computation (IPEC 2017) in Vienna, Austria. Larisch is pursuing his Ph.D. at KAUST and working in the University's Extreme Computing Research Center, focusing on acoustics and graph structure theory. Why it matters: This recognition highlights KAUST's contribution to advanced computer science research and its ability to attract and foster talented researchers in niche areas like parameterized complexity.
Keywords
KAUST · PACE Challenge · Lukas Larisch · Parameterized Algorithms · Tree Decomposition
Get the weekly digest
Top AI stories from the GCC region, every week.