| Publication | Date of Publication | Type |
|---|
Exact enumeration of satisfiable 2-SAT formulae
Combinatorial Theory | 2023-12-16 | Paper |
Transmitting once to elect a leader on wireless networks
Algorithmica | 2023-09-27 | Paper |
| Transmitting once to elect a leader on wireless networks | 2022-10-13 | Paper |
Cycles of given lengths in unicyclic components in sparse random graphs
Advances in Applied Mathematics | 2021-04-23 | Paper |
Threshold functions for small subgraphs in simple graphs and multigraphs
European Journal of Combinatorics | 2020-06-16 | Paper |
Expected Maximum Block Size in Critical Random Graphs
Combinatorics, Probability and Computing | 2020-03-11 | Paper |
Shifting the phase transition threshold for random graphs using degree set constraints
(available as arXiv preprint) | 2020-02-12 | Paper |
The maximal length of 2-path in random critical graphs
Journal of Applied Mathematics | 2019-11-19 | Paper |
Isolated cycles of critical random graphs
2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
| The MAX-CUT of sparse random graphs | 2019-05-10 | Paper |
The Maximum Block Size of Critical Random Graphs
(available as arXiv preprint) | 2019-04-29 | Paper |
Threshold functions for small subgraphs: an analytic approach
(available as arXiv preprint) | 2018-01-18 | Paper |
Analytic description of the phase transition of inhomogeneous multigraphs
European Journal of Combinatorics | 2015-06-02 | Paper |
On the probability of planarity of a random graph near the critical point
Proceedings of the American Mathematical Society | 2015-02-02 | Paper |
Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Analytic Description of the Phase Transition of Inhomogeneous Multigraphs
(available as arXiv preprint) | 2014-06-11 | Paper |
| The probability of planarity of a random graph near the critical point | 2014-02-18 | Paper |
Birth and growth of multicyclic components in random hypergraphs
Theoretical Computer Science | 2010-11-11 | Paper |
Minimum sum edge colorings of multicycles
Discrete Applied Mathematics | 2010-08-13 | Paper |
Limit Theorems for Random MAX-2-XORSAT
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Another proof of Wright's inequalities
Information Processing Letters | 2010-03-24 | Paper |
Chromatic Edge Strength of Some Multigraphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Random 2-XORSAT at the Satisfiability Threshold
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Creation and Growth of Components in a Random Hypergraph Process
Lecture Notes in Computer Science | 2007-09-10 | Paper |
On the growth of components with non-fixed excesses
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Quasi-optimal energy-efficient leader election algorithms in radio networks
Information and Computation | 2007-05-14 | Paper |
The average size of giant components between the double-jump
Algorithmica | 2007-02-14 | Paper |
Forbidden subgraphs in connected graphs
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 1984539 (Why is no real title available?) | 2003-09-22 | Paper |
On the growth of components with non-fixed excesses
Discrete Applied Mathematics | 2003-09-22 | Paper |
Patchworks and metablocks enumeration
Information Processing Letters | 2002-07-25 | Paper |
| Asymptotic enumeration of cographs | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 1504594 (Why is no real title available?) | 2001-04-26 | Paper |
| scientific article; zbMATH DE number 1512673 (Why is no real title available?) | 2000-10-03 | Paper |
