News and Event Highlights from 2025
- May 8, 2025. I’m honored to have been selected for an AFOSR Young Investigator Program Award. My proposal was titled “Measuring and Enhancing Resilience in Dynamic Hypergraphs.” Read more about the research here.
- May 5, 2025. I’m excited to have received a course development grant from the Texas A&M Institute of Data Science (TAMIDS) to develop a new course on “Computational Methods for Network Science.”
- May 1, 2025. Two papers, co-authored with my student Thomas Stanley, were accepted for publication at ICML 2025, covering learning-augmented algorithms for metric MSTs (joint work with a team at Lawrence Livermore National Laboratory), and advances in clustering edge-colored hypergraphs (joint with Blair Sullivan and Alex Crane at the University of Utah).
- February 20-22, 2025. I attended the ICERM workshop on Fusing Theory and Practice of Graph Algorithms.
- January 2025. I will be serving as one of the co-chairs for the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX26), to be held in Vancouver, CA in January 2026. The paper submission deadline was July 18, 2025.
- January 11-15, 2025. Traveled to New Orleans, LA, to attend SODA/SOSA/ALENEX 2025.
- January 2025. I started serving as one of the officers (specifically, the Secretary) of the SIAM Activity Group on Applied and Computational Discrete Algorithms (ACDA).
News and Event Highlights from 2024
- July 22-25, 2024. My co-author Vicente Balmaseda presented our research on improved combinatorial algorithms for cluster deletion at ICML in Vienna, Austria.
- July 8-12, 2024. Attended SIAM Discrete Math to give a talk on hypergraph clustering and chair a minisymposium on Applied and Computational Discrete Algorithms.
- May 12-17, 2024. Attended the Dagstuhl Workshop on “Discrete Algorithms on Modern and Emerging Computer Infrastructure” in Wadern, Germany.
- May 6-9, 2024. Attended the Toronto Metropolitan University as an invited speaker for the upcoming workshop on “Modelling and Mining Complex Networks as Hypergraphs“.
- May 01, 2024. Our paper on improved combinatorial algorithms for cluster deletion was accepted at ICML 2024. Joint work with Vicente Balmaseda, Ying Xu, and Yixin Cao.
- January 8-10, 2024. My paper “Growing a Random Maximal Independent Set Produces a 2-approximate Vertex Cover” appeared at SOSA 2024 (Symposium on Simplicity in Algorithms).
News and Event Highlights from 2023
- November 1, 2023. I wrote an article on generalized hypergraph cut problems for this month’s edition of SIAM News. You can read it here or here.
- August 10, 2023. Nature Reviews Physics recently published a Research Spotlight about my research on hypergraph measures of homophily (joint work with Austin Benson and Jon Kleinberg). You can check out the spotlight here
- August 5, 2023. Our paper on Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling was accepted for publication at CIKM. Congratulations to the lead author, Vedangi Bengali!
- May 16, 2023. My paper with Austin Benson and Jon Kleinberg on Augmented Sparsifiers for Hypergraph Cuts has been accepted for publication in JMLR.
- April 24, 2023. My paper on improved approximation algorithms for edge-colored hypergraph clustering has been accepted for publication at ICML (Honolulu, HI, July 2023). Here’s a preprint of the paper.
- January 31, 2023. My paper on cut-matching games in hypergraphs was accepted for publication at The Web Conference, (Austin, TX, May 2023). A preprint is now on arXiv.
- January 6, 2023. Our research on “Combinatorial Characterizations and Impossibilities for Higher-order Homophily” (joint with Austin Benson and Jon Kleinberg) has been published in Science Advances. I had a chance to discuss some of this research as part of a recent article in the Communications of the ACM.
- January 5, 2023. I am honored to have been selected for the SIAM SIAG/ACDA Early Career Prize. I look forward to giving a talk on my research at the 2023 ACDA Conference in Seattle, Washington, May 31-June 2. Here’s the TAMU CSE Department news story and SIAM’s prize spotlight article.
News and Event Highlights from 2022
- November 28, 2022. We successfully held our workshop on Machine Learning on Higher-order Structured data at ICDM. Thanks to the participants and my co-organizers!
- August 4, 2022. Our research on “Hypergraph Cuts with General Splitting Functions” (joint with Austin Benson and Jon Kleinberg) is now published in SIAM Review. Here is a summary by the section editor. My co-author Austin Benson talks a bit more about this research in a Quanta magazine article.
- April 11, 2022. I am honored to be awarded the 2022 Texas A&M Institute of Data Science Career Initiation Fellowship!