Conducting research on graph spanners, with emphasis on single-level weighted additive spanners and multi-level spanners
Developing scalable visualizations for large networks using multi-level spanners and layout algorithms
Designing a tree layout algorithm that avoids edge crossings and label overlaps while preserving compactness and edge lengths, extended to general graphs
Applying GNNs to solve NP-complete graph problems, currently focusing on Steiner tree computation
Building a gradient descent-based optimization framework that jointly optimizes stress, edge crossings, crossing angles, and upwardness for DAGs
Studying the online facility assignment problem on graphs/planes/lines with capacity constraints, designing deterministic and randomized algorithms with game-theoretic analysis