Probability of a Condorcet Winner for Large Electorates: An Analytic Combinatorics Approach - Emma Caizergues; François Durand; Marc Noy; Élie de Panafieu; Vlady Ravelomanana (CoRR, 2025)

Chordal graphs with bounded tree-width - Jordi Castellví; Michael Drmota; Marc Noy; Clément Requilé (Adv. Appl. Math., 2024)

Random Cubic Planar Maps - Michael Drmota; Marc Noy; Clément Requilé; Juanjo Rué (Electron. J. Comb., 2023)

Cut Vertices in Random Planar Maps - Michael Drmota; Marc Noy; Benedikt Stufler (Electron. J. Comb., 2023)

Enumeration of chordal planar graphs and maps - Jordi Castellví; Marc Noy; Clément Requilé (Discret. Math., 2023)

A logical limit law for 231-avoiding permutations - Michael Albert; Mathilde Bouvel; Valentin Féray; Marc Noy (Discret. Math. Theor. Comput. Sci., 2023)

Enumeration of labelled 4-regular planar graphs II: Asymptotics - Marc Noy; Clément Requilé; Juanjo Rué (Eur. J. Comb., 2023)

Universal singular exponents in catalytic variable equations - Michael Drmota; Marc Noy; Guan-Ru Yu (J. Comb. Theory A, 2022)

Limiting probabilities of first order properties of random sparse graphs and hypergraphs - Lázaro Alberto Larrauri; Tobias Müller; Marc Noy (Random Struct. Algorithms, 2022)

Enumeration of chordal planar graphs and maps - Jordi Castellví; Marc Noy; Clément Requilé (CoRR, 2022)

Logic and Random Discrete Structures (Dagstuhl Seminar 22061) - Erich Grädel; Phokion G. Kolaitis; Marc Noy (Dagstuhl Reports, 2022)

Cycles of given lengths in unicyclic components in sparse random graphs - Marc Noy; Vonjy Rasendrahasina; Vlady Ravelomanana; Juanjo Rué (Adv. Appl. Math., 2021)

Further results on random cubic planar graphs - Marc Noy; Clément Requilé; Juanjo Rué (Random Struct. Algorithms, 2020)

Cut Vertices in Random Planar Maps - Michael Drmota; Marc Noy; Benedikt Stufler (31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2020, June 15-19, 2020, Klagenfurt, Austria (Virtual Conference), 2020)

On the expected number of perfect matchings in cubic planar graphs - Marc Noy; Clément Requilé; Juanjo Rué (CoRR, 2020)

Random Planar Maps and Graphs with Minimum Degree Two and Three - Marc Noy; Lander Ramos (Electron. J. Comb., 2018)

On the number of labeled graphs of bounded treewidth - Julien Baste; Marc Noy; Ignasi Sau (Eur. J. Comb., 2018)

The first order convergence law fails for random perfect graphs - Tobias Müller; Marc Noy (Electron. Notes Discret. Math., 2018)

Logical limit laws for minor-closed classes of graphs - Peter Heinig; Tobias Müller; Marc Noy; Anusch Taraz (J. Comb. Theory B, 2018)

The first order convergence law fails for random perfect graphs - Tobias Müller; Marc Noy (Random Struct. Algorithms, 2018)

On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface - Albert Atserias; Stephan Kreutzer; Marc Noy (45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, 2018)

Counting Outerplanar Maps - Ivan Geffner; Marc Noy (Electron. J. Comb., 2017)

Enumeration of labeled 4-regular planar graphs - Marc Noy; Clément Requilé; Juanjo Rué (Electron. Notes Discret. Math., 2017)

Isolated cycles of critical random graphs - Marc Noy; Vonjy Rasendrahasina; Vlady Ravelomanana; Juanjo Rué (Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017, 2017)

On the Number of Labeled Graphs of Bounded Treewidth - Julien Baste; Marc Noy; Ignasi Sau (Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, 2017)

