default search action
Louigi Addario-Berry
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Louigi Addario-Berry, Pat Morin
, Ralph Neininger:
Patricia's Bad Distributions. AofA 2024: 25:1-25:8 - [i7]Louigi Addario-Berry, Anna M. Brandenberger, Simon Briend, Nicolas Broutin, Gábor Lugosi:
Leaf Stripping on Uniform Attachment Trees. CoRR abs/2410.06481 (2024) - 2022
- [i6]Louigi Addario-Berry, Erin Beckman, Jessica Lin:
Symmetric cooperative motion in one dimension. CoRR abs/2204.03689 (2022) - 2021
- [j26]Louigi Addario-Berry, Shankar Bhamidi
A probabilistic approach to the leader problem in random graphs. Random Struct. Algorithms 58(1): 34-67 (2021) - [i5]Louigi Addario-Berry, Erin Beckman, Jessica Lin:
Cooperative motion in one dimension. CoRR abs/2104.03369 (2021) - 2020
- [j25]Louigi Addario-Berry, Borja Balle, Guillem Perarnau:
Diameter and Stationary Distribution of Random $r$-Out Digraphs. Electron. J. Comb. 27(3): 3 (2020) - [j24]Louigi Addario-Berry, Maria Chudnovsky
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". J. Comb. Theory B 142: 374-375 (2020)
2010 – 2019
- 2019
- [i4]Louigi Addario-Berry, Hannah Cairns, Luc Devroye, Celine Kerriou, Rivka Mitchell:
Hipster random walks. CoRR abs/1909.07367 (2019) - 2018
- [j23]Louigi Addario-Berry, Laura Eslava
High degrees in random recursive trees. Random Struct. Algorithms 52(4): 560-575 (2018) - [c6]Louigi Addario-Berry:
Assumptionless Bounds for Random Trees (Keynote Speakers). AofA 2018: 2:1-2:1 - [c5]Louigi Addario-Berry, Omer Angel
Voronoi tessellations in the CRT and continuum random maps of finite excess. SODA 2018: 933-946 - [i3]Louigi Addario-Berry, Pascal Maillard:
The algorithmic hardness threshold for continuous random energy models. CoRR abs/1810.05129 (2018) - 2017
- [i2]Louigi Addario-Berry, Luc Devroye, Gábor Lugosi, Roberto Imbuzeiro Oliveira:
Local optima of the Sherrington-Kirkpatrick Hamiltonian. CoRR abs/1712.07775 (2017) - 2015
- [j22]Laura Eslava
High degrees in recursive trees. Electron. Notes Discret. Math. 50: 451-456 (2015) - [j21]Louigi Addario-Berry, Shankar Bhamidi, Sébastien Bubeck, Luc Devroye, Gábor Lugosi, Roberto Imbuzeiro Oliveira:
Exceptional rotations of random graphs: a VC theory. J. Mach. Learn. Res. 16: 1893-1922 (2015) - [i1]Louigi Addario-Berry, Borja Balle, Guillem Perarnau:
Diameter and Stationary Distribution of Random $r$-out Digraphs. CoRR abs/1504.06840 (2015) - 2014
- [j20]Louigi Addario-Berry, Svante Janson, Colin McDiarmid:
On the Spread of Random Graphs. Comb. Probab. Comput. 23(4): 477-504 (2014) - [j19]Louigi Addario-Berry, Laura Eslava
Hitting Time Theorems for Random Matrices. Comb. Probab. Comput. 23(5): 635-669 (2014) - 2013
- [j18]Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales
Oriented trees in digraphs. Discret. Math. 313(8): 967-974 (2013) - 2012
- [j17]Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed:
Connectivity for Bridge-Addable Monotone Graph Classes. Comb. Probab. Comput. 21(6): 803-815 (2012) - [j16]Louigi Addario-Berry:
Tail bounds for the height and width of a random tree with a given degree sequence. Random Struct. Algorithms 41(2): 253-261 (2012) - [c4]Louigi Addario-Berry, Tao Lei:
The mixing time of the Newman: Watts small world. SODA 2012: 1661-1668 - 2011
- [j15]Chris Dowden, Louigi Addario-Berry:
Subgraphs of 4-Regular Planar Graphs. Algorithmica 61(3): 758-776 (2011) - 2010
- [j14]Louigi Addario-Berry, Nicolas Broutin, Gábor Lugosi
The Longest Minimum-Weight Path in a Complete Graph. Comb. Probab. Comput. 19(1): 1-19 (2010) - [j13]Louigi Addario-Berry, W. Sean Kennedy, Andrew D. King, Zhentao Li, Bruce A. Reed:
Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discret. Appl. Math. 158(7): 765-770 (2010) - [j12]Louigi Addario-Berry, Louis Esperet
Acyclic improper colourings of graphs with bounded maximum degree. Discret. Math. 310(2): 223-229 (2010) - [j11]Louigi Addario-Berry, Ross J. Kang
Acyclic dominating partitions. J. Graph Theory 64(4): 292-311 (2010)
2000 – 2009
- 2009
- [j10]Louigi Addario-Berry, Nicolas Broutin, Bruce A. Reed:
Critical random graphs and the structure of a minimum spanning tree. Random Struct. Algorithms 35(3): 323-347 (2009) - 2008
- [j9]Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed:
Degree constrained subgraphs. Discret. Appl. Math. 156(7): 1168-1174 (2008) - [j8]Louigi Addario-Berry, Maria Chudnovsky
Bisimplicial vertices in even-hole-free graphs. J. Comb. Theory B 98(6): 1119-1164 (2008) - [c3]Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. SWAT 2008: 41-52 - 2007
- [j7]Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason:
Vertex-Colouring Edge-Weightings. Comb. 27(1): 1-12 (2007) - [j6]Louigi Addario-Berry, Ross J. Kang:
Acyclic dominating partitions. Electron. Notes Discret. Math. 29: 419-425 (2007) - [j5]Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé
Paths with two blocks in n-chromatic digraphs. J. Comb. Theory B 97(4): 620-626 (2007) - [j4]Louigi Addario-Berry, Neil Olver
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. J. Graph Algorithms Appl. 11(1): 309-319 (2007) - 2005
- [j3]Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed:
Degree constrained subgraphs. Electron. Notes Discret. Math. 19: 257-263 (2005) - [j2]Louigi Addario-Berry, Robert E. L. Aldred, Ketan Dalal, Bruce A. Reed:
Vertex colouring edge partitions. J. Comb. Theory B 94(2): 237-244 (2005) - 2004
- [j1]Louigi Addario-Berry, Benny Chor, Michael T. Hallett
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinform. Comput. Biol. 2(2): 257-272 (2004) - 2003
- [c2]Louigi Addario-Berry, Michael T. Hallett, Jens Lagergren:
Towards Identifying Lateral Gene Transfer Events. Pacific Symposium on Biocomputing 2003: 279-290 - [c1]Louigi Addario-Berry, Benny Chor, Michael T. Hallett
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI 2003: 202-215
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: