default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEleni Tzanaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Aram Dermenjian, Eleni Tzanaki:
Enumerating regions of Shi arrangements per Weyl cone. Eur. J. Comb. 122: 104002 (2024)- [j13]Nikos Bessas
, Eleni Tzanaki, Dionisios Vavougios, Vassilis P. Plagianakos:
Implementing the Flipped Classroom Model in Science Lessons for Junior High School Students. Int. J. Emerg. Technol. Learn. 19(3): 4-21 (2024) - [j12]Eleni Tzanaki, Nikos Bessas, Dionisios Vavougios, Vassilis P. Plagianakos:
An Interdisciplinary Educational Proposal in Junior High School: The Fractal Geometry in Science, Computer Science and Art Lessons. Int. J. Emerg. Technol. Learn. 19(3): 35-45 (2024) - 2022
- [j11]Myrto Kallipoliti, Robin Sulzgruber, Eleni Tzanaki:
Patterns in Shi Tableaux and Dyck Paths. Order 39(2): 263-289 (2022)
2010 – 2019
- 2018
- [j10]Myrto Kallipoliti, Eleni Tzanaki:
Bijections between generalized Catalan families of types A and C. Discret. Math. 341(9): 2448-2464 (2018) - 2017
- [j9]Fabio Enrique Brochero Martínez, Theodoulos Garefalakis, Lucas Reis, Eleni Tzanaki:
On the multiplicative order of the roots of bXqr+1 - aXqr - dX - c. Finite Fields Their Appl. 47: 33-45 (2017) - 2016
- [j8]Menelaos I. Karavelas, Eleni Tzanaki:
The Maximum Number of Faces of the Minkowski Sum of Two Convex Polytopes. Discret. Comput. Geom. 55(4): 748-785 (2016) - [j7]Menelaos I. Karavelas, Eleni Tzanaki:
A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes. Discret. Comput. Geom. 56(4): 966-1017 (2016) - 2015
- [j6]Menelaos I. Karavelas, Christos Konaxis, Eleni Tzanaki:
The maximum number of faces of the Minkowski sum of three convex polytopes. J. Comput. Geom. 6(1): 21-74 (2015) - [c4]Menelaos I. Karavelas, Eleni Tzanaki:
A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes. SoCG 2015: 81-95 - [i5]Menelaos I. Karavelas, Eleni Tzanaki:
A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes. CoRR abs/1502.02265 (2015) - 2014
- [j5]Alessandro Conflitti, Ricardo Mamede, Eleni Tzanaki:
Dominant Shi regions with a fixed separating wall: bijective enumeration. Australas. J Comb. 60: 198-207 (2014) - 2013
- [j4]Susanna Fishel, Myrto Kallipoliti, Eleni Tzanaki:
Facets of the Generalized Cluster Complex and Regions in the Extended Catalan Arrangement of Type A. Electron. J. Comb. 20(4): 7 (2013) - [j3]Menelaos I. Karavelas, Raimund Seidel, Eleni Tzanaki:
Convex hulls of spheres and convex hulls of disjoint convex polytopes. Comput. Geom. 46(6): 615-630 (2013) - [c3]Menelaos I. Karavelas, Christos Konaxis, Eleni Tzanaki:
The maximum number of faces of the minkowski sum of three convex polytopes. SoCG 2013: 187-196 - 2012
- [c2]Menelaos I. Karavelas, Eleni Tzanaki:
The maximum number of faces of the Minkowski sum of two convex polytopes. SODA 2012: 11-28 - [i4]Menelaos I. Karavelas, Christos Konaxis, Eleni Tzanaki:
The maximum number of faces of the Minkowski sum of three convex polytopes. CoRR abs/1211.6089 (2012) - 2011
- [c1]Menelaos I. Karavelas, Eleni Tzanaki:
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes. SCG 2011: 397-406 - [i3]Menelaos I. Karavelas, Eleni Tzanaki:
The maximum number of faces of the Minkowski sum of two convex polytopes. CoRR abs/1106.6254 (2011) - [i2]Menelaos I. Karavelas, Eleni Tzanaki:
Tight lower bounds on the number of faces of the Minkowski sum of convex polytopes via the Cayley trick. CoRR abs/1112.1535 (2011)
2000 – 2009
- 2009
- [i1]Menelaos I. Karavelas, Eleni Tzanaki:
Convex hulls of hyperspheres and convex hulls of convex polytopes lying on parallel hyperplanes. CoRR abs/0911.5086 (2009) - 2008
- [j2]Eleni Tzanaki:
Faces of Generalized Cluster Complexes and Noncrossing Partitions. SIAM J. Discret. Math. 22(1): 15-30 (2008) - 2006
- [j1]Eleni Tzanaki:
Polygon dissections and some generalizations of cluster complexes. J. Comb. Theory A 113(6): 1189-1198 (2006)
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-08-03 21:10 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:
