Jan
van den Brand

General Information

Email:
vdbrand@gatech.edu
Phone:
None
Location - Building:
KACB
Location - Room:
2144
Roles:
Professor (any rank)
Primary Unit:
School of Computer Science

Details

Degrees with subject and Postdoc Experience:
Degree Type
Postdoctoral Scholar
Subject
Computer Science
Year
2021-2022
Institution
UC Berkeley & Simons Institute for the Theory of Computing
Location
Berkeley
Degree Type
Ph.D
Subject
Computer Science
Year
2021
Institution
KTH Royal Institute of Technology
Location
Stockholm, Sweden
Degree Type
M.S.
Subject
Mathematics
Year
2017
Institution
Goethe University Frankfurt
Location
Frankfurt, Germany
Degree Type
M.S.
Subject
Computer Science
Year
2016
Institution
Goethe University Frankfurt
Location
Frankfurt, Germany
Degree Type
B.S
Subject
Mathematics
Year
2016
Institution
Goethe University Frankfurt
Location
Frankfurt, Germany
Degree Type
B.S
Subject
Computer Science
Year
2014
Institution
Goethe University Frankfurt
Location
Frankfurt, Germany
Statement of Research Interests:

My research is on the design and theoretical analysis of efficient algorithms and data structures. 
One research focus are dynamic algorithms (i.e., data structures) that maintain properties of dynamically changing graphs and matrices. These can be abstract problems like maintaining the solution of a linear system that changes over time, but it also covers applications like maintaining the fastest route in a road network under changing traffic conditions. 
Another research focus are optimization algorithms. Many of these algorithms are iterative and solve a sequence of smaller subproblems, whose solution can be maintained via the aforementioned dynamic algorithms. I develop new iterative methods and dynamic algorithms that complement each other, resulting in improved optimization algorithms.

Statement of Teaching Interests:

Algorithm classes on both undergraduate and graduate level. These include CS 3510, 6515, 7530.

Selection of recent research, scholarly, and creative activities:

Some recent publications:

The Structural Complexity of Matrix-Vector Multiplication 
with Emile Anand and Rose McCarty. 
NeurIPS 2025.

Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances 
with Hossein Gholizadeh, Yonggang Jiang, Tijn de Vos. 
SPAA 2025, Distinguished Paper.
DOI: 10.1145/3694906.3743356

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality 
with Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva. 
FOCS 2024.
DOI: 10.1109/FOCS61266.2024.00120