| Publication | Date of Publication | Type |
|---|
| Effective resistances in non-expander graphs | 2025-01-06 | Paper |
| Massively parallel algorithms for the stochastic block model | 2025-01-06 | Paper |
| An optimal separation between two property testing models for bounded degree directed graphs | 2024-11-14 | Paper |
On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing
SIAM Journal on Computing | 2024-07-17 | Paper |
| Sublinear-time algorithms for \textsc{Max Cut, Max E2Lin}\((q)\), and unique label cover on expanders | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788434 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7758318 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
Constant-time Dynamic (Δ +1)-Coloring
ACM Transactions on Algorithms | 2023-10-31 | Paper |
GSF-locality is not sufficient for proximity-oblivious testing
(available as arXiv preprint) | 2023-07-12 | Paper |
Congruence skein relations for colored HOMFLY-PT invariants
Communications in Mathematical Physics | 2023-05-22 | Paper |
| On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing | 2023-04-07 | Paper |
scientific article; zbMATH DE number 7651209 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| Constant-time dynamic \((\Delta+1)\)-coloring | 2023-02-07 | Paper |
Constant-time dynamic weight approximation for minimum spanning forest
Information and Computation | 2021-11-25 | Paper |
Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem
Algorithmica | 2021-11-05 | Paper |
scientific article; zbMATH DE number 7378710 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Improved guarantees for vertex sparsification in planar graphs | 2020-05-27 | Paper |
The power of vertex sparsifiers in dynamic graph algorithms
(available as arXiv preprint) | 2020-05-27 | Paper |
Improved guarantees for vertex sparsification in planar graphs
SIAM Journal on Discrete Mathematics | 2020-01-10 | Paper |
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Dynamic graph stream algorithms in \(o(n)\) space
Algorithmica | 2019-05-07 | Paper |
Spectral concentration and greedy \(k\)-clustering
Computational Geometry | 2018-11-16 | Paper |
Equilibrium games in networks
Physica A | 2018-09-20 | Paper |
| Estimating graph parameters from random order streams | 2018-03-15 | Paper |
Estimating graph parameters from random order streams
(available as arXiv preprint) | 2018-03-15 | Paper |
Dynamic graph stream algorithms in \(o(n)\) space
(available as arXiv preprint) | 2017-12-19 | Paper |
Relating two property testing models for bounded degree directed graphs
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| On constant-size graphs that preserve the local structure of high-girth graphs | 2017-08-31 | Paper |
Testing small set expansion in general graphs
(available as arXiv preprint) | 2017-01-24 | Paper |
Testing cluster structure of graphs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| Congruent skein relations for colored HOMFLY-PT invariants and colored Jones polynomials | 2014-02-14 | Paper |
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
Algorithms and Computation | 2014-01-14 | Paper |
A local algorithm for finding dense bipartite-like subgraphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Community structures in classical network models
Internet Mathematics | 2012-08-29 | Paper |
| Mathematical aspects of string duality | 2012-07-21 | Paper |
The Small Community Phenomenon in Networks: Models, Algorithms and Applications
Lecture Notes in Computer Science | 2012-07-16 | Paper |
New structures of knot invariants
Communications in Number Theory and Physics | 2012-07-13 | Paper |
The small-community phenomenon in networks
MSCS. Mathematical Structures in Computer Science | 2012-06-04 | Paper |
On a proof of the Labastida-Mariño-Ooguri-Vafa conjecture
Mathematical Research Letters | 2011-08-09 | Paper |
Proof of the Labastida-Mariño-Ooguri-Vafa conjecture
Journal of Differential Geometry | 2011-01-28 | Paper |
Proof of the Labastida-Mariño-Ooguri-Vafa conjecture
Journal of Differential Geometry | 2011-01-28 | Paper |
| Towards the large \(N\) duality between the Chern-Simons gauge theory and the topological string theory | 2009-05-22 | Paper |
A simple proof of Gopakumar-Vafa conjecture for local toric Calabi-Yau manifolds
Communications in Mathematical Physics | 2008-02-18 | Paper |
