| Publication | Date of Publication | Type |
|---|
The maximum degree of random planar graphs
| 2019-05-10 | Paper |
On the diameter of random planar graphs
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
On the diameter of random planar graphs
| 2017-02-10 | Paper |
Degree distribution in random planar graphs
| 2017-02-10 | Paper |
Maximum degree in minor-closed classes of graphs
European Journal of Combinatorics | 2016-04-14 | Paper |
The maximum degree of random planar graphs
Proceedings of the London Mathematical Society | 2014-11-18 | Paper |
The maximum degree of random planar graphs
Proceedings of the London Mathematical Society. Third Series | 2014-11-18 | Paper |
The HOM problem is decidable
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
The HOM problem is decidable
| 2014-02-17 | Paper |
Graph classes with given 3-connected components: asymptotic enumeration and random graphs
Random Structures & Algorithms | 2013-07-26 | Paper |
The influence of \(k\)-dependence on the complexity of planning
Artificial Intelligence | 2012-05-23 | Paper |
A linear algorithm for the random sampling from regular languages
Algorithmica | 2012-04-26 | Paper |
The maximum degree of series-parallel graphs
Combinatorics, Probability and Computing | 2011-08-16 | Paper |
Deciding regularity of the set of instances of a set of terms with regular constraints is EXPTIME-complete
SIAM Journal on Computing | 2011-07-29 | Paper |
Degree distribution in random planar graphs
Journal of Combinatorial Theory. Series A | 2011-07-07 | Paper |
Asymptotic enumeration and limit laws for graphs of fixed genus
Journal of Combinatorial Theory. Series A | 2011-04-11 | Paper |
Asymptotic enumeration and limit laws of planar graphs
Journal of the American Mathematical Society | 2011-03-02 | Paper |
Vertices of given degree in series-parallel graphs
Random Structures & Algorithms | 2010-11-10 | Paper |
The maximum degree of planar graphs I. Series-parallel graphs
| 2010-08-31 | Paper |
Causal graphs and structurally restricted planning
Journal of Computer and System Sciences | 2010-08-18 | Paper |
On the number of series parallel and outerplanar graphs
| 2010-07-30 | Paper |
Counting planar graphs and related families of graphs
| 2010-01-13 | Paper |
On-the-Fly Macros
Logic, Language, Information and Computation | 2009-07-02 | Paper |
Asymptotic enumeration of series-parallel graphs
| 2009-05-22 | Paper |
The complexity of planning problems with simple causal graphs
| 2009-04-28 | Paper |
Planning over chain causal graphs for variables with domains of size 5 is NP-hard
| 2009-04-28 | Paper |
The number of graphs not containing \(K_{3,3}\) as a minor
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Graph classes with given 3-connected components: asymptotic counting and critical phenomena
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Enumeration and limit laws for series-parallel graphs
European Journal of Combinatorics | 2007-11-21 | Paper |
Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
Multi-Path Matroids
Combinatorics, Probability and Computing | 2007-07-30 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
The number of planar graphs and properties of random planar graphs
| 2006-08-29 | Paper |
On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
Combinatorics, Probability and Computing | 2006-07-06 | Paper |
On the number of bases of bicircular matroids
Annals of Combinatorics | 2005-04-28 | Paper |
scientific article; zbMATH DE number 2127723 (Why is no real title available?)
| 2005-01-14 | Paper |
