default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalph Tindell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c1]Alessio Gaspar, Sarah Langevin, Naomi R. Boyer, Ralph Tindell:
A preliminary review of undergraduate programming students' perspectives on writing tests, working with others, & using peer testing. SIGITE Conference 2013: 109-114
2000 – 2009
- 2000
- [j16]Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra, Ralph Tindell:
On Isoperimetric Connectivity in Vertex-Transitive Graphs. SIAM J. Discret. Math. 13(1): 139-144 (2000)
1990 – 1999
- 1991
- [j15]Ralph Tindell:
Covering Morphisms and Unique Minimal D-Schemes. Acta Cybern. 10(1-2): 101-112 (1991) - 1990
- [j14]Yahya Ould Hamidoune, Ralph Tindell:
Vertex Transitivity and Super Line Connectedness. SIAM J. Discret. Math. 3(4): 524-530 (1990)
1980 – 1989
- 1987
- [j13]Stephen L. Bloom, Ralph Tindell:
A note on zero-congruences. Acta Cybern. 8(1): 1-4 (1987) - [j12]Appajosyula Satyanarayana, Ralph Tindell:
Chromatic polynomials and network reliability. Discret. Math. 67(1): 57-79 (1987) - 1985
- [j11]Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell:
Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks 15(2): 257-271 (1985) - 1984
- [j10]Frank Boesch, Ralph Tindell:
Circulants and their connectivities. J. Graph Theory 8(4): 487-499 (1984) - 1983
- [j9]Stephen L. Bloom, Ralph Tindell:
Varieties of "if-then-else". SIAM J. Comput. 12(4): 677-707 (1983) - 1982
- [j8]Douglas Bauer, Ralph Tindell:
Graphs isomorphic to subgraphs of their line-graphs. Discret. Math. 41(1): 1-6 (1982) - [j7]Douglas Bauer, Ralph Tindell:
The connectivities of line and total graphs. J. Graph Theory 6(2): 197-203 (1982) - 1981
- [j6]Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell:
The cohesiveness of a point of a graph. Networks 11(1): 65-68 (1981) - 1980
- [j5]Stephen L. Bloom, Ralph Tindell:
Compatible Orderings on the Metric Theory of Trees. SIAM J. Comput. 9(4): 683-691 (1980)
1970 – 1979
- 1979
- [j4]Douglas Bauer, Ralph Tindell:
Graphs with prescribed connectivity and line graph connectivity. J. Graph Theory 3(4): 393-395 (1979) - [j3]Stephen L. Bloom, Ralph Tindell:
Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes. Theor. Comput. Sci. 9: 265-286 (1979) - 1978
- [j2]Calvin C. Elgot, Stephen L. Bloom, Ralph Tindell:
On the Algebraic Atructure of Rooted Trees. J. Comput. Syst. Sci. 16(3): 362-399 (1978) - 1977
- [j1]Francis T. Boesch, Charles L. Suffel, Ralph Tindell:
The spanning subgraphs of eulerian graphs. J. Graph Theory 1(1): 79-84 (1977)
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-25 05:52 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:
