default search action
Robert F. Cohen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j11]Ian M. Fingerman, Xuan Zhang, Walter Ratzat, Nora Husain, Robert F. Cohen, Gregory D. Schuler:
NCBI Epigenomics: What's new for 2013. Nucleic Acids Res. 41(Database-Issue): 221-225 (2013) - 2012
- [c24]Jaime L'Heureux, Deborah Boisvert, Robert F. Cohen, Kamaljeet Sanghera:
IT problem solving: an implementation of computational thinking in information technology. SIGITE Conference 2012: 183-188 - 2011
- [j10]Ian M. Fingerman, Lee McDaniel, Xuan Zhang, Walter Ratzat, Tarek Hassan, Zhifang Jiang, Robert F. Cohen, Gregory D. Schuler:
NCBI Epigenomics: a new public resource for exploring epigenomic data sets. Nucleic Acids Res. 39(Database-Issue): 908-912 (2011)
2000 – 2009
- 2007
- [c23]Matt Calder, Robert F. Cohen, Jessica A. Lanzoni, Neal Landry, Joelle Skaff:
Teaching data structures to students who are blind. ITiCSE 2007: 87-90 - 2006
- [c22]Robert F. Cohen, Valerie Haven, Jessica A. Lanzoni, Arthur Meacham, Joelle Skaff, Michael Wissell:
Using an audio interface to assist users Who are visually impaired with steering tasks. ASSETS 2006: 119-124 - [c21]Matt Calder, Robert F. Cohen, Jessica A. Lanzoni, Yun Xu:
PLUMB: : an interface for users who are blind to display, create, and modify graphs. ASSETS 2006: 263-264 - [c20]Brian J. Rosmaita, Katherine Deibel
, Robert F. Cohen, Mary Anne L. Egan:
Accessibility and computer science education. SIGCSE 2006: 63-64 - [c19]Robert F. Cohen, Arthur Meacham, Joelle Skaff:
Teaching graphs to visually impaired students using an active auditory interface. SIGCSE 2006: 279-282 - [c18]Deborah Boisvert, Robert F. Cohen, Oscar Gutierrez, Joyce LaTulippe:
Achieving a regional process for curriculum development. SIGITE Conference 2006: 59-64 - 2005
- [c17]Robert F. Cohen, Rui Yu, Arthur Meacham, Joelle Skaff:
PLUMB: displaying graphs to the blind using an active auditory interface. ASSETS 2005: 182-183 - [c16]Robert F. Cohen, Alexander V. Fairley, David Gerry, Gustavo R. Lima:
Accessibility in introductory computer science. SIGCSE 2005: 17-21 - 2004
- [c15]Robert F. Cohen, Deborah Boisvert:
Aligning programming education between community colleges and universities. SIGITE Conference 2004: 224-226 - 2003
- [c14]Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos, Robert F. Cohen:
Authenticated Data Structures for Graph and Geometric Searching. CT-RSA 2003: 295-313 - 2002
- [j9]Tim Menzies, Robert F. Cohen, Sam Waugh, Simon Goss:
Applications of Abduction: Testing Very Long Qualitative Simulations. IEEE Trans. Knowl. Data Eng. 14(6): 1362-1375 (2002)
1990 – 1999
- 1998
- [j8]Mao Lin Huang
WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping. Comput. Networks 30(1-7): 638-642 (1998) - 1997
- [j7]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
Three-Dimensional Graph Drawing. Algorithmica 17(2): 199-208 (1997) - [j6]Robert F. Cohen, Roberto Tamassia:
Combine and Conquer. Algorithmica 18(3): 324-362 (1997) - [j5]Helen C. Purchase
An Experimental Study of the Basis for Graph Drawing Algorithms. ACM J. Exp. Algorithmics 2: 4 (1997) - [c13]Tim Menzies, Robert F. Cohen:
A Graph Theoretic Optimisation of Temporal Abductive Validation. EUROVAV 1997: 55-68 - [c12]Peter Eades, Robert F. Cohen, Mao Lin Huang
Online Animated Graph Drawing for Web Navigation. GD 1997: 330-335 - 1995
- [j4]Robert F. Cohen, Roberto Tamassia:
Dynamic Expression Trees. Algorithmica 13(3): 245-265 (1995) - [j3]Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. SIAM J. Comput. 24(5): 970-1001 (1995) - [c11]Qing-Wen Feng, Robert F. Cohen, Peter Eades:
How to Draw a Planar Clustered Graph. COCOON 1995: 21-30 - [c10]Qing-Wen Feng, Robert F. Cohen, Peter Eades:
Planarity for Clustered Graphs. ESA 1995: 213-226 - [c9]Helen C. Purchase
Validating Graph Drawing Aesthetics. GD 1995: 435-446 - 1994
- [j2]Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph. Int. J. Comput. Geom. Appl. 4(4): 385-402 (1994) - [c8]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey:
Volume upper bounds for 3D graph drawing. CASCON 1994: 11 - [c7]Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
Three-Dimensional Graph Drawing. GD 1994: 1-11 - 1993
- [j1]Robert F. Cohen:
Dynamic graph drawing (abstract). SIGACT News 24(1): 60 (1993) - [c6]Robert F. Cohen, Roberto Tamassia:
Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract). ESA 1993: 97-108 - [c5]Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter:
Dynamic algorithms for optimization problems in bounded tree-width graphs. IPCO 1993: 99-112 - [c4]Robert F. Cohen, Giuseppe Di Battista, Arkady Kanevsky, Roberto Tamassia:
Reinventing the wheel: an optimal data structure for connectivity queries. STOC 1993: 194-200 - 1992
- [c3]Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis, Paola Bertolazzi:
A Framework for Dynamic Graph Drawing. SCG 1992: 261-270 - [c2]Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis:
How to Draw a Series-Parallel Digraph (Extended Abstract). SWAT 1992: 272-283 - 1991
- [c1]Robert F. Cohen, Roberto Tamassia:
Dynamic Expression Trees and their Applications (Extended Abstract). SODA 1991: 52-61
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 23:07 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: