| Publication | Date of Publication | Type |
|---|
| Nibbling at long cycles: dynamic (and static) edge coloring in optimal time | 2024-11-28 | Paper |
| Dynamic algorithms for packing-covering LPs via multiplicative weight updates | 2024-05-14 | Paper |
| Dynamic matching with better-than-2 approximation in polylogarithmic update time | 2024-05-14 | Paper |
| Sublinear algorithms for \((1.5+\epsilon)\)-approximate matching | 2024-05-08 | Paper |
scientific article; zbMATH DE number 7788488 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788506 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover
SIAM Journal on Computing | 2023-10-26 | Paper |
Coarse-Grained Complexity for Dynamic Algorithms
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Prior-free multi-unit auctions with ordered bidders
Theoretical Computer Science | 2020-11-06 | Paper |
| Improved algorithm for dynamic \(b\)-matching | 2020-05-27 | Paper |
Deterministic dynamic matching in \(O(1)\) update time
Algorithmica | 2020-02-28 | Paper |
Deterministically maintaining a \((2 + \epsilon)\)-approximate minimum vertex cover in \(O(1/\epsilon^2)\) amortized update time
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
New amortized cell-probe lower bounds for dynamic problems
Theoretical Computer Science | 2019-06-06 | Paper |
Fully dynamic approximate maximum matching and minimum vertex cover in \(O(\log^3 n)\) worst case update time
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Deterministic fully dynamic data structures for vertex cover and matching
SIAM Journal on Computing | 2018-07-04 | Paper |
Dynamic algorithms via the primal-dual method
Information and Computation | 2018-06-14 | Paper |
| scientific article; zbMATH DE number 6850309 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850309 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
Welfare maximization with friends-of-friends network externalities
Theory of Computing Systems | 2018-02-01 | Paper |
Deterministic fully dynamic data structures for vertex cover and matching
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
New deterministic approximation algorithms for fully dynamic matching
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time
(available as arXiv preprint) | 2017-08-31 | Paper |
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
| Welfare maximization with friends-of-friends network externalities | 2017-01-24 | Paper |
Maintaining Near-Popular Matchings
Automata, Languages, and Programming | 2015-11-04 | Paper |
Design of dynamic algorithms via primal-dual method
Automata, Languages, and Programming | 2015-10-27 | Paper |
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
New approximability results for the robust \(k\)-median problem
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Budget constrained auctions with heterogeneous items
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Coordination mechanisms for selfish routing over time on a tree
Automata, Languages, and Programming | 2014-07-01 | Paper |
| scientific article; zbMATH DE number 6297730 (Why is no real title available?) | 2014-05-22 | Paper |
Budget-constrained auctions with heterogeneous items
Theory of Computing | 2012-09-27 | Paper |
A cops and robber game in multidimensional grids
Discrete Applied Mathematics | 2010-11-05 | Paper |
