������

Title of the thesis: Extremal and Algorithmic Results for Bipartite Graphs via Ferrers Dimension and Axis-Parallel Geometry

Thesis defender: Minoo Zarsav
Opponent: Associate Professor Erik Jan van Leeuwen, Utrecht University, Netherlands
Custos: Professor Lauri Savioja, Aalto University School of Science

Public defense in Computer Science: Minoo Zarsav MSc (Tech) 

Minoo Zarsav will defend the doctoral dissertation 
“Extremal and Algorithmic Results for Bipartite Graphs via Ferrers Dimension and Axis-Parallel Geometry” on 25th of May, 2026, at noon in lecture hall M1 (M232), Undergraduate Center, Otakaari 1, Aalto University, Espoo. 

The dissertation field is theoretical computer science, with a focus on combinatorics, graph theory, and algorithms. The thesis develops new structural and extremal results for bipartite graphs arising from geometric representations and introduces algorithmic frameworks for classical hard problems such as the Maximum Balanced Biclique problem. The results demonstrate how geometric constraints induce sparsity and enable improved approximation guarantees. 

Associate Professor Erik Jan van Leeuwen (Utrecht University) will act as the opponent, and Professor Lauri Savioja (Aalto University) as the custos. 

The dissertation will be publicly available at Aalto University's public display page.

Keywords: Bipartite graphs, Ferrers dimension, Geometric intersection graphs, Zarankiewicz problem, Bicliques, Approximation algorithms

Thesis available for public display 7 days prior to the defence at .