| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147529 | 2024-01-15 | Paper |
| Near-optimal dominating sets in dense random graphs in polynomial expected time | 2024-01-05 | Paper |
| Mobility-aware, adaptive algorithms for wireless power transfer in ad hoc networks | 2023-10-20 | Paper |
| Selected combinatorial problems through the prism of random intersection graphs models | 2023-10-04 | Paper |
| MAX CUT in weighted random intersection graphs and discrepancy of sparse random set systems | 2023-09-27 | Paper |
| A spectral algorithm for finding maximum cliques in dense random intersection graphs | 2023-08-14 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs | 2022-07-21 | Paper |
| Maximum cliques in graphs with small intersection number and random intersection graphs | 2021-12-20 | Paper |
| An extension of the Moran process using type-specific connection graphs | 2021-11-25 | Paper |
| How fast can we reach a target vertex in stochastic temporal graphs? | 2020-09-07 | Paper |
| An extension of the Moran process using type-specific connection graphs | 2020-02-12 | Paper |
| Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing | 2019-04-29 | Paper |
| Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time | 2019-01-10 | Paper |
| Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks | 2018-08-20 | Paper |
| Stably Computing Order Statistics with Arithmetic Population Protocols | 2018-03-21 | Paper |
| Strategic Contention Resolution with Limited Feedback | 2018-03-02 | Paper |
| A 3-player protocol preventing persistence in strategic contention with limited feedback | 2018-02-13 | Paper |
| Expander properties in random regular graphs with edge faults | 2017-12-04 | Paper |
| On the chromatic number of non-sparse random intersection graphs | 2017-03-31 | Paper |
| Determining majority in networks with local interactions and very small local memory | 2017-03-29 | Paper |
| A Glimpse at Paul G. Spirakis | 2016-01-27 | Paper |
| On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations | 2016-01-27 | Paper |
| On Some Combinatorial Properties of Random Intersection Graphs | 2016-01-27 | Paper |
| On the structure of equilibria in basic network formation | 2015-06-10 | Paper |
| CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS | 2015-04-29 | Paper |
| On the energy balance problem in distributed sensor networks | 2014-10-24 | Paper |
| Book review of: Y. Shoham and K. Leyton-Brown, Multiagent systems. Algorithmic, game-theoretic, and logical foundations. | 2014-10-24 | Paper |
| Determining Majority in Networks with Local Interactions and Very Small Local Memory | 2014-07-01 | Paper |
| On the Structure of Equilibria in Basic Network Formation | 2013-08-16 | Paper |
| A Guided Tour in Random Intersection Graphs | 2013-08-07 | Paper |
| Natural models for evolution on networks | 2013-04-17 | Paper |
| Maximum cliques in graphs with small intersection number and random intersection graphs | 2012-09-25 | Paper |
| On the independence number and Hamiltonicity of uniform random intersection graphs | 2011-12-07 | Paper |
| Selected Combinatorial Properties of Random Intersection Graphs | 2011-11-11 | Paper |
| Probabilistic Data Propagation in Wireless Sensor Networks | 2011-04-05 | Paper |
| Energy-Balanced Data Propagation inWireless Sensor Networks | 2011-04-05 | Paper |
| Stochastic models and adaptive algorithms for energy balance in sensor networks | 2010-10-06 | Paper |
| Expander properties and the cover time of random intersection graphs | 2009-11-06 | Paper |
| Colouring Non-sparse Random Intersection Graphs | 2009-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395947 | 2009-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395990 | 2009-09-15 | Paper |
| The survival of the weakest in networks | 2009-08-06 | Paper |
| Large independent sets in general random intersection graphs | 2008-11-12 | Paper |
| Expander Properties and the Cover Time of Random Intersection Graphs | 2008-09-17 | Paper |
| The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs | 2008-09-04 | Paper |
| Efficient sensor network design for continuous monitoring of moving objects | 2008-08-14 | Paper |
| The Survival of the Weakest in Networks | 2008-02-21 | Paper |
| Adaptive energy management for incremental deployment of heterogeneous wireless sensors | 2008-02-18 | Paper |
| A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks | 2007-12-17 | Paper |
| Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental Evaluation | 2007-09-14 | Paper |
| Fault-tolerant and efficient data propagation in wireless sensor networks using local, additional network information | 2007-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3433910 | 2007-04-23 | Paper |
| The infection time of graphs | 2007-01-09 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies | 2006-10-31 | Paper |
| The impact of network structure on the stability of greedy protocols | 2006-02-08 | Paper |
| Radiocoloring in planar graphs: Complexity and approximations | 2005-09-22 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668736 | 2005-04-15 | Paper |
| Attack propagation in networks | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813181 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473907 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437116 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437513 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436058 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426342 | 2003-09-16 | Paper |
| Distributed communication algorithms for ad hoc mobile networks. | 2003-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415065 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414500 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708560 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788605 | 2003-06-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791664 | 2003-01-30 | Paper |
| On the robustness of interconnections in random graphs: a symbolic approach. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785581 | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152424 | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536423 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536928 | 2002-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536372 | 2002-11-04 | Paper |
| On the existence of $\delta$-temporal cliques in random simple temporal graphs | N/A | Paper |
