Yap Roland

Yap Roland is an Associate Professor at the School of Computing, National University of Singapore (NUS), and a member of the Institute of Operations Research and Analytics (IORA). His research focuses on constraint programming and solving, optimization, combinatorial problems, vehicle routing, and big data applications. He actively contributes to advancing methodologies in computational logic, software security, and algorithm design.

His work spans theoretical foundations of constraint satisfaction (CSP/SAT) and practical applications in database systems, graph neural networks, and transportation logistics. Notable contributions include benchmarking tools like OSS-Bench for coding LLMs, novel approaches to detecting logic bugs in graph databases, and enhancing security through randomized pointer techniques. His research bridges algorithmic theory and real-world challenges in AI, cybersecurity, and efficient resource allocation.

Yap Roland has published extensively in top-tier venues such as the International Conference on Principles and Practice of Constraint Programming (CP) and the International Conference on Theory and Applications of Satisfiability Testing (SAT). His recent work emphasizes scalability, fairness in machine learning, and robustness against memory errors in software systems.