default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSean Cleary
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Sean Cleary:
Restricted rotation distance between k-ary trees. J. Graph Algorithms Appl. 27(1): 19-33 (2023)- 2022
- [j10]Sean Cleary
, Haris Nadeem:
Distributions of restricted rotation distances. Art Discret. Appl. Math. 5(1) (2022) - 2020
- [i5]Sean Cleary, Roland Maio:
Counting difficult tree pairs with respect to the rotation distance problem. CoRR abs/2001.06407 (2020) - [i4]Sean Cleary, Roland Maio:
An efficient sampling algorithm for difficult tree pairs. CoRR abs/2001.06422 (2020) - [i3]Sean Cleary, Haris Nadeem:
Distributions of restricted rotation distances. CoRR abs/2005.00518 (2020)
2010 – 2019
- 2018
- [j9]Sean Cleary, Roland Maio:
Edge Conflicts do not Determine Geodesics in the Associahedron. SIAM J. Discret. Math. 32(2): 1003-1015 (2018) - 2013
- [j8]Sean Cleary, Andrew Rechnitzer, Thomas Wong:
Common Edges in Rooted Trees and Polygonal Triangulations. Electron. J. Comb. 20(1): 39 (2013) - 2010
- [j7]Sean Cleary, Katherine St. John:
A Linear-Time Approximation Algorithm for Rotation Distance. J. Graph Algorithms Appl. 14(2): 385-390 (2010)
2000 – 2009
- 2009
- [j6]Sean Cleary, Katherine St. John:
Rotation distance is fixed-parameter tractable. Inf. Process. Lett. 109(16): 918-922 (2009) - [i2]Sean Cleary, Katherine St. John:
Rotation Distance is Fixed-Parameter Tractable. CoRR abs/0903.0197 (2009) - [i1]Sean Cleary, Katherine St. John:
A Linear-Time Approximation Algorithm for Rotation Distance. CoRR abs/0903.0199 (2009) - 2007
- [j5]Sean Cleary, Jennifer Taback:
Bounding Right-Arm Rotation Distances. Int. J. Algebra Comput. 17(2): 369-399 (2007) - [j4]Sean Cleary, Fabrizio Luccio, Linda Pagli:
Refined upper bounds for right-arm rotation distances. Theor. Comput. Sci. 377(1-3): 277-281 (2007) - 2004
- [j3]Gilbert Baumslag, Sean Cleary, George Havas:
Experimenting with Infinite Groups, I. Exp. Math. 13(4): 495-502 (2004) - 2003
- [j2]Sean Cleary, Jennifer Taback:
Bounding restricted rotation distance. Inf. Process. Lett. 88(5): 251-256 (2003) - 2002
- [j1]Sean Cleary:
Restricted rotation distance between binary trees. Inf. Process. Lett. 84(6): 333-338 (2002)
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 22:48 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:
