default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean Flower
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j8]Martin Marinov
, Marco Amagliani, Tristan Barback, Jean Flower, Stephen A. Barley, Suguru Furuta, Peter Charrot, Iain Henley, Nanda Santhanam, G. Thomas Finnigan, Siavash Meshkat, Justin Hallet, Maciej Sapun, Pawel Wolski:
Generative Design Conversion to Editable and Watertight Boundary Representation. Comput. Aided Des. 115: 194-205 (2019)- 2014
- [j7]Peter Rodgers, Gem Stapleton, Jean Flower, John Howse:
Drawing Area-Proportional Euler Diagrams Representing Up To Three Sets. IEEE Trans. Vis. Comput. Graph. 20(1): 1 (2014) - [j6]Jean Flower, Gem Stapleton, Peter Rodgers:
On the drawability of 3D Venn and Euler diagrams. J. Vis. Lang. Comput. 25(3): 186-209 (2014) - 2012
- [j5]Gem Stapleton, Jean Flower, Peter J. Rodgers, John Howse:
Automatically drawing Euler diagrams with circles. J. Vis. Lang. Comput. 23(3): 163-193 (2012) - [c17]Peter J. Rodgers, Jean Flower, Gem Stapleton:
Introducing 3D Venn and Euler Diagrams. ED@Diagrams 2012: 92-106 - [c16]Matej Urbas, Mateja Jamnik, Gem Stapleton, Jean Flower:
Speedith: A Diagrammatic Reasoner for Spider Diagrams. Diagrams 2012: 163-177 - 2010
- [c15]Peter Rodgers, Jean Flower, Gem Stapleton, John Howse:
Drawing Area-Proportional Venn-3 Diagrams with Convex Polygons. Diagrams 2010: 54-68
2000 – 2009
- 2009
- [c14]Peter Rodgers, Jean Flower, Gem Stapleton, John Howse:
Some Results for Drawing Area Proportional Venn3 With Convex Curves. IV 2009: 667-672 - 2008
- [j4]Jean Flower, Andrew Fish, John Howse:
Euler diagram generation. J. Vis. Lang. Comput. 19(6): 675-694 (2008) - [c13]Andrew Fish, Jean Flower:
Euler Diagram Decomposition. Diagrams 2008: 28-44 - 2007
- [j3]Gem Stapleton, Judith Masthoff, Jean Flower, Andrew Fish, Jane Southern:
Automated Theorem Proving in Euler Diagram Systems. J. Autom. Reason. 39(4): 431-470 (2007) - 2005
- [j2]Andrew Fish, Jean Flower, John Howse:
The semantics of augmented constraint diagrams. J. Vis. Lang. Comput. 16(6): 541-573 (2005) - 2004
- [j1]Jean Flower, John Howse, John Taylor:
Nesting in Euler Diagrams: syntax, semantics and construction. Softw. Syst. Model. 3(1): 55-67 (2004) - [c12]Paul Mutton, Peter Rodgers, Jean Flower:
Drawing Graphs in Euler Diagrams. Diagrams 2004: 66-81 - [c11]Jean Flower, Judith Masthoff, Gem Stapleton:
Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams. Diagrams 2004: 166-181 - [c10]Peter Rodgers, Paul Mutton, Jean Flower:
Dynamic Euler Diagram Drawing. VL/HCC 2004: 147-156 - [c9]Andrew Fish, Jean Flower:
Investigating Reasoning with Constraint Diagrams. VLFM 2004: 53-69 - [c8]Andrew Fish, Jean Flower:
Abstractions of Euler Diagrams. Euler 2004: 77-101 - [c7]Jean Flower, Gem Stapleton:
Automated Theorem Proving with Spider Diagrams. CATS 2004: 246-263 - 2003
- [c6]Jean Flower, Peter Rodgers, Paul Mutton:
Layout Metrics for Euler Diagrams. IV 2003: 272-280 - [c5]Andrew Fish, Jean Flower, John Howse:
A reading algorithm for constraint diagrams. HCC 2003: 161-168 - 2002
- [c4]Jean Flower, John Howse:
Generating Euler Diagrams. Diagrams 2002: 61-75 - [c3]John Howse, Gemma Stapleton, Jean Flower, John Taylor:
Corresponding Regions in Euler Diagrams. Diagrams 2002: 76-90 - [c2]Jean Flower, John Howse, John Taylor, Stuart Kent:
A Visual Framework for Modelling with Heterogeneous Notations. HCC 2002: 71-73 - [c1]Jean Flower, John Howse, John Taylor:
Nesting in Euler Diagrams. GT-VMT@ICGT 2002: 93-102
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-01-09 12:58 CET 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:
