2008 |
12 | EE | 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 |
11 | EE | Louigi Addario-Berry,
Ketan Dalal,
Bruce A. Reed:
Degree constrained subgraphs.
Discrete Applied Mathematics 156(7): 1168-1174 (2008) |
10 | EE | Louigi Addario-Berry,
Maria Chudnovsky,
Frédéric Havet,
Bruce A. Reed,
Paul D. Seymour:
Bisimplicial vertices in even-hole-free graphs.
J. Comb. Theory, Ser. B 98(6): 1119-1164 (2008) |
2007 |
9 | EE | Louigi Addario-Berry,
Ketan Dalal,
Colin McDiarmid,
Bruce A. Reed,
Andrew Thomason:
Vertex-Colouring Edge-Weightings.
Combinatorica 27(1): 1-12 (2007) |
8 | EE | Louigi Addario-Berry,
Ross J. Kang:
Acyclic dominating partitions.
Electronic Notes in Discrete Mathematics 29: 419-425 (2007) |
7 | EE | Louigi Addario-Berry,
Frédéric Havet,
Stéphan Thomassé:
Paths with two blocks in n-chromatic digraphs.
J. Comb. Theory, Ser. B 97(4): 620-626 (2007) |
6 | EE | Louigi Addario-Berry,
Neil Olver,
Adrian Vetta:
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games.
J. Graph Algorithms Appl. 11(1): 309-319 (2007) |
2005 |
5 | EE | Louigi Addario-Berry,
Ketan Dalal,
Bruce A. Reed:
Degree constrained subgraphs.
Electronic Notes in Discrete Mathematics 19: 257-263 (2005) |
4 | EE | Louigi Addario-Berry,
Robert E. L. Aldred,
Ketan Dalal,
Bruce A. Reed:
Vertex colouring edge partitions.
J. Comb. Theory, Ser. B 94(2): 237-244 (2005) |
2004 |
3 | EE | Louigi Addario-Berry,
Benny Chor,
Michael T. Hallett,
Jens Lagergren,
Alessandro Panconesi,
Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
J. Bioinformatics and Computational Biology 2(2): 257-272 (2004) |
2003 |
2 | EE | Louigi Addario-Berry,
Michael T. Hallett,
Jens Lagergren:
Towards Identifying Lateral Gene Transfer Events.
Pacific Symposium on Biocomputing 2003: 279-290 |
1 | EE | Louigi Addario-Berry,
Benny Chor,
Michael T. Hallett,
Jens Lagergren,
Alessandro Panconesi,
Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
WABI 2003: 202-215 |