Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

A new framework called Falcon, developed by Unnikrishnan Cheramangalath, is revolutionizing graph analytics. This ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

A significant body of recent literature has explored various research directions in hyper-heuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous ...

Forbes contributors publish independent expert analyses and insights. I write about blockchain and big data, primarily focusing on XRP. By applying a well-known graph algorithm to the XRP ledger data, ...

This course is compulsory on the BSc in Data Science and BSc in Mathematics with Data Science. This course is available on the BSc in Mathematics and Economics, BSc in Mathematics with Economics, BSc ...