default search action
Elena Mumford
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j7]David Eppstein, Elena Mumford:
Steinitz Theorems for Simple Orthogonal Polyhedra. J. Comput. Geom. 5(1): 179-244 (2014) - 2013
- [j6]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
:
Optimal 3D Angular Resolution for Low-Degree Graphs. J. Graph Algorithms Appl. 17(3): 173-200 (2013) - 2012
- [j5]David Eppstein, Elena Mumford, Bettina Speckmann
Area-Universal and Constrained Rectangular Layouts. SIAM J. Comput. 41(3): 537-564 (2012) - 2011
- [j4]Maarten Löffler, Elena Mumford:
Connected Rectilinear Graphs on Point Sets. J. Comput. Geom. 2(1): 1-15 (2011) - 2010
- [j3]Mark de Berg, Elena Mumford, Bettina Speckmann
Optimal BSPs and Rectilinear Cartograms. Int. J. Comput. Geom. Appl. 20(2): 203-222 (2010) - [c10]David Eppstein, Elena Mumford:
Steinitz theorems for orthogonal polyhedra. SCG 2010: 429-438 - [c9]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg
Optimal 3D Angular Resolution for Low-Degree Graphs. GD 2010: 208-219 - [i6]David Eppstein, Maarten Löffler, Elena Mumford, Martin Nöllenburg:
Optimal 3D Angular Resolution for Low-Degree Graphs. CoRR abs/1009.0045 (2010)
2000 – 2009
- 2009
- [j2]David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
Edges and switches, tunnels and bridges. Comput. Geom. 42(8): 790-802 (2009) - [j1]Mark de Berg, Elena Mumford, Bettina Speckmann
On rectilinear duals for vertex-weighted plane graphs. Discret. Math. 309(7): 1794-1812 (2009) - [c8]David Eppstein, Elena Mumford, Bettina Speckmann
Area-universal rectangular layouts. SCG 2009: 267-276 - [c7]David Eppstein, Elena Mumford:
Self-overlapping curves revisited. SODA 2009: 160-169 - [c6]David Eppstein, Elena Mumford:
Orientation-Constrained Rectangular Layouts. WADS 2009: 266-277 - [i5]David Eppstein, Elena Mumford, Bettina Speckmann, Kevin Verbeek:
Area-Universal Rectangular Layouts. CoRR abs/0901.3924 (2009) - [i4]David Eppstein, Elena Mumford:
Orientation-Constrained Rectangular Layouts. CoRR abs/0904.4312 (2009) - [i3]David Eppstein, Elena Mumford:
Steinitz Theorems for Orthogonal Polyhedra. CoRR abs/0912.0537 (2009) - 2008
- [c5]Maarten Löffler, Elena Mumford:
Connected Rectilinear Graphs on Point Sets. GD 2008: 313-318 - [c4]Boris Aronov, Mark de Berg, Chris Gray, Elena Mumford:
Cutting cycles of rods in space: hardness and approximation. SODA 2008: 1241-1248 - [i2]David Eppstein, Elena Mumford:
Self-overlapping Curves Revisited. CoRR abs/0806.1724 (2008) - 2007
- [c3]David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
Edges and Switches, Tunnels and Bridges. WADS 2007: 77-88 - [i1]David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann:
Edges and Switches, Tunnels and Bridges. CoRR abs/0705.0413 (2007) - 2006
- [c2]Mark de Berg, Elena Mumford, Bettina Speckmann
Optimal BSPs and rectilinear cartograms. GIS 2006: 19-26 - 2005
- [c1]Mark de Berg, Elena Mumford, Bettina Speckmann
On Rectilinear Duals for Vertex-Weighted Plane Graphs. GD 2005: 61-72
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-05-08 21:46 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: