PHYS 213: Thermal Physics
Published:
Introduction to thermodynamics…
Published:
Introduction to thermodynamics…
Published:
Notes for the Spring 2025 instance of honors abstract algebra at UIUC, taught by Eugene Lerman.
Published:
These notes very briefly summarize Chapters 2, 3, 5, 6 from Klaminski, Pralat, and Theberge’s book on Mining Complex Networks.
Published:
Short description of portfolio item number 1
Short description of portfolio item number 2 
Published in Applied Network Science, 2025
Using Stochastic Block Models for Community Detection: The issue of edge-connectivity
Recommended citation: Vu-Le, The-Anh and Park, Minhyuk and Chen, Ian and Chacko, George and Warnow, Tandy. (2025). "Using Stochastic Block Models for Community Detection: The issue of edge-connectivity"
Download Paper | Download Bibtex
Published in Complex Networks and Applications, 2025
Dense Subgraph Clustering and a New Cluster Ensemble Method
Recommended citation: Vu-Le, The-Anh and Lamy, Joao Alfredo Cardoso Lamy and Alessi, Tomas and Chen, Ian and Park, Minhyuk and Harb, Elfarouk and Chacko, George and Warnow, Tandy. (2025). "Dense Subgraph Clustering and a New Cluster Ensemble Method"
Download Paper | Download Bibtex
Published in preprint, 2026
Modeling citations and cartels
Recommended citation: Park, Minhyuk and Yi, Haotian and Chen, Ian and Warnow, Tandy and Chacko, George. (2026). "Modeling citations and cartels"
Download Paper | Download Bibtex
Published:
Recursion, Inverse Ackermann, Union-Find, Range-Minimum Queries…
Recommended citation: Chen, Ian; Inverse Ackermann Function
Download Slides
Published:
Elementary graph theory, De Bruijn sequences, and genome assembly…
Recommended citation: Chen, Ian; De Bruijn Graphs
Download Slides
Published:
Multiple sequence alignment, maximum weight trace, dynamic programing, heuristics…
Recommended citation: Chen, Ian; De Bruijn Graphs
Download Slides
Published:
Course project, Multiple Sequence Alignment, MAGUS, …
Recommended citation: Chen, Ian; Exploring the Effect of Iteration on MAGUS
Download Slides
Published:
Sampling with replacement, quickly.
Recommended citation: Chen, Ian; Reservoir Sampling
Download Slides
Published:
Karger-Klein-Tarjan randomized algorithm for computing minimum spanning trees in linear expected time.
Recommended citation: Chen, Ian; Linear time MST
Download Slides
Published:
In a static graph, checking whether nodes are in the connected component takes linear time. I will describe the Kapron, King, Mountjoy algorithm supporting polylog time updates and queries.
Recommended citation: Chen, Ian; Dynamic Graph Connectivity
Download Slides
Published:
Near-linear work algorithms for connectivity and single-source shortest paths (SSSP) have been known since before the 1950s. In this talk, we will describe approaches to increase their parallelism, including coarsening algorithms for connectivity, and incremental stepping algorithms for SSSP.
Recommended citation: Chen, Ian; Parallel Connectivity and Shortests Paths
Download Slides
Undergraduate course, University of Illinois Urbana-Champaign, Siebel School of Computing and Data Science, 2024
Undergraduate course assistant in Fall 2024 and Spring 2025.
Undergraduate/Graduate course, University of Illinois Urbana-Champaign, Siebel School of Computing and Data Science, 2025
Undergraduate course assistant in Fall 2025.