Fast Graph Algorithms Lab
Research Field
Shang-En Huang is currently an assistant professor in the Department of Computer Science and Information Engineering (CSIE), National Taiwan University. Shang-En Huang obtained his Ph.D. degree from University of Michigan and was a postdoc at Boston College. Shang-En's research interests include dynamic graph data structures and algorithms and distributed graph algorithms.
We work on a research subfield in theoretical computer science (TCS), especially in graph algorithms and distributed graph algorithms.
TCS: Fast Graph Algorithms
- We develop fast graph algorithms for solving approximate matching, shortest paths, and maximum flows.
TCS: Graph Sparsification
- We investigate existence and constructions to sparser graphs / graph data structures that approximately preserve the properties required by graph problems.
TCS: Parallel and Distributed Graph Algorithms
- We identify the bottleneck of parallelization of classical graph algorithms. These algorithms have applications to routing and transhipment in large networks.
- 2024-2027 academic year NTU-Fubon Distinguished Scholar
- Ph.D., Computer Science and Engineering, University of Michigan, Ann Arbor, MI, USA 2016 - 2022
- M.S., Computer Science and Engineering, University of Michigan, Ann Arbor, MI, USA 2014 - 2016
- B.S., dual degree on Mathematics and CSIE, National Taiwan University, Taipei, Taiwan 2007 - 2012
Job Description
- Participate research in graph algorithms and computational complexities.
- Implement parallel and/or distributed graph algorithms.
Preferred Intern Educational Level
Bachelor's Student, Master's Student, or PhD Student
Skill sets or Qualities
- Theoretical Computer Science: Discrete Math, Graph Theory, Algorithms and Data Structures
- Programming Skills: C/C++