| Publication | Date of Publication | Type |
|---|
| Vertex-connectivity for node failure identification in Boolean network tomography | 2024-03-26 | Paper |
| Independent Sets in Restricted Line of Sight Networks | 2022-12-09 | Paper |
| Independent sets in Line of Sight networks | 2020-09-17 | Paper |
| Dynamic programming optimization in line of sight networks | 2020-01-17 | Paper |
| Easy knapsacks and the complexity of energy allocation problems in the smart grid | 2018-10-23 | Paper |
| Finding Large Independent Sets in Line of Sight Networks | 2017-04-07 | Paper |
| An improved upper bound on the non-3-colourability threshold | 2016-06-09 | Paper |
| The complexity of the empire colouring problem | 2014-12-02 | Paper |
| The complexity of the empire colouring problem for linear forests | 2013-12-02 | Paper |
| Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem | 2011-12-16 | Paper |
| Large independent sets in random regular graphs | 2009-11-06 | Paper |
| Martingales on Trees and the Empire Chromatic Number of Random Trees | 2009-10-20 | Paper |
| An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm | 2009-06-24 | Paper |
| The block connectivity of random trees | 2009-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597153 | 2009-02-09 | Paper |
| Colouring Random Empire Trees | 2009-02-03 | Paper |
| Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs | 2008-09-17 | Paper |
| Packing vertices and edges in random regular graphs | 2008-01-18 | Paper |
| The unsatisfiability threshold revisited | 2007-08-23 | Paper |
| Dominating sets of random recursive trees | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439700 | 2007-05-29 | Paper |
| A PTAS for the sparsest 2-spanner of 4-connected planar triangulations | 2007-04-26 | Paper |
| Lower Bounds and Algorithms for Dominating Sets in Web Graphs | 2006-06-26 | Paper |
| Algorithms and Models for the Web-Graph | 2005-08-22 | Paper |
| On the approximability of the maximum induced matching problem | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448374 | 2004-02-18 | Paper |
| Small maximal matchings in random graphs. | 2003-08-17 | Paper |
| On polynomial-time approximation algorithms for the variable length scheduling problem. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708563 | 2003-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796200 | 2003-03-02 | Paper |
| Maximum induced matchings of random cubic graphs | 2002-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766812 | 2002-07-14 | Paper |
| Efficient web searching using temporal factors | 2002-03-03 | Paper |
| Leafy spanning trees in hypercubes | 2002-01-02 | Paper |
| An Upper Bound on the Space Complexity of Random Formulae in Resolution | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741515 | 2001-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508359 | 2001-06-21 | Paper |
| A predicative and decidable characterization of the polynomial classes of languages | 2000-12-12 | Paper |
| Complexity-theoretic models of phase transitions in search problems | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500845 | 2000-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944970 | 2000-08-03 | Paper |
| Sparse hypercube 3-spanners | 2000-07-11 | Paper |
| On a relation between uniform coding and problems of the form DTIMEF\((\mathcal F)=?\)DSPACEF\((\mathcal F)\) | 1999-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875216 | 1996-04-28 | Paper |
