Marc Noy
Orcid: 0000-0002-2399-1359
According to our database1,
Marc Noy
authored at least 108 papers
between 1995 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Probability of a Condorcet Winner for Large Electorates: An Analytic Combinatorics Approach.
CoRR, May, 2025
2024
2023
Eur. J. Comb., May, 2023
Discret. Math. Theor. Comput. Sci., 2023
2022
Limiting probabilities of first order properties of random sparse graphs and hypergraphs.
Random Struct. Algorithms, 2022
J. Comb. Theory A, 2022
Dagstuhl Reports, 2022
2021
Adv. Appl. Math., 2021
2020
Proceedings of the 31st International Conference on Probabilistic, 2020
2018
Electron. Notes Discret. Math., 2018
Electron. J. Comb., 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017
2016
2015
2014
2013
Graph classes with given 3-connected components: Asymptotic enumeration and random graphs.
Random Struct. Algorithms, 2013
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013
2012
Graphs Comb., 2012
Clusters, generating functions and asymptotics for consecutive patterns in permutations.
Adv. Appl. Math., 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
2011
J. Comb. Theory A, 2011
Electron. Notes Discret. Math., 2011
Electron. Notes Discret. Math., 2011
2010
2009
Discret. Appl. Math., 2009
2008
Electron. J. Comb., 2008
2007
Graph classes with given 3-connected components: asymptotic counting and critical phenomena.
Electron. Notes Discret. Math., 2007
2006
Comb. Probab. Comput., 2006
2005
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005
2004
Comput. Geom., 2004
2003
J. Comb. Theory A, 2003
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice.
Electron. J. Comb., 2003
2002
J. Graph Algorithms Appl., 2002
Diagonally convex directed polyominoes and even trees: a bijection and related issues.
Discret. Math., 2002
2001
J. Comb. Theory B, 2001
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
2000
Comput. Geom., 2000
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
1999
J. Graph Theory, 1999
Comput. Geom., 1999
Proceedings of the Graph Drawing, 7th International Symposium, 1999
1998
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
1997
Counting triangulations of almost-convex polygons.
Ars Comb., 1997
Proceedings of the Graph Drawing, 5th International Symposium, 1997
Planar segment visibility graphs.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997
1996
Comput. Geom., 1996
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
1995
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995