default search action
Timothy R. S. Walsh
Person information
- affiliation: Université du Québec à Montréal, QC, Canada
Other persons with the same name
- Timothy Walsh 0002 — Georgetown University, Washington, DC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j30]Yingbo Shen, Rong Zhang
, Dongyan Shao
Genomic Shift in Population Dynamics of mcr-1-positive Escherichia coli in Human Carriage. Genom. Proteom. Bioinform. 20(6): 1168-1179 (2022)
2010 – 2019
- 2019
- [j29]Valery A. Liskovets
Corrigendum to "Enumeration of eulerian and unicursal planar maps" [Discrete Math. 282 (2004) 208-221]. Discret. Math. 342(7): 2162-2163 (2019) - 2018
- [j28]Alain Giorgetti, Timothy R. S. Walsh:
Enumeration of hypermaps of a given genus. Ars Math. Contemp. 15(1): 225-266 (2018) - 2015
- [j27]Timothy R. Walsh:
Space-Efficient Generation of Nonisomorphic Maps and Hypermaps. J. Integer Seq. 18(4): 15.4.3 (2015) - 2014
- [j26]Timothy R. S. Walsh, Alain Giorgetti:
Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices. Ars Math. Contemp. 7(2): 263-280 (2014) - 2013
- [j25]Timothy R. Walsh:
Counting maps on doughnuts. Theor. Comput. Sci. 502: 4-15 (2013) - 2012
- [j24]Timothy R. S. Walsh, Alain Giorgetti
Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices. Discret. Math. 312(17): 2660-2671 (2012)
2000 – 2009
- 2009
- [j23]Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh:
Structure and enumeration of two-connected graphs with prescribed three-connected components. Adv. Appl. Math. 43(1): 46-74 (2009) - 2007
- [i1]Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh:
Two-connected graphs with prescribed three-connected components. CoRR abs/0712.1869 (2007) - 2006
- [j22]Valery A. Liskovets
Counting unrooted maps on the plane. Adv. Appl. Math. 36(4): 364-387 (2006) - [j21]Vincent Vajnovszki, Timothy Walsh:
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words. J. Discrete Algorithms 4(4): 633-648 (2006) - 2005
- [j20]Timothy R. Walsh:
Efficient enumeration of sensed planar maps. Discret. Math. 293(1-3): 263-289 (2005) - [j19]Valery A. Liskovets
Counting unrooted loopless planar maps. Eur. J. Comb. 26(5): 651-663 (2005) - 2004
- [j18]Valery A. Liskovets
Enumeration of eulerian and unicursal planar maps. Discret. Math. 282(1-3): 209-221 (2004) - 2003
- [c1]Timothy Walsh:
Generating Gray Codes in O(1) Worst-Case Time per Word. DMTCS 2003: 73-88
1990 – 1999
- 1999
- [j17]Leonid M. Koganov, Valery A. Liskovets, Timothy R. S. Walsh:
Total Vertex Enumeration in Rooted Planar Maps. Ars Comb. 54 (1999) - 1998
- [j16]Timothy R. Walsh:
Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time. J. Algorithms 29(1): 165-173 (1998) - 1997
- [j15]Timothy R. Walsh:
Worst-Case Analysis of Read's Chromatic Polynomial Algorithm. Ars Comb. 46 (1997) - 1993
- [j14]Robert W. Robinson, Timothy R. S. Walsh:
Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs. J. Comb. Theory B 57(2): 289-308 (1993)
1980 – 1989
- 1988
- [j13]Timothy R. Walsh:
Efficient axis-translation of binary digital pictures by blocks in linear quadtree representation. Comput. Vis. Graph. Image Process. 41(3): 282-292 (1988) - 1987
- [j12]Edward W. Elcock, Irene Gargantini, Timothy R. Walsh:
Triangular decomposition. Image Vis. Comput. 5(3): 225-231 (1987) - [j11]M. V. S. Ramanath, Timothy R. Walsh:
Enumeration and generation of a class of regular digraphs. J. Graph Theory 11(4): 471-479 (1987) - 1986
- [j10]Irene Gargantini, Timothy R. Walsh, Oi-Lun Wu:
Viewing Transformations of Voxel-Based Objects Via Linear Octrees. IEEE Computer Graphics and Applications 6(10): 12-21 (1986) - [j9]Harvey H. Atkinson, Irene Gargantini, Timothy R. S. Walsh:
Filling by quadrants or octants. Comput. Vis. Graph. Image Process. 33(2): 138-155 (1986) - 1985
- [j8]Harvey H. Atkinson, Irene Gargantini, Timothy R. S. Walsh:
Counting regions, holes, and their nesting level in time proportional to the border. Comput. Vis. Graph. Image Process. 29(2): 196-215 (1985) - 1984
- [j7]Timothy R. Walsh:
How Evenly Should One Divide to Conquer Quickly? Inf. Process. Lett. 19(4): 203-208 (1984) - 1983
- [j6]Timothy R. Walsh:
Iteration Strikes Back - at the Cyclic Towers of Hanoi. Inf. Process. Lett. 16(2): 91-93 (1983) - 1982
- [j5]Timothy R. Walsh:
The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves. Inf. Process. Lett. 15(2): 64-67 (1982) - [j4]Timothy R. S. Walsh:
Counting labelled three-connected and homeomorphically irreducible two-connected graphs. J. Comb. Theory B 32(1): 1-11 (1982) - [j3]Timothy R. S. Walsh:
Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs. J. Comb. Theory B 32(1): 12-32 (1982) - [j2]Timothy R. S. Walsh:
Counting non-isomorphic three-connected planar maps. J. Comb. Theory B 32(1): 33-44 (1982) - [j1]Timothy R. S. Walsh:
The busy beaver on a one-way infinite tape. SIGACT News 14(1): 38-43 (1982)
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 2025-04-03 00:23 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: