Eprints

On verifying and engineering the well-gradedness of a union-closed family, 0704.2919
Space-efficient straggler identification in round-trip data streams via Newton's identities and invertible Bloom filters, 0704.3313
Edges and switches, tunnels and bridges, 0705.0413
Recognizing partial cubes in quadratic time, 0705.1025
Axisymmetric dynamical models for SAURON and OASIS observations of NGC 3377, astro-ph/0311387
Random geometric graphs, cond-mat/0203026
Quasistatic scale-free networks, cond-mat/0207476
Searching for spaceships, cs.AI/0004003
Phutball endgames are hard, cs.CC/0008025
Playing games with algorithms: algorithmic combinatorial game theory, cs.CC/0106019
Examples, counterexamples, and enumeration results for foldings and unfoldings between polygons and polytopes, cs.CG/0007019
Computing the depth of a flat, cs.CG/0009024
Internet packet filter management and rectangle geometry, cs.CG/0010018
Computational geometry column 38, cs.CG/001025
Optimal M�bius transformations for information visualization and meshing, cs.CG/0101006
Nice point sets can have nasty Delaunay triangulations, cs.CG/0103017
Notes on computing peaks in $k$-levels and parametric spanning trees, cs.CG/0103024
Optimization over zonotopes and training support vector machines, cs.CG/0105017
Hinged kite mirror dissection, cs.CG/0106032
Vertex-unfoldings of simplicial polyhedra, cs.CG/0107023
Enumerating foldings and unfoldings between polygons and polytopes, cs.CG/0107024
Flipping cubical meshes, cs.CG/0108020
Computational geometry column 42, cs.CG/0108021
Vertex-unfoldings of simplicial manifolds, cs.CG/0110054
Small strictly convex quadrilateral meshes of point sets, cs.CG/0202011
Building space-time meshes over arbitrary spatial domains, cs.CG/0206002
Optimally cutting a surface into a disk, cs.CG/0207004
Parallel Delaunay refinement: algorithms and analyses, cs.CG/0207063
M�bius-invariant natural neighbor interpolation, cs.CG/0207081
Optimized color gamuts for tiled displays, cs.CG/0212007
Confluent drawings: visualizing non-planar diagrams in a planar way, cs.CG/0212046
Tiling space and slabs with acute tetrahedra, cs.CG/0302027
When crossings count — approximating the minimum spanning tree, cs.CG/0303001
Computational geometry column 44, cs.CG/0304025
Testing bipartiteness of geometric intersection graphs, cs.CG/0307023
Deterministic sampling and range counting in geometric data streams, cs.CG/0307027
The geometric thickness of low degree graphs, cs.CG/0312056
Single-strip triangulation of manifolds with arbitrary topology, cs.CG/0405036
Minimum dilation stars, cs.CG/0412025
Quasiconvex programming, cs.CG/0412046
A time-optimal Delaunay refinement algorithm in two dimensions, cs.CG/0501007
The weighted maximum-mean subtree and other bicriterion subtree problems, cs.CG/0503023
Point set stratification and Delaunay depth, cs.CG/0505017
The skip quadtree: a simple dynamic data structure for multidimensional data, cs.CG/0507049
Confluent layered drawings, cs.CG/0507051
Grid vertex-unfolding orthogonal polyhedra, cs.CG/0509054
Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time, cs.CG/0512064
Minimum-weight triangulation is NP-hard, cs.CG/0601002
The density of iterated crossing points and a gap result for triangulations of finite point sets, cs.CG/0601033
Approximate weighted farthest neighbors and minimum dilation stars, cs.CG/0602029
Guard placement for efficient point-in-polygon proofs, cs.CG/0603057
Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition, cs.CG/0604034
Spanners for geometric intersection graphs, cs.CG/0605029
Upright-quad drawing of $st$-planar learning spaces, cs.CG/0607094
Trees with convex faces and optimal angles, cs.CG/0607113
Choosing colors for geometric graphs via color space embeddings, cs.CG/0609033
Happy endings for flip graphs, cs.CG/0610092
Regression depth and center points, cs.CG/9809037
Incremental and decremental maintenance of planar width, cs.CG/9809038
Optimal point placement for mesh smoothing, cs.CG/9809081
Linear complexity hexahedral mesh generation, cs.CG/9809109
Hinged dissections of polyominoes and polyforms, cs.CG/9907018
Algorithms for coloring quadtrees, cs.CG/9907030
Beta-skeletons have unbounded dilation, cs.CG/9907031
Ununfoldable polyhedra, cs.CG/9908003
Computational geometry column 36, cs.CG/9908006
Computational geometry column 37, cs.CG/9908007
Quadrilateral meshing by circle packing, cs.CG/9908016
Emerging challenges in computational topology, cs.CG/9909001
Multivariate regression depth, cs.CG/9912013
Fully sequential and distributed dynamic algorithms for minimum spanning trees, cs.DC/0002005
The effect of faults on network expansion, cs.DC/0404029
Skip-webs: efficient distributed data structures for multi-dimensional data sets, cs.DC/0507050
A steady state model for graph power laws, cs.DM/0204001
Really straight graph drawings, cs.DM/0405112
Track layouts of graphs, cs.DM/0407033
$k$-connectivity in the semi-streaming model, cs.DM/0608066
The distribution of cycle lengths in graphical models for iterative decoding, cs.DM/9907002
Deciding first order properties of locally tree-decomposable structures, cs.DS/0004007
3-coloring in time $O(1.3289^n)$, cs.DS/0006046
Fast approximation of centrality, cs.DS/0009005
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction, cs.DS/0009006
Small maximal independent sets and faster exact graph coloring, cs.DS/0011009
The minimum expectation selection problem, cs.DS/0110011
Algorithms for media, cs.DS/0206033
Dynamic generators of topologically embedded graphs, cs.DS/0207082
Data structure for a time-based bandwidth reservations problem, cs.DS/0302009
The traveling salesman problem for cubic graphs, cs.DS/0302030
Quasiconvex analysis of backtracking algorithms, cs.DS/0304018
Maintaining information in fully-dynamic trees with top trees, cs.DS/0310065
The lattice dimension of a graph, cs.DS/0402028
Algorithms for drawing media, cs.DS/0406020
All maximal independent sets and dynamic dominance for sparse graphs, cs.DS/0407036
Logarithmic lower bounds in the cell-probe model, cs.DS/0502041
Improved combinatorial group testing for real-world problem sizes, cs.DS/0505048
Nonrepetitive paths and cycles in graphs with application to Sudoku, cs.DS/0507053
Setting parameters by example, cs.DS/9907001
Subgraph isomorphism in planar graphs and related problems, cs.DS/9911003
Fast hierarchical clustering and other applications of dynamic closest pairs, cs.DS/9912014
A linear weighted Laplacian smoothing framework for warping tetrahedral meshes, cs.NA/0410045
Local tree-width, excluded minors, and approximation algorithms, math.CO/0001128
One-dimensional peg solitaire, math.CO/0006067
One-dimensional peg solitaire, and duotaire, math.CO/0008172
The complexity of finding small triangulations of convex 3-polytopes , math.CO/0012177
Separating geometric thickness from book thickness, math.CO/0109195
Fat 4-polytopes and fatter 3-spheres, math.CO/0204007
Separating thickness from geometric thickness, math.CO/0204252
Construction techniques for cubical complexes, odd cubical 4-polytopes, and prescribed dual manifolds, math.CO/0310269
The lattice dimension of a tree, math.CO/0402246
Graph treewidth and geometric thickness parameters, math.CO/0503553
Bounded-degree graphs have arbitrarily large geometric thickness, math.CO/0509150
Cubic partial cubes from simplicial arrangements, math.CO/0510263
Media theory: representations and examples, math.CO/0512282
Drawings of planar graphs with few slopes and segments, math.CO/0606450
Fundamentals of media theory, math.CO/0610053
Diameter and treewidth in minor-closed graph families, math.CO/9907126
Geometric thickness of complete graphs, math.CO/9910185
Surface quadrangulations mod flips, math.GT/0501550
Location of incenters and Fermat points in variable triangles, math.MG/0002004
Face numbers of 4-polytopes and 3-spheres, math.MG/0208073
Many triangulated 3-spheres, math.MG/0212004
The $E_t$-construction for lattices, spheres and polytopes, math.MG/0304492
Transforming triangulations of polygons on non planar surfaces, math.MG/0311228
A unique representation of polyhedral types, math.MG/0401005
Projected products of polytopes, math.MG/0407042
On the geometric dilation of curves and point sets, math.MG/0407135
New polytopes from products, math.MG/0411092
Convex Polytopes: Extremal Constructions and $f$-Vector Shapes, math.MG/0411400
Tangent spheres and triangle centers, math.MG/9909152
Upper bound on the products of particle interactions in cellular automata, nlin.CG/0008038