Universidade Federal de Minas Gerais

Av. Antônio Carlos, 6627, Belo Horizonte

CEP: 31270-901, Brasil

Email: lastname at ufmg dot br

Telephone: (+55) (31) 3409 5789 (office)

Fax: (+55) (31) 3409 5692 (secretariat)

Cell: +55 31 975823864 (Belo Horizonte)

- Tópicos para projetos de mestrado.

- Reconstruction and isomorphism problems in combinatorics and graph theory
- Posets and lattices of graphs; polynomial invariants of graphs
- Algebraic and enumerative combinatorics

- The connected partition lattice of a graph and the
reconstruction conjecture.
J. Graph Theory,
(2019).
URL

- The edge-subgraph poset of a graph and the edge reconstruction
conjecture.
J. Graph Theory,
(2019)
URL

- (with Raazesh Sainudiin
and Amandine Véber) Ancestries of
a Recombining Diploid Population.
Journal of
Mathematical Biology (2016).
URL

- (with Igor C. Oliveira) An algebraic
formulation of the graph reconstruction conjecture.
Journal of Graph
Theory (2016).
arXiv
URL

- (with Daniel Martin) The maximum common subtree
problem, Discrete Applied
Mathematics 161 (2013), pp. 1805-1817.
arXiv
URL

- Reconstructing pedigrees: some identifiability questions for a
recombination-mutation model. Journal of Mathematical Biology 66, issue 1-2
(2013) 37-74.
arXiv
URL

- (with C. Richard
and U. Schwerdtfeger) Area laws
for symmetry classes of convex
polygons. Combinatorics, Probability and Computing 19,
no. 3 (2010) 441-461. arXiv
URL

- (with Mareike Fischer) Revisiting an equivalence
between maximum parsimony and maximum likelihood methods in
phylogenetics. Bulletin of
Mathematical Biology 72, no. 1 (2010)
208-220. arXiva
URL

- (with Mareike Fischer) Maximum Parsimony on Subsets of Taxa. Journal of Theoretical Biology 260, no. 2 (2009) 290--293. arXiv URL
- Combinatorics of pedigrees I: counter examples to a
reconstruction problem. SIAM Journal of Discrete Mathematics 22,
no. 3 (2008)
961-970. arXiv
URL

- (with Mike Steel) Reconstructing
pedigrees: a stochastic
perspective. J. Theoretical Biology 251, no. 3 (2008)
240-249. arXiv
URL

- A correct proof of the McMorris-Powers' theorem on the consensus
of phylogenies. Discrete Applied Mathematics, Volume
155, Issue 3 (2007),
423-427.
arXiv URL

- Invertibility of the TKF model of sequence
evolution. Mathematical Biosciences 200, no. 1 (2006)
58-75. arXiv URL

- Kocay's lemma, Whitney's theorem, and some polynomial invariant
reconstruction problems. The Electronic Journal of Combinatorics 12
(2005), #R63, 30
pages. arXiv
URL

- (with I.Krasikov and A.Lev) Upper
bounds on the automorphism group of a
graph. Discrete
Mathematics 256 (2002)
489-493. arXiv URL

- G-reconstruction of graphs. Ars Combinatoria 54 (2000)
293-299. arXiv

- A reconstruction problem related to balance equations-II: the
general case. Discrete
Mathematics 194, no. 1-3(1999) 281-284. Note that the
revised version on
the arXiv is more accurate, with
some extra details on a lemma.
URL

- A reconstruction problem related to balance
equations-I. Discrete
Mathematics 176 (1997)
279-284. arXiv URL

- Comments on a paper: "Reconstruction of a graph of order p from its (p-1)-complements" [Indian J. Pure Appl. Math., 27 (1996), no. 5, 435-441; MR 97a:05158] by E. Sampathkumar and L. Pushpa Latha. Indian J. Pure Appl. Math 27 (1996) 1279-1279.
- A note on a reconstruction
problem. Discrete
Mathematics 137 (1995)
387-388. URL

- Some results on the reconstruction problems-I: $p$-claw-free,
chordal and $P_4$ reducible
graphs. J. Graph
Theory 19, no. 4 (1995)
549-561. URL

- Some results and approaches for reconstruction conjectures,
Presented at the First Malta Conference on Graph Theory,
May-June 1990.
Discrete
Mathematics 124, no. 1-3(1994)
193-216. URL

- On the Nash-Williams' lemma in graph reconstruction
theory. J. Combinatorial Theory Ser. B. 58
no. 2(1993)
280-290. URL

- (with Rodrigo Caetano Rocha) Distributed cycle detection
in large-scale sparse graphs. SBPO 2015 - Simpósio Brasileiro de
Pesquisa Operacional, Pernambuco, Brazil.
URL

- (with Mike Hendy) MANTRA - A Multiple Alignment and Tree
Reconstruction Algorithm. Proceedings of the 15th Australasian Workshop
on Combinatorial Algorithms (AWOCA), July 2004, 121-12.

- Can hybridisation networks be constructed from local information?
(2007).