| Publication | Date of Publication | Type |
|---|
| Nearly optimal local algorithms for constructing sparse spanners of clusterable graphs | 2025-10-06 | Paper |
| Distributed CONGEST algorithm for finding Hamiltonian paths in Dirac graphs and generalizations | 2024-12-03 | Paper |
scientific article; zbMATH DE number 7829264 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Distributed Testing of Graph Isomorphism in the CONGEST Model.
(available as arXiv preprint) | 2023-10-31 | Paper |
| Three notes on distributed property testing | 2023-02-03 | Paper |
Robust routing made easy
Lecture Notes in Computer Science | 2022-11-04 | Paper |
| Distributed set cover approximation: primal-dual with optimal locality | 2022-07-21 | Paper |
Sublinear Random Access Generators for Preferential Attachment Graphs
ACM Transactions on Algorithms | 2022-02-22 | Paper |
scientific article; zbMATH DE number 7385938 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-26 | Paper |
Property testing of planarity in the \textsf{CONGEST} model
Distributed Computing | 2021-03-12 | Paper |
Sublinear Random Access Generators for Preferential Attachment Graphs.
(available as arXiv preprint) | 2020-05-27 | Paper |
Optimal Metastability-Containing Sorting via Parallel Prefix Computation
IEEE Transactions on Computers | 2020-01-28 | Paper |
On-line path computation and function placement in SDNs
Lecture Notes in Computer Science | 2019-11-22 | Paper |
Property testing of planarity in the \textsf{CONGEST} model
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| scientific article; zbMATH DE number 7075933 (Why is no real title available?) | 2019-07-03 | Paper |
On-line path computation and function placement in SDNs
Theory of Computing Systems | 2019-06-21 | Paper |
Best of two local models: centralized local and distributed local algorithms
Information and Computation | 2018-09-27 | Paper |
Non-local probes do not help with many graph problems
(available as arXiv preprint) | 2018-08-16 | Paper |
A Constant Approximation Algorithm for Scheduling Packets on Line Networks
(available as arXiv preprint) | 2018-03-02 | Paper |
Online packet-routing in grids with bounded buffers
Algorithmica | 2017-10-09 | Paper |
Improved approximation for orienting mixed graphs
Algorithmica | 2016-03-23 | Paper |
A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
Theoretical Computer Science | 2015-05-22 | Paper |
Deterministic stateless centralized local algorithms for bounded degree graphs
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science | 2014-01-10 | Paper |
A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Online Multi-Commodity Flow with High Demands
Approximation and Online Algorithms | 2013-09-13 | Paper |
| Digital Logic Design | 2012-12-13 | Paper |
Improved approximation for orienting mixed graphs
Structural Information and Communication Complexity | 2012-09-26 | Paper |
Revisiting randomized parallel load balancing algorithms
Theoretical Computer Science | 2012-08-10 | Paper |
Parallel randomized load balancing: a lower bound for a more general model
Theoretical Computer Science | 2011-05-10 | Paper |
An \(O(\log n)\)-competitive online centralized randomized packet-routing algorithm for lines
Automata, Languages and Programming | 2010-09-07 | Paper |
Revisiting Randomized Parallel Load Balancing Algorithms
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Parallel randomized load balancing: a lower bound for a more general model
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
