From powering search engines to securing data and optimizing networks, algorithms underpin nearly every aspect of modern technology. Understanding how efficiently they can solve problems — and where ...

Abstract: University course timetabling is a non-deterministic polynomial time-hard (NP-hard) problem that involves assigning courses to times and venues while satisfying constraints and minimizing ...

Abstract: Influence maximization in social networks has received much research attention in recent years. It asks to select a set of influential users as seed nodes, so as to trigger the maximum ...