Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm. - Mitchell Black 002; William Maxwell (ISAAC, 2021)

Finding surfaces in simplicial complexes with bounded-treewidth 1-skeleton. - Mitchell Black 002; Amir Nayyeri (CoRR, 2021)

ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth. - Mitchell Black 002; Nello Blaser; Amir Nayyeri; Erlend Raa Vågset (SoCG, 2022)

Hodge Decomposition and General Laplacian Solvers for Embedded Simplicial Complexes. - Mitchell Black 002; Amir Nayyeri (ICALP, 2022)

Computational Topology in a Collapsing Universe: Laplacians, Homology, Cohomology. - Mitchell Black 002; William Maxwell; Amir Nayyeri; Eli Winkelman (SODA, 2022)

Understanding Oversquashing in GNNs through the Lens of Effective Resistance. - Mitchell Black 002; Zhengchao Wan; Amir Nayyeri; Yusu Wang 001 (ICML, 2023)

An Incremental Span-Program-Based Algorithm and the Fine Print of Quantum Topological Data Analysis. - Mitchell Black 002; William Maxwell; Amir Nayyeri (CoRR, 2023)

Biharmonic Distance of Graphs and its Higher-Order Variants: Theoretical Properties with Applications to Centrality and Clustering. - Mitchell Black 002; Lucy Lin; Weng-Keen Wong; Amir Nayyeri (ICML, 2024)

Comparing Graph Transformers via Positional Encodings. - Mitchell Black 002; Zhengchao Wan; Gal Mishne; Amir Nayyeri; Yusu Wang 001 (ICML, 2024)

Graph Inference with Effective Resistance Queries. - Huck Bennett; Mitchell Black 002; Amir Nayyeri; Philip G. Warton (CoRR, 2025)

Geometric Generative Modeling with Noise-Conditioned Graph Networks. - Peter Pao-Huang; Mitchell Black 002; Xiaojie Qiu (CoRR, 2025)