Maximum degree in minor-closed classes of graphs - Omer Giménez; Dieter Mitsche; Marc Noy (Eur. J. Comb., 2016)

Random cubic planar graphs revisited - Marc Noy; Clément Requilé; Juanjo Rué (Electron. Notes Discret. Math., 2016)

The number of labeled graphs of bounded treewidth - Julien Baste; Marc Noy; Ignasi Sau (CoRR, 2016)

On the Diameter of Random Planar Graphs - Guillaume Chapuy; Éric Fusy; Omer Giménez; Marc Noy (Comb. Probab. Comput., 2015)

Extremal statistics on non-crossing configurations - Michael Drmota; Anna de Mier; Marc Noy (Discret. Math., 2014)

On the number of self-dual rooted maps - Sergey Kitaev; Anna de Mier; Marc Noy (Eur. J. Comb., 2014)

Graph classes with given 3-connected components: Asymptotic enumeration and random graphs - Omer Giménez; Marc Noy; Juan José Rué (Random Struct. Algorithms, 2013)

Extremal Parameters in Sub-Critical Graph Classes - Michael Drmota; Marc Noy (Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013, 2013)

Clusters, generating functions and asymptotics for consecutive patterns in permutations - Sergi Elizalde; Marc Noy (Adv. Appl. Math., 2012)

On the Maximum Number of Cycles in Outerplanar and Series-Parallel Graphs - Anna de Mier; Marc Noy (Graphs Comb., 2012)

The maximum degree of random planar graphs - Michael Drmota; Omer Giménez; Marc Noy; Konstantinos Panagiotou; Angelika Steger (Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012, 2012)

The Maximum Degree of Series-Parallel Graphs - Michael Drmota; Omer Giménez; Marc Noy (Comb. Probab. Comput., 2011)

The Tutte Polynomial Characterizes Simple Outerplanar Graphs - Andrew J. Goodall; Anna de Mier; Steven D. Noble; Marc Noy (Comb. Probab. Comput., 2011)

Universal exponents and tail estimates in the enumeration of planar maps - Michael Drmota; Marc Noy (Electron. Notes Discret. Math., 2011)

The Tutte polynomial characterizes simple outerplanar graphs - Andrew J. Goodall; Anna de Mier; Steven D. Noble; Marc Noy (Electron. Notes Discret. Math., 2011)

Asymptotic enumeration and limit laws for graphs of fixed genus - Guillaume Chapuy; Éric Fusy; Omer Giménez; Bojan Mohar; Marc Noy (J. Comb. Theory A, 2011)

Bijections for Baxter families and related objects - Stefan Felsner; Éric Fusy; Marc Noy; David Orden (J. Comb. Theory A, 2011)

Degree distribution in random planar graphs - Michael Drmota; Omer Giménez; Marc Noy (J. Comb. Theory A, 2011)

Augmenting the Connectivity of Outerplanar Graphs - Alfredo García Olaverri; Ferran Hurtado; Marc Noy; Javier Tejel (Algorithmica, 2010)

Asymptotic enumeration of orientations - Stefan Felsner; Éric Fusy; Marc Noy (Discret. Math. Theor. Comput. Sci., 2010)

Growth constants of minor-closed classes of graphs - Olivier Bernardi; Marc Noy; Dominic Welsh (J. Comb. Theory B, 2010)

Vertices of given degree in series-parallel graphs - Michael Drmota; Omer Giménez; Marc Noy (Random Struct. Algorithms, 2010)

Gray codes for non-crossing partitions and dissections of a convex polygon - Clemens Huemer; Ferran Hurtado; Marc Noy; Elsa Omaña-Pulido (Discret. Appl. Math., 2009)

Partitions of a finite Boolean lattice into intervals - Josep M. Brunat; António Guedes de Oliveira; Marc Noy (Eur. J. Comb., 2009)

On the maximum number of cycles in outerplanar and series-parallel graphs - Anna de Mier; Marc Noy (Electron. Notes Discret. Math., 2009)

