Cooperative Problem Solving & Competitive Programming

This is the official page for the Cooperative Problem Solving and Competitive Programming group at Ca’ Foscari University of Venice.

Meeting Style

We meet weekly. Our meetings are hands-on and interactive. Typically, they have the following structure:

  1. Kick-off (30 mins): A brief introductory talk by a RAVEN researcher on an algorithmic topic or technique.
  2. Lab (60 mins): Students work in small groups to solve a set of problems in the scope of the introduced topic.

After a batch of lectures (typically 3 or 4) with this structure, we hold friendly coding competitions.

What is the Purpose of this Group?

The group is meant for students who want to improve their theoretical and practical algorithmic knowledge. Our activities focus on the following:

With our meetings we prepare teams to participate in international contests such as ITACPC, SWERC, and ICPC. Besides this, our meetings alo provide the perfect preparation for technical job interviews at top-tier tech companies (like Google or Meta).

Archive & Materials

This archive is updated weekly with the topics covered and relevant resources.

Winter Semester 2026

DateRoomTopicMaterialsLecturer
Sep 17, 2026 Dynamic Programming  
Sep 24, 2026 Graph Visits  
Oct 1, 2026 Minimum Spanning Trees  
Oct 8, 2026 Programming Contest  

Summer Semester 2026

DateRoomTopicMaterialsLecturer
May 7, 20261B (Delta)Linked Data StructuresIntroduction, SlidesAlessio Campanelli
May 14, 2026B (Zeta)Heaps and Priority QueuesSlidesRuben Becker
May 21, 2026B (Zeta)Union-Find Data StructureSlidesDavide Cologni
May 28, 2026B (Zeta)Programming Contest Riccardo Maso
Jun 4, 2026B (Zeta)Complete SearchSlidesRuben Becker
Jun 11, 2026C (Zeta)Divide & ConquerAfter the lectureDavide Cologni
Jun 25, 2026Acadia (Zeta)GreedyAfter the lectureRiccardo Maso
Jul 2, 2026Acadia (Zeta)Programming Contest Alessio Campanelli