| Publication | Date of Publication | Type |
|---|
| Vertex-connectivity for node failure identification in Boolean network tomography | 2024-04-05 | Paper |
Vertex-connectivity for node failure identification in Boolean network tomography
Information Processing Letters | 2024-03-26 | Paper |
Independent Sets in Restricted Line of Sight Networks
Algorithms for Sensor Systems | 2022-12-09 | Paper |
Independent sets in Line of Sight networks
Discrete Applied Mathematics | 2020-09-17 | Paper |
Dynamic programming optimization in line of sight networks
Information and Computation | 2020-01-17 | Paper |
Easy knapsacks and the complexity of energy allocation problems in the smart grid
Optimization Letters | 2018-10-23 | Paper |
Finding large independent sets in line of sight networks
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
An improved upper bound on the non-3-colourability threshold
Information Processing Letters | 2016-06-09 | Paper |
The complexity of the empire colouring problem
Algorithmica | 2014-12-02 | Paper |
The complexity of the empire colouring problem for linear forests
Discrete Mathematics | 2013-12-02 | Paper |
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Large independent sets in random regular graphs
Theoretical Computer Science | 2009-11-06 | Paper |
Martingales on Trees and the Empire Chromatic Number of Random Trees
Fundamentals of Computation Theory | 2009-10-20 | Paper |
An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm
Discrete Applied Mathematics | 2009-06-24 | Paper |
The block connectivity of random trees
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The block connectivity of random trees
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
| scientific article; zbMATH DE number 5504155 (Why is no real title available?) | 2009-02-09 | Paper |
Colouring Random Empire Trees
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Packing vertices and edges in random regular graphs
Random Structures & Algorithms | 2008-01-18 | Paper |
The unsatisfiability threshold revisited
Discrete Applied Mathematics | 2007-08-23 | Paper |
| scientific article; zbMATH DE number 5158519 (Why is no real title available?) | 2007-05-29 | Paper |
Dominating sets of random recursive trees
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Lower Bounds and Algorithms for Dominating Sets in Web Graphs
Internet Mathematics | 2006-06-26 | Paper |
Algorithms and Models for the Web-Graph
Lecture Notes in Computer Science | 2005-08-22 | Paper |
On the approximability of the maximum induced matching problem
Journal of Discrete Algorithms | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2044510 (Why is no real title available?) | 2004-02-18 | Paper |
Small maximal matchings in random graphs.
Theoretical Computer Science | 2003-08-17 | Paper |
On polynomial-time approximation algorithms for the variable length scheduling problem.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1929931 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1875441 (Why is no real title available?) | 2003-03-02 | Paper |
Maximum induced matchings of random cubic graphs
Journal of Computational and Applied Mathematics | 2002-08-22 | Paper |
| scientific article; zbMATH DE number 1696620 (Why is no real title available?) | 2002-07-14 | Paper |
Efficient web searching using temporal factors
Theoretical Computer Science | 2002-03-03 | Paper |
Leafy spanning trees in hypercubes
Applied Mathematics Letters | 2002-01-02 | Paper |
An Upper Bound on the Space Complexity of Random Formulae in Resolution
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
An Upper Bound on the Space Complexity of Random Formulae in Resolution
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
An Upper Bound on the Space Complexity of Random Formulae in Resolution
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
| The unsatisfiability threshold revisited | 2001-09-24 | Paper |
| scientific article; zbMATH DE number 1512672 (Why is no real title available?) | 2001-06-21 | Paper |
A predicative and decidable characterization of the polynomial classes of languages
Theoretical Computer Science | 2000-12-12 | Paper |
Complexity-theoretic models of phase transitions in search problems
Theoretical Computer Science | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1496857 (Why is no real title available?) | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1420901 (Why is no real title available?) | 2000-08-03 | Paper |
Sparse hypercube 3-spanners
Discrete Applied Mathematics | 2000-07-11 | Paper |
On a relation between uniform coding and problems of the form DTIMEF\((\mathcal F)=?\)DSPACEF\((\mathcal F)\)
Acta Informatica | 1999-04-26 | Paper |
| scientific article; zbMATH DE number 871941 (Why is no real title available?) | 1996-04-28 | Paper |
