default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid E. Brown
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]David E. Brown, David Skidmore
:
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams. Theory Comput. Syst. 67(6): 1307-1332 (2023)
2010 – 2019
- 2018
- [j8]David E. Brown, Breeann Flesch, Larry J. Langley:
Interval k-Graphs and Orders. Order 35(3): 495-514 (2018) - [c4]Dor Abrahamson, Alejandro Andrade, Oskar Lindwall, Arthur Bakker, Mitchell J. Nathan, Candace A. Walkington, Robb Lindgren, David E. Brown, Asnat R. Zohar, Sharona T. Levy, Joshua A. Danish, Adam Maltese, Noel Enyedy, Megan Humburg, Asmalina Saleh, Maggie Dahn, Christine Lee, Xintian Tu, Bria Davis, Chris Georgen:
Moving Forward: In Search of Synergy Across Diverse Views on the Role of Physical Movement in Design for STEM Education. ICLS 2018 - [c3]Nitasha Mathayas, David E. Brown:
Exploring Multimodal Scaffolds Supporting Middle School Students' Construction of Causal-Mechanistic Scientific Explanations. ICLS 2018 - 2016
- [c2]Robb Lindgren, Robert C. Wallon, David E. Brown, Nitasha Mathayas, Nathan Kimball:
"Show Me" What You Mean: Learning and Design Implications of Eliciting Gesture in Student Explanations. ICLS 2016 - 2014
- [j7]David E. Brown, Breeann Flesch, J. Richard Lundgren:
A characterization of 2-tree probe interval graphs. Discuss. Math. Graph Theory 34(3): 509-527 (2014) - 2012
- [j6]David E. Brown, Larry J. Langley:
Forbidden subgraph characterization of bipartite unit probe interval graphs. Australas. J Comb. 52: 19-32 (2012) - 2011
- [c1]Stella Vosniadou, Michellene T. H. Chi, Stellan Ohlsson, David G. Cosejo, David E. Brown, Nancy J. Nerserssian:
New Approaches to the Problem of Conceptual Change in the Learning of Science and Math. CogSci 2011 - 2010
- [j5]David E. Brown, Arthur H. Busch, Garth Isaak:
Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs. Discret. Math. Theor. Comput. Sci. 12(5): 63-82 (2010)
2000 – 2009
- 2009
- [j4]David E. Brown, J. Richard Lundgren, Li Sheng:
A characterization of cycle-free unit probe interval graphs. Discret. Appl. Math. 157(4): 762-767 (2009) - [j3]LeRoy B. Beasley, David E. Brown, K. Brooks Reid:
Extending partial tournaments. Math. Comput. Model. 50(1-2): 287-291 (2009) - [p1]David E. Brown, Larry J. Langley:
Probe Interval Orders. The Mathematics of Preference, Choice and Order 2009: 313-322 - 2007
- [j2]David E. Brown, Arthur H. Busch, J. Richard Lundgren:
Interval Tournaments. J. Graph Theory 56(1): 72-81 (2007) - 2006
- [j1]David E. Brown, J. Richard Lundgren:
Bipartite probe interval graphs, circular arc graphs, and interval point bigraphs. Australas. J Comb. 35: 221-236 (2006)
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:21 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:
