I'm broadly interested in theoretical computer science and its interplay with combinatorics.
Here there be brambles and trees and sunflowers, gadgets and oracles and the devil; what else could this be if not the garden of earthly delights?
I've dabbled a bit with computational geometry.
Trying to learn other things too; it's tough, but we'll get there someway or somehow!
Publications
-
Local Routing in Sparse and Lightweight Geometric Graphs
VA, Joachim Gudmundsson, Christos Levcopoulos, Bengt J. Nilsson, André van Renssen
Algorithmica 84 (5), ISAAC 2019, [arxiv]
Preprints, Notes, Etc
-
Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
VA, Rezaul Chowdury, Jie Gao, Mayank Goswami, Joseph S. B. Mitchell, Valentin Polishchuk
[t.b.d.]
-
Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance
VA, Sepehr Assadi, Chengyuan Deng, Jie Gao, Chen Wang
[arxiv]
-
Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights
VA, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin Hao Su
[arxiv]
-
Online Ply Maintenance
VA, Patrick Eades, Maarten Löffler, Seeun William Umboh
EuroCG 2021
Teaching
-
Computer Architecture (Fall 2021)
Teaching Assistant
-
Algorithms (Undergraduate: Spring 2022, Fall 2023; Graduate: Spring 2023)
Teaching Assistant
