default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAristidis Sapounakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Ioannis Tasoulas, Kostas Manes, Aristidis Sapounakis:
Hamiltonian Intervals in the Lattice of Binary Paths. Electron. J. Comb. 31(1) (2024)- 2020
- [j16]Ioannis Tasoulas, Kostas Manes, Aristidis Sapounakis, Panagiotis Tsikouras:
Chains with Small Intervals in the Lattice of Binary Paths. J. Integer Seq. 23(1): 20.1.5 (2020)
2010 – 2019
- 2019
- [j15]Kostas Manes, Ioannis Tasoulas, Aristidis Sapounakis, Panagiotis Tsikouras:
Counting pairs of noncrossing binary paths: A bijective approach. Discret. Math. 342(2): 352-359 (2019) - 2016
- [j14]Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Equivalence classes of ballot paths modulo strings of length 2 and 3. Discret. Math. 339(10): 2557-2572 (2016) - 2014
- [j13]Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Nonleft peaks in Dyck paths: A combinatorial approach. Discret. Math. 337: 97-105 (2014) - 2012
- [j12]Aristidis Sapounakis, Panagiotis Tsikouras, Ioannis Tasoulas, Kostas Manes:
Strings of Length 3 in Grand-Dyck Paths and the Chung-Feller Property. Electron. J. Comb. 19(2): 2 (2012) - 2011
- [j11]Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
General Results on the Enumeration of Strings in Dyck Paths. Electron. J. Comb. 18(1) (2011)
2000 – 2009
- 2009
- [j10]Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Enumeration of strings in Dyck paths: A bijective approach. Discret. Math. 309(10): 3032-3039 (2009) - 2007
- [j9]Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Some strings in Dyck paths. Australas. J Comb. 39: 49-72 (2007) - [j8]Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Counting strings in Dyck paths. Discret. Math. 307(23): 2909-2924 (2007) - 2006
- [j7]Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Ordered trees and the inorder traversal. Discret. Math. 306(15): 1732-1741 (2006) - 2005
- [j6]Aristidis Sapounakis, Panagiotis Tsikouras:
Counting peaks and valleys in k-colored Motzkin paths. Electron. J. Comb. 12 (2005) - 2004
- [j5]Aristidis Sapounakis, Panagiotis Tsikouras:
On the enumeration of noncrossing partitions with fixed points. Ars Comb. 73 (2004) - 2003
- [j4]Aristidis Sapounakis, Panagiotis Tsikouras:
Noncrossing partitions with fixed points. Australas. J Comb. 28: 263-272 (2003) - [j3]A. Panayotopoulos, Aristidis Sapounakis:
On Motzkin words and noncrossing partitions. Ars Comb. 69 (2003)
1990 – 1999
- 1999
- [j2]A. Panayotopoulos, Aristidis Sapounakis, Panagiotis Tsikouras:
Matching generalized nested sets. Australas. J Comb. 20: 25-36 (1999) - 1997
- [j1]A. Panayotopoulos, Aristidis Sapounakis, Panagiotis Tsikouras:
The matching property of nested sets. Australas. J Comb. 15: 17-24 (1997)
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-04-24 23:16 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:
