default search action
Anna de Mier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j34]Jaume Martí-Farré, Anna de Mier:
Approximation and decomposition in lattices of clutters. Discret. Math. 346(8): 113445 (2023) - [j33]José Aliste-Prieto
, Anna de Mier, Rosa C. Orellana, José Zamora:
Marked Graphs and the Chromatic Symmetric Function. SIAM J. Discret. Math. 37(3): 1881-1919 (2023) - 2021
- [j32]José Aliste-Prieto
On the smallest trees with the same restricted U-polynomial and the rooted U-polynomial. Discret. Math. 344(3): 112255 (2021)
2010 – 2019
- 2018
- [j31]José Aliste-Prieto, José Zamora, Anna de Mier:
On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs. Electron. Notes Discret. Math. 68: 185-190 (2018) - 2017
- [j30]José Aliste-Prieto, Anna de Mier
On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem. Discret. Math. 340(6): 1435-1441 (2017) - 2016
- [j29]Anna de Mier, Oriol Serra:
Preface. Electron. Notes Discret. Math. 54: 1-2 (2016) - 2015
- [j28]Anders Claesson, Sergey Kitaev, Anna de Mier:
An involution on bicubic maps and β(0, 1)-trees. Australas. J Comb. 61: 1-18 (2015) - [j27]Clemens Huemer
Lower bounds on the maximum number of non-crossing acyclic graphs. Eur. J. Comb. 48: 48-62 (2015) - [j26]Joseph E. Bonin
Extensions and presentations of transversal matroids. Eur. J. Comb. 50: 18-29 (2015) - 2014
- [j25]Michael Drmota, Anna de Mier
Extremal statistics on non-crossing configurations. Discret. Math. 327: 103-117 (2014) - [j24]Sergey Kitaev
On the number of self-dual rooted maps. Eur. J. Comb. 35: 377-387 (2014) - [j23]Sergey Kitaev
Enumeration of Fixed Points of an Involution on β(1, 0)-Trees. Graphs Comb. 30(5): 1207-1221 (2014) - 2013
- [j22]Joseph P. S. Kung, Anna de Mier
Catalan lattice paths with rook, bishop and spider steps. J. Comb. Theory A 120(2): 379-389 (2013) - 2012
- [j21]Anna de Mier, Marc Noy:
On the Maximum Number of Cycles in Outerplanar and Series-Parallel Graphs. Graphs Comb. 28(2): 265-275 (2012) - 2011
- [j20]Andrew J. Goodall
Spanning trees of 3-uniform hypergraphs. Adv. Appl. Math. 47(4): 840-868 (2011) - [j19]Joseph E. Bonin, Joseph P. S. Kung, Anna de Mier:
Characterizations of Transversal and Fundamental Transversal Matroids. Electron. J. Comb. 18(1) (2011) - [j18]Andrew J. Goodall
The Tutte Polynomial Characterizes Simple Outerplanar Graphs. Comb. Probab. Comput. 20(4): 609-616 (2011) - [j17]Andrew J. Goodall
The Tutte polynomial characterizes simple outerplanar graphs. Electron. Notes Discret. Math. 38: 639-644 (2011)
2000 – 2009
- 2009
- [j16]Anna de Mier, Marc Noy:
On the maximum number of cycles in outerplanar and series-parallel graphs. Electron. Notes Discret. Math. 34: 489-493 (2009) - 2007
- [j15]Anna de Mier
k -noncrossing and k -nonnesting graphs and fillings of ferrers diagrams. Comb. 27(6): 699-720 (2007) - [j14]Anna de Mier:
k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams. Electron. Notes Discret. Math. 28: 3-10 (2007) - [j13]Joseph P. S. Kung, Anna de Mier, Xinyu Sun, Catherine H. Yan
Lattice paths with periodic boundaries. Electron. Notes Discret. Math. 29: 59-63 (2007) - [j12]Anna de Mier
A Natural Family of Flag Matroids. SIAM J. Discret. Math. 21(1): 130-140 (2007) - 2006
- [j11]Anna de Mier:
On the Symmetry of the Distribution of k-Crossings and k-Nestings in Graphs. Electron. J. Comb. 13(1) (2006) - [j10]Joseph E. Bonin
Lattice path matroids: Structural properties. Eur. J. Comb. 27(5): 701-738 (2006) - 2005
- [j9]Anna de Mier
Tutte uniqueness of line graphs. Discret. Math. 301(1): 57-65 (2005) - [j8]Anna de Mier
On matroids determined by their Tutte polynomials. Discret. Math. 302(1-3): 52-76 (2005) - [j7]Anna de Mier
A solution to the tennis ball problem. Theor. Comput. Sci. 346(2-3): 254-264 (2005) - 2004
- [j6]Joseph E. Bonin
T-uniqueness of some families of k-chordal matroids. Adv. Appl. Math. 32(1-2): 10-30 (2004) - [j5]Joseph E. Bonin
Tutte polynomials of generalized parallel connections. Adv. Appl. Math. 32(1-2): 31-43 (2004) - [j4]Anna de Mier
On Graphs Determined by Their Tutte Polynomials. Graphs Comb. 20(1): 105-119 (2004) - 2003
- [j3]Alberto Márquez
Locally grid graphs: classification and Tutte uniqueness. Discret. Math. 266(1-3): 327-352 (2003) - [j2]Joseph E. Bonin
Lattice path matroids: enumerative aspects and Tutte polynomials. J. Comb. Theory A 104(1): 63-94 (2003) - 2001
- [j1]Criel Merino
Irreducibility of the Tutte Polynomial of a Connected Matroid. J. Comb. Theory B 83(2): 298-304 (2001)
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-06-10 20:28 CEST 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: