Lattice path matroids: enumerative aspects and Tutte polynomials J Bonin, A de Mier, M Noy
Journal of Combinatorial Theory, Series A 104 (1), 63-94, 2003
121 2003 Lattice path matroids: structural properties JE Bonin, A de Mier
European Journal of Combinatorics 27 (5), 701-738, 2006
72 2006 k -noncrossing and k -nonnesting graphs and fillings of ferrers diagramsA De Mier
Combinatorica 27 (6), 699-720, 2007
60 2007 The lattice of cyclic flats of a matroid JE Bonin, A de Mier
Annals of combinatorics 12 (2), 155-170, 2008
59 2008 On graphs determined by their Tutte polynomials A Mier, M Noy
Graphs and Combinatorics 20 (1), 105-119, 2004
56 2004 Irreducibility of the Tutte polynomial of a connected matroid C Merino, A de Mier, M Noy
Journal of Combinatorial Theory, Series B 83 (2), 298-304, 2001
37 2001 Locally grid graphs: classification and Tutte uniqueness A Márquez, A de Mier, M Noy, MP Revuelta
Discrete mathematics 266 (1-3), 327-352, 2003
34 2003 Representation of numerical semigroups by Dyck paths M Bras-Amorós, A De Mier
arXiv preprint math/0612634, 2006
31 2006 A solution to the tennis ball problem A De Mier, M Noy
Theoretical computer science 346 (2-3), 254-264, 2005
29 2005 On trees with the same restricted U-polynomial and the Prouhet–Tarry–Escott problem J Aliste-Prieto, A de Mier, J Zamora
Discrete Mathematics 340 (6), 1435-1441, 2017
26 2017 On the Symmetry of the Distribution of A De Mier
the electronic journal of combinatorics 13 (1), N21, 2006
26 2006 Spanning trees of 3-uniform hypergraphs A Goodall, A De Mier
Advances in Applied Mathematics 47 (4), 840-868, 2011
17 2011 Tutte polynomials of generalized parallel connections J Bonin, A De Mier
Advances in Applied Mathematics 32 (1-2), 31-43, 2004
15 2004 On the maximum number of cycles in outerplanar and series–parallel graphs A de Mier, M Noy
Graphs and Combinatorics 28 (2), 265-275, 2012
14 2012 Characterizations of transversal and fundamental transversal matroids JE Bonin, JPS Kung, A de Mier
arXiv preprint arXiv:1009.3435, 2010
13 2010 T-uniqueness of some families of k-chordal matroids J Bonin, A De Mier
Advances in Applied Mathematics 32 (1-2), 10-30, 2004
13 2004 Graphs and matroids determined by their Tutte polynomials A de Mier Vinué, MN Serrano
Doctoral program in Applied Mathematics, Universitat Politècnica de …, 2003
13 2003 Lower bounds on the maximum number of non-crossing acyclic graphs C Huemer, A de Mier
European Journal of Combinatorics 48, 48-62, 2015
12 2015 Tutte uniqueness of line graphs A De Mier, M Noy
Discrete mathematics 301 (1), 57-65, 2005
12 2005 On the number of bases of bicircular matroids O Giménez, A Mier, M Noy
Annals of Combinatorics 9, 35-45, 2005
12 2005 