default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarshall W. Bern
Person information
- affiliation: Palo Alto Research Center Incorporated, PARC, California, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2011
[j42]Marshall W. Bern, Barry Hayes:
Origami Embedding of Piecewise-Linear Two-Manifolds. Algorithmica 59(1): 3-15 (2011)- [c50]Swapnil Bhatia
, Yong J. Kil, Beatrix Ueberheide, Brian T. Chait, Lemmuel Lara Tayo, Lourdes J. Cruz, Bingwen Lu, John R. Yates III, Marshall W. Bern:
Constrained De Novo Sequencing of Peptides with Application to Conotoxins. RECOMB 2011: 16-30 - [c49]Ying Zhang, Marshall W. Bern, Juan Liu, Kurt Partridge, Bo Begole, Bob Moore, Jim Reich, Koji Kishimoto:
Ubiquitous Meeting Facilitator with Playful Real-Time User Interface. UIC 2011: 3-11 - 2010
- [c48]Ying Zhang, Marshall W. Bern, Juan Liu, Kurt Partridge, Bo Begole, Bob Moore, Jim Reich, Koji Kishimoto:
Facilitating meetings with playful feedback. CHI Extended Abstracts 2010: 4033-4038
2000 – 2009
- 2009
- [j41]David Goldberg, Marshall W. Bern, Simon J. North, Stuart M. Haslam, Anne Dell:
Glycan family analysis for deducing N-glycan topology from single MS. Bioinform. 25(3): 365-371 (2009) - [j40]Ritendra Datta, Marshall W. Bern:
Spectrum Fusion: Using Multiple Mass Spectra for De Novo Peptide Sequencing. J. Comput. Biol. 16(8): 1169-1182 (2009) - 2008
- [j39]Marshall W. Bern, David Goldberg:
Improved Ranking Functions for Protein and Modification-Site Identifications. J. Comput. Biol. 15(7): 705-719 (2008) - [c47]Koji Yatani, Kurt Partridge, Marshall W. Bern, Mark W. Newman:
Escape: a target selection technique using visually-cued gestures. CHI 2008: 285-294 - [c46]Marshall W. Bern, Barry Hayes:
Origami Embedding of Piecewise-Linear Two-Manifolds. LATIN 2008: 617-629 - [c45]Ritendra Datta, Marshall W. Bern:
Spectrum Fusion: Using Multiple Mass Spectra for De Novo Peptide Sequencing. RECOMB 2008: 140-153 - 2007
- [j38]Leonardo B. Oliveira, Adrian Carlos Ferreira, Marcos Aurélio Vilaça, Hao Chi Wong, Marshall W. Bern, Ricardo Dahab, Antonio Alfredo Ferreira Loureiro:
SecLEACH - On the security of clustered sensor networks. Signal Process. 87(12): 2882-2895 (2007) - [c44]Marshall W. Bern, David Goldberg:
Improved Ranking Functions for Protein and Modification-Site Identifications. RECOMB 2007: 444-458 - 2006
- [j37]Marshall W. Bern, David Goldberg:
De Novo Analysis of Peptide Tandem Mass Spectra by Spectral Graph Partitioning. J. Comput. Biol. 13(2): 364-378 (2006) - [j36]Marshall W. Bern, John R. Gilbert, Bruce Hendrickson, Nhat Nguyen, Sivan Toledo:
Support-Graph Preconditioners. SIAM J. Matrix Anal. Appl. 27(4): 930-951 (2006) - [c43]Leonardo B. Oliveira, Hao Chi Wong, Marshall W. Bern, Ricardo Dahab, Antonio Alfredo Ferreira Loureiro:
SecLEACH - A Random Key Distribution Solution for Securing Clustered Sensor Networks. NCA 2006: 145-154 - 2005
- [c42]Marshall W. Bern, Jindong Chen, Hao Chi Wong:
Avoiding Local Optima in Single Particle Reconstruction. RECOMB 2005: 118-132 - [c41]Marshall W. Bern, David Goldberg:
EigenMS: De Novo Analysis of Peptide Tandem Mass Spectra by Spectral Graph Partitioning. RECOMB 2005: 357-372 - 2004
- [j35]David Goldberg, Christopher Malon, Marshall W. Bern:
A global approach to automatic solution of jigsaw puzzles. Comput. Geom. 28(2-3): 165-174 (2004) - [c40]Marshall W. Bern, David Goldberg, W. Hayes McDonald, John R. Yates III:
Automatic Quality Assessment of Peptide Tandem Mass Spectra. ISMB/ECCB (Supplement of Bioinformatics) 2004: 49-54 - [r1]Marshall W. Bern:
Triangulations and Mesh Generation. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 563-582 - 2003
- [j34]Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink:
Ununfoldable polyhedra with convex faces. Comput. Geom. 24(2): 51-62 (2003) - [c39]Marshall W. Bern, David Eppstein:
Optimized color gamuts for tiled displays. SCG 2003: 274-281 - [c38]Marshall W. Bern, David Eppstein:
Möbius-invariant natural neighbor interpolation. SODA 2003: 128-129 - 2002
- [j33]David Eppstein, Marshall W. Bern, Brad L. Hutchings:
Algorithms for Coloring Quadtrees. Algorithmica 32(1): 87-94 (2002) - [j32]Marshall W. Bern, David Eppstein:
Multivariate Regression Depth. Discret. Comput. Geom. 28(1): 1-17 (2002) - [j31]Marshall W. Bern, David Eppstein, Jeff Erickson:
Flipping Cubical Meshes. Eng. Comput. 18(3): 173-187 (2002) - [c37]Marshall W. Bern, David Goldberg:
Paper position sensing. SCG 2002: 74-81 - [c36]David Goldberg, Christopher Malon, Marshall W. Bern:
A global approach to automatic solution of jigsaw puzzles. SCG 2002: 82-87 - [c35]Chi Wong, Marshall W. Bern, David Goldberg:
An image signature for any kind of image. ICIP (1) 2002: 409-412 - [i13]Marshall W. Bern, David Eppstein:
Moebius-Invariant Natural Neighbor Interpolation. CoRR cs.CG/0207081 (2002) - [i12]Marshall W. Bern, David Eppstein:
Optimized Color Gamuts for Tiled Displays. CoRR cs.CG/0212007 (2002) - 2001
- [j30]Marshall W. Bern:
Combinatorial Curves and Surfaces - Editorial. Comput. Geom. 19(2-3): 87-88 (2001) - [c34]Ming Ye, Marshall W. Bern, David Goldberg:
Document Image Matching and Annotation Lifting. ICDAR 2001: 753- - [c33]Marshall W. Bern, Jeff Breidenbach, David Goldberg:
Trustworthy Paper Documents. Information Hiding 2001: 1-12 - [c32]Marshall W. Bern, David Eppstein:
Flipping Cubical Meshes. IMR 2001 - [c31]Marshall W. Bern:
Computing the depth of a flat. SODA 2001: 700-701 - [c30]Marshall W. Bern, David Eppstein:
Optimal Möbius Transformations for Information Visualization and Meshing. WADS 2001: 14-25 - [c29]Marshall W. Bern, David Eppstein:
Optimization over Zonotopes and Training Support Vector Machines. WADS 2001: 111-121 - [i11]Marshall W. Bern, David Eppstein:
Optimal Moebius Transformations for Information Visualization and Meshing. CoRR cs.CG/0101006 (2001) - [i10]Marshall W. Bern, David Eppstein:
Optimization Over Zonotopes and Training Support Vector Machines. CoRR cs.CG/0105017 (2001) - [i9]Marshall W. Bern, David Eppstein, Jeff Erickson:
Flipping Cubical Meshes. CoRR cs.CG/0108020 (2001) - 2000
- [j29]Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Regression Depth and Center Points. Discret. Comput. Geom. 23(3): 305-323 (2000) - [j28]Marshall W. Bern:
Guest Editor's Foreword. Discret. Comput. Geom. 24(4): 575-576 (2000) - [j27]Marshall W. Bern, David Eppstein:
Quadrilateral Meshing by Circle Packing. Int. J. Comput. Geom. Appl. 10(4): 347-360 (2000) - [c28]Marshall W. Bern, David Eppstein:
Multivariate regression depth. SCG 2000: 315-321 - [c27]Marshall W. Bern, David Goldberg:
Scanner-Model-Based Document Image Improvement. ICIP 2000: 582-585 - [p1]Marshall W. Bern, Paul E. Plassmann:
Mesh Generation. Handbook of Computational Geometry 2000: 291-332 - [i8]Marshall W. Bern, David Eppstein:
Computing the Depth of a Flat. CoRR cs.CG/0009024 (2000)
1990 – 1999
- 1999
- [j26]Nina Amenta, Marshall W. Bern:
Surface Reconstruction by Voronoi Filtering. Discret. Comput. Geom. 22(4): 481-504 (1999) - [j25]Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations. Int. J. Comput. Geom. Appl. 9(6): 517-532 (1999) - [j24]Nina Amenta, Marshall W. Bern, David Eppstein:
Optimal Point Placement for Mesh Smoothing. J. Algorithms 30(2): 302-322 (1999) - [c26]Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo:
Ununfoldable polyhedra. CCCG 1999 - [i7]David Eppstein, Marshall W. Bern, Brad L. Hutchings:
Algorithms for Coloring Quadtrees. CoRR cs.CG/9907030 (1999) - [i6]Marshall W. Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink:
Ununfoldable Polyhedra with Convex Faces. CoRR cs.CG/9908003 (1999) - [i5]Marshall W. Bern, David Eppstein:
Quadrilateral Meshing by Circle Packing. CoRR cs.CG/9908016 (1999) - [i4]Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin:
Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999) - [i3]Marshall W. Bern, David Eppstein:
Multivariate Regression Depth. CoRR cs.CG/9912013 (1999) - 1998
- [j23]Nina Amenta, Marshall W. Bern, David Eppstein:
The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction. Graph. Model. Image Process. 60(2): 125-135 (1998) - [j22]Marshall W. Bern, Amit Sahai:
Pushing Disks Together - The Continuous-Motion Case. Discret. Comput. Geom. 20(4): 499-514 (1998) - [c25]Nina Amenta, Marshall W. Bern:
Surface Reconstruction by Voronoi Filtering. SCG 1998: 39-48 - [c24]Marshall W. Bern:
Computational Geometry for Mesh Generation (abstract). IMR 1998: 227 - [c23]Nina Amenta, Marshall W. Bern, Manolis Kamvysselis:
A New Voronoi-based Surface Reconstruction Algorithm. SIGGRAPH 1998: 415-421 - [i2]Nina Amenta, Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Regression Depth and Center Points. CoRR cs.CG/9809037 (1998) - [i1]Nina Amenta, Marshall W. Bern, David Eppstein:
Optimal Point Placement for Mesh Smoothing. CoRR cs.CG/9809081 (1998) - 1997
- [c22]Nina Amenta, Marshall W. Bern, David Eppstein:
Optimal Point Placement for Mesh Smoothing. SODA 1997: 528-537 - 1996
- [c21]Marshall W. Bern, Barry Hayes:
The Complexity of Flat Origami. SODA 1996: 175-183 - [c20]Marshall W. Bern, Amit Sahai:
Pushing Disks Together - The Continuous-Motion Case. STOC 1996: 119-125 - 1995
- [j21]Marshall W. Bern, Scott A. Mitchell, Jim Ruppert:
Linear-Size Nonobtuse Triangulation of Polygons. Discret. Comput. Geom. 14(4): 411-428 (1995) - [j20]Marshall W. Bern:
Compatible Tetrahedralizations. Fundam. Informaticae 22(4): 371-384 (1995) - [j19]Marshall W. Bern, David P. Dobkin, David Eppstein:
Triangulating polygons without large angles. Int. J. Comput. Geom. Appl. 5: 171-192 (1995) - [c19]Marshall W. Bern, David Eppstein, Leonidas J. Guibas, John Hershberger, Subhash Suri, Jan Wolter:
The Centroid of Points with Approximate Weights. ESA 1995: 460-472 - [c18]Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert:
Dihedral Bounds for Mesh Generation in High Dimensions. SODA 1995: 189-196 - 1994
- [j18]Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan:
On-Line Algorithms for Locating Checkpoints. Algorithmica 11(1): 33-52 (1994) - [j17]Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman:
Visibility with a Moving Point of View. Algorithmica 11(4): 360-378 (1994) - [j16]Boris Aronov, Marshall W. Bern, David Eppstein:
On the Number of Minimal 1-Steiner Trees. Discret. Comput. Geom. 12: 29-34 (1994) - [j15]Marshall W. Bern, David Eppstein, John R. Gilbert:
Provably Good Mesh Generation. J. Comput. Syst. Sci. 48(3): 384-409 (1994) - [c17]Marshall W. Bern, Scott A. Mitchell, Jim Ruppert:
Linear-Size Nonobtuse Triangulation of Polygons. SCG 1994: 221-230 - 1993
- [j14]Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan:
Edge Insertion for Optimal Triangulations. Discret. Comput. Geom. 10: 47-65 (1993) - [j13]Marshall W. Bern:
Approximate Closest-Point Queries in High Dimensions. Inf. Process. Lett. 45(2): 95-99 (1993) - [c16]Marshall W. Bern, David Eppstein:
Worst-Case Bounds for Subadditive Geometric Graphs. SCG 1993: 183-188 - [c15]Marshall W. Bern:
Compatible Tetrahedralizations. SCG 1993: 281-288 - [c14]Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan:
On-line algorithms for cache sharing. STOC 1993: 422-430 - [c13]Marshall W. Bern, David Eppstein, Shang-Hua Teng:
Parallel Construction of Quadtrees and Quality Triangulations. WADS 1993: 188-199 - 1992
- [j12]Marshall W. Bern, David Eppstein:
Polynomial-size nonobtuse triangulation of polygons. Int. J. Comput. Geom. Appl. 2(3): 241-255 (1992) - [j11]Marshall W. Bern, David Eppstein:
Erratum: Polynomial-size nonobtuse triangulation of polygons. Int. J. Comput. Geom. Appl. 2(4): 449-450 (1992) - [j10]Marshall W. Bern, John R. Gilbert:
Drawing the Planar Dual. Inf. Process. Lett. 43(1): 7-13 (1992) - [j9]Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems. Theor. Comput. Sci. 106(2): 265-281 (1992) - [c12]Marshall W. Bern, David P. Dobkin, David Eppstein:
Triangulating Polygons without Large Angles. SCG 1992: 222-231 - [c11]Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Scott A. Mitchell, Tiow Seng Tan:
Edge Insertion for Optional Triangulations. LATIN 1992: 46-60 - 1991
- [j8]Marshall W. Bern, Daniel Bienstock:
Polynomially solvable special cases of the Steiner problem in planar networks. Ann. Oper. Res. 33(6): 403-418 (1991) - [j7]Marshall W. Bern, David Eppstein, F. Frances Yao:
The expected extremes in a Delaunay triangulation. Int. J. Comput. Geom. Appl. 1(1): 79-91 (1991) - [c10]Marshall W. Bern, David Eppstein:
Polynomial-Size Nonobtuse Triangulation of Polygons. SCG 1991: 342-350 - [c9]Marshall W. Bern, David Eppstein, F. Frances Yao:
The Expected Extremes in a Delaunay Triangulation. ICALP 1991: 674-685 - 1990
- [j6]Marshall W. Bern:
Hidden Surface Removal for Rectangles. J. Comput. Syst. Sci. 40(1): 49-69 (1990) - [j5]Marshall W. Bern:
Faster exact algorithms for steiner trees in planar networks. Networks 20(1): 109-120 (1990) - [c8]Marshall W. Bern, David Eppstein, Paul E. Plassmann, F. Frances Yao:
Horizon Theorems for Lines and Polygons. Discrete and Computational Geometry 1990: 45-66 - [c7]Marshall W. Bern, David Eppstein, John R. Gilbert:
Provably Good Mesh Generation. FOCS 1990: 231-241 - [c6]Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman:
Visibility with a Moving Point of View. SODA 1990: 107-117 - [c5]Marshall W. Bern, Daniel H. Greene, Arvind Raghunathan, Madhu Sudan:
Online Algorithms for Locating Checkpoints. STOC 1990: 359-368
1980 – 1989
- 1989
- [j4]Marshall W. Bern, Paul E. Plassmann:
The Steiner Problem with Edge Lengths 1 and 2. Inf. Process. Lett. 32(4): 171-176 (1989) - [c4]Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems. SCG 1989: 292-301 - 1988
- [j3]Marshall W. Bern:
Two Probabilistic Results on Rectilinear Steiner Trees. Algorithmica 3: 191-204 (1988) - [c3]Marshall W. Bern:
Hidden Surface Removal for Rectangles. SCG 1988: 183-192 - 1987
- [j2]Marshall W. Bern, Maria M. Klawe, Alice Wong:
Bounds on the convex label number of trees. Comb. 7(3): 221-230 (1987) - [j1]Marshall W. Bern, Eugene L. Lawler, A. L. Wong:
Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs. J. Algorithms 8(2): 216-235 (1987) - 1986
- [c2]Marshall W. Bern:
Two Probabilistic Results on Rectilinear Steiner Trees. STOC 1986: 433-441 - 1985
- [c1]Marshall W. Bern, Eugene L. Lawler, A. L. Wong:
Why Certain Subgraph Computations Require Only Linear Time. FOCS 1985: 117-125
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-08-05 21:12 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:
