神马福利影片

The workshop Algorithms & Complexity @ Warwick took place at the 神马福利影片 on September 22-23, 2025 (see for more details).

The aim of the event was to highlight several recent exciting advances in the field of Algorithms and Complexity, to facilitate interactions within the research community, and to provide an excellent opportunity for Theory researchers (including academics, postdocs, and students) to connect and collaborate.

We had a fantastic list of invited speakers by renowned world experts: (Technical University of Catalonia), (University of Bath), (University of Pennsylvania), (Max Planck Institute for Informatics), (Charles University in Prague), (University of Sheffield and University of Haifa), (University of Oxford), (University of Cambridge), (University of Toronto).

We are delighted to congratulate Dr Scott Brooks, a former DCS graduate (MEng, 2016–2020), on his new role as a Knowledge Transfer Partnership (KTP) Associate.

Following the successful completion of his iCASE PhD, supervised by Professors Till Bretschneider (DCS) and Andrew McAinsh at Warwick Medical School, Scott has been awarded a 30-month KTP position, funded by Innovate UK. In collaboration with Intelligent Imaging Innovations (3i), he will develop smart microscopy software (CelFDrive) building on the prototype tools he created during his PhD.

Scott鈥檚 work leverages machine learning to automatically identify cells with rare or subtle biological features, often missed by human observers, enabling faster and more accurate analysis. This innovation accelerates fundamental biological research and establishes a foundation for high-throughput drug discovery.

For more details, see the official announcement:

We really enjoyed celebrating with our fantastic graduating students on Friday. If you have Instagram you can to see the highlights!

We would like to wish all our graduates all the best in their future work or study.

Click the link to view our 2024/25 prize winners.

We are delighted to announce that a result coauthored by and (from our Theory and Foundations Research Division), along with (University of Waterloo), (Northeastern University), (Tel Aviv University) and (ETH Zurich), has received a best paper award at the upcoming (STOC), 2025. STOC is a flagship international conference in theoretical computer science.

The paper, titled "," tackles a fundamental, textbook edge-coloring problem: Given a graph G with n vertices and m edges, the goal is to assign a color to each edge such that no two edges sharing a common endpoint receive the same color. A classical result by Vizing, dating back to 1960s, proves that any simple graph can always be edge-colored with at most 螖 + 1 colors, where 螖 is the maximum degree of a vertex. Vizing's original proof is inherently algorithmic and immediately gives an O(mn) time algorithm for computing such a coloring.

This problem has seen a long and influential line of research aimed at designing faster algorithms for this basic task. For over four decades, the best-known runtime was 脮(m鈭歯), a significant barrier that was only broken in 2024 through concurrent, independent works. The recent paper culminates this effort by providing a randomized algorithm that computes a 螖 + 1 edge coloring in O(m log 螖) time, a running time that is near-linear in the input size.

We are very happy to announce four recent promotions in the department effective from 1 August 2025:

• Dr Jonathan FossLink opens in a new window has been promoted to Assistant Professor
• Dr Ayse Saliha SunarLink opens in a new window has been promoted to Assistant Professor
• Dr Adam ShephardLink opens in a new window has been promoted to Assistant Professor
• Dr Greg WatsonLink opens in a new window has been promoted to Associate Professor

Many congratulations to our colleagues for all their achievements!

Congratulations to Peter Kiss who has been awarded the Best PhD Thesis Prize in Computer Science 2025.

"Keep up your outstanding performance and best wishes for your career!" - Florin