Juanjo Rué

According to our database1, Juanjo Rué authored at least 33 papers between 2007 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


Further results on random cubic planar graphs.
Random Struct. Algorithms, 2020

Structure and enumeration of K4-minor-free links and link-diagrams.
Eur. J. Comb., 2020

On the expected number of perfect matchings in cubic planar graphs.
CoRR, 2020

Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes.
Electron. J. Comb., 2020

On the optimality of the uniform random strategy.
Random Struct. Algorithms, 2019

Memorial to Javier Cilleruelo: A Problem List.
Integers, 2018

Structure and Enumeration of K<sub>4</sub>-minor-free links and link diagrams.
Electron. Notes Discret. Math., 2018

On a problem of Sárközy and Sós for multivariate linear forms.
Electron. Notes Discret. Math., 2018

Corrigendum to "On the limiting distribution of the metric dimension for random forests" [European J. Combin. 49(2015) 68-89].
Eur. J. Comb., 2018

Subgraph statistics in subcritical graph classes.
Random Struct. Algorithms, 2017

Enumeration of labeled 4-regular planar graphs.
Electron. Notes Discret. Math., 2017

Random Strategies are Nearly Optimal for Generalized van der Waerden Games.
Electron. Notes Discret. Math., 2017

Isolated cycles of critical random graphs.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

Random cubic planar graphs revisited.
Electron. Notes Discret. Math., 2016

Spanning trees in random series-parallel graphs.
Adv. Appl. Math., 2016

Counting configuration-free sets in groups.
Electron. Notes Discret. Math., 2015

Triangles in random cubic planar graphs.
Electron. Notes Discret. Math., 2015

On the limiting distribution of the metric dimension for random forests.
Eur. J. Comb., 2015

Many 2-Level Polytopes from Matroids.
Discret. Comput. Geom., 2015

Dynamic programming for graphs on surfaces.
ACM Trans. Algorithms, 2014

Analytic combinatorics of chord and hyperchord diagrams with <i>k</i> crossings.
Adv. Appl. Math., 2014

Graph classes with given 3-connected components: Asymptotic enumeration and random graphs.
Random Struct. Algorithms, 2013

Threshold functions for systems of equations on random sets.
Electron. Notes Discret. Math., 2013

On polynomial representation functions for multivariate linear forms.
Eur. J. Comb., 2013

Asymptotic enumeration of non-crossing partitions on surfaces.
Discret. Math., 2013

Enumerating simplicial decompositions of surfaces with boundaries.
Eur. J. Comb., 2012

Dynamic Programming for H-minor-free Graphs.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Asymptotic Study of Subcritical Graph Classes.
SIAM J. Discret. Math., 2011

A Lower Bound for the Size of a Minkowski Sum of Dilates.
Comb. Probab. Comput., 2011

Enumeration and limit laws of dissections on a cylinder.
Discret. Math., 2010

Outerplanar Obstructions for the Feedback Vertex Set.
Electron. Notes Discret. Math., 2009

Counting polygon dissections in the projective plane.
Adv. Appl. Math., 2008

Graph classes with given 3-connected components: asymptotic counting and critical phenomena.
Electron. Notes Discret. Math., 2007