| Publication | Date of Publication | Type |
|---|
| MS-BioGraphs MS1 | 2024-04-03 | Dataset |
| MS-BioGraphs MS | 2023-08-12 | Dataset |
| MS-BioGraphs MSA10 | 2023-08-12 | Dataset |
| MS-BioGraphs MSA50 | 2023-08-12 | Dataset |
| MS-BioGraphs MSA500 | 2023-08-12 | Dataset |
| MS-BioGraphs MS50 | 2023-08-12 | Dataset |
| MS-BioGraphs MSA200 | 2023-08-12 | Dataset |
| MS-BioGraphs MS200 | 2023-08-12 | Dataset |
| Quasifibrations of graphs to find symmetries and reconstruct biological networks | 2022-12-13 | Paper |
| Spectral rank monotonicity on undirected networks | 2022-10-25 | Paper |
| Estimating latent feature-feature interactions in large feature-rich graphs | 2022-03-23 | Paper |
| Quasifibrations of Graphs to Find Symmetries in Biological Networks | 2021-11-12 | Paper |
| Axioms for Centrality | 2021-04-23 | Paper |
| Lower bounds for sense of direction in regular graphs | 2020-12-04 | Paper |
| Universal dynamic synchronous self-stabilization | 2020-12-03 | Paper |
| Kings, Name Days, Lazy Servants and Magic | 2020-08-11 | Paper |
| Theory and Practise of Monotone Minimal Perfect Hashing | 2019-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633891 | 2019-05-06 | Paper |
| A network model characterized by a latent attribute structure with competition | 2018-10-31 | Paper |
| \(E=I+T\): the internal extent formula for compacted tries | 2018-04-10 | Paper |
| Efficient optimally lazy algorithms for minimal-interval semantics | 2016-09-12 | Paper |
| Minimal sense of direction and decision problems for Cayley graphs | 2016-06-09 | Paper |
| Minimal and Monotone Minimal Perfect Hash Functions | 2015-09-16 | Paper |
| Computing anonymously with arbitrary knowledge | 2015-09-11 | Paper |
| Theory and practice of monotone minimal perfect hashing | 2014-04-01 | Paper |
| \(E=I+T\): the internal extent formula for compacted tries | 2013-03-28 | Paper |
| Permuting Web and Social Graphs | 2012-04-18 | Paper |
| Fast Prefix Search in Little Space, with Applications | 2010-09-06 | Paper |
| Pictures from Mongolia. Extracting the top elements from a partially ordered set | 2009-08-06 | Paper |
| Permuting Web Graphs | 2009-02-10 | Paper |
| The number of convex permutominoes | 2008-10-08 | Paper |
| Generic Damping Functions for Propagating Importance in Link-Based Ranking | 2008-08-19 | Paper |
| Traps and Pitfalls of Topic-Biased PageRank | 2008-08-19 | Paper |
| Pictures from Mongolia – Partial Sorting in a Partial World | 2007-11-15 | Paper |
| Graph fibrations, graph isomorphism, and PageRank | 2007-04-10 | Paper |
| Codes for the World Wide Web | 2006-10-12 | Paper |
| Paradoxical Effects in PageRank Incremental Computations | 2006-06-26 | Paper |
| Algorithms and Models for the Web-Graph | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044348 | 2004-08-11 | Paper |
| Lower bounds for weak sense of direction | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436038 | 2003-11-23 | Paper |
| TOWARDS AN IMPLEMENTATION OF THE B–H ALGORITHM FOR RECOGNIZING THE UNKNOT | 2003-03-22 | Paper |
| Coverings that preserve sense of direction | 2002-07-25 | Paper |
| Measuring with jugs | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766878 | 2002-06-25 | Paper |
| Fibrations of graphs | 2002-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4531990 | 2002-05-27 | Paper |
| Universal homogeneous graph-like structures and domains | 2002-01-01 | Paper |
| The Turing closure of an Archimedean field | 2000-08-23 | Paper |
| Complexity of Deciding Sense of Direction | 2000-03-19 | Paper |
| Equality is a jump | 1999-06-21 | Paper |
| \(\delta\)-uniform BSS machines | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874649 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288285 | 1994-04-19 | Paper |
