Marshall W. Bern

According to our database1, Marshall W. Bern authored at least 79 papers between 1985 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2011
Origami Embedding of Piecewise-Linear Two-Manifolds.
Algorithmica, 2011

Ubiquitous Meeting Facilitator with Playful Real-Time User Interface.
Proceedings of the Ubiquitous Intelligence and Computing - 8th International Conference, 2011

Constrained De Novo Sequencing of Peptides with Application to Conotoxins.
Proceedings of the Research in Computational Molecular Biology, 2011

2010
Facilitating meetings with playful feedback.
Proceedings of the 28th International Conference on Human Factors in Computing Systems, 2010

2009
Spectrum Fusion: Using Multiple Mass Spectra for De Novo Peptide Sequencing.
J. Comput. Biol., 2009

Glycan family analysis for deducing <i>N</i>-glycan topology from single MS.
Bioinform., 2009

2008
Improved Ranking Functions for Protein and Modification-Site Identifications.
J. Comput. Biol., 2008

Escape: a target selection technique using visually-cued gestures.
Proceedings of the 2008 Conference on Human Factors in Computing Systems, 2008

2007
SecLEACH - On the security of clustered sensor networks.
Signal Process., 2007

2006
Support-Graph Preconditioners.
SIAM J. Matrix Anal. Appl., 2006

<i>De Novo</i> Analysis of Peptide Tandem Mass Spectra by Spectral Graph Partitioning.
J. Comput. Biol., 2006

SecLEACH - A Random Key Distribution Solution for Securing Clustered Sensor Networks.
Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications, 2006

2005
EigenMS: De Novo Analysis of Peptide Tandem Mass Spectra by Spectral Graph Partitioning.
Proceedings of the Research in Computational Molecular Biology, 2005

Avoiding Local Optima in Single Particle Reconstruction.
Proceedings of the Research in Computational Molecular Biology, 2005

2004
Triangulations and Mesh Generation.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

A global approach to automatic solution of jigsaw puzzles.
Comput. Geom., 2004

Automatic Quality Assessment of Peptide Tandem Mass Spectra.
Proceedings of the Proceedings Twelfth International Conference on Intelligent Systems for Molecular Biology/Third European Conference on Computational Biology 2004, 2004

2003
Ununfoldable polyhedra with convex faces.
Comput. Geom., 2003

Möbius-invariant natural neighbor interpolation.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Optimized color gamuts for tiled displays.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Flipping Cubical Meshes.
Eng. Comput., 2002

Multivariate Regression Depth.
Discret. Comput. Geom., 2002

Moebius-Invariant Natural Neighbor Interpolation
CoRR, 2002

Algorithms for Coloring Quadtrees.
Algorithmica, 2002

An image signature for any kind of image.
Proceedings of the 2002 International Conference on Image Processing, 2002

Paper position sensing.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
Optimal Moebius Transformations for Information Visualization and Meshing
CoRR, 2001

Combinatorial Curves and Surfaces - Editorial.
Comput. Geom., 2001

Optimization over Zonotopes and Training Support Vector Machines.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Optimal Möbius Transformations for Information Visualization and Meshing.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Computing the depth of a flat.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Flipping Cubical Meshes.
Proceedings of the 10th International Meshing Roundtable, 2001

Trustworthy Paper Documents.
Proceedings of the Information Hiding, 4th International Workshop, 2001

Document Image Matching and Annotation Lifting.
Proceedings of the 6th International Conference on Document Analysis and Recognition (ICDAR 2001), 2001

2000
Quadrilateral Meshing by Circle Packing.
Int. J. Comput. Geom. Appl., 2000

Guest Editor's Foreword.
Discret. Comput. Geom., 2000

Regression Depth and Center Points.
Discret. Comput. Geom., 2000

Computing the Depth of a Flat
CoRR, 2000

Scanner-Model-Based Document Image Improvement.
Proceedings of the 2000 International Conference on Image Processing, 2000

Mesh Generation.
Proceedings of the Handbook of Computational Geometry, 2000

1999
Optimal Point Placement for Mesh Smoothing.
J. Algorithms, 1999

Parallel Construction of Quadtrees and Quality Triangulations.
Int. J. Comput. Geom. Appl., 1999

Surface Reconstruction by Voronoi Filtering.
Discret. Comput. Geom., 1999

Emerging Challenges in Computational Topology
CoRR, 1999

Ununfoldable polyhedra.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Pushing Disks Together - The Continuous-Motion Case.
Discret. Comput. Geom., 1998

The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction.
Graph. Model. Image Process., 1998

A New Voronoi-based Surface Reconstruction Algorithm.
Proceedings of the 25th Annual Conference on Computer Graphics and Interactive Techniques, 1998

Computational Geometry for Mesh Generation (abstract).
Proceedings of the 7th International Meshing Roundtable, 1998

1996
The Complexity of Flat Origami.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
Triangulating polygons without large angles.
Int. J. Comput. Geom. Appl., 1995

Compatible Tetrahedralizations.
Fundam. Inform., 1995

Linear-Size Nonobtuse Triangulation of Polygons.
Discret. Comput. Geom., 1995

Dihedral Bounds for Mesh Generation in High Dimensions.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

The Centroid of Points with Approximate Weights.
Proceedings of the Algorithms, 1995

1994
Provably Good Mesh Generation.
J. Comput. Syst. Sci., 1994

On the Number of Minimal 1-Steiner Trees.
Discret. Comput. Geom., 1994

On-Line Algorithms for Locating Checkpoints.
Algorithmica, 1994

Visibility with a Moving Point of View.
Algorithmica, 1994

1993
Approximate Closest-Point Queries in High Dimensions.
Inf. Process. Lett., 1993

Edge Insertion for Optimal Triangulations.
Discret. Comput. Geom., 1993

On-line algorithms for cache sharing.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Worst-Case Bounds for Subadditive Geometric Graphs.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992
Fast Geometric Approximation Techniques and Geometric Embedding Problems.
Theor. Comput. Sci., 1992

Drawing the Planar Dual.
Inf. Process. Lett., 1992

Erratum: Polynomial-size nonobtuse triangulation of polygons.
Int. J. Comput. Geom. Appl., 1992

Polynomial-size nonobtuse triangulation of polygons.
Int. J. Comput. Geom. Appl., 1992

Edge Insertion for Optional Triangulations.
Proceedings of the LATIN '92, 1992

1991
The expected extremes in a Delaunay triangulation.
Int. J. Comput. Geom. Appl., 1991

Polynomially solvable special cases of the Steiner problem in planar networks.
Annals OR, 1991

1990
Faster exact algorithms for steiner trees in planar networks.
Networks, 1990

Hidden Surface Removal for Rectangles.
J. Comput. Syst. Sci., 1990

Online Algorithms for Locating Checkpoints
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Horizon Theorems for Lines and Polygons.
Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

1989
The Steiner Problem with Edge Lengths 1 and 2.
Inf. Process. Lett., 1989

1988
Two Probabilistic Results on Rectilinear Steiner Trees.
Algorithmica, 1988

1987
Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs.
J. Algorithms, 1987

Bounds on the convex label number of trees.
Comb., 1987

1985
Why Certain Subgraph Computations Require Only Linear Time
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985


  Loading...