Louigi Addario-Berry

According to our database1, Louigi Addario-Berry authored at least 32 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Corrigendum to "Bisimplicial vertices in even-hole-free graphs".
J. Comb. Theory, Ser. B, 2020

Diameter and Stationary Distribution of Random $r$-Out Digraphs.
Electron. J. Comb., 2020

2019
Hipster random walks.
CoRR, 2019

2018
High degrees in random recursive trees.
Random Struct. Algorithms, 2018

The algorithmic hardness threshold for continuous random energy models.
CoRR, 2018

Voronoi tessellations in the CRT and continuum random maps of finite excess.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Assumptionless Bounds for Random Trees (Keynote Speakers).
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Local optima of the Sherrington-Kirkpatrick Hamiltonian.
CoRR, 2017

2015
Exceptional rotations of random graphs: a VC theory.
J. Mach. Learn. Res., 2015

High degrees in recursive trees.
Electron. Notes Discret. Math., 2015

2014
On the Spread of Random Graphs.
Comb. Probab. Comput., 2014

Hitting Time Theorems for Random Matrices.
Comb. Probab. Comput., 2014

2013
Oriented trees in digraphs.
Discret. Math., 2013

2012
Tail bounds for the height and width of a random tree with a given degree sequence.
Random Struct. Algorithms, 2012

Connectivity for Bridge-Addable Monotone Graph Classes.
Comb. Probab. Comput., 2012

The mixing time of the Newman: Watts small world.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Subgraphs of 4-Regular Planar Graphs.
Algorithmica, 2011

2010
Acyclic dominating partitions.
J. Graph Theory, 2010

Acyclic improper colourings of graphs with bounded maximum degree.
Discret. Math., 2010

Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph.
Discret. Appl. Math., 2010

The Longest Minimum-Weight Path in a Complete Graph.
Comb. Probab. Comput., 2010

2009
Critical random graphs and the structure of a minimum spanning tree.
Random Struct. Algorithms, 2009

2008
Bisimplicial vertices in even-hole-free graphs.
J. Comb. Theory, Ser. B, 2008

Guarding Art Galleries: The Extra Cost for Sculptures Is Linear.
Proceedings of the Algorithm Theory, 2008

2007
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games.
J. Graph Algorithms Appl., 2007

Paths with two blocks in n-chromatic digraphs.
J. Comb. Theory, Ser. B, 2007

Acyclic dominating partitions.
Electron. Notes Discret. Math., 2007

Vertex-Colouring Edge-Weightings.
Comb., 2007

2005
Vertex colouring edge partitions.
J. Comb. Theory, Ser. B, 2005

Degree constrained subgraphs.
Electron. Notes Discret. Math., 2005

2004
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
J. Bioinform. Comput. Biol., 2004

2003
Towards Identifying Lateral Gene Transfer Events.
Proceedings of the 8th Pacific Symposium on Biocomputing, 2003


  Loading...