Counting polygon dissections in the projective plane - Marc Noy; Juanjo Rué (Adv. Appl. Math., 2008)

The Number of Graphs Not Containing K\(_3, 3\) as a Minor - Stefanie Gerke; Omer Giménez; Marc Noy; Andreas Weißl (Electron. J. Comb., 2008)

Identities for non-crossing graphs and multigraphs - Rubén Albiol; Marc Noy (Discret. Math., 2008)

Enumeration and limit laws for series-parallel graphs - Manuel Bodirsky; Omer Giménez; Mihyun Kang; Marc Noy (Eur. J. Comb., 2007)

Graph classes with given 3-connected components: asymptotic counting and critical phenomena - Omer Giménez; Marc Noy; Juan José Rué (Electron. Notes Discret. Math., 2007)

On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids - Omer Giménez; Marc Noy (Comb. Probab. Comput., 2006)

Hamiltonicity and colorings of arrangement graphs - Stefan Felsner; Ferran Hurtado; Marc Noy; Ileana Streinu (Discret. Appl. Math., 2006)

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width - Omer Giménez; Petr Hlinený; Marc Noy (SIAM J. Discret. Math., 2006)

On the chromatic number of some geometric type Kneser graphs - Gabriela Araujo; Adrian Dumitrescu; Ferran Hurtado; Marc Noy; Jorge Urrutia (Comput. Geom., 2005)

Tutte uniqueness of line graphs - Anna de Mier; Marc Noy (Discret. Math., 2005)

On matroids determined by their Tutte polynomials - Anna de Mier; Marc Noy (Discret. Math., 2005)

Graphs of Triangulations and Perfect Matchings - Michael E. Houle; Ferran Hurtado; Marc Noy; Eduardo Rivera-Campo (Graphs Comb., 2005)

A solution to the tennis ball problem - Anna de Mier; Marc Noy (Theor. Comput. Sci., 2005)

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width - Omer Giménez; Petr Hlinený; Marc Noy (Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, 2005)

Special issue on the Tutte polynomial - Joseph P. S. Kung; Marc Noy; Dominic Welsh (Adv. Appl. Math., 2004)

Recursively constructible families of graphs - Marc Noy; Ares Ribó (Adv. Appl. Math., 2004)

Visualizing Objects with Mirrors - Ferran Hurtado; Marc Noy; J.-M. Robert; Vera Sacristán; Steven Skiena (Comput. Graph. Forum, 2004)

A lower bound on the number of triangulations of planar point sets - Oswin Aichholzer; Ferran Hurtado; Marc Noy (Comput. Geom., 2004)

On Graphs Determined by Their Tutte Polynomials - Anna de Mier; Marc Noy (Graphs Comb., 2004)

Consecutive patterns in permutations - Sergi Elizalde; Marc Noy (Adv. Appl. Math., 2003)

Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice - Neil J. Calkin; Criel Merino; Steven D. Noble; Marc Noy (Electron. J. Comb., 2003)

Locally grid graphs: classification and Tutte uniqueness - Alberto Márquez; Anna de Mier; Marc Noy; Maria Pastora Revuelta Marchena (Discret. Math., 2003)

Foreword - Jaroslav Nesetril; Marc Noy; Oriol Serra (Discret. Math., 2003)

Simultaneous Edge Flipping in Triangulations - Jérôme Galtier; Ferran Hurtado; Marc Noy; Stephane Perennes; Jorge Urrutia (Int. J. Comput. Geom. Appl., 2003)

Lattice path matroids: enumerative aspects and Tutte polynomials - Joseph E. Bonin; Anna de Mier; Marc Noy (J. Comb. Theory A, 2003)

Graphs determined by polynomial invariants - Marc Noy (Theor. Comput. Sci., 2003)

Foreword - Robert Cori; Marc Noy (Discret. Math., 2002)

Statistics on non-crossing trees - Emeric Deutsch; Marc Noy (Discret. Math., 2002)

