PhD Student
SIAM Journal on Discrete Mathematics From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
European Symposium on Algorithms (ESA) Faster Exponential Algorithms For Multi-Machine Scheduling Problems
European Symposium on Algorithms (ESA) Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-eta Deletion
Distributed Computing Content-oblivious leader election on rings
ACM Symposium on Principles of Distributed Computing (PODC) Brief Announcement: Toward Uniform Content-Oblivious Leader Election on General Graphs
International Symposium on Distributed Computing (DISC) Content-Oblivious Leader Election on Rings
International Symposium on Algorithms and Computation (ISAAC) From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges
European Symposium on Algorithms (ESA) Exploring the Approximability Landscape of 3SUM
ACM Symposium on Principles of Distributed Computing (PODC) Brief Announcement: Content-Oblivious Leader Election on Rings
Workshop on Open-Source EDA Technology (WOSET) Openlane: The Open-source Digital ASIC Implementation Flow