Marc Noy

According to our database1, Marc Noy authored at least 98 papers between 1995 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

Cut Vertices in Random Planar Maps.
Proceedings of the 31st International Conference on Probabilistic, 2020

2018
Logical limit laws for minor-closed classes of graphs.
J. Comb. Theory, Ser. B, 2018

The first order convergence law fails for random perfect graphs.
Electron. Notes Discret. Math., 2018

On the number of labeled graphs of bounded treewidth.
Eur. J. Comb., 2018

Random Planar Maps and Graphs with Minimum Degree Two and Three.
Electron. J. Comb., 2018

On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed Surface.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

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

Counting Outerplanar Maps.
Electron. J. Comb., 2017

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

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

Maximum degree in minor-closed classes of graphs.
Eur. J. Comb., 2016

2015
On the Diameter of Random Planar Graphs.
Comb. Probab. Comput., 2015

2014
On the number of self-dual rooted maps.
Eur. J. Comb., 2014

Extremal statistics on non-crossing configurations.
Discret. Math., 2014

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

Extremal Parameters in Sub-Critical Graph Classes.
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

2012
Clusters, generating functions and asymptotics for consecutive patterns in permutations.
Adv. Appl. Math., 2012

The maximum degree of random planar graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Bijections for Baxter families and related objects.
J. Comb. Theory, Ser. A, 2011

Degree distribution in random planar graphs.
J. Comb. Theory, Ser. A, 2011

Asymptotic enumeration and limit laws for graphs of fixed genus.
J. Comb. Theory, Ser. A, 2011

The Tutte polynomial characterizes simple outerplanar graphs.
Electron. Notes Discret. Math., 2011

Universal exponents and tail estimates in the enumeration of planar maps.
Electron. Notes Discret. Math., 2011

The Maximum Degree of Series-Parallel Graphs.
Comb. Probab. Comput., 2011

2010
Vertices of given degree in series-parallel graphs.
Random Struct. Algorithms, 2010

Growth constants of minor-closed classes of graphs.
J. Comb. Theory, Ser. B, 2010

Asymptotic enumeration of orientations.
Discret. Math. Theor. Comput. Sci., 2010

Augmenting the Connectivity of Outerplanar Graphs.
Algorithmica, 2010

2009
On the maximum number of cycles in outerplanar and series-parallel graphs.
Electron. Notes Discret. Math., 2009

Partitions of a finite Boolean lattice into intervals.
Eur. J. Comb., 2009

Gray codes for non-crossing partitions and dissections of a convex polygon.
Discret. Appl. Math., 2009

2008
Identities for non-crossing graphs and multigraphs.
Discret. Math., 2008

The Number of Graphs Not Containing K<sub>3, 3</sub> as a Minor.
Electron. J. Comb., 2008

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

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

Enumeration and limit laws for series-parallel graphs.
Eur. J. Comb., 2007

2006
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.
SIAM J. Discret. Math., 2006

Hamiltonicity and colorings of arrangement graphs.
Discret. Appl. Math., 2006

On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids.
Comb. Probab. Comput., 2006

2005
A solution to the tennis ball problem.
Theor. Comput. Sci., 2005

Graphs of Triangulations and Perfect Matchings.
Graphs Comb., 2005

On matroids determined by their Tutte polynomials.
Discret. Math., 2005

Tutte uniqueness of line graphs.
Discret. Math., 2005

On the chromatic number of some geometric type Kneser graphs.
Comput. Geom., 2005

2004
On Graphs Determined by Their Tutte Polynomials.
Graphs Comb., 2004

A lower bound on the number of triangulations of planar point sets.
Comput. Geom., 2004

Visualizing Objects with Mirrors.
Comput. Graph. Forum, 2004

Recursively constructible families of graphs.
Adv. Appl. Math., 2004

Special issue on the Tutte polynomial.
Adv. Appl. Math., 2004

2003
Graphs determined by polynomial invariants.
Theor. Comput. Sci., 2003

Lattice path matroids: enumerative aspects and Tutte polynomials.
J. Comb. Theory, Ser. A, 2003

Simultaneous Edge Flipping in Triangulations.
Int. J. Comput. Geom. Appl., 2003

Foreword.
Discret. Math., 2003

Locally grid graphs: classification and Tutte uniqueness.
Discret. Math., 2003

Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice.
Electron. J. Comb., 2003

Consecutive patterns in permutations.
Adv. Appl. Math., 2003

2002
Packing trees into planar graphs.
J. Graph Theory, 2002

Triangle-Free Planar Graphs and Segment Intersection Graphs.
J. Graph Algorithms Appl., 2002

On the minimum size of visibility graphs.
Inf. Process. Lett., 2002

Graphs of Non-Crossing Perfect Matchings.
Graphs Comb., 2002

Statistics on non-crossing trees.
Discret. Math., 2002

Diagonally convex directed polyominoes and even trees: a bijection and related issues.
Discret. Math., 2002

Foreword.
Discret. Math., 2002

2001
Acyclic and Totally Cyclic Orientations in Planar Graphs.
Am. Math. Mon., 2001

Irreducibility of the Tutte Polynomial of a Connected Matroid.
J. Comb. Theory, Ser. B, 2001

Preface: Volume 10.
Electron. Notes Discret. Math., 2001

On the number of visibility graphs of simple polygons.
Discret. Math., 2001

Separating objects in the plane by wedges and strips.
Discret. Appl. Math., 2001

Foreword.
Discret. Appl. Math., 2001

On the Reflexivity of Point Sets.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

On the number of triangulations every planar point set must have.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
On the chromatic number of tree graphs.
Discret. Math., 2000

Lower bounds on the number of crossing-free subgraphs of K<sub>N</sub>.
Comput. Geom., 2000

Planar segment visibility graphs.
Comput. Geom., 2000

A class of point-sets with few k-sets.
Comput. Geom., 2000

1999
A characterization of <i>P</i><sub>4</sub>-indifference graphs.
J. Graph Theory, 1999

Analytic combinatorics of non-crossing configurations.
Discret. Math., 1999

Flipping Edges in Triangulations.
Discret. Comput. Geom., 1999

Properties of Random Triangulations and Trees.
Discret. Comput. Geom., 1999

Geometric Tree Graphs of Points in Convex Position.
Discret. Appl. Math., 1999

Stabbing Information of a Simple Polygon.
Discret. Appl. Math., 1999

Bipartite Embeddings of Trees in the Plane.
Discret. Appl. Math., 1999

Graph of triangulations of a convex polygon and tree of triangulations.
Comput. Geom., 1999

Triangle-Free Planar Graphs as Segments Intersection Graphs.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998
Enumeration of noncrossing trees on a circle.
Discret. Math., 1998

Point-Sets with few <i>k</i>-Sets.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

Parallel edge flipping.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Separating objects in the plane with wedges and strips.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Geometric tree graphs of points in the plane.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Stage-graph Representations.
Discret. Appl. Math., 1997

Counting triangulations of almost-convex polygons.
Ars Comb., 1997

1996
Ears of triangulations and Catalan numbers.
Discret. Math., 1996

Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon.
Comput. Geom., 1996

The Graph of Triangulations of a Convex Polygon.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
Optimal Shooting: Characterizations and Applications.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Lower bounds for the number noncrossing free subgraphs of K<sub>n</sub>.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995


  Loading...