2024
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship.
Math. Program., January, 2024

FedSSP: Federated Graph Learning with Spectral Knowledge and Personalized Preference.
CoRR, 2024

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances.
CoRR, 2024

Cut-Preserving Vertex Sparsifiers for Planar and Quasi-bipartite Graphs.
CoRR, 2024

On (1 + ɛ)-Approximate Flow Sparsifiers.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

An <i>Ω~(√log|T|)</i> Lower Bound for Steiner Point Removal.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Lower Bounds on 0-Extension with Steiner Nodes.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

New Structures and Algorithms for Length-Constrained Expander Decompositions.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families.
CoRR, 2023

An Ω̃(√(log |T|) Lower Bound for Steiner Point Removal.
CoRR, 2023

On (1+ε)-Approximate Flow Sparsifiers.
CoRR, 2023

Parallel Greedy Spanners.
CoRR, 2023

Worst-Case Welfare of Item Pricing in the Tollbooth Problem.
Proceedings of the ACM Web Conference 2023, 2023

Almost-Optimal Sublinear Additive Spanners.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Query Complexity of the Metric Steiner Tree Problem.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems.
CoRR, 2022

Near-Linear ε-Emulators for Planar Graphs.
CoRR, 2022

A subpolynomial approximation algorithm for graph crossing number in low-degree graphs.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Almost-linear <i>ε</i>-emulators for planar graphs.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Towards tight(er) bounds for the Excluded Grid Theorem.
J. Comb. Theory B, 2021

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Erratum for "On the Inequalities of Projected Volumes and the Constructible Region".
SIAM J. Discret. Math., 2020

On Packing Low-Diameter Spanning Trees.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Towards Better Approximation of Graph Crossing Number.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
On the Inequalities of Projected Volumes and the Constructible Region.
SIAM J. Discret. Math., 2019

Towards Automatic Engagement Recognition of Autistic Children in a Machine Learning Approach.
Proceedings of the IEEE International Conference on Engineering, Technology and Education, 2019

2018
Comments on Cut-Set Bounds on Network Function Computation.
IEEE Trans. Inf. Theory, 2018

2016
On the computational complexity of bridgecard.
J. Comb. Optim., 2016

Robust Influence Maximization.
Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016

2015
Upper bound on function computation in directed acyclic networks.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014
On the Meeting Time for Two Random Walks on a Regular Graph.
CoRR, 2014

On the Inequalities of Projected Volumes and the Constructible Region.
CoRR, 2014