Diagonally convex directed polyominoes and even trees: a bijection and related issues - Emeric Deutsch; Svjetlan Feretic; Marc Noy (Discret. Math., 2002)

Graphs of Non-Crossing Perfect Matchings - M. Carmen Hernando; Ferran Hurtado; Marc Noy (Graphs Comb., 2002)

On the minimum size of visibility graphs - Alfredo García Olaverri; Ferran Hurtado; Marc Noy; Javier Tejel (Inf. Process. Lett., 2002)

Triangle-Free Planar Graphs and Segment Intersection Graphs - Natalia de Castro; Francisco Javier Cobos; Juan Carlos Dana; Alberto Márquez; Marc Noy (J. Graph Algorithms Appl., 2002)

Packing trees into planar graphs - Alfredo García Olaverri; M. Carmen Hernando; Ferran Hurtado; Marc Noy; Javier Tejel (J. Graph Theory, 2002)

On the Reflexivity of Point Sets - Esther M. Arkin; Sándor P. Fekete; Ferran Hurtado; Joseph S. B. Mitchell; Marc Noy; Vera Sacristán; Saurabh Sethia (CoRR, 2002)

Foreword - Ferran Hurtado; Joseph S. B. Mitchell; Marc Noy (Discret. Appl. Math., 2001)

Separating objects in the plane by wedges and strips - Ferran Hurtado; Marc Noy; Pedro A. Ramos; Carlos Seara (Discret. Appl. Math., 2001)

On the number of visibility graphs of simple polygons - Ferran Hurtado; Marc Noy (Discret. Math., 2001)

Preface: Volume 10 - Jaroslav Nesetril; Marc Noy; Oriol Serra (Electron. Notes Discret. Math., 2001)

Irreducibility of the Tutte Polynomial of a Connected Matroid - Criel Merino; Anna de Mier; Marc Noy (J. Comb. Theory B, 2001)

Acyclic and Totally Cyclic Orientations in Planar Graphs - Marc Noy (Am. Math. Mon., 2001)

On the number of triangulations every planar point set must have - Oswin Aichholzer; Ferran Hurtado; Marc Noy (Proceedings of the 13th Canadian Conference on Computational Geometry, University of Waterloo, Ontario, Canada, August 13-15, 2001, 2001)

On the Reflexivity of Point Sets - Esther M. Arkin; Sándor P. Fekete; Ferran Hurtado; Joseph S. B. Mitchell; Marc Noy; Vera Sacristán; Saurabh Sethia (Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, 2001)

A class of point-sets with few k-sets - Helmut Alt; Stefan Felsner; Ferran Hurtado; Marc Noy; Emo Welzl (Comput. Geom., 2000)

Lower bounds on the number of crossing-free subgraphs of K\(_N\) - Alfredo García Olaverri; Marc Noy; Javier Tejel (Comput. Geom., 2000)

Planar segment visibility graphs - Hazel Everett; Chính T. Hoàng; Kyriakos Kilakos; Marc Noy (Comput. Geom., 2000)

On the chromatic number of tree graphs - Vladimir Estivill-Castro; Marc Noy; Jorge Urrutia (Discret. Math., 2000)

Hamiltonicity and colorings of arrangement graphs - Stefan Felsner; Ferran Hurtado; Marc Noy; Ileana Streinu (Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA, 2000)

Graph of triangulations of a convex polygon and tree of triangulations - Ferran Hurtado; Marc Noy (Comput. Geom., 1999)

Stabbing Information of a Simple Polygon - Hazel Everett; Ferran Hurtado; Marc Noy (Discret. Appl. Math., 1999)

Geometric Tree Graphs of Points in Convex Position - M. Carmen Hernando; Ferran Hurtado; Alberto Márquez; Mercè Mora; Marc Noy (Discret. Appl. Math., 1999)

Bipartite Embeddings of Trees in the Plane - Manuel Abellanas; Jesus Garcia-Lopez; Gregorio Hernández-Peñalver; Marc Noy; Pedro A. Ramos (Discret. Appl. Math., 1999)

