| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6123998 | 2024-04-08 | Paper |
| Co-eigenvector graphs | 2024-04-05 | Paper |
| Maximum modular graphs | 2023-07-26 | Paper |
| Graph Spectra for Complex Networks | 2023-07-03 | Paper |
| Two-Population SIR Model and Strategies to Reduce Mortality in Pandemics | 2022-11-15 | Paper |
| Markov modulated process to model human mobility | 2022-10-25 | Paper |
| Number of paths in a graph | 2022-09-19 | Paper |
| The spreading time in SIS epidemics on networks | 2022-06-27 | Paper |
| Linear processes on complex networks | 2022-01-19 | Paper |
| Prevalence expansion in NIMFA | 2022-01-17 | Paper |
| The simplex geometry of graphs | 2021-09-15 | Paper |
| Detecting the number of clusters in a network | 2021-09-15 | Paper |
| Clustering for epidemics on networks: A geometric approach | 2021-07-15 | Paper |
| Optimal curing policy for epidemic spreading over a community network with heterogeneous population | 2021-05-07 | Paper |
| Binet's factorial series and extensions to Laplace transforms | 2021-02-09 | Paper |
| Time-dependent solution of the NIMFA equations around the epidemic threshold | 2021-01-19 | Paper |
| The correlation of metrics in complex networks with applications in functional brain networks | 2020-08-11 | Paper |
| Community Networks with Equitable Partitions | 2020-07-08 | Paper |
| Adaptive Networks | 2020-07-08 | Paper |
| The Mittag-Leffler function | 2020-05-27 | Paper |
| Optimal Induced Spreading of SIS Epidemics in Networks | 2020-01-28 | Paper |
| Constructing Laplacian matrices with Soules vectors: inverse eigenvalue problem and applications | 2019-09-24 | Paper |
| Tighter spectral bounds for the cut size, based on Laplacian eigenvectors | 2019-05-29 | Paper |
| Designing Virus-Resistant, High-Performance Networks: A Game-Formation Approach | 2019-03-29 | Paper |
| Degree distribution and assortativity in line graphs of complex networks | 2018-11-13 | Paper |
| Evaluation of an analytic, approximate formula for the time-varying SIS prevalence in different networks | 2018-11-13 | Paper |
| Weighted betweenness and algebraic connectivity | 2018-10-16 | Paper |
| Assortativity in complex networks | 2018-10-16 | Paper |
| The impact of the topology on cascading failures in a power grid model | 2018-09-20 | Paper |
| A topological investigation of phase transitions of cascading failures in power grids | 2018-09-20 | Paper |
| Kemeny's constant and the effective graph resistance | 2017-10-10 | Paper |
| Decentralized Protection Strategies Against SIS Epidemics in Networks | 2017-09-21 | Paper |
| Universal mean-field framework for SIS epidemics on networks, based on graph partitioning and the isoperimetric inequality | 2017-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5506767 | 2016-12-16 | Paper |
| Estimating the covariance structure of heterogeneous SIS epidemics on networks | 2016-09-24 | Paper |
| A Lagrange series approach to the spectrum of the Kite | 2016-01-26 | Paper |
| ILIGRA: an efficient inverse line graph algorithm | 2015-12-01 | Paper |
| Performance Analysis of Complex Networks and Systems | 2014-07-21 | Paper |
| Exact Markovian SIR and SIS epidemics on networks and an upper bound for the epidemic threshold | 2014-02-07 | Paper |
| Graph eigenvectors, fundamental weights and centrality metrics for nodes in networks | 2014-01-18 | Paper |
| Decay towards the overall-healthy state in SIS epidemics on networks | 2013-10-15 | Paper |
| Graph Spectra for Complex Networks | 2013-01-21 | Paper |
| Bounds for the spectral radius of a graph when nodes are removed | 2012-05-14 | Paper |
| The \(N\)-intertwined SIS epidemic network model | 2011-12-14 | Paper |
| Effective graph resistance | 2011-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3066830 | 2011-01-12 | Paper |
| Weight of a link in a shortest path tree and the Dedekind Eta function | 2010-11-10 | Paper |
| Graphs with given diameter maximizing the algebraic connectivity | 2010-11-05 | Paper |
| Sampling networks by the union of \(m\) shortest path trees | 2010-05-11 | Paper |
| Performance Analysis of Communications Networks and Systems | 2009-07-31 | Paper |
| Performance Analysis of Communications Networks and Systems | 2009-05-19 | Paper |
| The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights | 2008-09-29 | Paper |
| On lower bounds for the largest eigenvalue of a symmetric matrix | 2008-06-17 | Paper |
| A new type of lower bound for the largest eigenvalue of a symmetric matrix | 2007-10-05 | Paper |
| The weight of the shortest path tree | 2007-05-11 | Paper |
| Performance analysis of the AntNet algorithm | 2007-04-26 | Paper |
| Size and Weight of Shortest Path Trees with Exponential Link Weights | 2007-02-07 | Paper |
| On the mean distance in scale free graphs | 2006-01-17 | Paper |
| Distances in random graphs with finite variance degrees | 2005-08-29 | Paper |
| The flooding time in random graphs | 2004-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428423 | 2003-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422998 | 2003-08-24 | Paper |
| Price-coupled scheduling for differentiated services: Gcµversus GPS | 2003-02-04 | Paper |
| On the covariance of the level sizes in random recursive trees | 2002-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763301 | 2002-06-30 | Paper |
| FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH | 2001-11-22 | Paper |
| The asymptotic behavior of queueing systems: Large deviations theory and dominant pole approximation | 1998-01-22 | Paper |
