| Publication | Date of Publication | Type |
|---|
On parallel k-center clustering
ACM Transactions on Algorithms | 2026-09-17 | Paper |
Optimal (degree+1)-coloring in congested clique
SIAM Journal on Computing | 2026-07-29 | Paper |
Near uniform triangle sampling over adjacency list graph streams
Theoretical Computer Science | 2026-07-13 | Paper |
Parallel derandomization for coloring
Theoretical Computer Science | 2026-04-16 | Paper |
| Even the easiest(?) Graph coloring problem is not easy in streaming! | 2026-04-15 | Paper |
Log-diameter MST verification and sensitivity in MPC
Algorithmica | 2025-10-10 | Paper |
Faster counting and sampling algorithms using colorful decision oracle
ACM Transactions on Computation Theory | 2025-07-22 | Paper |
| Streaming graph algorithms in the massively parallel computation model | 2025-06-13 | Paper |
| A tight lower bound for 3-coloring grids in the online-LOCAL model | 2025-06-13 | Paper |
Exploring the gap between tolerant and non-tolerant distribution testing
IEEE Transactions on Information Theory | 2025-02-27 | Paper |
| On the complexity of triangle counting using emptiness queries | 2025-01-14 | Paper |
Optimal non-adaptive algorithm for edge estimation
(available as arXiv preprint) | 2025-01-01 | Paper |
| Overlay network construction: improved overall and node-wise message complexity | 2025-01-01 | Paper |
| Optimal (degree+1)-coloring in congested clique | 2024-11-14 | Paper |
| Counting and sampling from substructures using linear algebraic queries | 2024-09-12 | Paper |
| Exploring the gap between tolerant and non-tolerant distribution testing | 2024-08-22 | Paper |
| Tolerant bipartiteness testing in dense graphs | 2024-06-24 | Paper |
| Faster counting and sampling algorithms using colorful decision oracle | 2024-04-23 | Paper |
Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams
Theory of Computing Systems | 2024-01-08 | Paper |
scientific article; zbMATH DE number 7768389 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
Query complexity of global minimum cut
(available as arXiv preprint) | 2023-11-20 | Paper |
| Interplay Between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds | 2023-11-20 | Paper |
| Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond | 2023-10-31 | Paper |
Almost optimal query algorithm for hitting set using a subset query
Journal of Computer and System Sciences | 2023-07-10 | Paper |
| Triangle Estimation Using Tripartite Independent Set Queries. | 2023-02-03 | Paper |
FPT Algorithms for Embedding into Low-Complexity Graphic Metrics
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond
Computational Complexity | 2022-08-01 | Paper |
Parameterized query complexity of hitting set using stability of sunflowers
(available as arXiv preprint) | 2022-07-21 | Paper |
On triangle estimation using tripartite independent set queries
Theory of Computing Systems | 2021-12-18 | Paper |
On triangle estimation using tripartite independent set queries
Theory of Computing Systems | 2021-12-18 | Paper |
FPT algorithms for embedding into low complexity graphic metrics
(available as arXiv preprint) | 2021-08-04 | Paper |
| Fixed parameter tractability of graph deletion problems over data streams | 2021-04-21 | Paper |
Grid obstacle representation of graphs
Discrete Applied Mathematics | 2021-04-20 | Paper |
Existence of planar support for geometric hypergraphs using elementary techniques
Discrete Mathematics | 2020-04-21 | Paper |
Improved algorithms for the evacuation route planning problem
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
Improved algorithms for the evacuation route planning problem
Lecture Notes in Computer Science | 2016-02-05 | Paper |