Properties of Random Triangulations and Trees - Luc Devroye; Philippe Flajolet; Ferran Hurtado; Marc Noy; William L. Steiger (Discret. Comput. Geom., 1999)

Flipping Edges in Triangulations - Ferran Hurtado; Marc Noy; Jorge Urrutia (Discret. Comput. Geom., 1999)

Analytic combinatorics of non-crossing configurations - Philippe Flajolet; Marc Noy (Discret. Math., 1999)

A characterization of P\(_4\)-indifference graphs - Chính T. Hoàng; Frédéric Maffray; Marc Noy (J. Graph Theory, 1999)

Triangle-Free Planar Graphs as Segments Intersection Graphs - Natalia de Castro; Francisco Javier Cobos; Juan Carlos Dana; Alberto Márquez; Marc Noy (Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, 1999)

Enumeration of noncrossing trees on a circle - Marc Noy (Discret. Math., 1998)

Geometric tree graphs of points in the plane - M. Carmen Hernando; Ferran Hurtado; Alberto Márquez; Mercè Mora; Marc Noy (Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montréal, Québec, Canada, August 10-12, 1998, 1998)

Separating objects in the plane with wedges and strips - Ferran Hurtado; Marc Noy; Pedro A. Ramos; Carlos Seara (Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montréal, Québec, Canada, August 10-12, 1998, 1998)

Parallel edge flipping - Ferran Hurtado; Marc Noy; Jorge Urrutia (Proceedings of the 10th Canadian Conference on Computational Geometry, McGill University, Montréal, Québec, Canada, August 10-12, 1998, 1998)

Point-Sets with few k-Sets - Helmut Alt; Stefan Felsner; Ferran Hurtado; Marc Noy (Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 7-10, 1998, 1998)

Counting triangulations of almost-convex polygons - Ferran Hurtado; Marc Noy (Ars Comb., 1997)

Stage-graph Representations - Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Marc Noy; Jörg-Rüdiger Sack; Jorge Urrutia (Discret. Appl. Math., 1997)

Planar segment visibility graphs - Hazel Everett; Chính T. Hoàng; Kyriakos Kilakos; Marc Noy (Proceedings of the 9th Canadian Conference on Computational Geometry, Kingston, Ontario, Canada, August 11-14, 1997, 1997)

Packing Trees into Planar Graphs - Alfredo García Olaverri; M. Carmen Hernando; Ferran Hurtado; Marc Noy; Javier Tejel (Graph Drawing, 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997, Proceedings, 1997)

Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon - Ferran Hurtado; Marc Noy (Comput. Geom., 1996)

Ears of triangulations and Catalan numbers - Ferran Hurtado; Marc Noy (Discret. Math., 1996)

Stabbing Information of a Simple Polygon - Hazel Everett; Ferran Hurtado; Marc Noy (Proceedings of the 8th Canadian Conference on Computational Geometry, Carleton University, Ottawa, Canada, August 12-15, 1996, 1996)

Flipping Edges in Triangulations - Ferran Hurtado; Marc Noy; Jorge Urrutia (Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996, 1996)

The Graph of Triangulations of a Convex Polygon - Ferran Hurtado; Marc Noy (Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996, 1996)

Bipartite Embeddings of Trees in the Plane - Manuel Abellanas; Jesus Garcia-Lopez; Gregorio Hernández-Peñalver; Marc Noy; Pedro A. Ramos (Graph Drawing, Symposium on Graph Drawing, GD '96, Berkeley, California, USA, September 18-20, Proceedings, 1996)

Lower bounds for the number noncrossing free subgraphs of K\(_n\) - Alfredo García Olaverri; Marc Noy; Javier Tejel (Proceedings of the 7th Canadian Conference on Computational Geometry, Quebec City, Quebec, Canada, August 1995, 1995)

Optimal Shooting: Characterizations and Applications - Frank Bauernöppel; Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Marc Noy; Jörg-Rüdiger Sack; Jorge Urrutia (Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings, 1995)