iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.org/pid/23/8045.rss
dblp: Juanjo Rué https://dblp.org/pid/23/8045.html dblp person page RSS feed Mon, 07 Oct 2024 21:22:13 +0200 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Juanjo Ruéhttps://dblp.org/pid/23/8045.html14451 Preface.https://doi.org/10.1016/j.ejc.2023.103834, , , :
Preface. Eur. J. Comb. 121: 103834 ()]]>https://dblp.org/rec/journals/ejc/NesetrilPRS24Mon, 01 Jan 2024 00:00:00 +0100 Random Cubic Planar Maps.https://doi.org/10.37236/11619, , , :
Random Cubic Planar Maps. Electron. J. Comb. 30(2) ()]]>https://dblp.org/rec/journals/combinatorics/DrmotaNRR23Sun, 01 Jan 2023 00:00:00 +0100 Enumeration of labelled 4-regular planar graphs II: Asymptotics.https://doi.org/10.1016/j.ejc.2022.103661, , :
Enumeration of labelled 4-regular planar graphs II: Asymptotics. Eur. J. Comb. 110: 103661 ()]]>https://dblp.org/rec/journals/ejc/NoyRR23Mon, 01 May 2023 01:00:00 +0200 Cycles of given lengths in unicyclic components in sparse random graphs.https://doi.org/10.1016/j.aam.2020.102162, , , :
Cycles of given lengths in unicyclic components in sparse random graphs. Adv. Appl. Math. 125: 102162 ()]]>https://dblp.org/rec/journals/aam/NoyRRR21Fri, 01 Jan 2021 00:00:00 +0100 On strong infinite Sidon and Bh sets and random sets of integers.https://doi.org/10.1016/j.jcta.2021.105460, , :
On strong infinite Sidon and Bh sets and random sets of integers. J. Comb. Theory A 182: 105460 ()]]>https://dblp.org/rec/journals/jcta/FabianRS21Fri, 01 Jan 2021 00:00:00 +0100 Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes.https://doi.org/10.37236/8683, , , :
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. Electron. J. Comb. 27(1): 1 ()]]>https://dblp.org/rec/journals/combinatorics/DrmotaRRR20Wed, 01 Jan 2020 00:00:00 +0100 Structure and enumeration of K4-minor-free links and link-diagrams.https://doi.org/10.1016/j.ejc.2020.103147, , :
Structure and enumeration of K4-minor-free links and link-diagrams. Eur. J. Comb. 89: 103147 ()]]>https://dblp.org/rec/journals/ejc/RueTV20Wed, 01 Jan 2020 00:00:00 +0100 Further results on random cubic planar graphs.https://doi.org/10.1002/rsa.20893, , :
Further results on random cubic planar graphs. Random Struct. Algorithms 56(3): 892-924 ()]]>https://dblp.org/rec/journals/rsa/NoyRR20Wed, 01 Jan 2020 00:00:00 +0100 On the expected number of perfect matchings in cubic planar graphs.https://arxiv.org/abs/2005.13821, , :
On the expected number of perfect matchings in cubic planar graphs. CoRR abs/2005.13821 ()]]>https://dblp.org/rec/journals/corr/abs-2005-13821Wed, 01 Jan 2020 00:00:00 +0100 On the optimality of the uniform random strategy.https://doi.org/10.1002/rsa.20829, , , :
On the optimality of the uniform random strategy. Random Struct. Algorithms 55(2): 371-401 ()]]>https://dblp.org/rec/journals/rsa/KuschRSS19Tue, 01 Jan 2019 00:00:00 +0100 Corrigendum to "On the limiting distribution of the metric dimension for random forests" [European J. Combin. 49(2015) 68-89].https://doi.org/10.1016/j.ejc.2017.07.001, :
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 ()]]>https://dblp.org/rec/journals/ejc/MitscheR18Mon, 01 Jan 2018 00:00:00 +0100 On a problem of Sárközy and Sós for multivariate linear forms.https://doi.org/10.1016/j.endm.2018.06.018, :
On a problem of Sárközy and Sós for multivariate linear forms. Electron. Notes Discret. Math. 68: 101-106 ()]]>https://dblp.org/rec/journals/endm/RueS18Mon, 01 Jan 2018 00:00:00 +0100 Structure and Enumeration of K4-minor-free links and link diagrams.https://doi.org/10.1016/j.endm.2018.06.021, , :
Structure and Enumeration of K4-minor-free links and link diagrams. Electron. Notes Discret. Math. 68: 119-124 ()]]>https://dblp.org/rec/journals/endm/RueTV18Mon, 01 Jan 2018 00:00:00 +0100 Memorial to Javier Cilleruelo: A Problem List.http://math.colgate.edu/~integers/s28/s28.Abstract.html, , :
Memorial to Javier Cilleruelo: A Problem List. Integers 18: A28 ()]]>https://dblp.org/rec/journals/int/CandelaRS18Mon, 01 Jan 2018 00:00:00 +0100 Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes.https://doi.org/10.4230/LIPIcs.AofA.2018.18, , , :
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. AofA : 18:1-18:15]]>https://dblp.org/rec/conf/aofa/DrmotaRRR18Mon, 01 Jan 2018 00:00:00 +0100 Counting configuration-free sets in groups.https://doi.org/10.1016/j.ejc.2017.06.027, , :
Counting configuration-free sets in groups. Eur. J. Comb. 66: 281-307 ()]]>https://dblp.org/rec/journals/ejc/RueSV17Sun, 01 Jan 2017 00:00:00 +0100 Random Strategies are Nearly Optimal for Generalized van der Waerden Games.https://doi.org/10.1016/j.endm.2017.07.037, , , :
Random Strategies are Nearly Optimal for Generalized van der Waerden Games. Electron. Notes Discret. Math. 61: 789-795 ()]]>https://dblp.org/rec/journals/endm/KuschRSS17Sun, 01 Jan 2017 00:00:00 +0100 Enumeration of labeled 4-regular planar graphs.https://doi.org/10.1016/j.endm.2017.07.056, , :
Enumeration of labeled 4-regular planar graphs. Electron. Notes Discret. Math. 61: 933-939 ()]]>https://dblp.org/rec/journals/endm/NoyRR17Sun, 01 Jan 2017 00:00:00 +0100 Subgraph statistics in subcritical graph classes.https://doi.org/10.1002/rsa.20721, , :
Subgraph statistics in subcritical graph classes. Random Struct. Algorithms 51(4): 631-673 ()]]>https://dblp.org/rec/journals/rsa/DrmotaRR17Sun, 01 Jan 2017 00:00:00 +0100 Isolated cycles of critical random graphs.https://doi.org/10.1137/1.9781611974775.4, , , :
Isolated cycles of critical random graphs. ANALCO : 46-55]]>https://dblp.org/rec/conf/analco/NoyRRR17Sun, 01 Jan 2017 00:00:00 +0100 Spanning trees in random series-parallel graphs.https://doi.org/10.1016/j.aam.2015.12.001, :
Spanning trees in random series-parallel graphs. Adv. Appl. Math. 75: 18-55 ()]]>https://dblp.org/rec/journals/aam/EhrenmullerR16Fri, 01 Jan 2016 00:00:00 +0100 Random cubic planar graphs revisited.https://doi.org/10.1016/j.endm.2016.09.037, , :
Random cubic planar graphs revisited. Electron. Notes Discret. Math. 54: 211-216 ()]]>https://dblp.org/rec/journals/endm/NoyRR16Fri, 01 Jan 2016 00:00:00 +0100 Many 2-Level Polytopes from Matroids.https://doi.org/10.1007/s00454-015-9735-5, :
Many 2-Level Polytopes from Matroids. Discret. Comput. Geom. 54(4): 954-979 ()]]>https://dblp.org/rec/journals/dcg/GrandeR15Thu, 01 Jan 2015 00:00:00 +0100 On the limiting distribution of the metric dimension for random forests.https://doi.org/10.1016/j.ejc.2015.02.029, :
On the limiting distribution of the metric dimension for random forests. Eur. J. Comb. 49: 68-89 ()]]>https://dblp.org/rec/journals/ejc/MitscheR15Thu, 01 Jan 2015 00:00:00 +0100 Triangles in random cubic planar graphs.https://doi.org/10.1016/j.endm.2015.06.054, :
Triangles in random cubic planar graphs. Electron. Notes Discret. Math. 49: 383-391 ()]]>https://dblp.org/rec/journals/endm/RequileR15Thu, 01 Jan 2015 00:00:00 +0100 Counting configuration-free sets in groups.https://doi.org/10.1016/j.endm.2015.06.075, , :
Counting configuration-free sets in groups. Electron. Notes Discret. Math. 49: 549-557 ()]]>https://dblp.org/rec/journals/endm/RueSV15Thu, 01 Jan 2015 00:00:00 +0100 Analytic combinatorics of chord and hyperchord diagrams with k crossings.https://doi.org/10.1016/j.aam.2014.04.001, :
Analytic combinatorics of chord and hyperchord diagrams with k crossings. Adv. Appl. Math. 57: 60-100 ()]]>https://dblp.org/rec/journals/aam/PilaudR14Wed, 01 Jan 2014 00:00:00 +0100 Dynamic programming for graphs on surfaces.https://doi.org/10.1145/2556952, , :
Dynamic programming for graphs on surfaces. ACM Trans. Algorithms 10(2): 8:1-8:26 ()]]>https://dblp.org/rec/journals/talg/RueST14Wed, 01 Jan 2014 00:00:00 +0100 Asymptotic enumeration of non-crossing partitions on surfaces.https://doi.org/10.1016/j.disc.2012.12.011, , :
Asymptotic enumeration of non-crossing partitions on surfaces. Discret. Math. 313(5): 635-649 ()]]>https://dblp.org/rec/journals/dm/RueST13Tue, 01 Jan 2013 00:00:00 +0100 On polynomial representation functions for multivariate linear forms.https://doi.org/10.1016/j.ejc.2013.05.017:
On polynomial representation functions for multivariate linear forms. Eur. J. Comb. 34(8): 1429-1435 ()]]>https://dblp.org/rec/journals/ejc/Rue13Tue, 01 Jan 2013 00:00:00 +0100 Threshold functions for systems of equations on random sets.https://doi.org/10.1016/j.endm.2013.07.019, :
Threshold functions for systems of equations on random sets. Electron. Notes Discret. Math. 43: 113-116 ()]]>https://dblp.org/rec/journals/endm/RueZ13Tue, 01 Jan 2013 00:00:00 +0100 Graph classes with given 3-connected components: Asymptotic enumeration and random graphs.https://doi.org/10.1002/rsa.20421, , :
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs. Random Struct. Algorithms 42(4): 438-479 ()]]>https://dblp.org/rec/journals/rsa/GimenezNR13Tue, 01 Jan 2013 00:00:00 +0100 Enumerating simplicial decompositions of surfaces with boundaries.https://doi.org/10.1016/j.ejc.2011.09.010, :
Enumerating simplicial decompositions of surfaces with boundaries. Eur. J. Comb. 33(3): 302-325 ()]]>https://dblp.org/rec/journals/ejc/BernardiR12Sun, 01 Jan 2012 00:00:00 +0100 Outerplanar obstructions for a feedback vertex set.https://doi.org/10.1016/j.ejc.2011.09.018, , :
Outerplanar obstructions for a feedback vertex set. Eur. J. Comb. 33(5): 948-968 ()]]>https://dblp.org/rec/journals/ejc/RueST12Sun, 01 Jan 2012 00:00:00 +0100 Dynamic Programming for H-minor-free Graphs.https://doi.org/10.1007/978-3-642-32241-9_8, , :
Dynamic Programming for H-minor-free Graphs. COCOON : 86-97]]>https://dblp.org/rec/conf/cocoon/RueST12Sun, 01 Jan 2012 00:00:00 +0100 A Lower Bound for the Size of a Minkowski Sum of Dilates.https://doi.org/10.1017/S0963548310000520, :
A Lower Bound for the Size of a Minkowski Sum of Dilates. Comb. Probab. Comput. 20(2): 249-256 ()]]>https://dblp.org/rec/journals/cpc/HamidouneR11Sat, 01 Jan 2011 00:00:00 +0100 Asymptotic Study of Subcritical Graph Classes.https://doi.org/10.1137/100790161, , , , :
Asymptotic Study of Subcritical Graph Classes. SIAM J. Discret. Math. 25(4): 1615-1651 ()]]>https://dblp.org/rec/journals/siamdm/DrmotaFKKR11Sat, 01 Jan 2011 00:00:00 +0100 Asymptotic Enumeration of Non-crossing Partitions on Surfaces.http://arxiv.org/abs/1104.2477, , :
Asymptotic Enumeration of Non-crossing Partitions on Surfaces. CoRR abs/1104.2477 ()]]>https://dblp.org/rec/journals/corr/abs-1104-2477Sat, 01 Jan 2011 00:00:00 +0100 Dynamic Programming for Graphs on Surfaces.http://arxiv.org/abs/1104.2486, , :
Dynamic Programming for Graphs on Surfaces. CoRR abs/1104.2486 ()]]>https://dblp.org/rec/journals/corr/abs-1104-2486Sat, 01 Jan 2011 00:00:00 +0100 Enumeration and limit laws of dissections on a cylinder.https://doi.org/10.1016/j.disc.2010.06.023:
Enumeration and limit laws of dissections on a cylinder. Discret. Math. 310(19): 2519-2541 ()]]>https://dblp.org/rec/journals/dm/Rue10Fri, 01 Jan 2010 00:00:00 +0100 Dynamic Programming for Graphs on Surfaces.https://doi.org/10.1007/978-3-642-14165-2_32, , :
Dynamic Programming for Graphs on Surfaces. ICALP (1) : 372-383]]>https://dblp.org/rec/conf/icalp/RueST10Fri, 01 Jan 2010 00:00:00 +0100 Outerplanar Obstructions for the Feedback Vertex Set.https://doi.org/10.1016/j.endm.2009.07.028, , :
Outerplanar Obstructions for the Feedback Vertex Set. Electron. Notes Discret. Math. 34: 167-171 ()]]>https://dblp.org/rec/journals/endm/RueST09Thu, 01 Jan 2009 00:00:00 +0100 Counting polygon dissections in the projective plane.https://doi.org/10.1016/j.aam.2008.03.003, :
Counting polygon dissections in the projective plane. Adv. Appl. Math. 41(4): 599-619 ()]]>https://dblp.org/rec/journals/aam/NoyR08Tue, 01 Jan 2008 00:00:00 +0100 Graph classes with given 3-connected components: asymptotic counting and critical phenomena.https://doi.org/10.1016/j.endm.2007.07.080, , :
Graph classes with given 3-connected components: asymptotic counting and critical phenomena. Electron. Notes Discret. Math. 29: 521-529 ()]]>https://dblp.org/rec/journals/endm/GimenezNR07Mon, 01 Jan 2007 00:00:00 +0100