- SIAM J. DISCRETE MATH. c 2005 Society for Industrial and Applied Mathematics Vol. 19, No. 2, pp. 489500
- Journal of Discrete Algorithms 5 (2007) 135140 www.elsevier.com/locate/jda
- JOURNAL OF COMBINATORIAL THEORY, Series A 43, 58-69 (1986) All Maximum 2-Part Sperner Families
- arXiv:1004.2735v1[cs.DM]15Apr2010 Balanced Vertices in Trees and a Simpler Algorithm to Compute
- A note on full transversals and mixed orthogonal Harout Aydinian
- Journal of Combinatorial Optimization, 7, 369379, 2003 c 2004 Kluwer Academic Publishers. Manufactured in The Netherlands.
- ARTICLE IN PRESS Discrete Mathematics ( )
- ERDOS-KO-RADO THEOREMS OF HIGHER Peter L. Erdos and Laszlo A. Szekely
- Graphs and Combinatorics 5, 47-56 (1989) Combinatorics
- Annals of Combinatorics 3 (1999) 53-59 Combinatorics
- ANTICHAINS IN THE HOMOMORPHISM ORDER OF GRAPHS D. DUFFUS, P. L. ERDOS, J. NESETRIL, AND L. SOUKUP
- Akad6miai Kiad6 -Springer-Verlag COMBINATORICA12 (3) (1992) 287-293
- A tour of M-part L-Sperner families Harout Aydinian
- Annals of Combinatorics 10 (2006) 415-430 0218-0006/06/040415-16
- ADVANCES IN APPLIED MATHEMATICS l&488-496 (1989) Applications of Antilexicographic Order. I.
- Combinatorics, Probability and Computing (1997) 6, 127137 Copyright c 1997 Cambridge University Press
- COMBINATORICA Akad&~fiai Kiad6 -Springer-Vmqag
- Appl. Math. Leii. Vol. 5, No. 6, pp. 63-67, 1992 Printed in Great Britain. All rights reserved
- Comment.Math.Univ.Carolin. 48,4 (2007)571583 571 Antichains in the homomorphism order of graphs
- Annals of Combinatorics 8 (2004) 457-462 0218-0006/04/040457-6
- Acta Math. Hung. 46 0----4)(1985),311--313.
- Combinatorics, Probability and Computing: page 1 of 3. c 2007 Cambridge University Press doi:10.1017/S0963548306007930
- Discrete Mathematics 81 (1990) 165-169 North-Holland
- Constructing Big Trees from Short Sequences P~ter L. ErdSs
- Mathematical Programming 65 (1994) 93-105 On weighted multiway cuts in trees
- Graphs and Combinatorics 2, 123-134 (1986) Combinatorics
- Z .ADVANCES IN APPLIED MATHEMATICS 19, 431 443 1997 ARTICLE NO. AM970542
- COMBINATORICA Bolyai Society Springer-Verlag
- Annals of Combinatorics 9 (2005) 177-187 0218-0006/05/020177-11
- COMBINATORICA Bolyai Society Springer-Verlag
- NO FINITE-INFINITE ANTICHAIN DUALITY IN THE HOMOMORPHISM POSET D OF DIRECTED GRAPHS
- ADVANCES IN APPLIED MATHEMATICS 13, 375-389 (1992) Evolutionary Trees: An Integer Multicommodity
- Discrete Mathematics 111 (1993) 1799188 North-Holland
- Discrete Applied Mathematics 47 (1993) l-8 North-Holland
- A finite word poset Peter L. Erdos
- Theoretical Computer Science 313 (2004) 371376 www.elsevier.com/locate/tcs
- IOP PUBLISHING JOURNAL OF PHYSICS A: MATHEMATICAL AND THEORETICAL J. Phys. A: Math. Theor. 42 (2009) 392001 (10pp) doi:10.1088/1751-8113/42/39/392001
- A simple HavelHakimi type algorithm to realize graphical degree sequences of directed graphs
- arXiv:1004.2612v2[math.CO]14Jun2010 Towards random uniform sampling of bipartite
- Appl. Math. Lett. Vol. 6, No. 2, pp. 13-16, 1993 Printed in Great Britain. All rights reserved
- New Zealand Journal of Botany, 1993, Vol. 31: 289-296 OO28-825X/93/3103-0289 $2.50/0 The Royal Society of New Zealand 1993
- ( )A Few Logs Suffice to Build Almost ( )All Trees I
- Annals of Combinatorics 7 (2003) 155-169 0218-0006/03/020155-15
- Curriculum vitae June 18, 2010
- Antichains and duality pairs in the digraph-poset extended abstract
- On two-part Sperner systems for regular posets Extended Abstract
- Accepted Manuscript A linear algorithm for string reconstruction in the reverse
- Efficient Algorithms for the Periodic Subgraphs Mining Alberto Apostolicoa,b
- Parameterized Searching with Mismatches for Run-length Encoded Strings
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Efficient Reconstruction of RC-Equivalent Ferdinando Cicalese1
- Journal of Combinatorial Theory, Series A 118 (2011) 702725 Contents lists available at ScienceDirect
- Parameterized Searching with Mismatches for Run-Length Encoded Strings
- arXiv:1110.0099v1[math.CO]1Oct2011 Two-part set systems
- Asymptotically normal distribution of some tree families relevant for phylogenetics, and of partitions
- arXiv:1203.1257v1[math.CO]6Mar2012 On infinite-finite duality pairs of directed graphs
- arXiv:1203.1347v1[math.CO]6Mar2012 CATERPILLAR DUALITIES AND REGULAR LANGUAGES
