Ioannis Tasoulas

According to our database, Ioannis Tasoulas authored at least 12 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of seven.
• Erdős number of seven.

2024

Hamiltonian Intervals in the Lattice of Binary Paths.

Ioannis Tasoulas, Kostas Manes, Aristidis Sapounakis

Electron. J. Comb., 2024

2020

Chains with Small Intervals in the Lattice of Binary Paths.

Ioannis Tasoulas, Kostas Manes, Aristidis Sapounakis, Panagiotis Tsikouras

J. Integer Seq., 2020

2019

Counting pairs of noncrossing binary paths: A bijective approach.

Kostas Manes, Ioannis Tasoulas, Aristidis Sapounakis, Panagiotis Tsikouras

Discret. Math., 2019

2016

Equivalence classes of ballot paths modulo strings of length 2 and 3.

Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras

Discret. Math., 2016

2014

Nonleft peaks in Dyck paths: A combinatorial approach.

Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras

Discret. Math., 2014

The average number of times a stack exceeds a certain size.

Kostas Manes, Ioannis Tasoulas

Proceedings of the 5th International Conference on Information, 2014

2012

Strings of Length 3 in Grand-Dyck Paths and the Chung-Feller Property.

Aristidis Sapounakis, Panagiotis Tsikouras, Ioannis Tasoulas, Kostas Manes

Electron. J. Comb., 2012

2011

General Results on the Enumeration of Strings in Dyck Paths.

Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras

Electron. J. Comb., 2011

2009

Enumeration of strings in Dyck paths: A bijective approach.

Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras

Discret. Math., 2009

2007

Counting strings in Dyck paths.

Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras

Discret. Math., 2007

Some strings in Dyck paths.

Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras

Australas. J Comb., 2007

2006

Ordered trees and the inorder traversal.

Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras

Discret. Math., 2006