default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÉva Czabarka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j34]Ann Clifton, Éva Czabarka, Audace A. V. Dossou-Olory, Kevin Liu, Sarah Loeb, Utku Okur, László Székely, Kristina Wicke:
Decks of rooted binary trees. Eur. J. Comb. 124: 104076 (2025)- 2024
- [j33]Éva Czabarka, Junsheng Liu, László Székely:
The Largest Crossing Number of Tanglegrams. Electron. J. Comb. 31(1) (2024) - 2023
- [j32]Éva Czabarka
, Stephen J. Smith, László A. Székely:
Maximum diameter of 3- and 4-colorable graphs. J. Graph Theory 102(2): 262-270 (2023) - [i5]Sergio Cabello, Éva Czabarka, Ruy Fabila Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek:
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. CoRR abs/2312.01935 (2023) - 2022
- [j31]Éva Czabarka, Trevor Olsen, Stephen J. Smith, László A. Székely:
Minimum Wiener index of triangulations and quadrangulations. Discret. Appl. Math. 322: 295-310 (2022) - [j30]Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely:
Proximity in triangulations and quadrangulations. Electron. J. Graph Theory Appl. 10(2): 425-446 (2022) - [j29]Éva Czabarka, Stephen J. Smith, László A. Székely:
An Infinite Antichain of Planar Tanglegrams. Order 39(1): 45-54 (2022) - 2021
- [j28]Éva Czabarka, Josiah Reiswig, László Székely:
The Steiner distance problem for large vertex subsets in the hypercube. Bull. ICA 93: 119-125 (2021) - [j27]Éva Czabarka, Inne Singgih, László A. Székely:
On the Maximum Diameter of $k$-Colorable Graphs. Electron. J. Comb. 28(3) (2021) - [j26]Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely:
Wiener Index and Remoteness in Triangulations and Quadrangulations. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j25]Garner Cochran, Éva Czabarka, Peter Dankelmann, László A. Székely:
A Size Condition for Diameter Two Orientable Graphs. Graphs Comb. 37(2): 527-544 (2021) - [j24]Éva Czabarka, Inne Singgih, László A. Székely:
Counterexamples to a conjecture of Erdős, Pach, Pollack and Tuza. J. Comb. Theory B 151: 38-45 (2021) - 2020
- [j23]Éva Czabarka, Audace A. V. Dossou-Olory, László A. Székely, Stephan G. Wagner:
Inducibility of d-ary trees. Discret. Math. 343(2): 111671 (2020)
2010 – 2019
- 2019
- [j22]Éva Czabarka, Peter Dankelmann, László A. Székely:
A degree condition for diameter two orientability of graphs. Discret. Math. 342(4): 1063-1065 (2019) - [j21]Éva Czabarka, László A. Székely, Stephan G. Wagner:
A tanglegram Kuratowski theorem. J. Graph Theory 90(2): 111-122 (2019) - 2018
- [j20]Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C.-H. Lin, Austin Mohr, Heather C. Smith, László A. Székely, Hays Whitlatch:
Analogies between the Crossing Number and the Tangle Crossing Number. Electron. J. Comb. 25(4): 4 (2018) - [j19]Éva Czabarka, Rigoberto Flórez, Leandro Junes, José Luis Ramírez:
Enumerations of peaks and valleys on non-decreasing Dyck paths. Discret. Math. 341(10): 2789-2807 (2018) - [j18]Éva Czabarka, László A. Székely, Stephan G. Wagner:
On the Number of Nonisomorphic Subtrees of a Tree. J. Graph Theory 87(1): 89-95 (2018) - 2017
- [j17]Éva Czabarka, Johannes Rauh, Kayvan Sadeghi, Taylor Short, László A. Székely:
On the Number of Non-Zero Elements of Joint Degree Vectors. Electron. J. Comb. 24(1): 1 (2017) - [j16]Éva Czabarka, László A. Székely, Stephan G. Wagner:
Paths vs. Stars in the Local Profile of Trees. Electron. J. Comb. 24(1): 1 (2017) - [j15]Éva Czabarka, László A. Székely, Stephan G. Wagner:
Inducibility in Binary Trees and Crossings in Random Tanglegrams. SIAM J. Discret. Math. 31(3): 1732-1750 (2017) - [i4]Robin Anderson, Shuliang Bai, Fidel Barrera-Cruz, Éva Czabarka, Giordano Da Lozzo, Natalie L. F. Hobson, Jephian C.-H. Lin, Austin Mohr, Heather C. Smith, László A. Székely, Hays Whitlatch:
Analogies between the crossing number and the tangle crossing number. CoRR abs/1709.08119 (2017) - 2015
- [j14]Éva Czabarka, Rigoberto Flórez, Leandro Junes:
Some Enumerations on Non-Decreasing Dyck Paths. Electron. J. Comb. 22(1): 1 (2015) - [j13]Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós:
On realizations of a joint degree matrix. Discret. Appl. Math. 181: 283-288 (2015) - [j12]Éva Czabarka, Rigoberto Flórez, Leandro Junes:
A Discrete Convolution on the Generalized Hosoya Triangle. J. Integer Seq. 18(1): 15.1.6 (2015) - 2014
- [i3]F. Molnár Jr., Noemi Derzsy, Éva Czabarka, László A. Székely, Boleslaw K. Szymanski, György Korniss:
Dominating Scale-Free Networks Using Generalized Probabilistic Methods. CoRR abs/1406.4851 (2014) - 2013
- [j11]Éva Czabarka, Péter L. Erdös, Virginia Johnson, Vincent Moulton:
Generating functions for multi-labeled trees. Discret. Appl. Math. 161(1-2): 107-117 (2013) - [c3]Harout K. Aydinian, Éva Czabarka, László A. Székely:
Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals. Information Theory, Combinatorics, and Search Theory 2013: 371-401 - [c2]Éva Czabarka, Matteo Marsili, László A. Székely:
Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner. Information Theory, Combinatorics, and Search Theory 2013: 463-471 - [i2]Éva Czabarka, Aaron Dutle, Péter L. Erdös, István Miklós:
On Realizations of a Joint Degree Matrix. CoRR abs/1302.3548 (2013) - 2012
- [i1]Éva Czabarka, László A. Székely, Todd J. Vision:
Minimizing the number of episodes and Gallai's theorem on intervals. CoRR abs/1209.5699 (2012) - 2011
- [j10]Harout K. Aydinian, Éva Czabarka, Péter L. Erdös, László A. Székely:
A tour of M-part L-Sperner families. J. Comb. Theory A 118(2): 702-725 (2011) - 2010
- [j9]Harout K. Aydinian, Éva Czabarka, Konrad Engel, Péter L. Erdös, László A. Székely:
A note on full transversals and mixed orthogonal arrays. Australas. J Comb. 48: 133-142 (2010) - [j8]Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrt'o:
General Lower Bounds for the Minor Crossing Number of Graphs. Discret. Comput. Geom. 44(2): 463-483 (2010)
2000 – 2009
- 2009
- [j7]Éva Czabarka, László A. Székely, Stephan G. Wagner:
The inverse problem for certain tree parameters. Discret. Appl. Math. 157(15): 3314-3319 (2009) - [j6]Éva Czabarka, Peter Dankelmann, László A. Székely:
Diameter of 4-colourable graphs. Eur. J. Comb. 30(5): 1082-1089 (2009) - 2008
- [j5]Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method. Random Struct. Algorithms 33(4): 480-496 (2008) - 2007
- [j4]Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrto:
Graph minors and the crossing number of graphs. Electron. Notes Discret. Math. 28: 169-175 (2007) - 2004
- [j3]Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrt'o:
Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions. Electron. J. Comb. 11(1) (2004) - 2000
- [c1]Éva Czabarka, Goran Konjevod, Madhav V. Marathe, Allon G. Percus, David C. Torney:
Algorithms for optimizing production DNA sequencing. SODA 2000: 399-408
1990 – 1999
- 1999
- [j2]Éva Czabarka:
Intersecting Chains In Finite Vector Spaces. Comb. Probab. Comput. 8(6): 509-528 (1999) - 1996
- [j1]Suresh Viswanathan, Éva Czabarka, Abhijit Sengupta:
On Fault-Tolerant Embedding of Hamiltonian Circuits in Line Digraph Interconnection Networks. Inf. Process. Lett. 57(5): 265-271 (1996)
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 2025-01-20 23:59 CET 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:
