Sean Cleary

According to our database, Sean Cleary authored at least 13 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Restricted rotation distance between k-ary trees.

Sean Cleary

J. Graph Algorithms Appl., 2023

2022

Distributions of restricted rotation distances.

Sean Cleary, Haris Nadeem

Art Discret. Appl. Math., 2022

2020

An efficient sampling algorithm for difficult tree pairs.

Sean Cleary, Roland Maio

CoRR, 2020

Counting difficult tree pairs with respect to the rotation distance problem.

Sean Cleary, Roland Maio

CoRR, 2020

2018

Edge Conflicts do not Determine Geodesics in the Associahedron.

Sean Cleary, Roland Maio

SIAM J. Discret. Math., 2018

2013

Common Edges in Rooted Trees and Polygonal Triangulations.

Sean Cleary, Andrew Rechnitzer, Thomas Wong

Electron. J. Comb., 2013

2010

A Linear-Time Approximation Algorithm for Rotation Distance.

Sean Cleary, Katherine St. John

J. Graph Algorithms Appl., 2010

2009

Rotation distance is fixed-parameter tractable.

Sean Cleary, Katherine St. John

Inf. Process. Lett., 2009

2007

Refined upper bounds for right-arm rotation distances.

Sean Cleary, Fabrizio Luccio, Linda Pagli

Theor. Comput. Sci., 2007

Bounding Right-Arm Rotation Distances.

Sean Cleary, Jennifer Taback

Int. J. Algebra Comput., 2007

2004

Experimenting with Infinite Groups, I.

Gilbert Baumslag, Sean Cleary, George Havas

Exp. Math., 2004

2003

Bounding restricted rotation distance.

Sean Cleary, Jennifer Taback

Inf. Process. Lett., 2003

2002

Restricted rotation distance between binary trees.

Sean Cleary

Inf. Process. Lett., 2002