@chapter{PolicritiTomescu,
    Author = {Policriti, Alberto and Tomescu, Alexandru I.},
    BookTitle = {Language and Automata Theory and Applications},
    File = {Well-Quasi-Ordering Hereditarily Finite Sets - Policriti, Tomescu (0) (0) - a - a - v.pdf},
    Keywords = {well quasi-orders},
    Pages = {440--451},
    Series = {Lecture Notes in Computer Science},
    Title = {Well-Quasi-Ordering Hereditarily Finite Sets},
    Volume = {6638},
    Year = {2011},
    bdsk-url-1 = {http://www.springerlink.com/content/411k6p60715t4727/fulltext.pdf},
    bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-642-21254-3\_35},
    date-added = {2012-06-10 00:35:57 +0200},
    date-modified = {2012-12-02 15:44:30 +0000},
    doi = {10.1007/978-3-642-21254-3_35}
}

@chapter{PolicritiTomescu, Author = {Policriti, Alberto and Tomescu, Alexandru I.}, BookTitle = {Language and Automata Theory and Applications}, File = {Well-Quasi-Ordering Hereditarily Finite Sets - Policriti, Tomescu (0) (0) - a - a - v.pdf}, Keywords = {well quasi-orders}, Pages = {440--451}, Series = {Lecture Notes in Computer Science}, Title = {Well-Quasi-Ordering Hereditarily Finite Sets}, Volume = {6638}, Year = {2011}, bdsk-url-1 = {http://www.springerlink.com/content/411k6p60715t4727/fulltext.pdf}, bdsk-url-2 = {http://dx.doi.org/10.1007/978-3-642-21254-3_35}, date-added = {2012-06-10 00:35:57 +0200}, date-modified = {2012-12-02 15:44:30 +0000}, doi = {10.1007/978-3-642-21254-3_35} }