| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147529 | 2024-01-15 | 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 |
| The temporal explorer who returns to the base | 2021-06-30 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5206908 | 2019-12-19 | 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 |
| 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 |
| 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 |
| 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 |
| Expander properties and the cover time of random intersection graphs | 2009-11-06 | Paper |
| Colouring Non-sparse Random Intersection Graphs | 2009-10-16 | 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 |
| The Survival of the Weakest in Networks | 2008-02-21 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| On the existence of $\delta$-temporal cliques in random simple temporal graphs | 0001-01-03 | Paper |
