| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126324 | 2024-04-09 | Paper |
| On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition | 2024-03-26 | Paper |
| Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions | 2024-03-26 | Paper |
| (1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings | 2024-03-26 | Paper |
| On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition | 2023-06-14 | Paper |
| Ant-Inspired Dynamic Task Allocation via Gossiping | 2022-11-04 | Paper |
| On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs | 2022-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090932 | 2022-07-21 | Paper |
| Towards the locality of Vizing’s theorem | 2020-01-30 | Paper |
| Optimal Gossip Algorithms for Exact and Approximate Quantile Computations | 2019-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224730 | 2019-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224731 | 2019-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743486 | 2019-05-10 | Paper |
| Ant-inspired density estimation via random walks | 2019-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4559882 | 2018-12-04 | Paper |
| Scaling Algorithms for Weighted Matching in General Graphs | 2018-11-12 | Paper |
| Scaling Algorithms for Weighted Matching in General Graphs | 2018-07-16 | Paper |
| Distributed Degree Splitting, Edge Coloring, and Orientations | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636165 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636187 | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636197 | 2018-04-23 | Paper |
| Distributed MST and Routing in Almost Mixing Time | 2017-10-11 | Paper |
| (2Δ — l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting | 2017-10-05 | Paper |
| Ant-Inspired Density Estimation via Random Walks | 2017-09-29 | Paper |
| Distributed algorithms for the Lovász local lemma and graph coloring | 2017-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3178793 | 2016-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3178796 | 2016-12-20 | Paper |
| Clairvoyant Mechanisms for Online Auctions | 2016-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2799817 | 2016-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2799824 | 2016-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2799847 | 2016-04-13 | Paper |
| Distributed algorithms for the Lovász local lemma and graph coloring | 2015-09-03 | Paper |
| Distributed coloring algorithms for triangle-free graphs | 2015-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5252024 | 2015-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5252036 | 2015-05-21 | Paper |
| Almost-Tight Distributed Minimum Cut Algorithms | 2015-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403273 | 2014-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2869381 | 2014-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2869390 | 2014-01-03 | Paper |
| Fast Distributed Coloring Algorithms for Triangle-Free Graphs | 2013-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3145601 | 2012-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165983 | 2012-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165989 | 2012-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3166000 | 2012-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2906846 | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096228 | 2011-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3089187 | 2011-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3089200 | 2011-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3015615 | 2011-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581916 | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581924 | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581934 | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581948 | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3567788 | 2010-06-17 | Paper |
| An improved algorithm for finding a length-constrained maximum-density subtree in a tree | 2010-06-09 | Paper |
| Efficient algorithms for the problems of enumerating cuts by non-decreasing weights | 2010-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615908 | 2009-03-24 | Paper |
