default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuanjo Rué
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Jaroslav Nesetril, Guillem Perarnau, Juanjo Rué, Oriol Serra:
Preface. Eur. J. Comb. 121: 103834 (2024)- 2023
- [j36]Michael Drmota, Marc Noy, Clément Requilé
, Juanjo Rué:
Random Cubic Planar Maps. Electron. J. Comb. 30(2) (2023) - [j35]Marc Noy, Clément Requilé, Juanjo Rué:
Enumeration of labelled 4-regular planar graphs II: Asymptotics. Eur. J. Comb. 110: 103661 (2023) - 2021
- [j34]Marc Noy, Vonjy Rasendrahasina, Vlady Ravelomanana, Juanjo Rué:
Cycles of given lengths in unicyclic components in sparse random graphs. Adv. Appl. Math. 125: 102162 (2021) - [j33]David Fabian, Juanjo Rué, Christoph Spiegel:
On strong infinite Sidon and Bh sets and random sets of integers. J. Comb. Theory A 182: 105460 (2021) - 2020
- [j32]Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué:
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. Electron. J. Comb. 27(1): 1 (2020) - [j31]Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona:
Structure and enumeration of K4-minor-free links and link-diagrams. Eur. J. Comb. 89: 103147 (2020) - [j30]Marc Noy, Clément Requilé, Juanjo Rué:
Further results on random cubic planar graphs. Random Struct. Algorithms 56(3): 892-924 (2020) - [i3]Marc Noy, Clément Requilé, Juanjo Rué:
On the expected number of perfect matchings in cubic planar graphs. CoRR abs/2005.13821 (2020)
2010 – 2019
- 2019
- [j29]Christopher Kusch, Juanjo Rué, Christoph Spiegel, Tibor Szabó:
On the optimality of the uniform random strategy. Random Struct. Algorithms 55(2): 371-401 (2019) - 2018
- [j28]Dieter Mitsche, Juanjo Rué:
Corrigendum to "On the limiting distribution of the metric dimension for random forests" [European J. Combin. 49(2015) 68-89]. Eur. J. Comb. 67: 275-277 (2018) - [j27]Juanjo Rué, Christoph Spiegel:
On a problem of Sárközy and Sós for multivariate linear forms. Electron. Notes Discret. Math. 68: 101-106 (2018) - [j26]Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona:
Structure and Enumeration of K4-minor-free links and link diagrams. Electron. Notes Discret. Math. 68: 119-124 (2018) - [j25]Pablo Candela, Juanjo Rué, Oriol Serra:
Memorial to Javier Cilleruelo: A Problem List. Integers 18: A28 (2018) - [c4]Michael Drmota, Lander Ramos, Clément Requilé, Juanjo Rué:
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. AofA 2018: 18:1-18:15 - 2017
- [j24]Juanjo Rué, Oriol Serra, Lluís Vena:
Counting configuration-free sets in groups. Eur. J. Comb. 66: 281-307 (2017) - [j23]Christopher Kusch, Juanjo Rué, Christoph Spiegel, Tibor Szabó:
Random Strategies are Nearly Optimal for Generalized van der Waerden Games. Electron. Notes Discret. Math. 61: 789-795 (2017) - [j22]Marc Noy, Clément Requilé, Juanjo Rué:
Enumeration of labeled 4-regular planar graphs. Electron. Notes Discret. Math. 61: 933-939 (2017) - [j21]Michael Drmota, Lander Ramos, Juanjo Rué:
Subgraph statistics in subcritical graph classes. Random Struct. Algorithms 51(4): 631-673 (2017) - [c3]Marc Noy, Vonjy Rasendrahasina, Vlady Ravelomanana, Juanjo Rué:
Isolated cycles of critical random graphs. ANALCO 2017: 46-55 - 2016
- [j20]Julia Ehrenmüller, Juanjo Rué:
Spanning trees in random series-parallel graphs. Adv. Appl. Math. 75: 18-55 (2016) - [j19]Marc Noy, Clément Requilé, Juanjo Rué:
Random cubic planar graphs revisited. Electron. Notes Discret. Math. 54: 211-216 (2016) - 2015
- [j18]Francesco Grande, Juanjo Rué:
Many 2-Level Polytopes from Matroids. Discret. Comput. Geom. 54(4): 954-979 (2015) - [j17]Dieter Mitsche, Juanjo Rué:
On the limiting distribution of the metric dimension for random forests. Eur. J. Comb. 49: 68-89 (2015) - [j16]Clément Requilé, Juanjo Rué:
Triangles in random cubic planar graphs. Electron. Notes Discret. Math. 49: 383-391 (2015) - [j15]Juanjo Rué, Oriol Serra, Lluís Vena:
Counting configuration-free sets in groups. Electron. Notes Discret. Math. 49: 549-557 (2015) - 2014
- [j14]Vincent Pilaud, Juanjo Rué:
Analytic combinatorics of chord and hyperchord diagrams with k crossings. Adv. Appl. Math. 57: 60-100 (2014) - [j13]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic programming for graphs on surfaces. ACM Trans. Algorithms 10(2): 8:1-8:26 (2014) - 2013
- [j12]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Asymptotic enumeration of non-crossing partitions on surfaces. Discret. Math. 313(5): 635-649 (2013) - [j11]Juanjo Rué:
On polynomial representation functions for multivariate linear forms. Eur. J. Comb. 34(8): 1429-1435 (2013) - [j10]Juanjo Rué, Ana Zumalacárregui:
Threshold functions for systems of equations on random sets. Electron. Notes Discret. Math. 43: 113-116 (2013) - [j9]Omer Giménez, Marc Noy, Juan José Rué:
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs. Random Struct. Algorithms 42(4): 438-479 (2013) - 2012
- [j8]Olivier Bernardi, Juanjo Rué:
Enumerating simplicial decompositions of surfaces with boundaries. Eur. J. Comb. 33(3): 302-325 (2012) - [j7]Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos:
Outerplanar obstructions for a feedback vertex set. Eur. J. Comb. 33(5): 948-968 (2012) - [c2]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for H-minor-free Graphs. COCOON 2012: 86-97 - 2011
- [j6]Yahya Ould Hamidoune, Juanjo Rué:
A Lower Bound for the Size of a Minkowski Sum of Dilates. Comb. Probab. Comput. 20(2): 249-256 (2011) - [j5]Michael Drmota, Éric Fusy, Mihyun Kang, Veronika Kraus, Juanjo Rué:
Asymptotic Study of Subcritical Graph Classes. SIAM J. Discret. Math. 25(4): 1615-1651 (2011) - [i2]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Asymptotic Enumeration of Non-crossing Partitions on Surfaces. CoRR abs/1104.2477 (2011) - [i1]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for Graphs on Surfaces. CoRR abs/1104.2486 (2011) - 2010
- [j4]Juanjo Rué:
Enumeration and limit laws of dissections on a cylinder. Discret. Math. 310(19): 2519-2541 (2010) - [c1]Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for Graphs on Surfaces. ICALP (1) 2010: 372-383
2000 – 2009
- 2009
- [j3]Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos:
Outerplanar Obstructions for the Feedback Vertex Set. Electron. Notes Discret. Math. 34: 167-171 (2009) - 2008
- [j2]Marc Noy, Juanjo Rué:
Counting polygon dissections in the projective plane. Adv. Appl. Math. 41(4): 599-619 (2008) - 2007
- [j1]Omer Giménez, Marc Noy, Juan José Rué:
Graph classes with given 3-connected components: asymptotic counting and critical phenomena. Electron. Notes Discret. Math. 29: 521-529 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
