Publications

  1. É. Czabarka, L.A. Székely, Z. Toroczkai, S. Walker An algebraic Monte-Carlo algorithm for the Bipartite Partition Adjacency Matrix realization problem, submitted
  2. É. Czabarka, R. Florez, L. Junes, J. L. Ramirez Ramirez Enumerations of Peaks and Valleys on Non-decreasing Dyck Paths, submitted
  3. É. Czabarka, L.A. Székely, S. Wagner, A tanglegram Kuratowski theorem, submitted
  4. É. Czabarka, L.A. Székely, S. Wagner, Inducibility in binary trees and crossings in random tanglegrams, SIAM J. Discrete Math Vol. 31, No. 3, (2017) pp. 1732-1750
  5. É. Czabarka, Johannes Rauh, Kayvan Sadeghi, Taylor Short, L.A. Székely, On the number of non-zero elements of joint degree vectors, Electronic Journal of Combinatorics, Vol. 24, Issue 1 (2017) #P1.55
  6. É. Czabarka, L.A. Székely, S. Wagner, Paths vs. stars in the local profile of trees, Electronic Journal of Combinatorics, Vol. 24, Issue 1 (2017) #P1.22
  7. É. Czabarka, L.A. Székely, S. Wagner, On the number of nonisomorphic subtrees of a tree, Journal of Graph Theory (2017)
  8. Sz. Horváth, É. Czabarka, Z. Toroczkai, Reducing degeneracy in maximum enthropy models of networks Physical Review Letters Vol. 114, Issue 15, 15871, 2015
  9. É. Czabarka, A. Dutle, T. Johnston, L.A. Székely, Abelian groups yield many large families for the diamond problem European Journal of Mathematics, Vol 1, Issue 2, 320-328, 2015
  10. É. Czabarka, R. Florez, L. Junes, A discrete convolution on the generalized Hosoya triangle Journal of Integer Sequences, Vol. 18, Article 15.1.6 2015
  11. É. Czabarka, A. Dutle P.L. Erdős, I. Miklós, On Realizations of a Joint Degree Matrix, Discrete Applied Mathematics, Volume 181, 283-288, 2015
  12. É. Czabarka, R Florez, L. Junes, Some enumerations on non-decreasing Dyck paths Electronic Journal of Combinatorics, Vol. 22 Issue 1, 2015
  13. F. Molnár Jr., N. Derzsy, É. Czabarka, L.A. Székely, B.K. Szymanski, G. Korniss Dominating scale-free networks using generalized probabilistic models, Scientific Reports Sep 2014
  14. H. Aydinian, É. Czabarka, L.A. Székely, Mixed orthogonal arrays, k-dimensional M-part Sperner multi-families, and full multi-transversals, Information Theory, Combinatorics and Search Theory, LNCS 7777, (2013) 371-401, Springer, Heidelberg
  15. É. Czabarka, M. Marsili, L.A. Székely, Threshold functions for distinct parts: revisiting Erdős-Lehner Information Theory, Combinatorics and Search Theory, LNCS 7777, (2013) 463-471, Springer, Heidelberg
  16. É. Czabarka, P.L. Erdős, V. Johnson, V. Moulton: Generating functions for multi-labeled trees Discrete Applied Mathematics 161 (2013) 107-117
  17. Csaba Biró É. Czabarka, Peter Dankelmann L.A. Székely, Remarks on the domination number of graphs. Bulletin of the I.C.A. 64 (2012) 73-82
  18. É. Czabarka, P.L. Erdős, V. Johnson, A. Kupczok, L.A. Székely, Asymptotically normal distribution of some tree families relevant for phylogenetics, and of partitions without singletons Moscow J. Comb. Numb. Theory, 1 (3) (2011) (file here is an earlier version)
  19. H. Aydinian, É. Czabarka, P.L. Erdős, L.A. Székely, A tour of M-part L-Serner families, J. Combin. Theory A 118 (2011) 702-725
  20. H. Aydinian, É. Czabarka, K. Engel, P.L. Erdős, L.A. Székely, A note on full transversals and mixed orthogonal arrays, Australasian J. Combin. 48 (2010) 133-141 (pdf file is the exact article in AJC, they retain copyright on the PDF file for the style, formatting, headers and footers, as they do for the printed volumes.)
  21. D. Bokal, É. Czabarka, L.A. Székely, I. Vrťo, General lower bounds for the minor crossing number of graphs, Discrete and Computational Geometry 44 (2010) 463-483
  22. É. Czabarka, L.A. Székely, S. Wagner, The inverse problem for certain tree parameters, Discrete Applied Math 157 (15) (2009) 3314-3319
  23. É. Czabarka, P. Dankelmann, L.A. Székely, Diameter of 4-colourable graphs, European J. of Combin. 30 (2009) 1082-1098
  24. É. Czabarka, O. Sýkora, L.A. Székely, I. Vrťo, Biplanar crossing numbers II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method, Random Structures and Algorithms 33 (4) (2008) 480-496
  25. D. Bokal, É. Czabarka, L.A. Székely, I. Vrťo, Graph minors and the crossing number of graphs, Electronic Notes in Discrete Math. 28 (2007) 169-175
  26. É. Czabarka, O. Sýkora, L.A. Székely, I. Vrťo, Crossing numbers and biplanar crossing numbers I: a survey of problems and results, More Sets, Graphs and Numbers eds. E. Győri, G. O. H. Katona, L. Lovász, and Tamás Fleiner, Bolyai Society Mathematical Studies 15, Springer Verlag, (2006), 57-77.
  27. J.L. Spouge, É. Czabarka, Some central limit theorems pertinent to the effectiveness of database retrieval, Technical Reports of the Interdisciplinary Mathematics Institute, College of Arts and Sciences, University of South Carolina
  28. É. Czabarka, O. Sýkora, L.A. Székely, I. Vrťo, Outerplanar crossing numbers, circular arrangement problem, and isoperimetric functions, Electronic Journal of Combinatorics 11(1), (2004) R81 20pp
  29. G.T. Marth, É. Czabarka, J. Murvai, S.T. Sherry, The allele frequency spectrum in genome-wide human variation data reveals signals of differential demographic history in three large world populations, Genetics 166 (2004) 351-372
  30. G.T. Marth, G. Schuler, R. Yeh, R. Davenport, R. Agarwala, D. Church, S. Wheelan, J. Baker, M. Ward, M. Kholodov, L. Phan, É. Czabarka, J. Murvai, D. Cutler, S. Wooding, A. Rogers, A. Chakravarty, H.C. Harpending, P.-Y. Kwok, S.T. Sherry, Sequence variations in the public human genome data reflect a bottlenecked population history, Proc. Natl. Acad. Sci. USA 100 (2003), 376-381.
  31. I.B. Rogozin, K.S. Makarova, J. Murvai, É. Czabarka, Y.I. Wolf, R.L. Tatusov, L.A. Székely, E.V. Koonin, Connected gene neighborhoods in prokaryotic genomes, Nucleic Acids Res. 30(10) (2002 May) 2212-23.
  32. É. Czabarka, G. Konjevod, M. V. Marathe, A.G. Percus, D.C. Torney, Algorithms for Optimizing Production DNA Sequencing, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00) 399-408.
  33. É. Czabarka, Intersecting chains in finite vector spaces, Combinatorics, Probability and Computing 8, (1999), 509-528.
  34. S. Visvanathan, É. Czabarka, A. Sengupta, Fault-Tolerant Embedding of Hamiltonian Circuits in Line Digraph Interconnection Networks, Information Processing Letters 57, (1996), 265-271
Return to home page