| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6190873 | 2024-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6190880 | 2024-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161055 | 2023-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161061 | 2023-06-26 | Paper |
| Self-adjusting grid networks | 2023-05-19 | Paper |
| Demand-aware network designs of bounded degree | 2023-02-03 | Paper |
| Dynamically optimal self-adjusting single-source tree networks | 2022-10-13 | Paper |
| Hotelling games in fault-prone settings | 2022-06-13 | Paper |
| Mixed preferential attachment model: homophily and minorities in social networks | 2022-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5072475 | 2022-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5072479 | 2022-04-28 | Paper |
| Breaking the \(\log n\) barrier on rumor spreading | 2022-02-15 | Paper |
| Competitive clustering of stochastic communication patterns on a ring | 2021-01-15 | Paper |
| Dynamic Balanced Graph Partitioning | 2020-10-28 | Paper |
| Demand-aware network designs of bounded degree | 2020-06-15 | Paper |
| Self-adjusting linear networks | 2020-03-03 | Paper |
| Generalized Perron–Frobenius Theorem for Multiple Choice Matrices, and Applications | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743416 | 2019-05-10 | Paper |
| Cover time and mixing time of random walks on dynamic graphs | 2018-09-05 | Paper |
| Online balanced repartitioning | 2018-08-16 | Paper |
| Information spreading in dynamic networks under oblivious adversaries | 2018-08-16 | Paper |
| rDAN: toward robust demand-aware network designs | 2018-03-16 | Paper |
| Assortative Mixing Equilibria in Social Network Games | 2017-11-01 | Paper |
| Homophily and the Glass Ceiling Effect in Social Networks | 2017-05-19 | Paper |
| Core Size and Densification in Preferential Attachment Networks | 2015-11-04 | Paper |
| Order optimal information spreading using algebraic gossip | 2015-09-11 | Paper |
| Self-adjusting grid networks to minimize expected path length | 2015-05-22 | Paper |
| Bounds for algebraic gossip on graphs | 2014-10-16 | Paper |
| Faster Rumor Spreading: Breaking the logn Barrier | 2014-09-29 | Paper |
| Testing the irreducibility of nonsquare Perron-Frobenius systems | 2014-08-28 | Paper |
| SINR diagrams | 2014-07-23 | Paper |
| Distributed Computing on Core-Periphery Networks: Axiom-Based Design | 2014-07-01 | Paper |
| SINR Diagrams | 2014-02-17 | Paper |
| Self-adjusting Grid Networks to Minimize Expected Path Length | 2013-12-17 | Paper |
| Order optimal information spreading using algebraic gossip | 2013-08-26 | Paper |
| A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model | 2012-10-11 | Paper |
| Many Random Walks Are Faster Than One | 2011-08-16 | Paper |
| Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs | 2010-01-27 | Paper |
| On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources | 2009-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5321550 | 2009-07-22 | Paper |
| How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) | 2008-08-28 | Paper |
| The power of choice in random walks: An empirical study | 2007-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5428934 | 2007-11-29 | Paper |
| On the cover time and mixing time of random geometric graphs | 2007-07-16 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4798018 | 2003-03-18 | Paper |
