2005-02-16 What are All the Best Sphere Packings n Low Dimensions?. 383-403 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#ConwayS95 2002-12-09 The Mayer-Vietoris and IC Equations for Convex Polytopes. 177-188 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Fine95 2002-11-25 _m_non Surfaces. 237-247 1998 19 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/19n2p237.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#ShahrokhiSSV98 2002-11-25 Self-Replicating Tiles and Their Boundary. 463-476 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p463.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Vince99 2002-12-09 Asymptotic Behavior of a Set-Statistic. 333-365 2000 23 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/0023003/00230333.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#BonettiV00 2006-02-01 Decomposition of Polytopes and Polynomials. 89-104 2001 26 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-001-0024-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#GaoL01 2004-05-18 Mixed Volume Computation for Semi-Mixed Systems. 257-277 2003 29 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/02/2837/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#GaoL03 2002-12-09 Intrinsic Volumes of the Brownian Motion Body. 41-50 2001 26 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0023/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#GaoV01 2002-11-25 Empilements de cercles et discrétisation quasiconforme: comportement asymptotique des rayons. 41-61 1999 22 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/22n1p41.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Matheus99 2002-12-09 A Left-First Search Algorithm for Planar Graphs. 459-468 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#FraysseixMP95 2003-02-14 A Euclidean Ramsey Problem. 223-227 2003 29 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/02/0780/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Exoo03 2002-12-02 Folding Rulers Inside Triangles. 265-285 1996 15 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/15n3p265.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#KreveldSW96 2002-12-09 Combinatorial Obstructions to the Lifting of Weaving Diagrams. 287-312 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Richter-Gebert93a 2002-11-25 On the Area Bisectors of a Polygon. 269-285 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p269.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#BohringerDH99 2002-12-09 Objects that Cannot Be Taken Apart with Two Hands. 367-384 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#SnoeyinkS94 2002-12-09 Improved Bounds on Weak epsilon-Nets for Convex Sets. 1-15 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#ChazelleEGGSW95 2002-07-02 On the Number of Balanced Lines. 611-628 2001 25 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0013/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#PachP01 2002-12-16 The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. 291-309 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#PachS89 2002-11-25 Canonical Theorems for Convex Sets. 427-435 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p427.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#PachS98 2002-11-25 On the Boundary of the Union of Planar Convex Sets. 321-328 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p321.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#PachS99 2002-01-03 Cutting Glass. 481-496 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240481.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#PachT00 2002-12-19 Untangling a Polygon. 585-592 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2889/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#PachT02 2002-12-09 Some Geometric Applications of Dilworth's Theorem. 1-7 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#PachT94 2002-11-25 A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets. 437-445 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p437.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#PachT98 2002-06-20 Isoperimetric Quotients for a Decomposed Convex Body. 257-270 2001 25 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/00/10084/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#BlindB01 2002-06-20 Packings of Unequal Circles in a Convex Set. 115-119 2002 28 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0094/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#BlindB02 2002-12-09 Gaps in the Numbers of Vertices of Cubical Polytopes, I. 351-356 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#BlindB94 2002-12-09 ^d+1Vertices. 321-345 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#BlindB95 2002-11-25 Shellings and the Lower Bound Theorem. 519-526 1999 21 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/21n4p519.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#BlindB99 2003-02-14 A Note on the Minimal Volume of Almost Cubic Parallelepipeds. 133-138 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2825/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Micciancio03 2002-01-03 <i>d</i>-Spheres Are Nonplanar. 539-550 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240539.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#SchnellW00 2002-12-09 Chiral Polytopes from Hyperbolic Honeycombs. 17-39 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#NostrandS95 2003-02-06 Embeddings of Graphs in Euclidean Spaces. 349-364 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#ReitermanRS89 2002-12-09 Partitioning Euclidean Space. 101-106 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Schmerl93 2002-12-09 Minimum Steiner Trees in Normed Planes. 351-370 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#DuGGLW93 2002-12-19 New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. 535-569 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2886/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#EfratGHMM02 2002-06-20 Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind - Rademacher Sums. 443-459 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0082/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#BeckR02 2006-06-01 A Helmholtz-Lie Type Characterization of Ellipsoids, I. 517-527 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Gruber95 2006-06-01 Stability of Blaschke's Characterization of Ellipsoids and Radon Norms. 411-427 1997 17 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/17n4p411.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Gruber97 2002-12-16 Smooth, Easy to Computer Interpolating Splines. 122-140 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Hobby86 2002-12-16 delta-Morphic Sets of Prototiles. 271-295 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Schmitt87 2002-12-16 Disks with Special Properties of Densest Packings. 181-190 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Schmitt91 2002-12-09 Another Space-Filling Trefoil Knot. 603-607 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Schmitt95 2004-12-07 _n. 105-116 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#DoyleHR94 2002-01-03 Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes. 499-511 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0045/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#ChinFW01 2002-12-09 ². 171-189 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#DoyleLR92 2002-11-25 Finding the Medial Axis of a Simple Polygon in Linear Time. 405-420 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p405.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#ChinSW99 2002-12-09 Independent Collections of Translates of Boxes and a Conjecture due to Grübaum. 101-105 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#NaimanW93 2002-11-25 A Condition for Sets in R3 to be Cones. 147-154 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230147.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Cel00 2002-12-02 Sphere Packings, I. 1-51 1997 17 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/17n1p1.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Hales97a 2002-12-09 On a New Method for Constructing Good Point Sets on Spheres. 111-129 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Wagner93 2002-11-25 Obstructions to Shellability. 95-103 1999 22 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/22n1p95.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Wachs99 2002-11-25 Improved Bounds for Planar k -Sets and Related Problems. 373-382 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p373.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Dey98 2002-11-25 Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities. 143-156 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p143.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#BoyvalenkovDN99 2002-01-30 On asymmetry of some convex bodies. 239-247 2002 27 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0059/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#GuoK02 2005-05-23 Counting the Interior Points of a Point Configuration. 1-13 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230001.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#EdelmanR00 2005-05-23 Free Arrangements and Rhombic Tilings. 307-340 1996 15 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/15n3p307.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#EdelmanR96 2005-05-23 Erratum to Free Arrangement and Rhombic Tilings. 359-359 1997 17 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/17n3p359.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#EdelmanR97 2005-05-23 Visibility Complexes and the Baues Problem for Triangulations in the Plane. 35-59 1998 20 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/20n1p35.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#EdelmanR98 2002-12-16 Diameter and Radius in the Manhattan Metric. 351-356 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#DuK90 2004-07-19 Conical Equipartitions of Mass Distributions. 335-350 2001 25 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0002/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#VrecicaZ01 2002-01-03 Finding Small Triangulations of Polytope Boundaries Is Hard. 503-518 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240503.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Richter-Gebert00 2002-12-09 Oriented Matroids with Few Mutations. 251-269 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Richter-Gebert93 2002-12-09 Successive Minima, Intrinsic Volumes, and Lattice Determinants. 233-239 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Schnell95 2002-12-09 Hyperbolic and Parabolic Packings. 123-149 1995 14 Discrete & Computational Geometry 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#HeS95 2002-06-20 The Tilt Formula for Generalized Simplices in Hyperbolic Space. 19-27 2002 28 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0079/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Ushijima02 2002-11-25 On the Independence Number of Minimum Distance Graphs. 179-187 1998 20 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/20n2p179.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Csizmadia98 2002-12-16 Lower Bounds on Moving a Ladder in Two and Three Dimensions. 197-217 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#KeO88 2002-12-09 Spectra of Regular Polytopes. 403-414 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#SaldanhaT92 2002-12-16 Kalai's Squeezed Spheres Are Shellable. 391-396 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10043/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Lee00 2002-12-16 P.L.-Spheres, Convex Polytopes, and Stress. 389-421 1996 15 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/15n4p389.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Lee96 2002-11-25 Many Polytopes Meeting the Conjectured Hirsch Bound. 1-17 1998 20 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/20n1p1.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#HoltK98 2003-11-20 On the Complexity of the Union of Fat Convex Objects in the Plane. 171-189 2000 23 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/0023002/00230171.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#EfratS00 2002-12-02 A Near-Linear Algorithm for the Planar Segment-Center Problem. 239-257 1996 16 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/16n3p239.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#EfratS96 2004-05-18 Counterexamples to the Connectivity Conjecture of the Mixed Cells. 515-521 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p515.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#LiW98 2003-07-31 Resolvable Representation of Polyhedra. 243-255 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p243.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Sugihara99 2004-05-18 All Polytopes Are Quotients, and Isomorphic Polytopes Are Quotients by Conjugate Subgroups. 289-298 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p289.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Hartley99 2003-02-14 Anchored Hyperplane Location Problems. 229-238 2003 29 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/02/0741/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Schobel03 2002-11-18 Multivariate Regression Depth. 1-17 2002 28 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0092/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#BernE02 2002-12-19 Pushing Disks Together - The Continuous-Motion Case. 499-514 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p499.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#BernS98 2006-09-05 An Algorithm for Reconstructing Convex Bodies form Their Projections. 205-237 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#KolzowKV89 2003-02-14 A Lower Bound on the Distortion of Embedding Planar Metrics into Euclidean Space. 77-81 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2813/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Ilan03 2002-12-16 Nonrealizability Proofs in Computational Geometry. 333-350 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#BokowskiRS90 2002-12-16 Cell Decompositions of the Projective Plane with Petrie Polygons of Constant Length. 377-392 1997 17 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/17n4p377.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#BokowskiRS97 2002-11-25 Convex Hulls of f- and $\beta$-Vectors. 421-431 1997 18 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/18n4p421.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Kozlov97 2002-12-02 An Optimal Bound for High-Quality Conforming Triangulations. 169-193 1996 15 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/15n2p169.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Tan96 2002-12-09 On the Cayley Factorization of Calotte Conditions. 97-109 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Tay94 2002-12-09 Lowe-Bound Theorems for Pseudomanifolds. 203-216 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Tay95 2002-12-16 Theorems on the Existence of Separating Surfaces. 49-56 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Houle91 2002-01-03 Grid Drawings of 4-Connected Plane Graphs. 73-87 2001 26 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0004/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#MiuraNN01 2002-12-16 Delaunay Graphs are almost as Good as Complete Graphs. 399-407 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#DobkinFS90 2003-01-02 A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. 423-432 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#ClarksonTW89 2002-12-09 An Algorithm to Compute Odd Orders and Ramification Indices of Cyclic Actions on Compact Surfaces. 451-464 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#BujalanceCGL94 2002-12-02 An Algorithm To Compute Orders and Ramification Indices of Cyclic Actions on Compact Surfaces, II. 33-54 1996 16 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/16n1p33.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#BujalanceCGL96 2002-12-16 An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments. 365-393 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Yap87 2002-01-30 About 4-Isosceles Planar Sets. 287-290 2002 27 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0067/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#XuD02 2002-06-20 Classification of Integral Expanding Matrices and Self-Affine Tiles. 49-73 2002 28 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0091/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#KiratL02 2002-12-16 On Lattices with Möbius Function ±1, 0. 1-8 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Kahn87 2002-12-09 ⁿ. 217-231 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Banaszczyk95 2002-12-02 Inequalities for Convex Bodies and Polar Reciprocal Lattices in $R^n$ II: Application of $K$-Convexity. 305-311 1996 16 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/16n3p305.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Banaszczyk96 2002-11-25 Semistable Reduction in Characteristic Zero for Families of Surfaces and Threefolds. 111-120 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230111.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Karu00 2002-12-16 Diameter-Extremal Subsets of Spheres. 117-137 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Katz89 2002-12-09 Tiling Polygons with Parallelograms. 175-188 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#KannanS92 2005-06-06 The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. 245-251 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#AlonKP89a 2002-07-02 On the Complexity of Arrangements of Circles in the Plane. 465-492 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0043/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#AlonLPS01 2002-12-16 The Blocking Numbers of Convex Bodies. 267-278 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10032/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#DallaLMZ00 2002-12-09 Dynamic Point Location in Arrangement of Hyperplanes. 335-360 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#MulmuleyS92 2004-03-22 Triangles in Euclidean Arrangements. 429-438 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p429.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#FelsnerF99 2005-12-23 A Theorem on Higher Bruhat Orders. 121-127 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230121.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#FelsnerW00 2004-01-12 Decomposing the Secondary Cayley Polytope. 367-380 2000 23 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/0023003/00230367.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#MichielsC00 2002-11-25 Enumerating Regular Mixed-Cell Configurations. 569-579 1999 21 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/21n4p569.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#MichielsV99 2002-01-03 Reconstructing Convex Polygons in the Plane from One Directed X-Ray. 105-146 2001 26 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0018/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#LamS01 2002-12-09 "What Is a Complex Matroid?". 313-348 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Ziegler93 2002-11-25 Shelling Polyhedral 3-Balls and 4-Polytopes. 159-174 1998 19 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/19n2p159.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Ziegler98 2002-12-16 On-line Covering the Unit Cube by Cubes. 433-438 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#JanuszewskiL94 2005-03-17 Penny-Packing and Two-Dimensional Codes. 1-11 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#GrahamS90 2002-12-16 Generalized Dalaunay Triangualtion for Planar Graphs. 201-217 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#LeeL86 2002-01-03 Lattice Substitution Systems and Model Sets. 173-201 2001 25 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/00/10083/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#LeeM01 2002-11-25 Counterexamples to the Strong d -Step Conjecture for d ge 5. 33-46 1998 19 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/19n1p33.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#HoltK98a 2002-12-16 Convex Disks Can Cover Their Shadow. 529-531 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#KosT90 2002-11-25 On Minimum Stars and Maximum Matchings. 389-407 2000 23 Discrete & Computational Geometry 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#FeketeM00 2002-01-03 Morphing Simple Polygons. 1-34 2000 24 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10017/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#GuibasHS00 2002-12-02 Yang-Baxter Invariants for Line Configurations. 15-33 1996 15 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/15n1p15.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Penne96 2002-12-16 On the General Motion-Planning Problem with Two Degrees of Freedom. 491-521 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#GuibasSS89 2002-12-16 A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems. 37-48 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Kolinek87 2002-12-09 Cardinalities of Primitive Fixing Systems for Convex Bodies. 209-218 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10028/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#BoltyanskiA00 2002-01-03 Stability Theorems for Two Measures of Symmetry. 301-312 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10037/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Groemer00 2002-12-16 Some Basic Properties of Packing and Covering Constants. 183-193 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Groemer86 2002-12-16 On Convex Bodies that Permit Packings of High Density. 357-364 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Groemer90 2002-12-09 Transitions in Geometric Minimum Spanning Trees. 265-293 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#MonmaS92 2003-07-09 Simplified Voronoi Diagrams. 219-236 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#CannyD88 2002-12-16 Combinatorial Geometries Representable over GF(3) and GF(q). I. The Number of Points. 83-95 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Kung90 2003-02-03 Hilbert Bases, Unimodular Triangulations, and Binary Covers of Rational Polyhedral Cones. 205-216 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p205.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#FirlaZ99 2002-12-16 On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space. 255-270 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#LevenS87a 2002-01-03 Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes. 35-48 2000 24 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10058/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#BelowLR00 2002-12-09 Algorithms for Ham-Sandwich Cuts. 433-452 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#LoMS94 2002-12-16 A Low Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem. 327-343 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Hayward87 2002-12-16 A Note on the Circle Containment Problem. 263-264 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Hayward89 2002-12-16 On Optimal Realizations of Finite Metric Spaces by Graphs. 103-122 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Althofer88 2002-12-09 The Steiner Ration Conjecture for Cocircular Points. 77-86 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#RubinsteinT92 2002-12-09 The Steiner Minimal Network for Convex Configurations. 323-333 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#ThomasRC93 2002-12-16 Incidence-Polytopes with Toroidal Cells. 55-73 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Weiss89 2002-12-09 On the Connected Components of the Space of Line Transersals t a Family of Convex Sets. 469-476 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#GoodmanPW95 2002-01-03 <i>j</i>-Facets. 351-364 2001 25 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/00/10085/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Welzl01 2002-12-16 More on k-Sets of Finite Sets in the Plane. 95-100 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Welzl86 2002-12-02 Guest Editor's Foreword. 315-315 1996 16 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/16n4p315.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Welzl96 2002-11-25 Ramsey-Type Results for Geometric Graphs, I. 247-255 1997 18 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/18n3p247.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#KarolyiPT97 2002-06-20 Examples of Z-Acyclic and Contractible Vertex-Homogeneous Simplicial Complexes. 137-154 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0057/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Lutz02 2002-11-25 Coloring Quasicrystals with Prescribed Symmetries and Frequencies. 459-475 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p459.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#AlaouiP99 2002-06-20 Lattice Polytopes with Distinct Pair-Sums. 65-72 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0052/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#ChoiLR02 2003-11-25 A Combinatorial Property of Convex Sets. 307-318 1997 17 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/17n3p307.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#AbellanasHKNU97 2003-08-21 Hard Tiling Problems with Simple Tiles. 573-590 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0047/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#MooreR01 2002-12-16 Arrangements of Lines with a Minimum Number of Triangles are Simple. 97-102 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Roudneff88 2002-12-09 On Lazy Randomized Incremental Construction. 261-286 1995 14 Discrete & Computational Geometry 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#BergDS95 2002-12-02 Vertical Decompositions for Triangles in 3-Space. 35-61 1996 15 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/15n1p35.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#BergGH96 2002-12-09 Piecewise Linear Paths Among Convex Obstacles. 9-29 1995 14 Discrete & Computational Geometry 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#BergMS95 2005-05-23 Oriented Matroid Rigidity of Multiplices. 177-184 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10025/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#BisztriczkyB00 2003-02-14 On the Identification of Sets of Points in the Square Lattice. 139-152 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/0730/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#HonkalaL03 2002-06-20 Circuit Admissible Triangulations of Oriented Matroids. 155-161 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0058/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Rambau02 2002-12-02 Nonrevisiting Paths on Surfaces. 353-357 1996 15 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/15n3p353.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#PulapakaV96 2002-12-16 Triangulating Point Sets in Space. 99-111 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#AvisE87 2002-12-09 A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra. 295-313 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#AvisF92 2002-12-16 Polyhedral Line transversals in Space. 257-265 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#AvisW88 2002-12-09 Linear-Size Nonobtuse Triangulation of Polygons. 411-428 1995 14 Discrete & Computational Geometry 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#BernMR95 2004-02-24 Affine Maps That Induce Polyhedral Complex Isomorphisms. 49-60 2000 24 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10034/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#DressHM00 2002-11-25 Fitting a Set of Points by a Circle. 389-402 1998 20 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/20n3p2389.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Garcia-LopezRS98 2004-10-05 <i>n</i>₄) Configurations. 603-612 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0041/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Berman01 2005-01-21 Central Points for Sets in Rn (or: the Chocolate Ice-Cream Problem). 467-479 1996 15 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/15n4p467.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#HooryL96 2003-07-24 ³. 279-292 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10035/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#FriedrichsH00 2003-07-24 Tiling Space by Platonic Solids, I. 299-315 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p299.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#FriedrichsH99 2002-12-16 Covering the Plane with Convex Polygons. 73-81 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Pach86 2002-11-25 Guest Editor's Foreword. 311-313 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p311.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Pach98 2002-12-09 An Approach to Hierarchical Clustering via Level Surfaces and Convexity. 221-233 2001 25 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/00/10089/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#HolleyMM01 2002-11-25 Primal - Dual Methods for Vertex and Facet Enumeration. 333-357 1998 20 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/20n3p333.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#BremnerFM98 2002-12-02 Equipartition of Mass Distributions by Hyperplanes. 147-167 1996 15 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/15n2p147.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Ramos96a 2002-12-16 On the Average Number of k-Sets. 209-213 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#Edelman92 2002-01-03 Realizations of Regular Abstract Polyhedra of Types {3, 6} and {6, 3}. 241-256 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10030/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#BurgielS00 2002-12-16 A Nonuniform Matroid Which violates the Isotogy Conecture. 1-2 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#White89 2002-12-16 Complexes Whose Boundaries Cannot Be Pused Around. 365-374 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Bloch89 2002-12-16 Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams. 9-31 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#LevenS87 2002-06-20 Generalizing Ham Sandwich Cuts to Equitable Subdivisions. 605-622 2000 24 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10065/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#BespamyatnikhKS00 2002-12-09 An Equipartition of Planar Sets. 257-266 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Schulman93 2002-12-19 Almost Disjoint Triangles in 3-Space. 577-583 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2888/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#KarolyiS02 2002-11-25 Coverings of Convex Sets and Volume Inequalities. 51-71 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230051.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#CarlE00 2003-02-14 The Size of Spanning Disks for Polygonal Curves. 1-17 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2707/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#HassST03 2002-12-09 The Euler Characteristic is the Unique Locally Determined Numerical Homotopy Invariant of Finite Complexes. 59-67 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Levitt92 2002-11-25 The Complexity of Stratification Computation. 47-78 1998 19 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/19n1p47.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Rannou98 2004-02-27 On Geometric Graphs with No Two Edges in Convex Position. 399-404 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p399.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#KatchalskiL98 2004-02-27 A Helly Type Conjecture. 37-43 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p37.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#KatchalskiN99 2002-12-09 Approximating the Volume of Convex Bodies. 15-21 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#BetkeH93 2002-11-25 Finite Packings of Spheres. 197-227 1998 19 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/19n2p197.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#BetkeH98 2002-12-16 Geometric Realizations for Dyck's Regular Map on a Surface of Genus 3. 141-153 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#SchulteW86 2002-11-25 The Missing Boundaries of the Santaló Diagrams for the Cases (d, w, R) and (w, R, r). 381-388 2000 23 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/0023003/00230381.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#CifreG00 2002-01-03 Convex Dimension of Locally Planar Convex Geometries. 85-101 2001 25 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10073/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Morris01 2002-12-19 The Partitioned Version of the Erdös - Szekeres Theorem. 625-637 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2894/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#PorV02 2002-12-09 Description of the Connected Components of a Semialgebraic in Single Exponential Time. 121-140 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#HeintzRS94 2002-12-16 On the Existence of Certain Smooth Toric Varieties. 255-262 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#GretenkortKS90 2005-03-17 Degrees of Real Wronski Maps. 331-347 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/0735/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#EremenkoG02 2002-11-25 Separating Maps of the Lattice E8 and Triangulations of the Eight-Dimensional Torus. 555-567 2000 23 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10012/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#DartoisG00 2002-12-16 On polyhedra with Transitivity Properties. 195-199 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Wills86 2002-12-16 An Inequality for the Volume of Inscribed Ellipsoids. 219-222 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Khachiyan90 2002-01-03 Convex and Linear Orientations of Polytopal Graphs. 421-436 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240421.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#MihalisinK00 2002-12-16 Minimum Ideal Triangulations of Hyperbolic 3-Manifolds. 135-153 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#AdamsS91 2002-01-03 Guest Editor's Foreword. 185-186 2001 26 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/1026002/10260185.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Agarwal01 2002-12-16 Partitioning Arrangements of Lines I: An Efficient deterministic Algorithm. 449-483 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Agarwal90 2003-07-15 Flipping Edges in Triangulations. 333-346 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p333.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#HurtadoNU99 2002-12-02 Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees. 191-215 1997 17 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/17n2p191.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#GrigorievKV97 2005-03-17 Frontier and Closure of a Semi-Pfaffian Set. 605-617 1998 19 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/19n4p605.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Gabrielov98 2002-01-03 Bounded Valence Excess and the Parabolicity of Tilings. 321-351 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0040/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Repp01 2002-12-02 New Lower Bounds for Hopcroft's Problem. 389-418 1996 16 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/16n4p389.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Erickson96 2003-02-14 Circular Cylinders through Four or Five Points in Space. 83-104 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2811/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#BernardFT03 2002-12-09 Computing the Volume, Counting Integral Points, and Exponential Sums. 123-141 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Barvinok93a 2004-05-18 The Alexandroff Dimension of Digital Quotients of Euclidean Spaces. 273-284 2002 27 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0065/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#WiederholdW02 2002-11-25 Notes on the Complexity of Exact View Graph Algorithms for Piecewise Smooth Algebraic Surfaces. 205-229 1998 20 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/20n2p205.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Rieger98 2002-12-16 Analytic Formulas for Full Steiner Trees. 69-82 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Booth91 2003-01-02 Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. 343-353 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#RosenstiehlT86 2002-03-15 Perpendicular Dissections of Space. 303-351 2002 27 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0073/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Zaslavsky02 2006-01-17 Helly-Type Theorems on the Homology of the Space of Transversals. 387-393 2002 27 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0076/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#BrachoM02 2005-12-23 Geometric Permutations and Common Transversals. 371-377 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#KatchalskiLL86 2005-12-23 The Different Ways of Stabbling Disjoint Convex Sets. 197-206 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#KatchalskiLL92 2004-02-27 A Constant Bound for Geometric Permutations of Disjoint Unit Balls. 161-173 2003 29 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/02/2828/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#KatchalskiSZ03 2002-12-09 The Classification of Quasi-Regular Polyhedra of Genus 2. 347-357 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#FranzH92 2002-12-09 Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. 415-431 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Smid92 2002-12-02 Inradii of Simplices. 365-375 1997 17 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/17n4p365.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#BetkeHT97 2002-12-09 Successive-Minima-Type Inequalities. 165-175 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#BetkeHW93 2002-12-09 Sausages are Good Packings. 297-311 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#BetkeHW95 2002-06-20 Lower Bounds for Kinetic Planar Subdivisions. 721-733 2000 24 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10060/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#AgarwalBBGH00 2002-11-25 Convexity and the Beta Invariant. 411-424 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p411.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#AhrensGM99 2002-01-03 Icosahedra Constructed from Congruent Triangles. 437-452 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240437.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Miller00 2002-11-25 Forced Convex n -Gons in the Plane. 367-371 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p367.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#ChungG98 2002-12-19 Box-Trees and R-Trees with Near-Optimal Query Time. 291-312 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/2817/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#AgarwalBGHH02 2002-11-25 Homotopy Groups of the Combinatorial Grassmannian. 549-560 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p549.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Anderson98 2004-06-21 On the Topology of the Combinatorial Flag Varieties. 195-214 2002 27 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0061/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#BorovikGS02 2002-12-19 Combinatorial Geometry Problems in Pattern Recognition. 495-510 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2884/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Brass02 2002-12-09 The maximum Number of Second Smallest Distances in Finite Planar Sets. 371-379 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Brass92 2002-12-02 On the Quantitative Steinitz Theorem in the Plane. 111-117 1997 17 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/17n1p111.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Brass97 2002-11-25 On Point Sets with Many Unit Distances in Few Directions. 355-366 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p355.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Brass98 2002-12-09 Ammann Bars and Quasicrystals. 125-133 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Stehling92 2002-01-03 <i>k</i>-Sets. 187-194 2001 26 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/00/10022/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Toth01 2002-12-16 Densest Packing of Translates of the Union of Two Circles. 307-314 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Toth86 2002-12-16 Finite Coverings by Translates of Centrally Symmetric Convex Domains. 353-363 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Toth87 2002-12-09 Flight in a Packing of Disks. 1-9 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Toth93 2002-12-09 Densest Packing of Typical Convex Sets are Nont Lattice-Like. 1-8 1995 14 Discrete & Computational Geometry 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Toth95 2002-11-25 Minkowski Circle Packings on the Sphere. 161-166 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p161.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Toth99 2002-12-09 Nonuniqueness Results for X-Ray Problems with Point Sources. 153-169 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#Brehm92 2002-06-20 Approximation Results for Kinetic Variants of TSP. 635-651 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0081/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#HammarN02 2004-08-26 An Addition to Art Galleries with Interior Walls. 311-334 2001 25 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/00/10078/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Hlineny01 2002-12-02 Guest Editor's Foreword. 363-364 1997 17 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/17n4p363.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Gritzmann97 2002-12-02 Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems. 369-387 1996 16 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/16n4p369.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Chan96a 2002-11-25 On the Kissing Numbers of Some Special Convex Bodies. 233-242 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p233.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#LarmanZ99 2003-01-02 A Construction of Inflation Rules Based on n-Fold Symmetry. 221-236 1996 15 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/15n2p221.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#NischkeD96 2002-12-16 A Power Law for the Distortion of Planar Sets. 345-351 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Freedman87 2002-12-09 On Convex Body Chasing. 293-321 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#FriedmanL93 2002-06-20 Improved Linear Programming Bounds for Antipodal Spherical Codes. 107-114 2002 28 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0080/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Anstreicher02 2002-06-20 Improving Rogers' Upper Bound for the Density of Unit Ball Packings via Estimating the Surface Area of Voronoi Cells from Below in Euclidean d-Space for All d>=8. 75-106 2002 28 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0095/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Bezdek02 2002-12-09 Hamiltonian Simple Polytopes. 301-304 1995 14 Discrete & Computational Geometry 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Prabhu95a 2003-03-24 Shortest Watchman Routes in Simple Polygons. 9-31 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#ChinN91 2002-12-19 Guest Editors' Foreword. 447-448 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2899/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#ShahrokhiS02 2002-12-16 A Dimension Series for Multivariate Splines. 107-128 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#BilleraR91 2002-11-25 Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. 79-94 1998 19 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/19n1p79.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#RabinovichR98 2002-12-16 On Levels in Arrangement and Voronoi Diagrams. 307-338 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Mulmuley91 2002-12-09 A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. 47-55 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Mulmuley93 2002-12-16 Bisectors of Linearly Separable Sets. 263-275 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#NackmanS91 2002-12-16 The Orthogonal Convex Skull Problem. 349-365 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#WoodY88 2004-12-14 Finite and Uniform Stability of Sphere Covering. 313-319 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#BezdekBC95 2004-12-14 Finite and Uniform Stability of Sphere Packings. 111-130 1998 20 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/20n1p111.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#BezdekBC98 2002-12-16 Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs. 183-190 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Chung89 2004-05-18 Maximum Density Space Packing with Parallel Strings of Spheres. 277-283 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#BezdekKM91 2002-12-09 Facet-Reducing Cuts of a Convex Polytope. 295-300 1995 14 Discrete & Computational Geometry 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Prabhu95 2002-11-25 Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. 455-462 1997 18 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/18n4p455.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Kortenkamp97 2002-12-16 Small-Dimensional Linear Programming and Convex Hulls Made Easy. 423-434 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Seidel91 2002-12-09 Guest Editor's Foreword. 285-285 1998 20 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/20n3p285.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Seidel98 2005-06-06 Combinatorial d-Tori with a Large Symmetry Group. 169-176 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#KuhnelL88 2004-05-18 Simplices with Equiareal Faces. 397-412 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10044/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#McMullen00 2004-05-18 Weights on Polytopes. 363-388 1996 15 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/15n4p363.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#McMullen96 2002-11-25 The Nature and Meaning of Perturbations in Geometric Computing. 1-17 1998 19 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/19n1p1.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Seidel98a 2002-11-25 Seven Cubes and Ten 24-Cells. 151-157 1998 19 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/19n2p151.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Coxeter98 2004-01-09 The Order of Points on the Second Convex Hull of a Simple Polygon. 185-205 1995 14 Discrete & Computational Geometry 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#GarciaT95 2002-12-16 A Unified Approach a Visibility Representation of Planar Graphs. 321-341 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#TamassiaT86 2002-12-16 On Nonnegative Solutions of Random Systems of Linear Inequalities. 85-95 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Buchta87 2002-12-16 Computing the Link Center of a Simple Polygon. 281-293 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#LenhartPSSSSTWY88 2004-06-11 Computing the Degree-4 Shortest Network under a Given Topology. 437-448 2000 23 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/0023003/00230437.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#XuYZ00 2002-11-25 Integer Optimization on Convex Semialgebraic Sets. 207-224 2000 23 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/0023002/00230207.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#KhachiyanP00 2002-12-16 Exterior Algebra and projections of Polytopes. 305-322 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Filliman90 2002-01-03 Simple Paradoxical Replications of Sets. 65-83 2001 25 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10077/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Richter01 2002-12-19 Congruence by Dissection of Topological Discs - An Elementary Approach to Tarski's Circle Squaring Problem. 427-442 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/0748/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Richter02 2002-11-25 Surface Reconstruction by Voronoi Filtering. 481-504 1999 22 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/22n4p481.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#AmentaB99 2002-12-09 X-Rays of Polygons. 281-293 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Gardner92 2002-12-16 Periodic Orbits for Additive Cellular Automata. 277-288 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#CordovilDC86 2002-12-16 On the Cocircuit Graph of an Oriented Matroid. 257-266 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10031/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#CordovilFO00 2004-05-18 Quotients of Polytopes and C-Groups. 453-464 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#McMullenS94 2004-05-18 Regular Polytopes in Ordinary Space. 449-478 1997 17 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/17n4p449.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#McMullenS97 2002-12-09 On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra. 227-253 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#RuppertS92 2004-02-27 Covering Squares with Squares. 151-170 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10023/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#AbbottK00 2002-12-09 Camera Placement in Integer Lattices. 91-104 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#KranakisP94 2002-12-09 An Example Concerning the Translative Kissing Number of Convex Body. 183-188 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Zong94 2002-12-02 The Kissing Numbers of Tetrahedra 239-252 1996 15 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/15n3p239.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Zong96 2002-12-16 Two Poset Polytopes. 9-23 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Stanley86 2002-11-25 Vertex-Rounding a Three-Dimensional Polyhedral Subdivision. 593-618 1999 22 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/22n4p593.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Fortune99 2002-12-02 Approximation of Analytic Functions with Prescribed Boundary Conditions by Circle-Packing Maps. 67-77 1997 17 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/17n1p67.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Dubejko97 2002-11-25 Discrete Solutions of Dirichlet Problems, Finite Volumes, and Circle Packings. 19-39 1999 22 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/22n1p19.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Dubejko99 2002-12-16 A Generalization of Hadwiger's Transversal Theorem to Intersecting Sets. 383-388 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Wenger90a 2002-01-03 Linear Repetitivity, I. Uniform Subadditive Ergodic Theorems and Applications. 411-428 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0033/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#DamanikL01 2004-05-18 Piles of Cubes, Monotone Path Polytopes, and Hyperplane Arrangements. 117-130 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p117.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Athanasiadis99 2004-07-19 Note on a Conjecture of Sierksma. 339-349 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#VucicZ93 2002-12-16 Many Triangulated Spheres. 1-14 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Kalai88 2002-12-09 Upper Bounds for the Diameter and Height of Graphs of Convex Polyhedra. 363-372 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#Kalai92 2002-11-25 Exponential Lower Bound for the Translative Kissing Numbers of d -Dimensional Convex Bodies. 447-455 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p447.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Talata98 2005-09-29 The Translative Kissing Number of Tetrahedra Is 18. 231-248 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p231.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Talata99 2006-01-31 Lattice Coverings and Gaussian Measures of n-Dimensional Convex Bodies. 283-286 1997 17 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/17n3p283.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#BanaszczykS97 2002-12-09 The Upper Envelope of voronoi Surfaces and Its Applications. 267-291 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#HuttenlocherKS93 2005-11-09 The Geometry of Products of Minors. 231-249 1998 20 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/20n2p231.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#BabsonB98 2002-12-16 An Efficient Motion-planning Algorithm for a Convex Polygonal Object in Two Dimensional Polygonal Space. 43-75 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#KedemS90 2002-12-16 ⁴. 73-75 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Purdy88 2002-12-09 Extension Spaces of Oriented Matroids. 23-45 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#SturmfelsZ93 2002-12-16 ^d^d+1+. 49-64 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Aurenhammer87 2002-12-16 A New Duality Result Concerning Voronoi Diagrams. 243-254 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Aurenhammer90 2002-11-25 Guest Editor's Foreword. 245-245 1997 18 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/18n3p245.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Guibas97 2002-01-03 <i>R</i>^<i>d</i>. 543-548 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0044/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#KatzV01 2002-12-16 Direction Trees. 249-254 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Jamison87 2002-01-03 Face-Transitive Polyhedra with Rectangular Faces and Icosahedral Symmetry. 163-172 2001 25 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/00/10087/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#CoxeterG01 2002-12-09 The Lower and Upper Bound Problems for Cubical Polytopes. 159-163 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Jockusch93 2002-12-09 ^d. 189-202 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Rajan94 2005-04-20 Minimum Convex Partition of Polygonal Domains by Guillotine Cuts. 291-305 1998 19 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/19n2p291.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#MartiniS98 2002-11-25 Configuration Spaces of Mechanical Linkages. 297-315 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p297.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#JordanS99 2002-12-09 Classification of Arrangement by the Number of Their Cells. 39-46 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Martinov93 2002-01-03 An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set. 233-244 2001 26 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0029/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Ramos01 2002-12-02 The Number of Extreme Triples of a Planar Point Set. 1-19 1996 16 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/16n1p1.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Ramos96 2006-09-18 Free Arrangements and Relation Spaces. 49-63 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#BrandtT94 2002-11-25 Growth Rates in the Quaquaversal Tiling. 419-435 2000 23 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/0023003/00230419.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#DracoSW00 2004-05-24 Combinatorics of the Toric Hilbert Scheme. 249-264 2002 27 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0062/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#MaclaganT02 2006-03-13 Appollonius Revisited: Supporting Spheres for Sundered Systems. 385-395 1997 18 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/18n4p385.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#KleeLH97 2002-01-03 <i>k</i>-Sets in Three Dimensions. 195-204 2001 26 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0005/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#SharirST01 2002-12-16 A Matroid on Hypergraphs with Applications in Scene Analysis and Geometry. 75-95 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Whiteley89 2004-12-13 Signable Posets and Partitionable Simplicial Complexes. 443-466 1996 15 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/15n4p443.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#KleinschmidtO96 2002-12-09 Arrangement of Oriented Hyperplanes. 435-446 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Linhart93 2002-12-16 Planar Realizations of Nonlinear Davenport-Schnitzel Sequences by Segments. 15-47 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#WiernikS88 2002-12-09 Guest Editor's Foreword. 363-363 1995 14 Discrete & Computational Geometry 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Mehlhorn95 2002-06-20 Toric Ideals and an Infinite Family of Normal (0, 1)-Polytopes without Unimodular Regular Triangulations. 551-565 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0087/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Ohsugi02 2002-12-09 Isoperimetric Problems for Convex Bodies and a Localization Lemama. 541-559 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#KannanLS95 2004-02-26 Cutting Polytopes and Flag f-Vectors. 261-271 2000 23 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/0023002/00230261.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#EhrenborgJRR00 2006-02-01 ⁿand Scissors Congruence. 573-583 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#LagariasM95a 2002-12-16 Some Provably Hard Crossing Number Problems. 443-459 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Bienstock91 2002-12-09 Classes of Graphs Which Approximate the Complete Euclidean Graph. 13-28 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#KeilG92 2002-11-25 The d-Step Conjecture and Gaussian Elimination. 53-82 1997 18 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/18n1p53.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#LagariasPR97 2002-12-19 The Kernel of the Adjacency Matrix of a Rectangular Mesh. 411-425 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/2819/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#TomeiV02 2003-01-02 On Squashed Designs. 379-390 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#DezaF86 2002-12-09 Lattice-Free Polytopes and Their Diameter. 59-75 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#DezaO95 2003-02-14 The Euclidean Distortion of Complete Binary Trees. 19-21 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2827/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#LinialS03 2002-12-02 Polytopes and the Mean Value Property. 163-189 1997 17 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/17n2p163.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Iwasaki97 2002-12-16 A Resolution of the Sylvester - Gallai Problem of J. -P. Serre. 101-104 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Kelly86 2002-11-25 Embedding into Rectilinear Spaces. 595-604 1998 19 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/19n4p595.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#BandeltCL98 2002-11-25 Visibility with One Reflection. 553-574 1998 19 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/19n4p553.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#AronovDDPP98a 2002-12-16 On Arrangement of Jordan Arcs with Three Intersection per Pair. 523-539 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#EdelsbrunnerGHPPSSS89 2002-11-25 Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates. 305-368 1997 18 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/18n3p305.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Shewchuk97 2002-03-15 Momentopes, the Complexity of Vector Partitioning, and Davenport - Schinzel Sequences. 409-417 2002 27 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0069/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#AviranO02 2002-12-16 On a Problem About Covering Lines by Squares. 77-82 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#KernW90 2002-11-25 A Normal (0, 1)-Polytope None of Whose Regular Triangulations Is Unimodular. 201-204 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p201.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#OhsugiH99 2002-12-09 A Gallai-Type Transversal Problem in the Plane. 203-214 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Eckhoff93 2002-12-09 Aperiodic Tiles. 1-25 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#AmmannGS92 2006-06-12 Hamiltonian Cycles in T-Graphs. 497-502 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240497.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#ReayZ00 2002-12-16 Polygonizations of Point Sets in the Plane. 77-87 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#DeneenS88 2002-12-16 Establishing Order in Planar Subdivisions. 267-280 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Kirkpatrick88 2002-11-25 A Central Limit Theorem for Convex Chains in the Square. 35-50 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230035.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#BaranyRSZ00 2002-12-09 Extremal Theory for Convex Matchings in Convex Geometric Graphs. 195-220 1996 15 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/15n2p195.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#KupitzP96 2004-02-11 A Combinatorial Result About Points and Balls in Euclidean Space. 259-262 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#BaranySSU89 2002-12-16 Parititoning Arrangements of Lines II: Applications. 533-573 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Agarwal90a 2002-12-09 Counting Facets and Incidences. 359-369 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#AgarwalA92 2002-12-09 On Range Searching with Semialgebraic Sets. 393-418 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#AgarwalM94 2002-06-20 Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. 645-657 2000 24 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10064/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#AgarwalS00 2002-12-09 Applications of a New Space-Partitioning Technique. 11-38 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#AgarwalS93 2002-12-09 On the Number of Views of Polyhedral Terrains. 177-182 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#AgarwalS94 2002-12-02 Efficient Randomized Algorithms for Some Geometric. Optimization Problems. 317-337 1996 16 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/16n4p317.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#AgarwalS96 2002-11-25 Efficient Algorithms for Approximating Polygonal Chains. 273-291 2000 23 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/0023002/00230273.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#AgarwalV00 2002-12-16 Triangulating a Simple Polygon in Linear Time. 485-524 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Chazelle91 2002-12-09 An Optimal Convex Hull Algorithm in Any Fixed Dimension. 377-409 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Chazelle93 2002-12-02 Lower Bounds for Off-Line Range Searching. 53-65 1997 17 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/17n1p53.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Chazelle97 2002-12-16 On Translating One Polyomino to Tile the Plane. 575-592 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#BeauquierN91 2002-12-16 The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces. 337-343 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Edelsbrunner89 2002-12-09 The Union of Balls and Its Dual Shape. 415-440 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Edelsbrunner95 2002-11-25 Deformable Smooth Surface Design. 87-115 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p87.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Edelsbrunner99 2005-03-17 Complexity of Stratifications of Semi-Pfaffian Sets. 71-91 1995 14 Discrete & Computational Geometry 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#GabrielovV95 2002-12-19 The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space. 491-494 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2895/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#BlokhuisS02 2005-06-06 ⁿ_finite-Metric. 433-434 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#BlokhuisW92 2002-11-25 Isogonal Prismatoids. 13-52 1997 18 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/18n1p13.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Grunbaum97 2002-11-25 Realizations of Symmetric Maps by Symmetric Polyhedra. 19-33 1998 20 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/20n1p19.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Grunbaum98 2002-11-25 Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. 485-519 1998 19 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/19n4p485.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#BoissonnatSTY98 2002-12-16 Implicitly Representing Arrangements of Lines or Segments. 433-466 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#EdelsbrunnerGHSSSW89 2002-12-16 Computing the Volume is Difficulte. 319-326 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#BaranyF87 2004-05-18 On the Exact Constant i the Quantitative Steinitz Theorem in the Plane. 387-398 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#BaranyH94 2002-12-16 A Combinatorial Property of Points anf Ellipsoids. 375-382 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#BaranyL90 2002-01-03 <i>k</i>-Fans. 317-334 2001 25 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0003/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#BaranyM01 2002-03-15 Equipartition of Two Measures by a 4-Fan. 293-301 2002 27 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0071/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#BaranyM02 2002-12-09 Guest Editor's Forword. 243-244 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#BaranyP95 2002-12-09 On the Expected Number of k-Sets. 243-263 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#BaranyS94 2002-11-25 A Positive Fraction Erdos - Szekeres Theorem. 335-342 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p335.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#BaranyV98 2002-01-03 Cyclic Product Theorems for Polygons (I) Constructions using Circles. 551-571 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240551.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Shephard00 2002-01-03 Cyclic Product Theorems for Polygons (II) Constructions using Conic Sections. 513-526 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0025/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Shephard01 2002-12-09 Better Lower Bounds on Detecting Affine and Spherical Degeneracies. 41-57 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#EricksonS95 2002-12-09 Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies. 239-240 1997 18 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/18n2p239.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#EricksonS97 2002-12-16 Tiling the Torus and Other Space Forms. 55-72 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Senechal88 2002-12-09 On the Number of Minimal 1-Steiner Trees. 29-34 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#AronovBE94 2002-12-16 Points and Triangles in the Plane and Halving Planes in Space. 435-442 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#AronovCE91 2002-11-11 Generation of Oriented Matroids - A Graph Theoretical Approach. 117-136 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0056/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#FinschiF02 2002-12-09 The Furthest-Site Geodesic Voronoi Diagram. 217-255 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#AronovFW93 2002-12-02 The Universal Partition Theorem for Oriented Matroids. 121-145 1996 15 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/15n2p121.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Gunzel96 2002-11-25 On the Universal Partition Theorem for 4-Polytopes. 521-551 1998 19 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/19n4p521.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Gunzel98 2002-12-09 On the Zone of a Surface in a Hyperplane Arrangement. 177-186 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#AronovPS93 2002-11-25 On a Characterization of Gauss Codes. 287-295 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p287.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#FraysseixM99 2002-11-25 Cross-Ratios and Angles Determine a Polygon. 619-631 1999 22 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/22n4p619.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Snoeyink99 2002-01-03 Triangles of Extremal Area or Perimeter in a Finite Planar Point Set. 51-58 2001 26 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0010/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#BrassRS01 2002-01-03 On the Generation of Oriented Matroids. 197-208 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10027/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#BokowskiO00 2002-12-16 On the Coordinatization of Oriented Matroids. 293-306 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#BokowskiS86 2002-12-09 Equifacetted 3-Spheres as Topes of Nonpolytopal Matroid Polytopes. 347-361 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#BokowskiS95 2002-11-25 On the Number of Arrangements of Pseudolines. 257-267 1997 18 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/18n3p257.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Felsner97 2002-06-20 Fractional Planks. 585-602 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0088/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#AharoniHKM02 2002-11-25 On Simple Polygonalizations with Optimal Area. 73-110 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230073.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Fekete00 2002-12-09 Approximation of Zonoids by Zonotopes in Fixed Directions. 419-431 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#CampiHW94 2004-05-18 Characterization of Planar Pseudo-Self-Similar Tilings. 289-306 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0032/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#PriebeS01 2002-12-11 Polygon Triangulation in O (n log log n) Time with Simple Data Structures. 329-346 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#KirkpatrickKT92 2002-12-09 Quantitative Steinitz's Theorems Applications to Multifingered Grasping. 295-318 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#KirkpatrickMY92 2002-12-19 Intersection Properties of Families of Convex (n, d)-Bodies. 275-287 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p275.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#KaiserR99 2002-12-16 Nonobtuse Triangulation of Polygons. 147-168 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#BakerGR88 2002-11-25 Coherence and Enumeration of Tilings of 3-Zonotopes. 119-147 1999 22 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/22n1p119.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Bailey99 2003-07-31 ^p- Completeness. 3-13 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#BajajL89 2002-11-25 A Large Subgraph of the Minimum Weight Triangulation. 289-304 1997 18 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/18n3p289.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#DickersonKM97 2002-12-16 Balanced Subdivision and Enumeration in Balanced Spheres. 297-317 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#BillerM87 2005-02-16 Minimal-Energy Clusters of Hard Spheres. 237-259 1995 14 Discrete & Computational Geometry 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#SloaneHDC95 2002-11-25 Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem. 93-109 1997 18 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/18n1p93.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#FossmeierKZ97 2002-11-25 Motion Planning for Multiple Robots. 505-525 1999 22 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/22n4p505.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#AronovBSSV99 2002-01-03 A Double Tiling of Triangles and Regular Hexagons. 467-480 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240467.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#OkumuraR00 2002-12-09 Computation of Peirod Matrices of Real Algebraic Curves. 65-81 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Seppala94 2002-12-09 The Rooted Tree Embedding Problem into Points in the Plane. 51-63 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#IkebePTT94 2002-12-16 Geometry of the Gass-Saaty Parametric Cost LP Algorithm. 13-26 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#KleeK90 2002-11-25 Visibility with Multiple Reflections. 61-78 1998 20 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/20n1p61.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#AronovDDPP98 2002-12-09 Topological Representation of Dual Pairs of Oriented Matroids. 237-240 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#BrylawskiZ93 2002-11-25 Regression Depth and Center Points. 305-323 2000 23 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/0023003/00230305.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#AmentaBET00 2002-12-16 Finite Sphere Packing and Sphere Covering. 19-40 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#TothGW89 2002-12-16 An On-line Potato-Sack Theorem. 1-7 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#LassakZ91 2002-12-09 Edge Insertion for Optimal Triangulations. 47-65 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#BernEEMT93 2002-12-09 Circle Packing and Polyhedral Surfaces. 429-440 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#Garrett92 2002-12-16 The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. 311-336 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#EdelsbrunnerGS89 2002-12-16 The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments. 161-196 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#EdelsbrunnerGS90 2002-12-19 Topological Persistence and Simplification. 511-533 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2885/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#EdelsbrunnerLZ02 2002-12-02 Cutting Dense Point Sets in Half. 243-255 1997 17 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/17n3p243.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#EdelsbrunnerVW97 2002-12-16 An O(n log n) Algorithm for the All-nearest.Neighbors Problem. 101-115 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Vaidya89 2002-12-16 A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions. 369-381 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Vaidya91 2005-02-02 Spaces of Domino Tilings. 207-233 1995 14 Discrete & Computational Geometry 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#SaldanhaTJR95 2002-12-16 On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. 59-70 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#KedemLPS86 2002-11-25 Some Generalizations of the Pinwheel Tiling. 79-110 1998 20 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/20n1p79.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Sadun98 2002-11-25 Weak epsilon-Nets for Points on a Hypersphere. 83-91 1997 18 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/18n1p83.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#BradfordC97 2002-12-16 A Combinatorial Study of Multiplexes and Ordinary Polytopes. 49-63 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0051/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#BayerBS02 2002-12-02 Planar Rectifiable Curves Are Determined by Their. Projections. 21-31 1996 16 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/16n1p21.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Richardson96 2002-11-25 Approximation of Planar Convex Sets from Hyperplane Probes. 151-177 1997 18 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/18n2p151.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Richardson97 2002-11-25 Containment and Circumscribing Simplices. 229-235 1998 19 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/19n2p229.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Lutwak98 2002-12-19 On the Maximum Number of Equilateral Triangles, I. 129-135 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230129.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#AbregoF00 2002-12-19 The Unit Distance Problem for Centrally Symmetric Convex Polygons. 467-473 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2882/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#AbregoF02 2005-05-19 Some Properties of Graphs of Diameters. 293-300 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10036/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Dolnikov00 2004-05-18 Double-Lattice Packings of Convex Bodies in the Plane. 389-397 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#KuperbergK90 2005-11-08 Average Complexity of a Gift-Wrapping Algorithm for Determining the Convex Hull of Randomly Given Points. 79-109 1997 17 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/17n1p79.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Borgwardt97 2002-12-16 A Decomposition Theorem on Euclidean Steiner Minimal Trees. 367-382 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#HwangSTD88 2002-11-25 Medians of Discrete Sets according to a Linear Distance. 465-484 2000 23 Discrete & Computational Geometry 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#DauratLN00 http://link.springer.de/link/service/journals/00454/contents/00/10018/ 2002-11-25 Geometric Pattern Matching in d -Dimensional Space. 257-274 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p257.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#ChewDEK99 2005-07-21 <i>R</i>². 591-601 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0034/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#BandtW01 2002-12-09 On Lattice Points in Polyhedral Cross-Sections. 95-99 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#KorneenkoM93 2002-12-16 On the Global Structure of Crystalline Surfaces. 225-262 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Taylor91 2004-02-26 On Flag Vectors, the Dowling Lattice, and Braid Arrangements. 389-403 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p389.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#EhrenborgR99 2002-01-03 Hadwiger - Wills-Type Higher-Dimensional Generalizations of Pick's Theorem. 355-364 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10041/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Kolodziejczyk00 2006-09-28 On the Graph of Large Distance. 541-549 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#ErdosLV89 2004-05-18 Nonperiodicity Implies Unique Composition for Self-Similar Translationally Finite Tilings. 265-279 1998 20 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/20n2p265.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Solomyak98 2002-12-09 Extremal Polynomials for Obtaining Bounds for Spherical Codes and Designs. 167-183 1995 14 Discrete & Computational Geometry 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Boyvalenkov95 2002-12-02 Accounting for Boundary Effects in Nearest-Neighbor Searching. 155-176 1996 16 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/16n2p155.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#AryaMN96 2002-12-16 Steiner Minimal Trees on Sets of Four Points. 401-414 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#DuHST87 2005-06-06 Cutting Disjoint Disks by Straight Lines. 239-243 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#AlonKP89 2002-12-09 An Efficient Algorithm for Guard Placement in Polygons with Holes. 77-109 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Bjorling-SachsS95 2002-11-25 Sections of the Difference Body. 137-146 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230137.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Rudelson00 2002-01-03 Finding Optimal Shadows of Polytopes. 219-240 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10029/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#BurgerG00 2002-12-16 Toughness and Delaunary Triangulations. 575-601 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Dillencourt90 2002-12-09 Approximating the Ball by a Minkowski Sum of Segments with Equal Length. 131-144 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#BourgainL93 2002-01-03 Voronoi Diagrams for Convex Polygon-Offset Distance Functions. 271-291 2001 25 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/00/10081/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#BarequetDG01 2002-12-09 Diameter, Width, Closest Line Pair, and Parametric Searching. 183-196 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#ChazelleEGS93 2002-12-09 Separating Convex Sets in the Plane. 189-195 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#CzyzowiczRU92 2002-11-25 Nonconstructible Simplicial Balls and a Way of Testing Constructibility. 223-230 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p223.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Hachimori99 2006-01-17 Transversals for Families of Translates of a Two-Dimensional Convex Compact Set. 345-354 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10040/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Karasev00 2006-01-17 On a Conjecture of A. Bezdek. 419-439 2002 27 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0072/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Karasev02 2002-12-09 Decomposition of Convex Figures into Similar Pieces. 143-148 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Laczkovich95 2002-11-25 Tilings of Polygons with Similar Triangles, II. 411-425 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p411.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Laczkovich98 2002-11-25 A Special Case of Mahler's Conjecture. 163-177 1998 20 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/20n2p163.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#LopezR98 2006-01-31 ₅₅. 149-159 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#RichterT95 2002-12-16 On the Complexity of Polyhedral Separability. 325-337 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Megiddo88 2002-12-16 On the Ball Spanned by Balls. 605-610 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Megiddo89 2004-07-05 Edge-Ramsey Theory. 341-352 1996 15 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/15n3p341.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Cantwell96 2002-12-09 Helly-Type Theorems and Generalized Linear Programming. 241-261 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Amenta94 2002-12-02 A Short Proof of an Interesting Helly-Type Theorem. 423-427 1996 15 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/15n4p423.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Amenta96 2002-12-09 Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. 113-122 1995 14 Discrete & Computational Geometry 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#GuibasHMS95 2002-06-20 Curve Reconstruction, the Traveling Salesman Problem, and Menger's Theorem on Length. 577-603 2000 24 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10061/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Giesen00 2004-02-17 Kinetic Connectivity for Unit Disks. 591-610 2001 25 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0015/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#GuibasHSZ01 2002-12-16 Congruence, Similarity, and Symmetries of Geometric Objects. 237-256 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#AltMWW88 2002-12-09 The Limit Shape of Convex Lattice Polygons. 279-295 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Barany95 2003-02-14 Imbedded Circle Patterns with the Combinatorics of the Square Grid and Discrete Painlevé Equations. 305-319 2003 29 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/02/0761/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Agafonov03 2002-11-25 ₄without Miracles. 425-427 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p425.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Stembridge99 2002-12-09 Lower Bounds for the Numbers of Antipodal Pairs and Strictly Antipodal Pairs of Vertices in a Convex Polytope. 149-162 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#NguyenS94 2002-12-16 Parallelotopes of Maximum Volume in a Simplex. 449-462 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p449.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Lassak99 2002-01-03 <i>R</i>³. 1-17 2001 26 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10090/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#MacdonaldPT01 2002-12-09 On the Number of Guard Edges of a Polygon. 447-462 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#ParkSCW93 2002-12-09 Higher-Order Rigidity - What Is the Proper Definition. 193-200 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#ConnellyS94 2002-12-16 A Commutative Algebra for Oriented Matroids. 73-84 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0053/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Cordovil02 2002-12-16 The Complexity of Many Cells in Arrangements of Planes and Related Problems. 197-216 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#EdelsbrunnerGS90a 2002-01-03 Face Numbers of Scarf Complexes. 185-196 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10026/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Bjorner00 2002-12-16 Star-Shaped Sets in Normed Spaces. 63-71 1996 15 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/15n1p63.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#BoltyanskiMS96 2005-04-20 On Grünbaum's Conjecture about Inner Illumination of Convex Bodies. 403-410 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p403.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#BoltyanskiMS99 2002-12-09 Subdivision Algorithms and the Kernel of a Polyhedron. 417-427 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#GardnerK92 2003-02-14 Reconstruction of Convex Bodies from Brightness Functions. 279-303 2003 29 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/02/0759/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#GardnerM03 2004-05-18 A Smaller Sleeping Bag for a Baby Snake. 173-181 2001 26 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0011/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#HastadLW01 2002-12-16 An Exact Algorithm for Kinodynamic Planning in the Plane. 461-484 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#CannyRR91 2002-11-25 A Probabilistic Analysis of the Power of Arithmetic Filters. 523-547 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p523.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#DevillersP98 2002-12-16 A Jordan Surface Theorem for Three-Dimensional Digital Spaces. 155-161 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#KoppermanMW91 2002-11-25 The Graph of Triangulations of a Point Configuration with d +4 Vertices Is 3-Connected. 489-536 2000 23 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10013/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#AzaolaS00 2002-06-20 The Number of Triangulations of the Cyclic Polytope C (n, n-4). 29-48 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0050/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#AzaolaS02 2002-12-09 Finding a Minimum-Weight k-Link Path Graphs with the Concae Monge Property and Applications. 263-280 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#AggarwalST94 2002-01-03 Approximation of Quasisymmetries Using Circle Packings. 103-124 2001 25 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10067/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Williams01 2002-12-09 Almost Optimal Set Covers in Finite VC-Dimension. 463-479 1995 14 Discrete & Computational Geometry 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#BronnimannG95 2002-12-09 A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons. 65-82 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#SrinivasaraghavanM94 2002-11-25 The Number of k -Faces of a Simple d -Polytope. 1-16 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p1.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#BjornerL99 2002-12-09 Representing Geometric Structures in d Dimensions: Topology and Order. 387-426 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Brisson93 2002-12-16 New Applications of random Sampling in Computational Geometry. 195-222 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Clarkson87 2002-12-09 A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem. 427-433 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Clarkson93 2002-11-25 Nearest Neighbor Queries in Metric Spaces. 63-93 1999 22 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/22n1p63.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Clarkson99 2002-01-03 Curvature and Geometry of Tessellating Plane Graphs. 141-159 2001 25 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10076/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#BauesP01 2002-12-16 Can You Cover Your Shadows?. 45-58 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#DebrunnerM86 2002-01-03 Every Set of Disjoint Line Segments Admits a Binary Tree. 387-410 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0042/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#BoseHT01 2002-12-02 A Compact Piecewise-Linear Voronoi Diagram for Convex Sites in the Plane. 73-105 1996 15 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/15n1p73.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#McAllisterKS96 2002-01-03 Crystallography and Riemann Surfaces. 445-476 2001 25 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/00/10091/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Elser01 2002-12-16 On the Modality of Convex Polygons. 409-419 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Abrahamson90 2002-11-25 Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. 269-288 1997 18 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/18n3p269.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#SchwarzkopfS97 2002-12-02 Rectangling a Rectangle. 217-225 1997 17 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/17n2p217.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#FreilingLR97 2002-06-20 A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary. 531-550 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0083/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#GurvitsS02 2002-11-25 Voronoi Diagrams and Convex Hulls of Random Moving Points. 343-365 2000 23 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/0023003/00230343.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Dwyer00 2002-12-16 Higher-Dimensional Voronoi Diagrams in Linear Expected Time. 343-367 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Dwyer91 2002-12-02 Voronoi Diagrams of Random Lines and Flats. 123-136 1997 17 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/17n2p123.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Dwyer97 2002-12-16 On k-Sets in Arrangement of Curves and Surfaces. 593-613 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Sharir91 2002-12-09 Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. 327-345 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Sharir94 2002-11-25 A Near-Linear Algorithm for the Planar 2-Center Problem. 125-134 1997 18 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/18n2p125.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Sharir97 2002-12-16 ^d. 219-227 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#GoodmanP86 2004-12-13 A Polyhedral Approach for a Constrained Matching Problem. 429-437 1997 17 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/17n4p429.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#HefnerK97 2002-12-16 On Helly's Theorem: Algorithms and Extensions. 393-410 1997 17 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/17n4p393.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#BriedenT97 2002-12-11 Almost Tight Bounds for epsilon-Nets. 163-173 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#KomlosPW92 2002-12-16 Helly-Type Theorems for Spheres. 279-285 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Maehara89a 2002-12-16 On Graver's Conjecture Concerning the Rigidity Problem of Graphs. 339-342 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Maehara91a 2004-09-07 On the Contact Dimensions of Graphs. 89-96 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#FranklM88 2004-07-19 Plane Sections of Convex Bodies of Maximal Volume. 33-49 2001 25 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10070/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#MakaiVZ01 2002-12-09 Approximating Euclidean Distances by Small Degree Graphs. 213-233 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Soares94 2002-12-16 A New Approach to the Dynamic Maintaince of Maximal Points in a Plane. 365-374 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#FredericksonR90 2002-12-19 Isoperimetric Constants of Infinite Plane Graphs. 313-330 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/0694/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#LawrencenkoPZ02 2004-12-13 Three Theorems, with Computer-Aided Proofs, on Three-Dimensional Faces and Quotients of Polytopes. 413-420 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240413.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#MeisingerKK00 2002-12-16 On Two Conjectures of Franz Hering about Convex Surfaces. 171-180 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Zamfirescu91 2005-06-06 On the Pentomino Exclusion Problem. 375-386 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0036/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#GravierP01 2005-05-23 A Cone of Inhomogeneous Second-Order Polynomials. 387-416 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#Erdahl92 2002-12-09 Areas of Polygons Inscribed in a Circle. 223-236 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Robbins94 2002-01-03 Geometric Construction of a Coboundary of a Cycle. 125-140 2001 25 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10072/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#AlliliK01 2002-12-02 Nonregular Triangulations of Products of Simplices. 253-264 1996 15 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/15n3p253.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Loera96 2002-12-09 How to Take Short Cuts. 251-264 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#KenyonK92 2002-12-02 Isomorphism of Spiral Polygons. 277-304 1996 16 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/16n3p277.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#MacDonaldS96 2006-09-05 On the Determination of Star and Convex Bodies by Section Functions. 69-85 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p69.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#GardnerSV99 2002-11-25 A Bound on the Ratio between the Packing and Covering Densities of a Convex Body. 325-331 2000 23 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/0023003/00230325.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Smith00 2002-11-25 Finding the Shortest Watchman Route in a Simple Polygon. 377-402 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p377.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#CarlssonJN99 2002-12-16 A New Index for Polytopes. 33-47 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#BayerK91 2004-05-18 On-Line Covering a Cube by a Sequence of Cubes. 83-90 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Kuperberg94 2004-05-18 Knotted Lattice-Like Space Fillers. 561-567 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Kuperberg95 2003-02-06 Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling. 485-503 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#PatersonY90 2002-03-15 Kalai's Squeezed 3-Spheres Are Polytopal. 395-407 2002 27 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0074/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Pfeifle02 2002-11-25 On Random Sections of the Cube. 157-169 2000 23 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/0023002/00230157.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Lonke00 2004-02-17 Applications of Random Sampling to On-line Algorithms in Computational Geometry. 51-71 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#BoissonnatDSTY92 2002-12-09 A Postscript on Distances in Convex n-Gons. 111-117 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#ErdosF94 2002-12-16 ²³. 325-331 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#ErdosK90 2002-12-09 Two Combinatorial Problems in the Plane. 441-443 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#ErdosP95 2004-05-18 Solid Coverings of the Euclidean Plane with Incongruent Circles. 225-245 2000 23 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/0023002/00230225.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#FlorianH00 2002-11-25 Rectification Principles in Additive Number Theory. 343-354 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p343.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#BiluLR98 2002-12-09 Residual Finiteness of Surface Groups via Tessellations. 201-211 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Lopez94 2003-02-14 Densest Packing of Equal Spheres in Hyperbolic Space. 23-39 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2791/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#BowenR03 2002-12-09 Area Requirement and Symmetry Display of Planar Upward Drawings. 381-401 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#BattistaTT92 2005-03-14 Dihedral Angles of Convex Polyhedra. 409-417 2000 23 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/0023003/00230409.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Schlenker00 2002-01-30 _pⁿ. 215-226 2002 27 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0066/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#BartheN02 2002-11-25 Degenerate Convex Hulls On-Line in Any Fixed Dimension. 527-545 1999 22 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/22n4p527.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Bronnimann99 2002-11-25 Two Finiteness Theorems for Periodic Tilings of d-Dimensional Euclidean Space. 143-153 1998 20 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/20n2p143.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#DolbilinDH98 2005-02-16 Relations in SO (3) Supported by Geodetic Angles. 453-463 2000 23 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10015/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#ConwayRS00 2005-02-16 On Angles Whose Squared Trigonometric Functions Are Rational. 321-332 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p321.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#ConwayRS99 2006-01-31 Ubiquitous Angles in Equiangular Sets of Lines. 313-324 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10038/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#GuiduliR00 2002-12-16 Multiregular Point Systems. 477-498 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p477.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#DolbilinLS98 2002-11-25 On the Structure of Multiple Translational Tilings by Polygonal Regions. 537-553 2000 23 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10014/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Kolountzakis00 2004-05-18 On the Volume of the Union of Balls. 449-461 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p449.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Csikos98 2006-04-20 There Exist 6n/13 Ordinary Points. 187-202 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#CsimaS93 2002-12-09 Computability and Complexity of Ray Tracing. 265-287 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#ReifTY94 2002-01-03 Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. 307-320 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0039/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#AgarwalAS01 2002-11-25 Largest Placement of One Convex Polygon Inside Another. 95-104 1998 19 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/19n1p95.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#AgarwalAS98 2002-11-25 Motion Planning for a Convex Polygon in a Polygonal Environment. 201-221 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p201.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#AgarwalAS99 2002-12-16 Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. 407-422 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#AgarwalES91 2002-01-03 Guest Editors' Foreword. 505-506 2001 25 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/1025004/10250505.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#AgarwalHP01 2002-12-02 The Overlay of Lower Envelopes and Its Applications. 1-13 1996 15 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/15n1p1.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#AgarwalSS96 2002-11-25 The Discrete 2-Center Problem. 287-305 1998 20 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/20n3p287.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#AgarwalSW98 2005-01-27 Realizations of Regular Toroidal Maps of Type {4, 4}. 453-466 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240453.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#MonsonW00 2002-12-19 Inequalities between Lattice Packing and Covering Densities of Centrally Symmetric Plane Convex Bodies. 365-388 2001 25 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/00/10068/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Ismailescu01 2002-12-19 Restricted Point Configurations with Many Collinear {k}-Tuplets. 571-575 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2887/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Ismailescu02 2002-12-19 Covering the Plane with Copies of a Convex Disk. 251-263 1998 20 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/20n2p251.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Ismailescu98 2002-11-18 On the Number of Facets of Three-Dimensional Dirichlet Stereohedra I: Groups with Reflections. 419-444 2001 25 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/00/10082/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#BochisS01 2002-01-03 The Screensaver Map: Dynamics on Elliptic Curves Arising from Polygonal Folding. 477-502 2001 25 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/00/10075/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#EschR01 2005-05-23 Spatial Graphs and Oriented Matroids: the Trefoil. 149-158 1999 22 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/22n1p149.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Alfonsin99 2002-12-16 Computing Simple Circuits form a Set of Line Segments. 289-304 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#RappaportIT90 2006-05-23 Generating Closed 2-Cell Embeddings in the Torus and the Projective Plane. 233-247 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Barnette87 2006-05-23 ^vPaths on the Torus. 603-608 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Barnette90 2002-12-16 The Weakly Neighborly Polyhedral Maps on the 2-Manifold with Euler Characteristic - 1. 355-369 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#AltshulerB86 2002-12-09 Neighborly Maps with Few Vertices. 93-104 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#AltshulerB92 2004-05-18 Edge Close Ball Packings. 59-71 2001 26 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0021/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Boroczky01a 2004-05-18 Quasicrystals and the Wulff-Shape. 421-436 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p421.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#BoroczkyS99 2002-12-09 Gaussian Samples, Regular Simplices, and Exchangeability. 257-261 1997 17 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/17n3p257.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Baryshnikov97 2002-12-19 Visibility Graphs and Oriented Matroids. 449-465 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2881/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#AbelloK02 2002-12-09 Constructing Arrangement Optimally in Parallel. 371-385 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Goodrich93 2002-12-09 Efficient Piecewise-Linear Function Approximation Using the Uniform Metric. 445-462 1995 14 Discrete & Computational Geometry 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Goodrich95 2002-12-16 A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. 591-604 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#AggarwalGSS89 2002-11-25 Fast Algorithms for Complete Linkage Clustering. 131-145 1998 19 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/19n1p131.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#KrznaricL98 2002-12-09 Finding Minimum Area k-gons. 45-58 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#EppsteinORW92 2002-12-09 Cutting Hyperplanes for Divide-and-Conquer. 145-158 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#Chazelle93a 2002-12-16 Linear Space Data Structures for Two Types of Range Search. 113-126 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#ChazelleE87 2002-12-16 Visibility and Intersection Problems in Plane Geometry. 551-581 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#ChazelleG89 2002-01-03 The Discrepancy of Boxes in Higher Dimension. 519-524 2001 25 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0014/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#ChazelleL01 2002-12-16 Halfspace Range Search: An Algorithmic Application of k-Sets. 83-93 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#ChazelleP86 2002-12-16 Triangulating a Nonconvex Polytope. 505-526 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#ChazelleP90 2002-12-09 Search Costs in Quadtrees and Singularity Perturbation Asymptotics. 151-175 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#FlajoletL94 2002-12-09 Bounds on the Size of Tetrahedralizations. 429-444 1995 14 Discrete & Computational Geometry 4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#ChazelleS95 2002-12-16 Quasi-Optimal Range Searching in Space of Finite VC-Dimension. 467-489 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#ChazelleW89 2002-12-18 An Efficient Algorithm for the Three-Dimensional Diameter Problem. 235-255 2001 25 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/00/10086/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Bespamyatnikh01 2002-12-18 An Optimal Algorithm for Closest-Pair Maintenance. 175-195 1998 19 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/19n2p175.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Bespamyatnikh98 2002-06-20 A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron. 603-602 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2776/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#StanleyP02 2004-05-18 Solid Circle-Packings in the Euclidean Plane. 29-43 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Heppes92 2004-05-18 On Surface-Minimizing Polyhedral Decompositions. 529-539 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Heppes95 2002-12-09 Largest j-Simplices n-Polytopes. 477-515 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#GritzmannKL95 2002-12-09 Can Visibility Graphs Be Represented Compactly?. 347-365 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#AgarwalAAS94 2002-11-25 On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. 315-331 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p315.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#AgarwalACS98 2002-12-09 Local Rules for Pentagonal Quasi-Crystals. 31-70 1995 14 Discrete & Computational Geometry 1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Thang95 2002-06-20 Approximation Algorithms for Minimum-Width Annuli and Shells. 687-705 2000 24 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10062/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#AgarwalAHS00 2002-11-25 Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. 373-388 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p373.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#AgarwalAS99a 2002-12-19 Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles. 607-624 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2892/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Pinchasi02 2002-01-03 Maintaining the Extent of a Moving Point Set. 353-374 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0019/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#AgarwalGHV01 2002-01-03 On Holyhedra. 85-104 2000 24 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10033/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Vinson00 2002-12-16 Upper Bounds on Geometric Permutations for Convex Sets. 27-33 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#Wenger90 2002-12-16 Rectilinear Shortest Paths in the presence of Rectangular Barriers. 41-53 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#RezendeLW89 2002-12-16 Spherical Complexes and Nonprojective Toric Varieties. 115-122 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Ewald86 2002-12-16 On the Classification of Toric Fano Varieties. 49-54 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Ewald88 2002-11-25 Tiling Groups: New Applications in the Triangular Lattice. 189-204 1998 20 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/20n2p189.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Remila98 2002-12-02 Embedding Metric Spaces in the Rectilinear Plane: a Six-Point Criterion. 107-117 1996 15 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/15n1p107.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#BandeltC96 2002-01-03 A Generalized Conjecture about Cutting a Polygon into Triangles of Equal Areas. 141-145 2000 24 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10021/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Stein00 2002-12-16 Invertible Relations on Polytopes. 395-399 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Sallee87 2002-03-15 Closed-Form Expressions for Uniform Polyhedra and Their Duals. 353-375 2002 27 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0078/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Messer02 2002-12-09 Low-Degree Minimum Spanning Trees. 151-165 1995 14 Discrete & Computational Geometry 2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#RobinsS95 2002-01-03 Mutation Polynomials and Oriented Matroids. 365-390 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10042/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Lawrence00 2002-12-16 Valuations and Polarity. 307-324 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Lawrence88 2002-12-16 A Geometric Realization Without Self-Intersections Does Exist for Dyck's Regular Map. 583-589 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Bokowski89 2002-12-19 A Short Simplicial h-Vector and the Upper Bound Theorem. 283-289 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/0746/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#HershN02 2002-11-25 Ramsey-Type Results for Geometric Graphs, II. 375-388 1998 20 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/20n3p375.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#KarolyiPTV98 2002-06-20 Edgewise Subdivision of a Simplex. 707-719 2000 24 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10063/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#EdelsbrunnerG00 2002-12-02 Inclusion - Exclusion Complexes for Pseudodisk Collections. 287-306 1997 17 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/17n3p287.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#EdelsbrunnerR97 2002-12-16 Voronoi Diagrams and Arrangements. 25-44 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#EdelsbrunnerS86 2002-12-16 The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2. 35-42 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#EdelsbrunnerS90 2002-12-09 An Upper Bound for Conforming Delaunary Triangulations. 193-213 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#EdelsbrunnerT93 2002-11-25 Mapping Zr into Zs with Maximal Contraction. 131-138 1998 20 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/20n1p131.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Stong98 2002-12-09 On Polytopes Cut by Flats. 287-294 1995 14 Discrete & Computational Geometry 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Kincses95 2002-06-20 The Mean Number of Extreme Lines in a Convex Hull of Lines. 485-499 2002 27 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0093/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Gates02 2002-01-03 Neighborly Cubical Polytopes. 325-344 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/contents/00/10039/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#JoswigZ00 2002-12-09 The Countability of a Tiling Family and the Periodicity of a Tiling. 405-414 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Dolbilin95 2002-12-19 Lines Tangent to Four Unit Spheres with Coplanar Centres. 493-497 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0046/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Megyesi01 2002-12-19 ⁿ^n-1Common Tangent Lines. 405-409 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/0744/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Megyesi02 2003-02-14 Finding Sets of Points without Empty Convex 6-Gons. 153-158 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2829/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Overmars03 2002-12-09 The Number of Different Distances Determined by a Set of Points in the Euclidean Plane. 1-11 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#ChungST92 2004-05-18 About the Error Term for Best Approximation with Respect to the Hausdorff Related Metrics. 293-309 2001 25 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/00/10088/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Boroczky01 2002-12-09 The Generic Contact of Convex Bodies with Circumscribed Homothets of a Convex Surface. 319-323 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Zucco92 2002-01-03 Locked and Unlocked Polygonal Chains in Three Dimensions. 269-281 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0038/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#BiedlDDLLOORSTW01 2002-06-20 Guest Editors' Foreword. 1-2 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/2027001/20270001.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#LoeraSS02 2002-12-02 The Number of Geometric Bistellar Neighbors of a Triangulation. 131-142 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p131.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#LoeraSU99 2002-12-09 Approximating the Minimum Weight Steiner Triangulation. 163-191 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Eppstein94 2002-12-09 Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions. 111-122 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Eppstein95 2002-11-25 Geometric Lower Bounds for Parametric Matroid Optimization. 463-476 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p463.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Eppstein98 2002-12-09 Simple Vertices of Maximal Minor Polytopes. 289-309 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#SanthanakrishnanZ94 2004-06-21 On the Stanley Ring of a Cubical Complex. 305-330 1995 14 Discrete & Computational Geometry 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#Hetyei95 2004-06-21 On the cd-Variation Polynomials of André and Simsun Permutations. 259-275 1996 16 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/16n3p259.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Hetyei96 2002-01-30 Bounds for Local Density of Sphere Packings and the Kepler Conjecture. 165-193 2002 27 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0060/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Lagarias02 2002-11-25 Geometric Models for Quasicrystals I. Delone Sets of Finite Type. 161-191 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p161.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Lagarias99 2002-11-25 Triangulations with Very Few Geometric Bistellar Neighbors. 15-33 2000 23 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/0023001/00230015.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Santos00 2002-12-02 On Delaunay Oriented Matroids for Convex Distance Functions. 197-210 1996 16 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/16n2p197.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Santos96 2002-11-25 Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions. 217-231 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p217.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Har-Peled99 2002-12-09 Iterated Nearest Neighbors and Finding Minimal Polytopes. 321-350 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#EppsteinE94 2002-11-25 Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions. 569-592 1999 22 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/22n4p569.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#EppsteinE99 2002-12-09 Two Constructions of Oriented Matroids with Disconnected Extension Space. 271-285 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#MnevR93 2002-12-09 Combinatorial Models for the Finite-Dimensional Grassmannians. 241-250 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#MnevZ93 2002-12-09 On Lines Missing Polyhedral Sets in 3-Space. 203-221 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Pellegrini94 2002-12-02 Monte Carlo Approximation of Form Factors with Error Bounded a Priori. 319-337 1997 17 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/17n3p319.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Pellegrini97 2002-12-09 Mixed Functionals of Convex Bodies. 527-538 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240527.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Schneider00 2002-12-16 Tessellations Generated by Hyperplanes. 223-232 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Schneider87 2002-12-09 Isoperimetric Inequalities for Infinite Hyperplane Systems. 609-627 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Schneider95 2002-12-09 On Antipodal and Adjoint Pairs of Points for Two Convex Bodies. 629-636 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Soltan95 2005-04-20 A Characterization of Homothetic Simplices. 193-200 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p193.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Soltan99 2002-12-16 A Geometric Inequality and the Complexity of Computing Volume. 289-292 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Elekes86 2002-12-09 Generalized Breadths, Circular Cantor Sets, and the Least Area UCC. 439-449 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Elekes94 2002-11-25 A Combinatorial Problem on Polynomials. 383-389 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p383.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Elekes98 2002-12-02 The Maximum Number of Odd Integral Distances Between Points in the Plane. 113-115 1996 16 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/16n1p113.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Piepmeyer96 2002-12-16 On the Cone of Nonnegative Circuits. 229-239 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#HoffmanL86 2002-11-25 Depth in an Arrangement of Hyperplanes. 167-176 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p167.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#RousseeuwH99 2002-01-03 A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time. 245-265 2001 26 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0027/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#AmatoGR01 2002-11-25 An Upper and a Lower Bound Theorem for Combinatorial 4-Manifolds. 575-593 1998 19 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/19n4p575.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Sparla98 2002-12-09 Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions. 73-92 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#Snyder92 2002-12-02 The Illumination Bodies of a Simplex. 297-306 1996 15 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/15n3p297.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#Werner96 2005-06-28 On the Complexity of a Single Cell in Certain Arrangement of Surfaces Related to Motion Planning. 1-33 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Halperin94 2002-12-16 Nonorientable Genus of Nearly Complete Bipartite Graphs. 137-146 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Mohar88 2002-12-09 Convex Representations of Maps on the Torus and Other Flat Surfaces. 83-95 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Mohar94 2002-01-03 Equivelar Polyhedra with Few Vertices. 429-461 2001 26 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0008/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#DattaN01 2002-12-09 Tilings of the Square with Similar Rectangles. 569-572 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#LoczkovichS95 2002-01-30 A Dido Problem as Modernized by Fejes Toth. 227-250 2002 27 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/01/0063/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Siegel02 2003-02-14 An Isoperimetric Theorem in Plane Geometry. 239-255 2003 29 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/02/2809/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Siegel03 2002-12-09 A Decomposition of 2-Weak Vertex-packing Polytopes. 465-479 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Steigrimsson94 2002-12-02 A New Technique for Analyzing Substructures in Arrangements of Piecewise Linear Surfaces. 455-479 1996 16 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/16n4p455.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#Tagansky96 2002-11-25 Finding Convex Sets Among Points in the Plane. 405-410 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p405.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#KleitmanP98 2002-12-16 Storing the Subdivision of a Polyhedral Surface. 153-174 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Mount87 2002-12-16 A Reduction of Lattice Tiling bz Translates of a Cubical Cluster. 33-36 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#Szabo87 2002-12-02 Triangulations Intersect Nicely. 339-359 1996 16 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/16n4p339.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#AichholzerACKRTX96 2002-11-25 On Conway's Thrackle Conjecture. 369-376 1997 18 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/18n4p369.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#LovaszPS97 2002-12-09 How Hard Is Half-Space Range Searching. 143-155 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#BronnimannCP93 2002-12-19 Recognizing String Graphs Is Decidable. 593-606 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2891/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#PachT02a 2002-12-09 An Upper Bound on the Number of Planar K-Sets. 109-123 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#PachSS92 2002-06-20 New Bounds on Crossing Numbers. 623-644 2000 24 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/00/10011/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#PachST00 2003-07-24 <i>R</i>³. 549-571 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0022/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Delgado-Friedrichs01 2002-11-25 Geometric Models for Quasicrystals II. Local Rules Under Isometries. 345-372 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p345.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Lagarias99a 2006-02-01 ⁿand Scissors Congruence. 359-360 1995 14 Discrete & Computational Geometry 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#LagariasM95 2002-11-25 Counting d -Step Paths in Extremal Dantzig Figures. 19-31 1998 19 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/19n1p19.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#LagariasP98 2002-12-09 ⁿand Nonlinear Codes. 359-391 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#LagariasS94 2003-02-14 Substitution Delone Sets. 175-209 2003 29 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/02/2820/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#LagariasW03 2002-12-09 On a Generalization of the Gallai-Sylvester Theorem. 87-103 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Kupitz92 2002-12-19 NP - Hardness of Largest Contained and Smallest Containing Simplices for V- and H-Polytopes. 349-377 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/0745/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Packer02 2004-05-18 Almost-Tiling the Plane by Ellipses. 367-375 1999 22 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/22n3p367.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#KuperbergKMV99 2002-01-03 Polytopes in Arrangements. 51-63 2001 25 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10066/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#AronovD01 2002-11-25 Approximating Minimum-Weight Triangulations in Three Dimensions. 527-549 1999 21 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/21n4p527.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#AronovF99 2002-12-09 Nonoverlap of the Star Unfolding. 219-250 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#AronovO92 2002-12-19 Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. 475-490 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/0084/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#AronovS02 2002-12-09 Castles in the Air Revisited. 119-150 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#AronovS94 2002-12-19 Line Transversals to Unit Disks. 379-387 2002 28 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/02/2821/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Kaiser02 2002-12-19 Transversals of d-Intervals. 195-203 1997 18 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/18n2p195.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Kaiser97 2002-12-09 Covering the Plane with Two Kinds of Circles. 445-457 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Toth95a 2002-11-25 Note on the Erdos - Szekeres Theorem. 457-459 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p457.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#TothV98 2002-12-09 Geometric Graphs with Few Disjoint Edges. 633-642 1999 22 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/22n4p633.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#TothV99 2002-12-09 A Note on Small Linear-Ordering Polytopes. 67-78 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Reinelt93 2002-12-02 On Recognizing and Characterizing Visibility Graphs of Simple Polygons. 143-162 1997 17 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/17n2p143.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#Ghosh97 2002-12-02 Bernstein's Theorem in Affine Space. 137-141 1997 17 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/17n2p137.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#HuberS97 2002-12-02 Topologically Sweeping Visibility Complexes via Pseudotriangulations. 419-453 1996 16 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/16n4p419.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#PocchiolaV96 2002-11-25 Randomized Complexity Lower Bound for Arrangements and Polyhedra. 329-344 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p329.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Grigoriev99 2002-12-16 ⁿ. 15-18 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Maehara89 2002-12-16 Dispersed Points and Geometric Embedding of Complete Bipartite Graphs. 57-67 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Maehara91 2002-12-09 Embedding a Polytope in a Lattice. 585-592 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Maehara95 2002-01-03 Guest Editors' Foreword. 149-150 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240149.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#KalaiK00 2002-01-03 Online Point Location in Planar Arrangements and Its Applications. 19-40 2001 26 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0026/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Har-PeledS01 2002-11-25 On Generalized h -Vectors of Rational Polytopes with a Symmetry of Prime Order. 259-268 1999 22 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/22n2p259.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#ACampo-Neuen99 2002-01-03 Unilateral and Equitransitive Tilings by Squares. 519-526 2000 24 Discrete & Computational Geometry 2-3 http://link.springer.de/link/service/journals/00454/bibs/0024002/00240519.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Schattschneider00 2002-12-02 On Nearest-Neighbor Graphs. 263-282 1997 17 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/17n3p263.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#EppsteinPY97 2002-12-16 Hyperplane Arrangements with a Lattice of Regions. 263-288 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#BjornerEZ90 2005-02-17 McLaren's Improved Snub Cube and Other New Spherical Designs in Three Dimensions. 429-441 1996 15 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/15n4p429.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg15.html#HardinS96 2002-12-16 Random Polytopes in the d-Dimensional Cube. 315-319 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#Furedi86 2002-12-16 The Densest Packing of Equal Circles into a Parallel Strip. 95-106 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Furedi91 2005-05-23 Stresses and Liftings of Cell-Complexes. 481-517 1999 21 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/21n4p481.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Rybnikov99 2002-12-09 A New Bound on the Local Density of Sphere Packings. 351-375 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Muder93 2002-12-02 Projections of Polytopes and the Generalized Baues Conjecture. 215-237 1996 16 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/16n3p215.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#RambauZ96 2004-06-21 Isohedral Polyomino Tiling of the Plane. 615-630 1999 21 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/21n4p615.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#KeatingV99 2002-12-09 Finding Stabbing Lines in 3-Space. 191-208 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#PellegriniS92 2002-06-20 Infinitesimal Hopf Algebras and the cd-Index of Polytopes. 3-28 2002 27 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0049/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#Aguiar02 2002-12-16 Disjoint Homotopic Paths and Trees in a Planar Graph. 527-574 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Schrijver91 2002-12-16 Constraints on the Angular Distribution of the Zeros of a Polynomial of Low Complexity. 163-169 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Stengel91 2002-11-25 New Maximal Numbers of Equilibria in Bimatrix Games. 557-568 1999 21 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/21n4p557.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Stengel99 2002-12-02 Extremal Properties of 0/1-Polytopes. 439-448 1997 17 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/17n4p439.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#KortenkampRSZ97 2002-01-03 The Honeycomb Conjecture. 1-22 2001 25 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10071/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Hales01 2002-11-25 Sphere Packings, II. 135-149 1997 18 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/18n2p125.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Hales97 2002-12-09 An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. 131-152 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#DjidjevLS92 2002-12-09 Minimum Dissection of a Rectilinear Polygon with Arbitrary Holes into Rectangles. 57-79 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#SoltanG93 2002-11-25 Guest Editor's Foreword. 479-480 1999 22 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/22n4p479.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#Clarkson99a 2002-12-16 Application of Random Sampling in Computational Geometry, II. 387-421 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#ClarksonS89 2002-12-09 <i>M</i>=2. 527-541 2001 26 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0035/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg26.html#Boltyanski01 2002-12-09 A New Step in the Solution of the Szökefalvi-Nagy Problem. 27-49 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#Boltyanski92 2002-12-16 Bounding the Number of Connected Components of a Real Algebraic Set. 191-209 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#BenedettiLR91 2002-12-09 Shellings Pseudopolyhedre. 207-215 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Goossens92 2002-12-09 Motions of a Short-Linked Robot Arm in a Square. 69-76 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Kantabutra92 2002-11-25 Bounds for Generalized Thrackles. 191-206 2000 23 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/0023002/00230191.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#CairnsN00 2002-01-03 A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints. 23-31 2001 25 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10074/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#Barvinok01 2002-12-09 Feasibility Testing for Systems of Real Quadratic Equations. 1-13 1993 10 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg10.html#Barvinok93 2002-12-09 Computing the Ehrhart Polynomial of a Convex Lattice Polytope. 35-48 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#Barvinok94 2002-12-09 Problems of Distance Geometry and Convex Properties of Quadratic Maps. 189-202 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Barvinok95 2002-11-25 Computing Mixed Discriminants, Mixed Volumes, and Permanents. 205-237 1997 18 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/18n2p205.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#Barvinok97 2002-12-09 ¹- Embed ability of Metric Spaces in the Plane. 373-385 1992 8 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg8.html#MalitzM92 2002-11-25 Approximating Planar Rotations. 45-56 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p45.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#SterlingS99 2002-12-16 A Sylvester Theorem for Conic Sections. 295-305 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#WisemanW88 2002-01-03 A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. 569-590 2001 25 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0006/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#GartnerW01 2002-12-09 Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements. 399-432 1994 12 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg12.html#GartnerW94 2002-11-25 Isosceles Planar Subsets. 390-398 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p390.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Fishburn98 2002-12-16 Convex Polytopes Whose Projection Bodies and Difference Set Are Polars. 83-91 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#Martini91 2003-07-15 Properties of Random Triangulations and Trees. 105-117 1999 22 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/22n1p105.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg22.html#DevroyeFHNS99 2004-02-13 On Sparse Spanners of Weighted Graphs. 81-100 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#AlthoferDDJS93 2002-12-09 Random Projections of Regular Simplices. 219-226 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#AffentrangerS92 2002-12-16 On the Convex Hull of Uniform Randowm Points in a Simple d-polytope. 291-305 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#AffentrangerW91 2002-12-16 Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. 99-160 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#ClarksonEGSW90 2002-12-02 On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm. 227-239 1997 17 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/17n2p227.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg17.html#KedemST97 2002-12-19 The k Most Frequent Distances in the Plane. 639-648 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2896/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#SolymosiTT02 2002-11-25 Incremental Convex Hull Algorithms Are Not Output Sensitive. 57-68 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p57.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Bremner99 2002-12-19 A Sufficient Condition for the Existence of Large Empty Convex Polygons. 671-682 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2898/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Valtr02 2002-12-09 Convex Independent Sets and 7-holes in Restricted Planar Point Sets. 135-152 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#Valtr92 2002-12-09 Unit Squares Intersecting All Secants of a Square. 235-239 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Valtr94 2002-12-09 Probability that n Random Points are in Convex Position. 637-643 1995 13 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg13.html#Valtr95 2002-11-25 On Geometric Graphs with No k Pairwise Parallel Edges. 461-469 1998 19 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/19n3p461.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg19.html#Valtr98 2002-11-25 On Galleries with No Bad Points. 193-200 1999 21 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/21n2p193.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Valtr99 2002-12-09 Regular Simplices and Gaussian Samples. 141-147 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#BaryshnikovV94 2002-12-09 Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. 331-358 1995 14 Discrete & Computational Geometry 3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg14.html#AbelloEK95 2002-06-20 Examples and Counterexamples for the Perles Conjecture. 29-44 2002 28 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/01/0085/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#HaaseZ02 2003-02-14 A Space of Cyclohedra. 61-75 2003 29 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/02/2810/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Devadoss03 2006-03-13 Reconstructing Plane Sets from Projections. 223-242 1990 5 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg5.html#BianchiL90 2002-12-16 Proof of Grünbaum's Conjecture on Common Transversals for Translates. 191-203 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Tverberg89 2003-02-14 Topological Complexity of Motion Planning. 211-221 2003 29 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/contents/02/0760/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Farber03 2002-11-25 Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. 247-259 2000 23 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/0023002/00230247.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#SmorodinskyMS00 2002-12-09 Inner and Outer j-Radii of Convex Bodies in Finite-Dimensional Normed Spaces. 255-280 1992 7 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg7.html#GritzmannK92 2002-12-16 Estimates for the Minimal Width of Polytopes Inscribed in Convex Bodies. 627-635 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#GritzmannL89 2006-06-01 A Helmholtz-Lie Type Characterization of Ellipsoids, II. 55-67 1996 16 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/16n1p55.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg16.html#GruberL96 2002-12-09 ³. 311-320 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#Borobia94 2003-01-28 On the Number of Linearly Separable Subsets of Finite Sets in Rn. 463-472 1997 18 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/18n4p463.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#GulliksenH97 2002-12-16 On the Construction of Abstract Voronoi Diagrams. 211-224 1991 6 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg6.html#MehlhornMO91 2002-11-25 The Volume as a Metric Invariant of Polyhedra. 405-425 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p405.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#Sabitov98 2002-12-19 A Note on Geometric Embeddings of Simplicial Complexes in a Euclidean Space. 293-302 2000 23 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/0023002/00230293.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg23.html#Novik00 2002-01-03 How Many Diagonal Rectangles Are Needed to Cover an Orthogonal Polygon? 117-140 2000 24 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/contents/00/10059/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg24.html#Ishigami00 2002-11-25 Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. 433-454 1997 18 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/18n4p433.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#ChanSY97 2002-11-25 Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming. 397-420 1997 18 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/18n4p397.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#GoodrichR97 2002-11-25 Subalgebras of the Stanley - Reisner Ring. 551-556 1999 21 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/21n4p551.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Schenck99 2002-12-16 A Polynomial Solution for the Potato-peeling Problem. 155-182 1986 1 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg1.html#ChangY86 2006-01-17 Separoids, Their Categories and a Hadwiger-Type Theorem for Transversals. 377-385 2002 27 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/contents/01/0075/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg27.html#ArochaBMOS02 2002-12-16 Dissections of Regular Polygons into Triangles of Equal Areas. 375-381 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#Kasimatis89 2002-12-16 epsilon-Nets and Simplex Range Queries. 127-151 1987 2 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg2.html#HausslerW87 2002-11-25 Motion Planning in Environments with Low Obstacle Density. 561-587 1998 20 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/bibs/20n4p561.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg20.html#StappenOBV98 2002-12-16 On Representing Sylvester- Gallai Designs. 345-348 1989 4 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg4.html#BorosFK89 2003-12-12 An Upper Bound for the Minimum Diameter of Integral Point Sets. 427-432 1993 9 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg9.html#HarborthKM93 2002-12-19 Independence Numbers of Planar Contact Graphs. 649-670 2002 28 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/02/2897/index.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg28.html#Swanepoel02 2002-11-25 Vertex Degrees of Steiner Minimal Trees in lpd and Other Smooth Minkowski Spaces. 437-447 1999 21 Discrete & Computational Geometry 3 http://link.springer.de/link/service/journals/00454/bibs/21n3p437.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#Swanepoel99 2002-11-25 Angular Properties of Delaunay Diagrams in Any Dimension. 17-36 1999 21 Discrete & Computational Geometry 1 http://link.springer.de/link/service/journals/00454/bibs/21n1p17.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg21.html#SchmittS99 2002-01-03 Distinct Distances in the Plane. 629-634 2001 25 Discrete & Computational Geometry 4 http://link.springer.de/link/service/journals/00454/contents/01/0009/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg25.html#SolymosiT01 2002-11-25 Curved Hexagonal Packings of Equal Disks in a Circle. 179-194 1997 18 Discrete & Computational Geometry 2 http://link.springer.de/link/service/journals/00454/bibs/18n2p179.html http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg18.html#LubachevskyG97 2002-12-09 Second Derivatives of Circle Packing and Conformal Mapping. 35-49 1994 11 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg11.html#DoyleHR94a 2002-12-16 Equidecomposabilitz of Polyhedra with Reference to Crystallographic Groups. 383-389 1988 3 Discrete & Computational Geometry http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg3.html#Muller88 2004-05-18 A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls. 595-602 2003 29 Discrete & Computational Geometry 4 http://dx.doi.org/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#HolmsenKL03 2004-05-18 A General Notion of Visibility Graphs. 511-524 2003 29 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-2773-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#DevelinHM03 2004-05-18 Perfect Packings of Squares Using the Stack-Pack Strategy. 625-631 2003 29 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0769-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Wastlund03 2004-05-18 Tverberg's Conjecture. 505-510 2003 29 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0784-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Vrecica03 2004-05-18 Quotients of Some Finite Universal Locally Projective Polytopes. 435-443 2003 29 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-002-2852-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Hartley03 2004-05-18 Shape Dimension and Approximation from Samples. 419-434 2003 29 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-002-2838-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#DeyGGZ03 2004-05-18 ^d. 561-573 2003 29 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-002-0790-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Soltan03 2004-05-18 Consequences of Pure Point Diffraction Spectra for Multiset Substitution Systems. 525-560 2003 29 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0781-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#LeeMS03 2004-05-18 An Improved Upper Bound for Leo Moser's Worm Problem. 409-417 2003 29 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-002-0774-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#NorwoodP03 2004-05-18 The Representation of Polyhedra by Polynomial Inequalities. 485-504 2003 29 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0782-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#GrotschelH03 2004-05-18 On Levels in Arrangements of Curves. 375-393 2003 29 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-002-2840-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Chan03 2004-05-18 Covering the Plane with Fat Ellipses without Non-Crossing Assumption. 477-481 2003 29 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-002-2835-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Heppes03 2004-05-18 Mixed Polytopes. 575-593 2003 29 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-002-0788-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Schneider03 2004-05-18 Bochner's Method for Cell Complexes and Combinatorial Ricci Curvature. 323-374 2003 29 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-002-0743-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Forman03 2004-05-18 Doubly Transitive Automorphism Groups of Combinatorial Surfaces. 445-457 2003 29 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-002-2836-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#KimmerleK03 2004-05-18 Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations. 459-467 2003 29 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-002-0758-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Frank03 2004-05-18 The Heighway Dragon Revisited. 603-623 2003 29 Discrete & Computational Geometry 4 http://dx.doi.org/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#NgaiN03 2004-05-18 New Bounds on the Katchalski--Lewis Transversal Problem. 395-408 2003 29 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-002-0755-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg29.html#Holmsen03 2004-05-18 Note on Integral Distances. 337-342 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0014-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Solymosi03 2004-05-18 Slicing the Pie. 263-276 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0008-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Ismailescu03 2004-05-18 Blowing Up Polygonal Linkages. 205-239 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0006-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#ConnellyDR03 2004-05-18 Counting Real Connected Components of Trinomial Curve Intersections and m-nomial Hypersurfaces. 379-414 2003 30 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2834-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#LiRW03 2004-05-18 Some Densest Two-Size Disc Packings in the Plane. 241-262 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0007-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Heppes03a 2004-05-18 A Note on Binary Plane Partitions. 3-16 2003 30 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2921-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Toth03 2004-05-18 Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. 437-452 2003 30 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2824-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#AttaliB03 2004-05-18 On the Complexity of Halfspace Area Queries. 639-648 2003 30 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-2856-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Langerman03 2004-05-18 Unavoidable Configurations in Complete Topological Graphs. 311-320 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0012-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#PachST03 2004-05-18 Combinatorics of Polytopes with a Group of Linear Symmetries of Prime Power Order. 529-542 2003 30 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-2867-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Jorge03 2004-05-18 A Volume Formual for Medial Sections of Simplices. 343-353 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0015-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Talata03 2005-10-07 Guest Editors' Foreword. 165-166 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0444-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#TothK03 2004-05-18 Lines With Many Points On Both Sides. 415-435 2003 30 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2826-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Pinchasi03 2004-05-18 Guest Editor's Foreword. 1-2 2003 30 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2920-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Eppstein03 2004-05-18 Illuminating Disjoint Line Segments in the Plane. 489-505 2003 30 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2797-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Toth03a 2004-05-18 Facility Location on a Polyhedral Surface. 357-372 2003 30 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2769-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#AronovKOV03 2004-05-18 A Partitioned Version of the Erdös-Szekeres Theorem for Quadrilaterals. 321-336 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0013-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Poor03 2004-05-18 Expressing the box cone radius in the relational calculus with real polynomial constraints. 607-622 2003 30 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0770-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Geerts03 2004-05-18 An isosceles triangle that tiles the sphere in exactly three ways. 459-466 2003 30 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2777-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Dawson03 2004-05-18 A Note on Shelling. 573-589 2003 30 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-2873-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#BaakeG03 2004-05-18 The "Point" Goalie Problem. 649-669 2003 30 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-2713-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#RichardsonS03 2004-05-18 The Number of Cylindrical Shells. 453-458 2003 30 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2818-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Devillers03 2004-05-18 Nice Point Sets Can Have Nasty Delaunay Triangulations. 109-132 2003 30 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2927-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Erickson03 2004-05-18 The Density of Shapes in Three-Dimensional Barycentric Subdivision. 373-377 2003 30 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2823-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Schwartz03 2004-05-18 Hierarchical Morse - Smale Complexes for Piecewise Linear 2-Manifolds. 87-107 2003 30 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2926-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#EdelsbrunnerHZ03 2004-05-18 The Union of Congruent Cubes in Three Dimensions. 133-160 2003 30 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2928-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#PachSS03 2004-05-18 Point Configurations in d-Space without Large Subsets in Convex Position. 277-286 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0009-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#KarolyiV03 2004-05-18 A Fully Dynamic Algorithm for Planar Width. 17-24 2003 30 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2923-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Chan03a 2004-05-18 Discrete Mobile Centers. 45-63 2003 30 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2925-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#GaoGHZZ03 2004-05-18 Asymptotically Efficient Triangulations of the d-Cube. 509-528 2003 30 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-2845-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#OrdenS03 2004-05-18 Covering an Annulus by Strips. 177-180 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0002-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Bezdek03 2004-05-18 The Complexity of Hyperplane Depth in the Plane. 299-309 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0011-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#LangermanS03 2004-05-18 The Determination of a Convex Set from Its Angle Function. 287-297 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0010-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Kincses03 2004-05-18 Tilings of the Sphere with Isosceles Triangles. 467-487 2003 30 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2846-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Dawson03a 2004-05-18 The Ehrhart Polynomial of the Birkhoff Polytope. 623-637 2003 30 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-2850-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#BeckP03 2004-05-18 Small convex polytopes with long edges and many vertices. 195-204 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0004-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#BoroczkyC03 2004-05-18 Total Curvature and Spiralling Shortest Paths. 167-176 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0001-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#BaranyKZ03 2004-05-18 Segment Intersection Searching Problems in General Settings. 25-44 2003 30 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2924-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Koltun03 2004-05-18 Spanning Trees Crossing Few Barriers. 591-606 2003 30 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-2853-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#AsanoBCGST03 2004-05-18 Different Bounds on the Different Betti Numbers of Semi-Algebraic Sets. 65-85 2003 30 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2922-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Basu03a 2004-05-18 Common Transversals and Tangents to Two Lines and Two Quadrics in P. 543-571 2003 30 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0789-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#MegyesiST03 2004-05-18 The Radon Number of the Three-Dimensional Integer Lattice. 181-184 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0003-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#BezdekB03 2004-05-18 Finite packing and covering by congruent convex domains. 185-193 2003 30 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0005-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg30.html#Boroczky03 2004-05-18 Gram Matrix Analysis of Finite Distance Spaces in Constant Curvature. 515-543 2004 31 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-0806-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Kokkendorff04 2004-05-18 The Number of Embeddings of Minimally Rigid Graphs. 287-303 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-2902-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#BorceaS04 2004-05-18 Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. 17-35 2004 31 Discrete & Computational Geometry 1 http://dx.doi.org/ http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#AichholzerAP04 2004-05-18 Properties of R-Sausages. 587-611 2004 31 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-2851-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#ToppurS04 2004-05-18 Classes of Discrete Convexity Properties. 461-490 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2877-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#CristescuL04 2004-05-18 Guest Editor's Foreword. 1 2004 31 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2946-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Suri04 2004-05-18 Metric Embeddings--Beyond One-Dimensional Distortion. 339-356 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2872-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#KrauthgamerLM04 2004-05-18 Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. 83-124 2004 31 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2950-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#KoltunS04 2004-05-18 Clustering Motion. 545-565 2004 31 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-2822-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Har-Peled04 2004-05-18 Bounded VC-Dimension Implies a Fractional Helly Theorem. 251-255 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-2859-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Matousek04 2004-05-18 On Linear Programming Bounds for Spherical Codes and Designs. 385-394 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2858-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Samorodnitsky04 2004-05-18 The Thirteen Spheres: A New Proof. 613-625 2004 31 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0819-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Anstreicher04 2004-05-18 Large Cells in Poisson-Delaunay Tessellations. 503-514 2004 31 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0818-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#HugS04 2004-05-18 An Inequality for Circle Packings Proved by Semidefinite Programming. 357-367 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2880-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#ParriloP04 2004-05-18 Aperiodic Linearly Repetitive Delone Sets Are Densely Repetitive. 323-326 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-2903-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Lenz04 2004-05-18 Distance Sets of Well-Distributed Planar Point Sets. 243-250 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-2857-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#IosevichL04 2004-05-18 Expanding Polynomials and Connectedness of Self-Affine Tiles. 275-286 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-2879-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#KiratLR04 2004-05-18 Crumpled Cube and Solid Horned Sphere Space Fillers. 421-433 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2907-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Tang04 2004-05-18 More About 4-Isosceles Planar Sets. 655-663 2004 31 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0825-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#XuD04a 2004-05-18 The Tight Span of an Antipodal Metric Space: Part II--Geometrical Properties. 567-586 2004 31 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-0777-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#HuberKM04 2004-05-18 Relationships Among Flag f-Vector Inequalities for Polytopes. 257-273 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0756-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Stenson04 2004-05-18 Sharp Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions. 435-460 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2871-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Koltun04 2004-05-18 Some Characterizations of Ellipsoids by Sections. 643-654 2004 31 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-0803-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#AlonsoM04 2004-05-18 Intersection and Linking Numbers in Oriented Matroids. 305-321 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-2865-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#CarvalhoO04 2004-05-18 Optimally Cutting a Surface into a Disk. 37-59 2004 31 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2948-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#EricksonH04 2004-05-18 Finding the Sink Takes Some Time: An Almost Quadratic Lower Bound for Finding the Sink of Unique Sink Oriented Cubes. 627-642 2004 31 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-003-0813-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#SchurrS04 2004-05-18 The Power of Nonmonotonicity in Geometric Searching. 3-16 2004 31 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2946-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Chazelle04 2004-05-18 Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. 139-171 2004 31 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2952-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#AsanoKY04 2004-05-18 A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces. 369-384 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2870-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#AttaliB04 2004-05-18 Mazur Sets in Normed Spaces. 411-420 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-0808-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#GraneroMP04 2004-05-18 The Extreme Points of Subsets of s-Concave Probabilities and a Geometric Localization Theorem. 327-335 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-2868-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#FradeliziG04 2004-05-18 ³. 405-410 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-0796-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#HolmsenM04 2004-05-18 The One-Round Voronoi Game. 125-138 2004 31 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2951-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#CheongHLM04 2004-05-18 Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. 207-227 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0729-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#DumitrescuMS04 2004-05-18 Linear Inequalities for Rank 3 Geometric Lattices. 229-242 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0807-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Nyman04 2004-05-18 Acute Triangulations of the Regular Icosahedral Surface. 197-206 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0805-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#ItohZ04 2004-05-18 Sylvester-Gallai Theorem and Metric Betweenness. 175-195 2004 31 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-003-0795-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Chvatal04 2004-05-18 Decompositions and Connectivity of Matching and Chessboard Complexes. 395-403 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-2869-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#Athanasiadis04 2004-05-18 Testing Homotopy for Paths in the Plane. 61-81 2004 31 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2949-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#CabelloLMS04 2004-05-18 The Number of Isosceles Right Triangles Determined by n Points in Convex Position in the Plane. 491-499 2004 31 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-003-0816-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg31.html#XuD04 2004-05-18 Chiral Polyhedra in Ordinary Space, I. 55-99 2004 32 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-0843-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Schulte04 2004-05-18 Cell Complexities in Hyperplane Arrangements. 107-115 2004 32 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-0854-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#AronovS04 2004-05-18 The Kneser-Poulsen Conjecture for Spherical Polytopes. 101-106 2004 32 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-0831-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#BezdekC04 2004-05-18 Computing the Writhing Number of a Polygonal Knot. 37-53 2004 32 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-2864-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#AgarwalEW04 2004-05-18 ². 149-160 2004 32 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-0822-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#WiederholdW04 2004-05-18 Regular Polytopes of Full Rank. 1-35 2004 32 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-0848-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#McMullen04 2004-05-18 Construction of a 3/4-Ideal Hyperbolic Tetrahedron out of Ideal Tetrahedra. 117-128 2004 32 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-2919-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Mohanty04 2004-05-18 A Small Cover for Convex Unit Arcs. 141-147 2004 32 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-0840-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#JohnsonPW04 2004-05-18 The Integer Hull of a Convex Rational Polytope. 129-139 2004 32 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-003-0834-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Lasserre04 2005-03-14 Tchebyshev Posets. 493-520 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1115-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Hetyei04 2005-03-14 The Area Derivative of a Space-Filling Diagram. 293-308 2004 32 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1099-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#BryantEKL04 2005-03-14 Loops in Reeb Graphs of 2-Manifolds. 231-244 2004 32 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1122-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Cole-McLaughlinEHNP04 2005-03-14 Long Monotone Paths in Line Arrangements. 167-176 2004 32 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1119-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#BaloghRSSS04 2005-03-14 Guest Editor's Foreword. 165-166 2004 32 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1125-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Berg04 2005-03-14 The Partial-Fractions Method for Counting Solutions to Integral Linear Systems. 437-446 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1131-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Beck04 2005-03-14 High-Dimensional Shape Fitting in Linear Time. 269-288 2004 32 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1118-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Har-PeledV04 2005-03-14 Approximation of the Normal Vector Field and the Area of a Smooth Surface. 383-400 2004 32 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1096-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#MorvanT04 2005-03-14 Stabbing Delaunay Tetrahedralizations. 339-343 2004 32 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1095-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Shewchuk04 2005-03-14 Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons. 401-415 2004 32 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1098-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#ChengCEO04 2005-03-14 _t-Construction for Lattices, Spheres and Polytopes. 601-621 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1140-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#PaffenholzZ04 2005-03-14 Mixed Fibre Polytopes. 521-532 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1136-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#McMullen04a 2005-09-29 Isoradial Bodies. 447-457 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1132-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#BrandenbergDGL04 2005-03-14 Euclidean Bounded-Degree Spanning Tree Ratios. 177-194 2004 32 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1117-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Chan04 2005-03-14 Shape Dimension and Intrinsic Metric from Samples of Manifolds. 245-267 2004 32 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1120-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#GiesenW04 2005-03-14 Convexity Properties of the Cone of Nonnegative Polynomials. 345-371 2004 32 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1090-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Blekherman04 2005-03-14 Vertices of Gelfand-Tsetlin Polytopes. 459-470 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1133-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#LoeraM04 2005-03-14 Relaxation, New Combinatorial and Polynomial Algorithms for the Linear Feasibility Problem. 317-338 2004 32 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-2878-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Betke04 2005-03-14 Guest Editors' Preface. 435-436 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1130-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#BayerLS04 2005-03-14 New Constructions of Weak epsilon-Nets. 195-206 2004 32 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1116-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#MatousekW04 2005-03-14 Enumerative Properties of Ferrers Graphs. 481-492 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1135-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#EhrenborgW04 2005-03-14 Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set. 417-430 2004 32 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1107-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#DinS04 2005-03-14 A Complexity Bound on Faces of the Hull Complex. 471-479 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1134-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Develin04 2005-03-14 Fault-Tolerant Geometric Spanners. 207-230 2004 32 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1121-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#CzumajZ04 2005-03-14 Non-Crossing Frameworks with Non-Crossing Reciprocals. 567-600 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1139-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#OrdenRSSSW04 2005-03-14 Directed Trees in a String, Real Polynomials with Triple Roots, and Chain Mails. 373-382 2004 32 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-2906-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Kozlov04 2005-03-14 Inequalities for the h-Vectors and Flag h-Vectors of Geometric Lattices. 533-548 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1137-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#NymanS04 2005-03-14 Graphs, Syzygies, and Multivariate Splines. 623-637 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1141-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#Rose04 2005-03-14 Convex Combinatorial Optimization. 549-566 2004 32 Discrete & Computational Geometry 4 http://www.springerlink.com/index/10.1007/s00454-004-1138-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#OnnR04 2005-03-14 Unflippable Tetrahedral Complexes. 309-315 2004 32 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1097-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg32.html#DoughertyFM04 2005-03-14 An Improved Bound for Joints in Arrangements of Lines in Space. 307-320 2005 33 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1093-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#FeldmanS05 2005-03-14 The Randomized Integer Convex Hull. 3-25 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-003-0836-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#BaranyM05 2005-03-14 Allocating Vertex pi-Guards in Simple Polygons via Pseudo-Triangulations. 345-364 2005 33 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1091-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#SpeckmannT05 2005-03-14 ⁿ. 143-155 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-2916-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Verger-Gaugry05 2005-03-14 Editorial Note. 1 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-3301-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#GoodmanP05 2006-04-28 Obstructions to Shiftedness. 535-545 2005 33 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1103-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Klivans05 2005-03-14 A Note on Caterpillar-Embeddings with No Two Parallel Edges. 223-229 2005 33 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1142-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#KleitmanP05 2005-03-14 Dense Point Sets Have Sparse Delaunay Triangulations or "... But Not Too Nasty". 83-115 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-1089-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Erickson05 2005-03-14 The Space of Unordered Real Line Arrangements. 157-163 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-1113-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Huisman05 2005-03-14 The Polytope of Non-Crossing Graphs on a Planar Point Set. 275-305 2005 33 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1143-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#OrdenS05 2005-03-14 Finite Coverings in the Hyperbolic Plane. 165-180 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-1101-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Boroczky05 2005-03-14 Valuations on Convex Sets of Oriented Hyperplanes. 57-65 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-1126-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#GatesHS05 2005-03-14 A Rigidity Criterion for Non-Convex Polyhedra. 207-221 2005 33 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1102-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Schlenker05 2005-03-14 Betti Numbers of Semialgebraic Sets Defined by Quantifier-Free Formulae. 395-401 2005 33 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1105-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#GabrielovV05 2005-03-14 Computing Persistent Homology. 249-274 2005 33 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1146-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#ZomorodianC05 2005-03-14 Cutting Triangular Cycles of Lines in Space. 231-247 2005 33 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1123-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#AronovKS05a 2005-03-14 Oriented Matroids and Associated Valuations. 445-462 2005 33 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1114-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Lawrence05 2005-03-14 The Mixed Volume of Two Finite Vector Sets. 403-421 2005 33 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1104-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#XiaoyanG05 2005-03-14 Extremal Convex Planar Sets. 369-393 2005 33 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1145-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#TingK05 2005-03-14 Canonical Ordering Trees and Their Applications in Graph Drawing. 321-344 2005 33 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1154-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#ZhangH05 2005-03-14 An Identity Relating Moments of Functionals of Convex Hulls. 125-142 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-1109-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Buchta05 2005-03-14 Some Low Distortion Metric Ramsey Problems. 27-41 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-1100-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#BartalLMN05 2005-04-04 Optimal System of Loops on an Orientable Surface. 507-534 2005 33 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1150-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#VerdiereL05 2005-03-14 Almost Periodic Measures and Long-Range Order in Meyer Sets. 483-505 2005 33 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1156-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Strungaru05 2005-03-14 Equilibrium Placement of Periodic Graphs and Convexity of Plane Tilings. 67-81 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-1147-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Friedrichs05 2005-03-14 Radii of Regular Polytopes. 43-55 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-1127-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Brandenberg05 2005-03-14 A Near-Quadratic Algorithm for Fence Design. 463-481 2005 33 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1148-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#AgarwalBC05 2005-03-14 Topology of Definable Hausdorff Limits. 423-443 2005 33 Discrete & Computational Geometry 3 http://www.springerlink.com/index/10.1007/s00454-004-1112-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Zell05 2005-03-14 Incidences between Points and Circles in Three and Higher Dimensions. 185-206 2005 33 Discrete & Computational Geometry 2 http://www.springerlink.com/index/10.1007/s00454-004-1111-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#AronovKS05 2005-03-14 epsilon-Unit Distance Graphs. 117-123 2005 33 Discrete & Computational Geometry 1 http://www.springerlink.com/index/10.1007/s00454-004-1092-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Exoo05 2006-01-17 Lower Bounds for Simplicial Covers and Triangulations of Cubes. 669-686 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-1128-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#BlissS05 2006-01-17 The Topological Representation of Oriented Matroids. 645-668 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1164-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#BokowskiKMS05 2006-01-17 Generic Global Rigidity. 549-563 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-1124-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Connelly05 2006-01-17 Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. 593-604 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-1152-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#BremnerDEILMT05 2006-01-17 Pairs of Convex Bodies with Centrally Symmetric Intersections of Translates. 605-616 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-1094-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Soltan05 2006-01-17 An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings. 569-591 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1168-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Nagamochi05 2006-01-17 The Envelope of Lines Meeting a Fixed Line and Tangent to Two Spheres. 617-644 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1160-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#MegyesiS05 2006-01-17 Monotone Paths in Line Arrangements with a Small Number of Directions. 687-697 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-1106-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#Dumitrescu05 2006-01-17 _pMinkowski Problem for Polytopes. 699-715 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-1149-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#HugLYZ05 2006-01-17 Covering Things with Things. 717-729 2005 33 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-004-1108-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg33.html#LangermanM05 2006-01-17 Bier Spheres and Posets. 71-86 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-1144-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#BjornerPSZ05 2006-01-17 Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry. 251-268 2005 34 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1170-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#RybnikovZ05 2006-01-17 Drapeability. 637-657 2005 34 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1189-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#MakiWW05 2006-01-17 Configurations of Flats, I: Manifolds of Points in the Projective Line. 111-128 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1163-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#ArochaBM05 2006-01-17 The Width of the Transversal Strips of T(3)-Families in the Plane. 455-461 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1180-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Heppes05 2006-01-17 Hyperbolic Regular Polygons with Notched Edges. 143-166 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1157-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Mann05 2006-01-17 Partitions of a Polytope and Mappings of a Point Set to Facets. 25-45 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1158-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Karasev05 2006-01-17 Equipartitions of Measures by 2-Fans. 87-96 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-1151-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Bereg05 2006-01-17 A New Packing Density Bound in 3-Space. 537-544 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1178-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Smith05 2006-01-17 On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. 497-506 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1177-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#KaraPW05 2006-01-17 The Geometry of Random {-1, 1}-Polytopes. 365-379 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1186-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#MendelsonPR05 2006-01-17 Lines Avoiding Unit Balls in Three Dimensions. 231-250 2005 34 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1166-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#AgarwalAKS05 2006-01-17 Maximal Dimension of Unit Simplices. 167-177 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-1155-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#ElsholtzK05 2006-01-17 Geometric Graphs with No Three Disjoint Edges. 679-695 2005 34 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1191-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Cerny05 2006-01-17 Chiral Polyhedra in Ordinary Space, II. 181-229 2005 34 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1176-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Schulte05 2006-01-17 Dissection of a Triangle into Similar Triangles. 295-312 2005 34 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1167-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Zak05 2006-01-17 Quantitative Generalized Bertini-Sard Theorem for Smooth Affine Varieties. 659-678 2005 34 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1203-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#JelonekK05 2006-01-17 Sums, Projections, and Sections of Lattice Sets, and the Discrete Covariogram. 391-409 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1169-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#GardnerGZ05 2006-01-17 Stability of the Minkowski Measure of Asymmetry for Convex Bodies. 351-362 2005 34 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1161-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Guo05 2006-01-17 Lower Bound for the Maximal Number of Facets of a 0/1 Polytope. 331-349 2005 34 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1159-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#GatzourasAM05 2006-01-17 On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences. 11-24 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1165-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Chan05 2006-01-17 Conflict-Free Coloring of Points and Simple Regions in the Plane. 47-70 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1162-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Har-PeledS05 2006-01-17 The Voronoi Diagram of Curved Objects. 439-453 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1192-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#AltCV05 2006-01-17 Non-Periodic Rhomb Substitution Tilings that Admit Order n Rotational Symmetry. 523-536 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1175-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Harriss05 2006-01-17 Tiling a Polygon with Two Kinds of Rectangles. 313-330 2005 34 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1173-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Remila05 2006-01-17 Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials. 475-495 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1179-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Perrucci05 2006-01-17 Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. 411-437 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1187-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#FelsnerGT05 2006-01-17 Covering with Fat Convex Discs. 129-141 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-1153-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Toth05 2006-01-17 Geometric Permutations Induced by Line Transversals through a Fixed Point. 285-294 2005 34 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1174-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#AronovS05 2006-01-17 Real Root Conjecture Fails for Five- and Higher-Dimensional Spheres. 269-284 2005 34 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1171-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Gal05 2006-01-17 Acute Triangulations of Polygons. 587-635 2005 34 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1184-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Streinu05 2006-01-17 ^d. 1-10 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-1110-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#AsinowskiK05 2006-01-17 Transversals to Line Segments in Three-Dimensional Space. 381-390 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1183-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#BronnimannELSW05 2006-01-17 Families of Tight Inequalities for Polytopes. 507-521 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1193-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Stenson05 2006-01-17 New Upper Bound on the Transversal Width of T(3)-Families of Discs. 463-474 2005 34 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1181-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Heppes05a 2006-01-17 Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group. 547-585 2005 34 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1196-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#GrahamLMWY05 2006-01-17 Acute Triangulations of Polygons. 697-706 2005 34 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1188-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#Yuan05 2006-01-17 Improved Dense Packings of Congruent Squares in a Square. 97-109 2005 34 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-004-1129-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg34.html#GensaneR05 2006-06-01 Combinatorially Regular Polyomino Tilings. 269-285 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1205-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#CannonFP06 2006-06-01 Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. 493-512 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1225-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#JacksonJS06 2006-06-01 Volume Computation for Polytopes and Partition Functions for Classical Root Systems. 551-595 2006 35 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-006-1234-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Baldoni-SilvaBCV06 2006-06-01 The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in R Is Omega(n). 473-480 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1219-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#AsinowskiK06 2006-06-01 Bar-Magnet Polyhedra and NS-Orientations of Maps. 481-491 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1223-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Mohar06 2006-06-01 ₁-Spaces. 301-310 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1217-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Ovchinnikov06 2006-06-01 Compact Packings of the Plane with Two Sizes of Discs. 255-267 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1172-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Kennedy06 2006-06-01 Neighborhood Complexes and Generating Functions for Affine Semigroups. 385-403 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1222-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#ScarfW06 2006-06-01 Lattice Points in Large Borel Sets and Successive Minima. 429-435 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1228-5 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#AlievG06 2006-06-01 Polygons Needing Many Flipturns. 131-141 2006 35 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1185-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Biedl06 2006-06-01 High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension. 617-652 2006 35 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1220-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Donoho06 2006-06-01 Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings. 1-36 2006 35 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1195-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#GrahamLMWY06 2006-06-01 Tropical Secant Varieties of Linear Spaces. 117-129 2006 35 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1182-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Develin06 2006-06-01 k-Sets in Four Dimensions. 177-191 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1200-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#MatousekSSW06 2006-06-01 Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions. 37-72 2006 35 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1197-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#GrahamLMWY06a 2006-06-01 Erratum to "Pseudo-Triangulations, Rigidity and Motion Planning". 358-358 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-006-3300-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Streinu06 2006-06-02 Distinct Distances in Homogeneous Sets in Euclidean Space. 537-549 2006 35 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-006-1232-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#SolymosiT06 2006-06-01 Packing Disks on a Torus. 159-174 2006 35 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1198-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Przeworski06 2006-06-01 Computational Approaches to Lattice Packing and Covering Problems. 73-116 2006 35 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1202-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#SchurmannV06 2006-06-01 Pseudo-Simplicial Complexes from Maximal Locally Convex Functions. 201-221 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1208-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#AurenhammerK06 2006-06-01 Minkowski Sums of Monotone and General Simple Polygons. 223-240 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1206-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#OksS06 2006-06-01 Rearrangement Inequalities and the Alternahedron. 241-254 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1199-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#CruickshankK06 2006-06-01 _n. 671-690 2006 35 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-005-1227-6 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#BaloghS06 2006-06-01 Sylvester-Gallai Theorems for Complex Numbers and Quaternions. 361-373 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1226-7 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#ElkiesPS06 2006-06-01 The Sylvester-Chvatal Theorem. 193-199 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1216-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Chen06 2006-06-01 Rhombus Tilings: Decomposition and Space Structure. 329-358 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1207-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#ChavanonR06 2006-06-01 Elementary Moves on Triangulations. 527-536 2006 35 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-006-1240-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#LudwigR06 2006-06-01 The Lifting Model for Reconfiguration. 653-669 2006 35 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-006-1239-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#BeregD06 2006-06-01 Colourful Simplicial Depth. 597-615 2006 35 Discrete & Computational Geometry 4 http://dx.doi.org/10.1007/s00454-006-1233-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#DezaHST06 2006-06-01 Combinatorial Complexity of Convex Sequences. 143-158 2006 35 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1194-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#IosevichKRT06 2006-06-01 Small Triangle-Free Configurations of Points and Lines. 405-427 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1224-9 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#BobenGPZ06 2006-06-01 Tverberg-Type Theorems for Separoids. 513-523 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1229-4 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Montellano-BallesterosPS06 2006-06-01 The Stirling Polynomial of a Simplicial Complex. 437-455 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1190-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Hetyei06 2006-06-01 The Angle Defect for Odd-Dimensional Simplicial Manifolds. 311-328 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1221-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Bloch06 2006-06-01 On the Bounded Complex of an Affine Oriented Matroid. 457-471 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1204-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Dong06 2006-06-01 The Kissing Problem in Three Dimensions. 375-384 2006 35 Discrete & Computational Geometry 3 http://dx.doi.org/10.1007/s00454-005-1201-3 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#Musin06 2006-06-01 ³. 287-300 2006 35 Discrete & Computational Geometry 2 http://dx.doi.org/10.1007/s00454-005-1230-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg35.html#BorceaGLP06 2006-06-01 Sphere Packings, VI. Tame Graphs and Linear Programs. 205-265 2006 36 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1215-x http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg36.html#Hales06c 2006-06-01 A Formulation of the Kepler Conjecture. 21-69 2006 36 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1211-1 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg36.html#HalesF06 2006-06-01 Historical Overview of the Kepler Conjecture. 5-20 2006 36 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1210-2 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg36.html#Hales06 2006-06-01 Guest Editors' Foreword. 1-3 2006 36 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1209-8 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg36.html#TothL06 2006-06-01 Sphere Packings, V. Pentahedral Prisms. 167-204 2006 36 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1214-y http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg36.html#Ferguson06 2006-06-01 Sphere Packing, IV. Detailed Bounds. 111-166 2006 36 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1213-z http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg36.html#Hales06b 2006-06-01 Sphere Packing, III. Extremal Cases. 71-110 2006 36 Discrete & Computational Geometry 1 http://dx.doi.org/10.1007/s00454-005-1212-0 http://www.informatik.uni-trier.de/~ley/db/journals/dcg/dcg36.html#Hales06a 2003-06-27 The Oberwolfach Meeting On Combinatorics, Probability And Computing. 2003 12 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#X03 2003-06-27 Algorithms For Colouring Random K-Colourable Graphs. 2000 9 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Subramanian00 2003-06-27 Lower And Upper Bounds For The Time Constant Of First-Passage Percolation. 2002 11 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#AlmP02 2003-06-27 Exact Expectations And Distributions For The Random Assignment Problem. 2002 11 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#AlmS02 2003-06-27 Inequalities For Means Of Restricted First-Passage Times In Percolation Theory. 1999 8 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#AlmW99 2003-06-27 On The Choice Number Of Random Hypergraphs. 2000 9 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Vu00 2003-06-27 A Large Deviation Result On The Number Of Small Subgraphs Of A Random Graph. 2001 10 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#Vu01 2003-06-27 A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs. 2002 11 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Vu02 2003-06-27 A Sharp Threshold For Network Reliability. 2002 11 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#KrivelevichSV02 2003-06-27 The Chromatic Number Of Graph Powers. 2002 11 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#AlonM02 2003-06-27 Bipartite Subgraphs And The Smallest Eigenvalue. 2000 9 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#AlonS00 2003-06-27 Studying Balanced Allocations With Differential Equations 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#Mitzenmacher99 2003-06-27 On The Number Of Simple Cycles In Planar Graphs. 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#AltFK99 2003-06-27 Random Star Processes. 2000 9 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#RobalewskaW00 2003-06-27 Some Spectral Characterizations Of Strongly Distance-Regular Graphs. 2001 10 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#Fiol01 2003-06-27 A General Spectral Bound For Distant Vertex Subsets. 2003 12 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Fiol03 2003-06-27 Approximating The Satisfiability Threshold For Random K-Xor-Formulas. 2003 12 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#CreignouDD03 2003-06-27 The Clairvoyant Demon Has A Hard Task. 2000 9 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Gacs00 2003-06-27 Hereditary Extended Properties, Quasi-Random Graphs And Induced Subgraphs. 2003 12 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#SimonovitsS03 2003-06-27 Tail Bounds And Expectations For Random Arc Allocation And Applications. 2003 12 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#SandersV03 2003-06-27 The Expected Norm Of Random Matrices. 2000 9 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Seginer00 2003-06-27 Zeros Of Reliability Polynomials And F-Vectors Of Matroids. 2000 9 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Wagner00 2003-06-27 Hypergraph Packing And Graph Embedding. 1999 8 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#RodlRT99 2003-06-27 On A Conjecture By Eriksson Concerning Overlap In Strings. 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#CakirCM99 2003-06-27 On Twisted Odd Graphs. 2000 9 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#FiolGY00 2003-06-27 Sparse 0-1-Matrices And Forbidden Hypergraphs 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#Bertram-KretzbergHL99 2003-06-27 Connected Matroids With Symmetric Tutte Polynomials. 2001 10 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#Qin01 2003-06-27 Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. 2002 11 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#CooperF02 2003-06-27 On The Circuit Cover Problemfor Mixed Graphs 2002 11 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#LeeW02 2003-06-27 Algorithmic Aspects Of Partial List Colourings. 2000 9 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Voigt00 2003-06-27 Critical Exponents, Colines, And Projective Geometries. 2000 9 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Kung00 2003-06-27 Quickselect And The Dickman Function. 2002 11 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#HwangT02 2003-06-27 Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs. 2000 9 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#DiazPPS00 2003-06-27 Spanning Subgraphs Of Random Graphs. 2000 9 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Riordan00 2003-06-27 Compound Poisson Approximation For Dissociated Random Variables Via Stein's Method. 1999 8 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#EichelsbacherR99 2003-06-27 Triangle-Freeness Is Hard To Detect. 2002 11 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#JuknaS02 2003-06-27 Dominating A Family Of Graphs With Small Connected Subgraphs. 2000 9 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#CaroY00 2003-06-27 Tutte Polynomials Of Perfect Matroid Designs. 2000 9 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Mphako00 2003-06-27 Intersecting Chains In Finite Vector Spaces. 1999 8 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#Czabarka99 2003-06-27 Convergence Of The Iterated Prisoner's Dilemma Game 2002 11 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#DyerGGIJ02 2003-06-27 Connectedness Of The Degree Bounded Star Process. 2003 12 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#GreenhillRW03 2003-06-27 The Minesweeper Game: Percolation And Complexity. 2002 11 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Mossel02 2003-06-27 Matroid Automorphisms And Symmetry Groups. 2000 9 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#FernGLP00 2003-06-27 Involutions Of Connected Binary Matroids. 2000 9 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Bonin00 2003-06-27 Poisson-Dirichlet And Gem Invariant Distributions For Split-And-Merge Transformations Of An Interval Partition. 2002 11 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Pitman02 2003-06-27 G-Intersecting Families. 2001 10 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#BohmanFRT01 2003-06-27 A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences. 2001 10 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#SzaboT01 2003-06-27 On Restricted Sums. 2000 9 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#HamidouneLS00 2004-09-07 On Sets With A Small Subset Sum. 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#HamidouneLS99 2003-06-27 Two Short Proofs Concerning Tree-Decompositions. 2002 11 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#BellenbaumD02 2003-06-27 The Largest Eigenvalue Of Sparse Random Graphs. 2003 12 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#KrivelevichS03 2003-06-27 A Note On Sequential Selection From Permutations. 2000 9 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Gnedin00 2003-06-27 The Choice Number Of Dense Random Graphs. 2000 9 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Krivelevich00 2004-09-07 On Vertex-Triads in 3-Connected Binary Matroids. 485-497 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Wu98 2003-06-27 Function Learning From Interpolation. 2000 9 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#AnthonyB00 2004-03-01 Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. 2002 11 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#CooperFR02 2003-06-27 Cycles And Unicyclic Components In Random Graphs. 2003 12 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Janson03 2003-06-27 One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights. 1999 8 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#Janson99 2003-06-27 Singularity Probabilities For Random Matrices Over Finite Fields. 2001 10 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#KahnK01 2003-06-27 On The Automorphism Groups Of Dowling Geometries. 2002 11 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Schwartz02 2003-06-27 On Compound Poisson Approximation For Sequence Matching. 2000 9 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Mansson00 2003-06-27 Pattern Avoidance And Overlap In Strings. 2002 11 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Mansson02 2003-06-27 Lagrangians Of Hypergraphs. 2002 11 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Talbot02 2003-06-27 Permutation Pseudographs And Contiguity. 2002 11 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#GreenhillJKW02 2003-06-27 Permutations With Restricted Cycle Structure And An Algorithmic Application. 2002 11 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#BealsLNPS02 2003-06-27 A Note On Vc-Dimension And Measure Of Sets Of Reals. 2000 9 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Ben-DavidG00 2003-06-27 Branching Random Walks On Quasi-Transitive Graphs. 2003 12 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Stacey03 2003-06-27 Searches On A Binary Tree With Random Edge-Weights. 1999 8 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#Stacey99 2003-06-27 The Residues Modulo M Of Products Of Random Integers. 2002 11 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Stadje02 2003-06-27 Information Loss In Riffle Shuffling. 2002 11 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#StarkGO02 2003-06-27 Packing Circuits Into KN. 2001 10 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#Balister01a 2003-06-27 Randomized Pursuit-Evasion In Graphs. 2003 12 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#AdlerRSSV03 2003-06-27 On Minimally 3-Connected Binary Matroids. 2001 10 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#ReidW01 2003-06-27 On Dominating Sets And Independent Sets Of Graphs. 1999 8 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#HarantPV99 2003-06-27 Partitioning Matroids With Only Small Cocircuits. 2002 11 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Oporowski02 2003-06-27 Local Density In Graphs With Forbidden Subgraphs. 2003 12 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#KeevashS03 2004-12-07 A Sufficient Condition For A Graph To Be The Core Of A Class 2 Graph. 2000 9 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#DugdaleH00 2004-03-01 Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. 2002 11 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#CooperFRR02 2004-02-26 On The Alspach Conjecture. 2001 10 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#Balister01 2003-06-27 Packing Digraphs With Directed Closed Trails. 2003 12 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Balister03 2003-06-27 On The Distribution Of The Number Of Missing Words In Random Texts. 2003 12 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#RahmannR03 2003-06-27 Linear And Hereditary Discrepancy. 2000 9 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Doerr00 2003-06-27 On The Number Of Elements In Matroids With Small Circuits Or Cocircuits. 1999 8 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#DenleyR99 2003-06-27 Packing Ferrers Shapes. 2000 9 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#AlonBS00 2003-06-27 Locally Thin Set Families. 2000 9 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#AlonFK00 2003-06-27 String Quartets In Binary. 2000 9 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#AlonKM00 2005-03-14 On Arithmetic Progressions Of Cycle Lengths In Graphs. 2000 9 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Verstraete00 2005-03-14 A Note On Vertex-Disjoint Cycles. 2002 11 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Verstraete02 2003-07-09 On The Fluctuations Of The Giant Component. 2000 9 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#BarraezBV00 2003-06-27 Simple Matroids With Bounded Cocircuit Size. 2000 9 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#BoninR00 2003-06-27 An Improved Upper Bound For The Hexagonal Lattice Site Percolation Critical Probability. 2002 11 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Wierman02 2003-06-27 Upper And Lower Bounds For The Kagome Lattice Bond Percolation Critical Probability. 2003 12 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Wierman03 2003-06-27 Matroid Duality From Topological Duality In Surfaces Of Nonnegative Euler Characteristic. 2002 11 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Slilaty02 2003-06-27 Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography. 2003 12 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#KrauseS03 2004-03-01 Chromatic, Flow And Reliability Polynomials: The Complexity Of Their Coefficients. 2002 11 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#OxleyW02 2003-06-27 Packing Trees Into The Complete Graph. 2002 11 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Dobson02 2003-06-27 Constructing Large Set Systems With Given Intersection Sizes Modulo Composite Numbers. 2002 11 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Kutin02 2003-06-27 On The Lock-In Probability Of Stochastic Approximation. 2002 11 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Borkar02 2003-06-27 Random Graphs And The Strong Convergence Of Bootstrap Means. 2000 9 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#CsorgoW00 2003-06-27 The Clarkson-Shor Technique Revisited And Extended. 2003 12 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Sharir03 2003-06-27 Excluding Minors In Nonplanar Graphs Of Girth At Least Five. 2000 9 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#ThomasT00 2003-06-27 Distinct Sums Modulo N And Tree Embeddings. 2002 11 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#KezdyS02 2003-06-27 Characterization Results Based On A Functional Derivative Approach. 2001 10 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#LilloM01 2003-11-27 Spanning Trees In Dense Graphs. 2001 10 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#KomlosSS01 2003-06-27 Expected Number Of Distinct Part Sizes In A Random Integer Composition. 2000 9 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#HitczenkoS00 2004-12-07 The Poisson-Dirichlet Distribution And The Scale-Invariant Poisson Process. 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#ArratiaBT99 2003-06-27 ^-7 Or P7. 2001 10 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#Mecay01 2003-06-27 Hereditary Properties Of Triple Systems. 2003 12 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#KohayakawaNR03 2004-03-16 The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#GuatteryLM99 2003-06-27 Bonferroni-Type Inequalities Via Chordal Graphs. 2002 11 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Dohmen02 2003-06-27 Concentration Of Measure For Products Of Markov Kernels And Graph Products Via Functional Inequalities. 2001 10 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#HoudreT01 2005-05-23 Distances In Random Induced Subgraphs Of Generalized N-Cubes. 2002 11 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Reidys02 2003-06-27 Bounds On The Complex Zeros Of (Di)Chromatic Polynomials And Potts-Model Partition Functions. 2001 10 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#Sokal01 2003-06-27 Proof Of The Van Den Berg-Kesten Conjecture. 2000 9 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Reimer00 2003-06-27 An Average Set Size Theorem. 2003 12 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Reimer03 2003-06-27 On The Edge Distribution Of A Graph. 2001 10 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#Nikiforov01 2003-06-27 Some Inequalities For The Largest Eigenvalue Of A Graph. 2002 11 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Nikiforov02 2003-06-27 A Note On Rough Isometry Invariance Of Resistance. 2002 11 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Telcs02 2003-06-27 Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs. 2000 9 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#FriezeZ00 2003-06-27 Simulated Annealing And Graph Colouring. 2001 10 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#NolteS01 2003-06-27 The Average Displacement Of The Simple Random Walk On The Sierpinski Graph. 2003 12 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Teufl03 2003-06-27 The Asymptotic Proportion Of Subdivisions Of A 2 × 2 Table That Result In Simpson's Paradox. 1999 8 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#Hadjicostas99 2003-06-27 Information Loss In Top To Random Shuffling. 2002 11 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Stark02 2003-06-27 Total Variation Asymptotics For Refined Poisson Process Approximations Of Random Logarithmic Assemblies. 1999 8 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#Stark99 2003-06-27 Propp-Wilson Algorithms And Finitary Codings For High Noise Markov Random Fields. 2000 9 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#HaggstromS00 2005-10-06 Algorithmic Aspects Of A Chip-Firing Game. 2001 10 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#Heuvel01 2003-06-27 Explicit Constructions Of Rödl's Asymptotically Good Packings And Coverings. 2000 9 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Kuzjurin00 2003-11-26 Concentration For Independent Permutations. 2002 11 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Mcdiarmid02 2003-06-27 Generating Random Regular Graphs Quickly. 1999 8 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#StegerW99 2003-06-27 A Note On Counting Very Different Sequences. 2001 10 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#FachiniK01 2003-06-27 Mappings On Decomposable Combinatorial Structures: Analytic Approach. 2002 11 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Manstavicius02 2003-06-27 Total Path Length For Random Recursive Trees. 1999 8 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#DobrowF99 2003-06-27 Fast Unimodular Counting. 2000 9 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#Mount00 2003-06-27 A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem. 1999 8 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#AhlswedeC99 2003-06-27 Constructing Trees In Graphs Whose Complement Has No K2, S. 2002 11 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Dobson02a 2003-06-27 Some Exact Results And New Asymptotics For Hypergraph Turán Numbers. 2002 11 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Mubayi02 2003-07-09 On The Independence Number Of Random Interval Graphs. 2001 10 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#BoucheronV01 2003-07-09 On A Square Packing Problem. 2002 11 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#BoucheronV02 2003-06-27 Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error. 2000 9 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#TillichZ00 2004-02-02 Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. 2002 11 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#MckayWW02 2003-06-27 The Minimum Size Of Saturated Hypergraphs. 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#Pikhurko99 2003-06-27 Equitable Colourings Of D-Degenerate Graphs. 2003 12 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#KostochkaN03 2004-02-26 Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#KostochkaN99 2003-06-27 The "Burnside Process" Converges Slowly 2002 11 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#GoldbergJ02 2006-02-13 A Ratio Inequality For Binary Trees And The Best Secretary. 2002 11 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#KubickiLM02 2003-06-27 Graphs Without Large Complete Minors Are Quasi-Random. 2002 11 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Myers02 2003-06-27 Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. 2003 12 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#GoerdtJ03 2003-12-12 A Grötzsch-Type Theorem For List Colourings With Impropriety One. 1999 8 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc8.html#Skrekovski99 2003-06-27 The Wiener Index Of Random Trees. 2002 11 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc11.html#Neininger02 2003-06-27 The Maximum Degree Of A Random Graph. 2000 9 Combinatorics, Probability & Computing 6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#RiordanS00 2003-06-27 Counting Partial Orders With A Fixed Number Of Comparable Pairs. 2001 10 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc10.html#PromelST01 2003-06-27 Some Constructions In The Inverse Spectral Theory Of Cyclic Groups. 2003 12 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Green03 2003-06-27 The Intersection Exponent For Simple Random Walk. 2000 9 Combinatorics, Probability & Computing 5 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc9.html#LawlerP00 2004-09-07 The Turán Theorem for Random Graphs. 61-91 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#KohayakawaRS04 2004-11-22 On the b-Independence Number of Sparse Random Graphs. 295-309 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#AtkinsonF04 2004-09-07 Distinct Distances in Three and Higher Dimensions. 283-293 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#AronovPST04 2004-09-07 Influences in Product Spaces: KKL and BKKKL Revisited. 17-29 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Friedgut04 2004-09-07 A Disproof of the Fon-der-Flaass Conjecture. 195-201 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Johnson04 2004-09-07 Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. 389-411 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#SmorodinskyS04 2004-09-07 Embedding a Markov Chain into a Random Walk on a Permutation Group. 339-351 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Evans04 2004-09-07 A Subset Expansion of the Coloured Tutte Polynomial. 269-275 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Traldi04 2004-09-07 Large Topological Cliques in Graphs Without a 4-Cycle. 93-102 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#KuhnO04 2004-09-07 Chromatic Roots are Dense in the Whole Complex Plane. 221-261 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Sokal04 2004-09-07 How Sharp is the Concentration of the Chromatic Number? 115-117 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Bollobas04 2004-09-07 Polynomials that Vanish on Distinct nth Roots of Unity. 37-59 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#KezdyS04 2004-09-07 Two Minor Problems. 412 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Thomason04 2004-09-07 A Note on a Question of Erdos and Graham. 263-267 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Solymosi04 2004-09-07 Extremal Combinatorics: with Applications in Computer Science by Stasys Jukna, Springer, 2001, xvii + 375 pp. 119-121 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Leader04 2004-09-07 On Generalized Random Railways. 31-35 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#GarmoJK04 2004-09-07 Threshold Functions for Random Graphs on a Line Segment. 373-387 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#McColm04 2006-04-27 Longest Paths in Circular Arc Graphs. 311-317 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#BalisterGLS04 2004-09-07 On Phase Transition in the Hard-Core Model on Math. 137-164 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#GalvinK04 2004-10-13 The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. 319-337 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#CooperF04 2004-09-07 Random Assignment with Integer Costs. 103-113 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Parviainen04 2004-09-07 Point-Line Incidences in Space. 203-220 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#SharirW04 2004-09-07 _r+2in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth. 361-371 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#KuhnO04a 2004-09-07 Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry, by J Matousek, Springer, 2003, 196 pp. 280-282 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Barany04 2006-03-14 Topics in Graph Automorphisms and Reconstruction by Josef Lauri and Raffaele Scapellato, Cambridge University Press, 2003, 172 pp. 122 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Scott04 2004-09-07 On the Number of Edges in Random Planar Graphs. 165-183 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#GerkeM04 2004-09-07 Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs. 1-16 2004 13 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Bordewich04 2004-09-07 Three Sampling Formulas. 185-193 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Gnedin04 2004-09-07 Isoperimetric Problems for r-sets. 277-279 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#BollobasL04 2004-09-07 Distributed Colouring and Communication in Rings with Local Knowledge. 123-136 2004 13 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#DessmarkP04 2005-12-06 Fat-Shattering of Affine Functions. 353-360 2004 13 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#HushS04 2004-09-07 Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph. 211-216 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Mosca98 2005-06-20 Endomorphisms of Partially Ordered Sets. 33-46 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#DuffusLRR98 2004-09-07 Distant Vertex Partitions of Graphs. 413-422 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Jagger98 2004-09-07 Some Inequalities Concerning Cross-Intersecting Families. 247-260 1998 7 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#FranklT98 2004-09-07 Seven-Set Venn Diagrams with Rotational and Polar Symmetry. 149-152 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Edwards98 2004-09-07 On the Cover Time for Random Walks on Random Graphs. 265-279 1998 7 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Jonasson98 2005-06-06 Almost Odd Random Sum-Free Sets. 27-32 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#CalkinC98 2005-01-07 Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. 423-436 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#LuczakVRS98 2004-09-07 On a Combinatorial Theorem of Erdös, Ginzburg and Ziv. 403-412 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#HamidouneOO98 2004-09-07 On Biased Positional Games. 339-351 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Bednarska98 2004-09-07 Consistency of Natural Relations on Sets. 281-293 1998 7 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#MaruokaPK98 2004-09-07 On Local Expansion of Vertex-Transitive Graphs. 205-209 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Lukacs98 2004-09-07 All Ramsey Numbers r(K3, G) for Connected Graphs of Order 7 and 8. 129-140 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Brinkmann98 2006-01-31 Isoperimetric Inequalities for Cartesian Products of Graphs. 141-148 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#ChungT98 2005-09-06 The Zero-Free Intervals for Characteristic Polynomials of Matroids. 153-165 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#EdwardsHJ98 2004-09-07 Lower Bounds for the Probability of Intersection of Several Unions of Events. 353-364 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#ChenS98 2004-09-17 Extremal Problems for Affine Cubes of Integers. 65-79 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#GundersonR98 2004-09-07 Generalized Stack Permutations. 239-246 1998 7 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Atkinson98 2004-09-07 Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth. 375-386 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Emden-WeinertHK98 2004-09-07 Uniform Intersecting Families with Covering Number Restrictions. 47-56 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#FranklOT98 2005-11-30 Complexity and Probability of Some Boolean Formulas. 451-463 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Savicky98 2004-09-07 On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs. 397-401 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Haggstrom98 2004-09-07 An Algebraic Proof of Deuber's Theorem. 167-180 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#HindmanS98 2004-09-07 Ramsey Theory and Sequences of Random Variables. 221-238 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#TrotterW98 2004-09-07 Expected Value Expansions in Random Subgraphs with Applications to Network Reliability. 465-483 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Siegrist98 2004-09-07 A Remark on the Number of Complete and Empty Subgraphs. 217-219 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#SchelpT98 2004-09-07 On the Critical Value for 'Percolation' of Minimum-Weight Trees in the Mean-Field Distance Model. 1-10 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Aldous98 2004-09-07 List Total Colourings of Graphs. 181-188 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#JuvanMS98 2005-08-01 Asymptotic Enumeration of Eulerian Circuits in the Complete Graph. 437-449 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#MacKayR98 2004-09-07 The Asymptotic Proportion of Subdivisions of a 2×2 Table that Result in Simpson's Paradox. 387-396 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Hadjicostas98 2004-09-07 A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures. 89-110 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Hwang98 2004-09-07 A Large Deviation Inequality for Functions of Independent, Multi-Way Choices. 57-63 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Grable98 2004-09-07 On a Theorem of Ganter. 247-254 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Vu97 2004-09-07 Comparisons in Hoare's Find Algorithm. 111-120 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#KirschenhoferP98 2004-09-07 Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width. 307-321 1998 7 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Noble98 2004-09-07 Reliable Fault Diagnosis with Few Tests. 323-333 1998 7 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#PelcU98 2004-09-07 Adding and Reversing Arcs in Semicomplete Digraphs. 17-25 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Bang-JensenJ98 2004-09-07 Adding Distinct Congruence Classes. 81-87 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Hamidoune98 2005-06-17 The Size of the Giant Component of a Random Graph with a Given Degree Sequence. 295-305 1998 7 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#MolloyR98 2004-09-07 Common Subsequences and Supersequences and their Expected Length. 365-373 1998 7 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Dancik98 2004-09-07 On the Maximum Cut of Line Graphs. 335-337 1998 7 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Shiraishi98 2004-09-07 On the Number of Incidences Between Points and Curves. 121-127 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#PachS98 2005-08-05 Zero Sums in Abelian Groups. 261-263 1998 7 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#GaoH98 2004-09-07 A Note on a Problem by Welsh in First-Passage Percolation. 11-15 1998 7 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#Alm98 2004-09-20 Reversal of Markov Chains and the Forget Time. 189-204 1998 7 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc7.html#LovaszW98 2004-09-07 The Zero-Free Intervals for Chromatic Polynomials of Graphs. 497-506 1997 6 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Thomassen97 2004-12-07 Imperfections in Random Tournaments. 1-15 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#BarbourGQ97 2004-09-07 The Number of m-ary Search Trees on n Keys. 435-453 1997 6 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#FillD97 2004-09-07 Markov Processes Involving q-Stirling Numbers. 165-178 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#CrippaST97 2004-09-07 On Medians of Lattice Distributions and a Game with Two Dice. 273-294 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Grindstead97 2004-09-07 Probabilistic Number Theory, the GEM/Poisson-Dirichlet Distribution and the Arc-sine Law. 57-77 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Hirth97 2004-09-07 An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction. 397-433 1997 6 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#DaudeFV97 2006-07-20 Stochastic Analysis of Convergence via Dynamic Representation for a Class of Line-search Algorithms. 205-229 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#PronzatoWZ97 2004-09-07 Triangle Factors in Random Graphs. 337-347 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Krivelevich97 2004-09-07 Self-Affine Carpets on the Square Lattice. 197-204 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#HueterP97 2005-11-09 On the Error-Correcting Capabilities of Cycle Codes of Graphs. 27-38 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#DecreusefondZ97 2004-09-28 Submap Density and Asymmetry Results for Two Parameter Map Families. 17-25 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#BenderCGR97 2004-09-07 Limit Laws for the Optimal Directed Tree with Random Costs. 315-335 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Hansen97 2004-09-07 Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution. 179-183 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#GrabnerP97 2004-09-07 Tied Favourite Edges for Simple Random Walk. 359-369 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#TothW97 2004-09-07 A Model for Random Random-Walks on Finite Groups. 49-56 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Greenhalgh97 2004-09-07 A Remark on the Szarek-Talagrand Theorem. 139-144 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Alesker97 2004-09-07 Recovering Set Systems and Graph Entropy. 481-491 1997 6 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#SaliS97 2004-09-07 Maximal Spacing Configurations in Graphs. 455-463 1997 6 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#FirbyH97 2004-09-07 Constructive Upper Bounds for the Turán Number. 475-479 1997 6 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Matthias97 2004-09-07 Log-Concavity and the Spectral Gap of Stochastic Matrices. 370-375 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Weineck97 2004-09-07 Crossing Numbers and Hard Erd[odblac]s Problems in Discrete Geometry. 353-358 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Szekely97 2004-09-07 An Upper Bound on the Number of Edges of a 2-Connected Graph. 107-113 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Wu97 2004-09-07 Centering Sequences with Bounded Differences. 79-86 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#McDiarmid97 2004-10-14 Intersecting Systems. 127-137 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#AhlswedeAERS97 2004-09-07 Symmetric Chain Decompositions of Linear Lattices. 231-245 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#VogtV97 2004-09-07 A Note on Distributional Equality in the Cyclic Tour Property for Markov Chains. 493-496 1997 6 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#TanushevA97 2004-09-07 Autocorrelation and the Enumeration of Strings Avoiding a Fixed String. 45-48 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Eriksson97 2004-09-07 On a Result of Lemke and Kleitman. 39-43 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Denley97 2005-03-01 From GEM back to Dirichlet via Hoppe's Urn. 185-195 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Hirth97a 2004-09-07 Independent Transversals and Independent Coverings in Sparse Partite Graphs. 115-125 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Yuster97 2005-06-21 Bipartite Coverings of Graphs. 349-352 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#RodlR97 2004-09-07 Triangle-Free Graphs with Large Degree. 381-396 1997 6 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#ChenJK97 2004-09-07 Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes. 87-105 1997 6 Combinatorics, Probability & Computing 1 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Stark97 2004-09-07 Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments. 255-261 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Bang-JensenGY97 2004-09-07 Dependent Sets of Constant Weight Binary Vectors. 263-271 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Calkin97 2004-09-07 New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs. 295-313 1997 6 Combinatorics, Probability & Computing 3 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#HagkvistJ97 2005-09-29 The Offset Problem. 159-164 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#CowenM97 2004-09-07 Large Deviation Bounds for Markov Chains. 465-474 1997 6 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Kahale97 2004-09-07 On the Edge-Expansion of Graphs. 145-152 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#Alon97 2004-09-07 Irredundance and Maximum Degree in Graphs. 153-157 1997 6 Combinatorics, Probability & Computing 2 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc6.html#CockayneM97 2004-09-07 Interval Packing and Covering in the Boolean Lattice. 373-384 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Engel96 2004-09-07 Fast String Matching in Stationary Ergodic Sources. 415-427 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Shawe-Taylor96 2004-09-07 Reliable Broadcasting in Hypercubes with Random Link and Node Failures. 337-350 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#ChlebusDP96 2004-09-07 The Harmonious Chromatic Number of Bounded Degree Trees. 15-28 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Edwards96 2005-06-17 Perfect Matchings in Random r-regular, s-uniform Hypergraphs. 1-14 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#CooperFMR96 2004-09-07 An Efficient Method of Examining all Trees. 403-413 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Kubicka96 2005-06-17 Paths, Stars and the Number Three. 277-295 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Reed96 2004-09-07 Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP. 297-306 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Saad96 2004-09-07 Excluding Minors in Cubic Graphs. 57-78 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#KilakosS96 2004-09-07 t-Covering Arrays: Upper Bounds and Poisson Approximations. 105-117 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#GodboleSS96 2004-09-07 Orthogonality of Measures Induced by Random Walks with Scenery. 247-256 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Howard96 2004-09-07 Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph. 91-94 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Slivnik96 2004-09-07 An Improvement of Hind's Upper Bound on the Total Chromatic Number. 94-104 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#ChetwyndH96 2004-09-07 Computing Norms of group-Invariant Transition Operators. 161-178 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Saloff-CosteW96 2004-09-07 ². 393-402 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Hegyvaeri96 2004-09-07 On the Number of Hamiltonian Cycles in Bipartite Graphs. 437-442 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Thomassen96a 2004-09-07 On Recognition of Shift Registers. 307-315 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#SzusterWZ96 2004-09-07 Some Asymptotical Estimates for Planar Eulerian Maps. 131-138 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Liskovets96 2004-09-07 A Winning Strategy for the Ramsey Graph Game. 267-276 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Pekec96 2004-09-20 Topological cliques in graphs 2. 79-90 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#KomloS96 2004-09-07 K5-Subdivisions in Graphs. 179-189 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Thomassen96 2004-09-07 Restricted Edge-colourings of Bipartite Graphs. 385-392 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Haggkvist96 2004-09-07 Smallest sets of Longest Paths with Empty Intersection. 429-436 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Skupien96 2004-09-07 An Upper Bound on Zarankiewicz' Problem. 29-33 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Furedi96 2004-09-07 Asymptotic Enumeration of Predicate-Junction Flowgraphs. 215-226 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Cooper96 2004-09-07 An Almost m-wise Independed Random Permutation of the Cube. 119-130 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Gowers96 2004-09-24 Valid Generalisation from Approximate Interpolation. 191-214 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#AnthonyBIS96 2004-09-07 A Characterization of Almost-Planar Graphs. 227-245 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Gubser96 2004-09-07 Cycle Partitions in Graphs. 95-97 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#ChenJ96 2004-09-07 A Phase Transition for the Distribution of Matching Blocks. 139-159 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Neuhauser96 2004-09-07 Multiway trees of Maximum and Minimum Probability under the Random Permutation Model. 351-371 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#DobrowF96 2005-01-27 Predecessors in Random Mappings. 317-335 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#BaronDM96 2004-09-07 Small Submatroids in Random Matroids. 257-266 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#Kordecki96 2004-09-07 Precoloring Extension 3: Classes of Perfect Graphs. 35-56 1996 5 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc5.html#HujterT96 2004-09-07 Substitution Method Critical Probability Bounds for the Square Lattice Site Percolation Model. 181-188 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Wierman95 2004-09-07 Isoperimetric Inequalities and Decay of Iterated Kernels for almost-transitive Markov Chains. 419-442 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Saloff-Coste95 2004-09-07 The Smallest Cubic Graphs of Girth Nine. 317-329 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#BrinkmannMS95 2004-09-07 Shortcutting Planar Digraphs. 287-315 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Thorup95 2004-09-07 Multivariate Identities, Permutation and Bonferroni Upper Bounds. 331-342 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#ChenS95 2006-07-03 On Vertices of Degree n in Minimally n-Edge-Connected Graphs. 81-95 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Mader95 2004-09-07 The Harmonious Chromatic Number of Almost All Trees. 31-46 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Edwards95 2004-09-07 The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions. 197-215 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#HaraS95 2004-09-07 On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE. 167-180 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Verbitsky95 2004-09-07 A probabilistic Analysis of a String Editing Problem and its Variations. 143-166 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Louchard95 2004-09-07 The Induced Size-Ramsey Number of Cycles. 217-239 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#HaxellKL95 2004-09-07 Graph Minors 1: A Short Proof of the Path-width Theorem. 27-30 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Diestel95 2004-09-07 Conditional Independences among Four Random Variables 2. 407-417 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Matus95 2004-09-07 Conditional Independences among Four Random Variables 1. 269-278 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#MatusS95 2005-06-17 Almost Every Graph can be Covered by [fracDelta2] Linear Forests. 257-268 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#DiarmidR95 2004-09-07 On Brooks' Theorem for Sparse Graphs. 97-132 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Kim95 2004-09-07 Recurrence and Transience for a Card Shuffling Model. 133-142 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Lawler95 2004-09-07 On Weighted Sequence Sums. 363-367 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Hamidoune95 2004-09-07 Some Small Circuit- Cocircuit Ramsey Numbers for Matroids. 67-80 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#HurstR95 2004-09-07 Automorphisms of Dowling and Related Geometries. 1-9 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Bonin95 2006-01-31 Eigenvalues of Graphs and Sobolev Inequalities. 11-25 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#ChungY95 2004-10-13 On the Connectivity of Random k-th Nearest Neighbour Graphs. 343-362 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#CooperF95 2004-09-07 Random Regular Graphs: Asymptotic Distributions and Contiguity. 369-405 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Janson95 2004-09-07 On Random 3-sat. 189-195 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#MaftouhiV95 2004-09-07 First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner. 279-285 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#Stark95 2004-09-07 proof of a Packing Conjecture of Bollobás. 241-255 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#KomlosSS95 2004-11-22 Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. 47-66 1995 4 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc4.html#FriezeRS95 2004-09-07 On Canonical Concurrent Flows, Crossing Number and Graph Expansion. 523-543 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#ShahrokhiS94 2004-09-07 Lower Bounds for Insertion Methods for TSP. 285-292 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Azar94 2005-05-23 (1, 2)-Factorizations of General Eulerian Nearly Regular Graphs. 87-95 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#HaggkvistJ94 2004-09-07 An Introduction to Random Topological Graphs Theory. 545-555 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#White94 2004-09-07 _s_r-Free Subgraphs. 349-354 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Krivelevich94 2004-09-07 Obstructions for the Disk and the Cylinder Embedding Extension Problems. 375-406 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Mohar94 2004-09-07 Non-Binary Madroids Having At Most Three Non-Binary Elements. 355-369 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Lemos94 2004-09-07 A Matroid Reconstruction Result. 371-373 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Mills94 2004-09-07 Independet Transversals in Sparse Partite Hypergraphs. 293-296 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#ErdosGL94 2004-09-07 On Triangle Contact Graphs. 233-246 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#FraysseixMR94 2004-09-07 Menger's Theorem for a Countable Source Set. 145-156 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#AharoniD94 2004-09-07 Deterministic Graphs Games and a Probabilistic Intuition. 13-26 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Beck94 2005-05-23 Lattice Points of Cut Cones. 191-214 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#DezaG94 2004-09-07 A Stochastic Comparisor for Arrangement Increasing Functions. 345-348 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#KriegerR94 2004-09-07 How Do Read-Once Formulae Shrink? 455-469 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#DubinerZ94 2004-09-07 Block Reduced Lattice Bases and Successive Minima. 507-522 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Schnorr94 2004-09-07 ^p-Independence Numbers. 297-325 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#ErdosHSSS94 2004-09-07 A Rate for the Erdös-Turan Law. 167-176 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#BarbourT94 2004-09-07 Properties of Classes of Random Graphs. 435-454 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#BrandJ94 2004-09-07 Almost Safe Testing with Few Tests. 411-419 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Pelc94 2004-09-07 On Universal Threshold Graphs. 327-344 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#HammerK94 2004-09-07 The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph. 97-126 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Janson94 2006-07-03 On Vertex-Edge-Critically n-Connected Graphs. 257-271 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Mader94 2004-09-07 A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs. 273-283 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Annan94 2004-09-07 Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs. 1-11 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#ArrowsmithE94 2004-09-07 On Intersecting Chains in Boolean Algebras. 57-62 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#ErdosSS94 2004-09-07 Amalgemated Factorizations of Complete Graphs. 215-231 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#DugdaleH94 2004-10-13 On the Maximum Number of Triangles in Wheel-Free Graphs. 63-75 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#FurediGK94 2004-09-07 Randomised Approximation in the Tutte Plane. 137-143 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Welsh94 2004-09-07 The Growth of Infinite Graphs: Boundedness and Finite Spreading. 51-55 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#DiestelL94 2004-09-07 Matchings in Lattice Graphs and Hamming Graphs. 157-165 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#AignerK94 2004-09-07 Blocking Sets in SQS(2u). 77-86 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#GionfriddoMT94 2004-09-07 An Extension of Foster's Network Theorem. 421-427 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Tetali94 2004-10-13 Hamilton Cycles in Random Regular Digraphs. 39-49 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#CooperFM94 2005-06-06 On Oriented Embedding of the Binary tree into the Hypercube. 27-38 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Bezrukov94 2004-09-07 Properties of Large Eden Clusters in the Plane. 471-505 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#HammersleyM94 2004-09-07 On Partitioning and Packing Products with Rectangles. 429-434 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#AhlswedeC94 2004-09-07 A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies. 177-190 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#DeuberT94 2004-09-07 Perfect Hashing and Probability. 407-409 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#Nilli94 2004-09-07 A Ramsey-type Theorem in the Plane. 127-135 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#NesetrilV94 2004-09-07 Topological Cliques in Graphs. 247-256 1994 3 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc3.html#KomlosS94 2004-09-07 Ramsey Size Linear Graphs. 389-399 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#ErdosFRS93 2004-09-07 Recognizing Polymatroids Associated with Hypergraphs. 519-530 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#VertiganW93 2004-09-07 Optimally Reliable Graphs for Both Vertex and Edge Failures. 93-100 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Smith93 2004-09-07 A Theorem on Reconstruction of Random Graphs. 1-9 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#CameronM93 2004-09-07 Factorization in Fq(x) and Brownian Motion. 285-299 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Hansen93 2004-09-07 Some Dual Problems of Geometric Probability in the Plane. 11-23 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Gates93 2004-09-07 Clique Partitions of Chordal Graphs. 409-415 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#ErdosOZ93 2005-01-21 Some LOcal Extremal Connectivity Results for Matroids. 367-384 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#AkkariO93 2004-09-07 Threshold Channel Graphs. 337-349 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#KraetzlC93 2004-10-05 A Zero-Free Interval for Chromatic Polynomials of Graphs. 325-336 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#JAckson93 2005-09-23 Constructing Small Sets that are Uniform in Arithmetic Progressions. 513-518 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#RazborovSW93 2004-09-07 A Random Recolouring Method for Graphs and Hypergrams. 363-365 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#McDiarmid93 2004-09-07 Minimization Problems for Infinite n-Connected graphs. 417-436 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Halin93 2005-01-26 Ramsey Problems With Bounded Degree Spread. 263-269 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#ChenS93 2004-09-07 On Extremal Set Partitions in Cartesian Product Spaces. 211-220 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#AhlswedeC93 2004-09-07 Potential Thory on Distance-Regular Graphs. 243-255 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Biggs93 2004-09-07 Reconstructing a Graph from its Neighborhood Lists. 103-113 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#AignerT93 2005-11-30 On Random Generation of the Symmetic Group. 505-512 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#LuczakP93 2005-05-04 Random Permutations: Some Group-Theoretic Aspects. 257-262 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#CameronK93 2004-09-07 On a Random Instance of a "Stable Roommates" Problem: Likely Bahavior of the Proposal Algorithm. 53-92 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Pittel93 2004-09-07 Threshold Functions for Markov Chains: a Graph Theoretic Approach. 351-362 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Lynch93 2004-09-07 Geometric Approaches to the Estimaton of the Spectral Gap of Reversible Marcov Chains. 301-323 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Ingrassia93 2004-09-07 Local-Global Phenomena in Graphs. 491-503 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Linial93 2005-01-10 Using the Perceptron Algorithm to Find Consistent Hypotheses. 385-387 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#AnthonyS93 2004-12-10 The Distribution of Heights of Binary Trees and Other Simple Trees. 145-156 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#FlajoletGOR93 2004-09-07 Triangle-Free Graphs with High Minimal Degrees. 479-490 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Jin93 2004-09-07 Nearly Equal Distances in the Plane. 401-408 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#ErdosMP93 2004-09-07 Upper Bounds for the Connective Constant of Self-Avoiding Walks. 115-136 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Alm93 2004-09-07 Sign-Coherent Identities for Characteristic Polynomials of Matroids. 33-51 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Kung93 2004-09-07 Additive and Multiplicative Ramsey Theorems in N-Some Elementary Results. 221-241 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#BergelsonH93 2004-09-07 Hamilton Cycles in Oriented Graphs. 25-32 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Haggkvist93 2004-09-07 Threshold Functions for H-factors. 137-144 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#AlonY93 2004-09-07 Random Matrices and Brownian Motion. 157-180 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#GohS93 2005-11-02 A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. 271-284 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#DyerFKKPV93 2004-09-07 A Discrete Analogue of a Theorem of Makarov. 181-199 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#Lawler93 2004-09-07 Image Partition Regularity of Matrices. 437-463 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#HindmanL93 2004-09-07 Extremal Graph Problems for Graphs with a Color-Critical Vertex. 465-477 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#HundackPS93 2004-09-07 Linear-Time Algorithms for the Max Cut Problem. 201-210 1993 2 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc2.html#NgocT93 2004-09-07 Plane Cubic Graphs with Prescribed Face Areas. 371-381 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Thomassen92 2004-09-07 Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. 351-370 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Sinclair92 2004-09-07 A Characterisation of Strict Matching Matroids. 209-217 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Bryant92 2005-02-15 The Compunational Complexity of the Tutte Plane: the Bipartite Case. 181-187 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#VertiganW92 2004-09-07 Three Thresholds for a Liar. 81-93 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#SpencerW92 2005-05-23 Large Induced Subgraphs with All Degrees Odd. 335-349 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Scott92 2004-09-07 Maximum Waiting Times are Asymptotically Independent. 251-264 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Mori92 2004-11-22 On Subgraph Sizes in Random Graphs. 123-134 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#CalkinFM92 2004-09-07 A Group-Theoretic Setting for Some Intersecting Sperner Families. 323-334 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#ErdosFK92 2004-09-07 An Expanded Set of Correlation Tests for Linear Congruential Random Number Generators. 161-168 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#PercusP92 2004-09-07 On the Trickness of Sparse Random Graphs. 303-309 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Cooper92 2004-09-07 Complete Subgraphs of r-partite Graphs. 241-250 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Jin92 2004-09-07 On the Diameter of Random Cayley Graphs of the Symmetric Group. 201-208 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#BabaiH92 2004-09-07 Random Graph Processes with Degree Restrictions. 169-180 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#RucinskiW92 2004-09-07 Duality in Polymatroids and Set Functions. 275-280 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Whittle92 2004-09-07 On the structure of Non-Hamiltonian Graphs 1. 27-34 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Haggkvist92 2004-09-07 Optimal Strategy for the First Player in the Penney Ante Game. 311-321 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Csirik92 2004-09-07 On a Correlation Inequality of Farr. 157-160 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#McDiarmid92 2004-09-07 Choice Numbers of Graphs: a Probabilistic Approach. 107-114 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Alon92 2004-09-07 Cycles in a Uniform Graph Process. 223-239 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#JaworskiL92 2004-09-07 Local Expansion of Ssymmetrical Graphs. 1-11 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#BabaiS92 2004-09-07 The Strongly Connected Components of 1-in, 1-out. 265-274 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#ReedM92 2004-10-13 Point Selections and Weak e-Nets for Convex Hulls. 189-200 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#AlonBFK92 2004-09-07 Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem. 115-122 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#CalderbankF92 2004-09-07 Componenets of Random Forests. 35-52 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#LuczakP92 2004-09-07 Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph. 13-25 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Godsil92 2004-09-14 Contractible Elements in Graphs and Matroids. 457-465 2003 12 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Wu03 2004-09-07 On the Number of Convex Lattice Polygons. 295-302 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#BaranyP92 2004-09-07 Greedy Search on the Binary Tree with random Edge-Weights. 281-293 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Aldous92 2004-09-07 Analysis of Top To Random Shuffles. 135-155 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#DiaconisFP92 2004-09-07 Equality of the Bond Percolation Critical Exponents for Two Pairs of Dual Lattices. 95-105 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#Wierman92 2004-09-07 Almost all Berge Graphs are Perfect. 53-79 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#PromelS92 2004-09-07 Duality for Random Sequential Adsorption on a Lattice. 219-222 1992 1 Combinatorics, Probability & Computing http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc1.html#FanP92 2004-09-14 Mixed Ramsey Numbers Revisited. 653-660 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#ROUSSEAUS03 2004-09-14 A Sárközy Theorem for Finite Fields. 643-651 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#McCutcheon03 2004-09-14 Schütte's Tournament Problem and Intersecting Families of Sets. 359-364 2003 12 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#BorowieckiGHT03 2005-02-01 On Ramsey Numbers of Sparse Graphs. 627-641 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#KostochkaS03 2004-09-14 On the Canonical Version of a Theorem in Ramsey Theory. 513-514 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Brown03 2004-09-14 A Partition Theorem for Scattered Order Types. 621-626 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#KomjathS03 2004-09-14 Subsequence Sums. 413-425 2003 12 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Hamidoune03 2004-09-14 Multicolour Discrepancies. 365-399 2003 12 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#DoerrS03 2005-05-23 Special Issue on Ramsey Theory. 467-468 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#BollobasBKLS03 2004-09-14 Ramsey Games Against a One-Armed Bandit. 515-545 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#FriedgutKRRT03 2004-09-14 On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle. 585-598 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#JiangW03 2004-09-14 Tura'n Numbers of Bipartite Graphs and Related Ramsey-Type Questions. 477-494 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#AlonKS03 2004-09-14 Markov Processes and Ramsey Theory for Trees. 547-563 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#FurstenbergW03 2004-09-14 Exact Expectations for Random Graphs and Assignments. 401-412 2003 12 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#ErikssonES03 2004-09-14 A Path Method for the Logarithmic Sobolev Constant. 431-455 2003 12 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Roberto03 2004-09-14 A Note on Explicit Ramsey Graphs and Modular Sieves. 565-569 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Grolmusz03 2004-09-14 Open Problems in Partition Regularity. 571-583 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#HindmanLS03 2004-09-14 An Application of Hindman's Theorem to a Problem on Communication Complexity. 661-670 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Pudlak03 2004-09-14 Rainbow Arithmetic Progressions and Anti-Ramsey Results. 599-620 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#JungicLMNR03 2004-09-14 Local Anti-Ramsey Numbers of Graphs. 495-511 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#AxenovichJT03 2004-09-14 Frank Ramsey. 469-475 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#BollobasT03 2004-09-14 A Lower Bound on the Size of Lipschitz Subsets in Dimension 3. 427-430 2003 12 Combinatorics, Probability & Computing 4 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Matousek03 2005-09-19 Canonical Vertex Partitions. 671-704 2003 12 Combinatorics, Probability & Computing 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc12.html#Sauer03 2005-10-04 Families of Trees Decompose the Random Graph in an Arbitrary Way. 893-910 2004 37 Combinatorics, Probability & Computing 6 http://dx.doi.org/10.1017/S096354830400639X http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Yuster04 2005-10-04 New Bounds on Parent-Identifying Codes: The Case of Multiple Parents. 795-807 2004 37 Combinatorics, Probability & Computing 6 http://dx.doi.org/10.1017/S0963548304006388 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#AlonS04 2005-10-04 Area and Inertial Moment of Dyck Paths. 697-716 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006339 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#The04 2005-10-04 Optimizing LRU Caching for Variable Document Sizes. 627-643 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S096354830400625X http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#JelenkovicR04 2005-10-05 And/Or Trees Revisited. 475-497 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006273 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#ChauvinFGG04 2005-10-04 Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm. 499-536 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006261 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#DaireauxV04 2005-10-04 Ramanujan Signing of Regular Graphs. 911-912 2004 37 Combinatorics, Probability & Computing 6 http://dx.doi.org/10.1017/S0963548304006509 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#BiluL04 2005-10-04 Special Issue on Analysis of Algorithms. 415-417 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006455 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#DrmotaS04 2005-10-04 Additive Decompositions, Random Allocations, and Threshold Phenomena. 537-575 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006224 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#DuboisLM04 2005-10-04 Logarithmic Combinatorial Structures: A Probabilistic Approach, by RichardcArratia, A. D. Barbour and Simon Tavaré. 916-917 2004 37 Combinatorics, Probability & Computing 6 http://dx.doi.org/10.1017/S0963548304226566 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Holst04 2006-01-31 Max Cut for Random Graphs with a Planted Partition. 451-474 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006303 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#BollobasS04 2005-10-04 Compatible Sequences and a Slow Winkler Percolation. 815-856 2004 37 Combinatorics, Probability & Computing 6 http://dx.doi.org/10.1017/S0963548304006340 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Gacs04 2005-10-04 Two Results on Real Zeros of Chromatic Polynomials. 809-813 2004 37 Combinatorics, Probability & Computing 6 http://dx.doi.org/10.1017/S0963548304006418 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#DongK04 2005-10-04 Probabilistic Transforms for Combinatorial Urn Models. 645-675 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006285 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#MilenkovicC04 2005-10-04 On Some Parameters in Heap Ordered Trees. 677-696 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006194 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#MorrisPP04 2005-10-04 Boltzmann Samplers for the Random Generation of Combinatorial Structures. 577-625 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006315 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#DuchonFLS04 2005-10-04 Spin Glasses: A Challenge for Mathematicians - Cavity and Mean Field Models, cby Michel Talagrand. 913-915 2004 37 Combinatorics, Probability & Computing 6 http://dx.doi.org/10.1017/S096354830421656X http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Bovier04 2005-10-04 On the Strong Chromatic Number. 857-865 2004 37 Combinatorics, Probability & Computing 6 http://dx.doi.org/10.1017/S0963548304006157 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Haxell04 2005-10-04 Asymptotics of Multivariate Sequences II: Multiple Points of the Singular Variety. 735-761 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006248 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#PemantleW04 2005-10-04 The Reconstructibility of Finite Abelian Groups. 867-892 2004 37 Combinatorics, Probability & Computing 6 http://dx.doi.org/10.1017/S0963548303005807 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Pebody04 2005-10-04 Quicksort with Unreliable Comparisons: A Probabilistic Analysis. 419-449 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006297 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#AlonsoCGJRS04 2005-10-04 Distribution of the Steiner Distance in Generalized M-ary Search Trees. 717-733 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006212 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Panholzer04 2005-10-04 Concentration of Size and Path Length of Tries. 763-793 2004 13 Combinatorics, Probability & Computing 4-5 http://dx.doi.org/10.1017/S0963548304006200 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc13.html#Schachinger04 2005-10-04 Probability on Discrete Structures, edited by H. Kesten. 619-623 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S0963548305216991 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Steif05 2005-10-04 Connected matchings and Hadwiger's conjecture. 435-438 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548305006759 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#FurediGS05 2005-10-04 The Maximum Degree of the Barabasi-Albert Random Tree. 339-348 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548304006133 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Mori05 2005-10-04 Zigzag Structures of Simple Two-Faced Polyhedra. 31-57 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006583 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#DezaD05 2005-10-04 The Cycle-Complete Graph Ramsey Numbers. 349-370 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S096354830400642X http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Nikiforov05 2005-10-04 The $k$-Equal Problem. 17-24 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006704 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Aigner05 2005-10-04 Convex Polytopes, by Branko Grunbaum, second edition (first edition (1967) written with the cooperation of V. L. Klee, M. Perles and G. C. Shephard. 623-626 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S0963548305226998 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#McMullen05 2005-10-04 Asymptotic Enumeration of Spanning Trees. 491-522 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S096354830500684X http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Lyons05 2005-10-04 On Subsequence Weighted Products. 485-489 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S0963548305006814 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#HamidouneQ05 2005-10-04 Triple Systems Not Containing a Fano Configuration. 467-484 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S0963548305006784 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#FurediS05 2005-10-04 Counting Small Cliques in 3-uniform Hypergraphs. 371-413 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548304006546 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#PengRS05 2005-10-04 Paradoxical Decompositions and Growth Conditions. 81-105 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006728 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#ElekS05 2005-10-04 Lifting Markov Chains to Random Walks on Groups. 269-273 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548304006352 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#ChanL05 2005-10-04 On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. 225-247 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006650 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#WegenerW05 2005-10-04 Some Ramsey Schur Numbers. 25-30 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006595 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#BodeGH05 2005-10-04 Sparse Parity-Check Matrices over ${GF(q)}$. 147-169 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006625 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Lefmann05 2005-10-04 Lamplighters, Diestel-Leader Graphs, Random Walks, and Harmonic Functions. 415-433 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548304006443 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Woess05 2005-10-04 Ramsey Classes and Homogeneous Structures. 171-189 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006716 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Nesetril05 2005-10-04 On Intersecting Properties of Partitions of Integers. 319-323 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548304006431 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Hegyvari05 2005-10-04 Distance Graphs on the Integers. 107-131 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006637 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#FerraraKR05 2005-10-04 Inequivalent Representations of Bias Matroids. 567-583 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S0963548305006838 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Mayhew05 2005-10-04 The Cycle Space of an Infinite Graph. 59-79 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006686 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Diestel05 2005-10-04 Packings in Dense Regular Graphs. 325-337 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548304006406 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#KuhnO05 2005-10-04 Orthogonal Decomposition of Symmetric Functions Defined on Random Permutations. 249-268 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548304006364 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Bloznelis05 2005-10-04 Using Symmetry to Improve Percolation Threshold Bounds. 549-566 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S0963548305006802 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#MayW05 2005-10-04 The Lovász Number of Random Graphs. 439-465 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S0963548305006826 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Coja-Oghlan05 2005-10-04 Detachments of Complete Graphs. 275-310 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548304006558 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Edwards05 2005-10-04 Improved Results for Competitive Group Testing. 191-202 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006649 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#SchlaghoffT05 2005-10-04 Self-Avoiding Walks on Hyperbolic Graphs. 523-548 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S0963548305006772 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#MadrasW05 2005-10-04 Modular Counting and Substitution of Structures. 203-210 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006698 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Specker05 2005-10-04 Complete Disorder is Impossible: The Mathematical Work of Walter Deuber. 3-16 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006674 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Promel05a 2005-10-04 On the Evolution of Triangle-Free Graphs. 211-224 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006613 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Steger05 2005-10-04 Special Issue in Memory of Walter Deuber. 1 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006662 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Promel05 2005-10-04 Construction of a Maximum Stable Set with $k$-Extensions. 311-318 2005 14 Combinatorics, Probability & Computing 3 http://dx.doi.org/10.1017/S0963548304006376 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#HammerZ05 2005-10-04 Triangle Density and Contractibility. 133-146 2005 14 Combinatorics, Probability & Computing 1-2 http://dx.doi.org/10.1017/S0963548304006601 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#Kriesell05 2005-10-04 On Cover Graphs and Dependent Arcs in Acyclic Orientations. 585-617 2005 14 Combinatorics, Probability & Computing 4 http://dx.doi.org/10.1017/S0963548305006760 http://www.informatik.uni-trier.de/~ley/db/journals/cpc/cpc14.html#RodlT05 2003-11-28 On transformation of authorization policies. 333-357 2003 45 Data Knowl. Eng. 3 http://dx.doi.org/10.1016/S0169-023X(02)00194-5 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke45.html#BaiV03 2003-11-27 Algorithms for Inferring Functional Dependencies from Relations. 83-99 1994 12 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke12.html#MannilaR94 2003-11-27 Discovering Concept Clusters by Decomposing Databases. 223-244 1994 12 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke12.html#ZhongO94 2003-11-27 A Hierarchical Model Learning Approach for Refining and Managing Concept Clusters Discovered from Databases. 227-252 1996 20 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke20.html#ZhongO96 http://dx.doi.org/10.1016/S0169-023X(96)00003-1 2003-11-27 Algebraic optimization of recursive queries. 299-325 1991 7 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke7.html#HoutsmaA91 2003-11-27 Set-Oriented Data Mining in relational Databases. 245-262 1995 17 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke17.html#HoutsmaS95 http://dx.doi.org/10.1016/0169-023X(95)00024-M 2003-11-27 An Extension of the General Entity Manipulator Language for Global View Definition. 305-326 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#ManninoK85 2003-11-27 Knowledge base refinement by backpropagation. 35-46 1991 7 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke7.html#Fu91 2003-11-27 Issues in Relational Database Performance (invited paper ISDBMS). 49-61 1988 3 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#Bell88 2003-11-27 An Agent-Based Model for Domain Knowledge Representation. 147-161 1999 29 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke29.html#BerC99 http://dx.doi.org/10.1016/S0169-023X(98)00041-X 2003-11-27 A framework for programming multiversion databases. 29-53 2001 36 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke36.html#GancarskiJ01 http://dx.doi.org/10.1016/S0169-023X(00)00033-1 2003-11-27 The use of metaphorical structures for internet sites. 161-180 2000 35 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#ThalheimD00 http://dx.doi.org/10.1016/S0169-023X(00)00037-9 2003-11-27 A new Fragmentation Scheme for Recursive Query Processing. 177-192 1994 13 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke13.html#ZhouZO94 2003-11-27 Generation of Natural Language from Information in a Frame Structure. 101-114 1989 4 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke4.html#Perkins89 2003-11-27 Merging Graph-Based and Rule-Based Computation: The Language G-Log. 267-300 1998 25 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke25.html#ParedaensPT98 http://dx.doi.org/10.1016/S0169-023X(97)00020-7 2003-11-27 Tuning Integrated Dissemination-Based Information Systems. 1-21 1999 30 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#CaiT99 2003-11-27 Multiversion views: Constructing views in a multiversion database. 277-306 2000 33 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke33.html#MedeirosBJ00 http://dx.doi.org/10.1016/S0169-023X(00)00004-5 2003-11-27 Using Background Knowledge in the Aggregation of Imprecise Evidence in Databases. 131-143 2000 32 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke32.html#McCleanSS00 http://dx.doi.org/10.1016/S0169-023X(99)00034-8 2003-11-27 English, Chinese and ER Diagrams. 5-16 1997 23 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke23.html#Chen97 http://dx.doi.org/10.1016/S0169-023X(97)00017-7 2003-11-27 Object-Oriented Database Schema Analysis and Inheritance Processing: A Graphtheoretic Approach. 157-181 1997 24 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#FormicaGM97 http://dx.doi.org/10.1016/S0169-023X(97)00018-9 2003-11-27 An Illustration of Verification and Validation in the Modelling Phase of KBS Development. 337-352 1998 27 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke27.html#VanthienenMA98 http://dx.doi.org/10.1016/S0169-023X(98)80003-7 2003-11-27 A customizable view for Web-based STEP data. 29-56 2002 43 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke43.html#KimNKK02 http://dx.doi.org/10.1016/S0169-023X(02)00101-5 2003-11-27 Clustering Techniques in Object Bases: A Survey. 255-275 1994 12 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke12.html#BertinoSI94 2003-11-27 Semantic Interpretation of a Database Query Language. 123-138 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#MuecksteinM85 2003-11-27 Guest editorial: Special issue NLDB '01. 247-249 2002 42 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke42.html#Moreno-CapuchinoR02 http://dx.doi.org/10.1016/S0169-023X(02)00047-2 2003-11-27 A Path Finding Method for Constraint Checking in Deductive Databases. 223-244 1989 4 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke4.html#DasW89 2005-09-16 Formulating Global Integrity Constraints During Derivation of Global Schema. 241-268 1995 16 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke16.html#ReddyPG95 http://dx.doi.org/10.1016/0169-023X(95)00018-N 2003-11-28 Restructuring decision tables for elucidation of knowledge. 271-290 2003 46 Data Knowl. Eng. 3 http://dx.doi.org/10.1016/S0169-023X(03)00020-X http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke46.html#HewettL03 2003-11-27 Natural Language Query Processing in a Temporal Database. 3-15 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#DePW85 2003-11-27 Database Lexicography. 293-314 2002 42 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke42.html#Coen02 http://dx.doi.org/10.1016/S0169-023X(02)00052-6 2003-11-27 Indexing support for spatial joins. 99-124 2000 34 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke34.html#Koudas00 http://dx.doi.org/10.1016/S0169-023X(00)00010-0 2003-11-27 A Relational Language with Deductions, Functions and Recursions. 139-154 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#Deen85 2003-11-27 PSQL: A Query Language for Probabilistic Relational Data. 107-120 1998 28 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke28.html#DeyS98 http://dx.doi.org/10.1016/S0169-023X(98)00015-9 2003-11-27 Safety, domain independence and generalized quantification. 147-172 2001 38 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke38.html#Badia01 http://dx.doi.org/10.1016/S0169-023X(01)00022-2 2003-11-28 MOVIE: An incremental maintenance system for materialized object views. 131-166 2003 47 Data Knowl. Eng. 2 http://dx.doi.org/10.1016/S0169-023X(03)00048-X http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke47.html#AliFP03 2003-11-27 The Operational Semantics of User-Defined Relationships in Object Oriented Database Systems. 223-240 1995 16 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke16.html#Diaz95 http://dx.doi.org/10.1016/0169-023X(95)00015-K 2003-11-27 Building intelligent Web applications using lightweight wrappers. 283-316 2001 36 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke36.html#SahuguetA01 http://dx.doi.org/10.1016/S0169-023X(00)00051-3 2003-11-27 Dependable Reactive Event-Oriented Planning. 27-49 1995 16 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke16.html#Dorn95 http://dx.doi.org/10.1016/0169-023X(95)00011-G 2003-11-27 Ramification Analysis Using Causal Mapping. 1-27 2000 32 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke32.html#Hunter00 http://dx.doi.org/10.1016/S0169-023X(99)00030-0 2003-11-27 Merging structured text using temporal knowledge. 29-66 2002 41 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke41.html#Hunter02 http://dx.doi.org/10.1016/S0169-023X(02)00019-8 2003-11-27 Thesaurus construction through knowledge representation. 25-45 2001 37 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke37.html#BechhoferG01 http://dx.doi.org/10.1016/S0169-023X(00)00052-5 2003-11-27 Principles of component-based design of intelligent agents. 1-27 2002 41 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke41.html#BrazierJT02 http://dx.doi.org/10.1016/S0169-023X(01)00058-1 2003-11-27 A Knowledge-Based Approach to Multiple Query Processing. 261-284 1989 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#ParkTL89 2003-11-27 Extracting ontological concepts for tendering conceptual structures. 71-89 2002 40 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke40.html#KayedC02 http://dx.doi.org/10.1016/S0169-023X(01)00046-5 2003-11-27 Inconsistency of Production Systems. 245-260 1989 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#BuningLS89 2003-11-27 SISYPHUS: The implementation of a chunk-based storage manager for OLAP data cubes. 155-180 2003 45 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke45.html#KarayannidisS03 2003-11-27 A component-based Petri net model for specifying and validating cooperative information systems. 143-187 2002 42 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke42.html#AoumeurS02 http://dx.doi.org/10.1016/S0169-023X(02)00025-3 2003-11-27 Deciding LTL over Mazurkiewicz traces. 219-238 2003 44 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#BolligL03 2003-11-27 Constructing interpretations of deductive databases using reduction and dynamic stratification. 173-197 2001 38 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke38.html#Johnson01 http://dx.doi.org/10.1016/S0169-023X(01)00023-4 2003-11-27 Handling Indefinite and Negative Data in a Deductive Database. 333-348 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#Johnson91 2003-11-27 On Computing Minimal and Perfect Model Membership. 225-276 1996 18 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke18.html#Johnson96 http://dx.doi.org/10.1016/0169-023X(96)00037-7 2003-11-27 Top-Down Query Processing in Indefinite Stratified Databases. 1-36 1998 26 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke26.html#Johnson98 http://dx.doi.org/10.1016/S0169-023X(97)00026-8 2003-11-27 On Cyclic Covers and Perfect Models. 25-65 1999 30 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#Johnson99 2003-11-27 MOSAIC: A fast multi-feature image retrieval system. 219-239 2000 33 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke33.html#GohT00 http://dx.doi.org/10.1016/S0169-023X(00)00002-1 2003-11-27 Concepts, attributes and arbitrary relations. 249-261 1992 8 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke8.html#Guarino92 2004-04-29 An Algorithm for Maintaining Working Memory Consistency in Multiple Rule Firing Systems. 181-198 2000 32 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke32.html#PerrajuP00 http://dx.doi.org/10.1016/S0169-023X(99)00038-5 2003-11-27 Losse Coupling of KAUS with Existing RDBMSs. 227-251 1990 5 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke5.html#YamauchiO90 2003-11-27 Expert Database Systems: Efficient Support for Engineering Environments. 71-85 1988 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#SellisRMF88 2003-11-27 DFL - a dialog based integration of concept and rule reasoners. 301-334 2001 38 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke38.html#BalabanE01 http://dx.doi.org/10.1016/S0169-023X(01)00032-5 2003-11-27 Data Security. 199-216 1998 25 Data Knowl. Eng. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke25.html#Bertino98 http://dx.doi.org/10.1016/S0169-023X(97)00049-9 2003-11-27 On the Design and Maintenance of Optimized Relational Representations of Entity-Relationship Schemas. 1-20 1993 11 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke11.html#CasanovaTL93 2003-11-27 Generalization-Based Data Mining in Object-Oriented Databases Using an Object Cube Model. 55-97 1998 25 Data Knowl. Eng. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke25.html#HanNKW98 http://dx.doi.org/10.1016/S0169-023X(97)00051-7 2003-11-27 Bounding the Computation Time of Forward-Chaining Rule-Based Systems. 317-334 1993 10 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke10.html#TomsovicL93 2003-11-27 Distributed Environment: A Conceptual Framework Using Objects. 191-202 1995 14 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke14.html#Ang95 http://dx.doi.org/10.1016/0169-023X(94)00029-E 2003-11-27 A Formal Approach to Object-Oriented Databases. 353-382 1990 5 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke5.html#Beeri90 2003-11-27 An Architecture for a Parallel Disjunctive Deductive Database System. 233-248 1998 28 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke28.html#Gryz98 http://dx.doi.org/10.1016/S0169-023X(98)00027-5 2003-11-27 Causality, time, and deadlines. 469-477 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#Durchholz91 2005-05-17 Query Evaluation in Deductive Databases: Bottom-Up and Top-Down Reconciled. 289-312 1990 5 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke5.html#Bry90 2005-04-12 The Use of the Typed Lambda Calculus for Guiding Naive Users in the Representation and Acquisition of Part-Whole Knowledge. 385-404 1996 20 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke20.html#Uschold96 http://dx.doi.org/10.1016/S0169-023X(96)00012-2 2003-11-27 Dependency Preserving Refinements and the Fundamental Problem of Database Design. 277-312 1998 24 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#MakowskyR98 http://dx.doi.org/10.1016/S0169-023X(97)00029-3 2003-11-27 Generalized Union and Project Operations for Pooling Uncertain and Imprecise Information. 89-117 1996 18 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke18.html#BellGL96 http://dx.doi.org/10.1016/0169-023X(95)00029-R 2003-11-27 Prefetch policies for large objects in a Web-enabled GIS application. 65-84 2001 37 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke37.html#ParkK01 http://dx.doi.org/10.1016/S0169-023X(01)00002-7 2003-11-27 The Freeze algorithms for concurrency control in secure real-time database systems. 101-125 2003 45 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke45.html#ParkP03 2003-11-27 A Pipelined Strategy for Processing Recursive Queries in Parallel. 367-391 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#BellSH91 2003-11-27 Heuristics and Multi-Dimensional Physical Database Design: An Experimental KBS. 183-206 1990 5 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke5.html#FuL90 2004-10-27 CoLan: A Functional Constraint Language and its Implementation. 203-249 1995 14 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke14.html#BassiliadesG95 http://dx.doi.org/10.1016/0169-023X(94)00028-D 2004-10-27 Processing Production Rules in DEVICE, and Active Knowledge Base System. 117-155 1997 24 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#BassiliadesV97 http://dx.doi.org/10.1016/S0169-023X(97)00006-2 2003-11-27 Precise Serialization for Optimistic Concurrency Control. 163-178 1999 29 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke29.html#Lee99 http://dx.doi.org/10.1016/S0169-023X(98)00033-0 2003-11-27 Supporting web query expansion efficiently using multi-granularity indexing and query processing. 239-257 2000 35 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#LiA00 http://dx.doi.org/10.1016/S0169-023X(00)00024-0 2003-11-27 SEMINT: A tool for identifying attribute correspondences in heterogeneous databases using neural networks. 49-84 2000 33 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke33.html#LiC00 http://dx.doi.org/10.1016/S0169-023X(99)00044-0 2003-11-27 A Framework for Object Migration in Object-Oriented Databases. 221-242 1994 13 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke13.html#LiD94 2003-11-27 A Recursive Object Algebra Based on Aggregation Abstraction for Manipulating Complex Object. 21-60 1993 11 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke11.html#Liu93 2003-11-27 Temporal representation and reasoning. 139-141 2003 44 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#BettiniM03 2003-11-27 Implicit versus Explicit Characterization of Complex Entities and Events. 115-134 1999 31 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke31.html#Pazzi99 http://dx.doi.org/10.1016/S0169-023X(99)00020-8 2003-11-27 The Category Concept: An Extension to the Entity-Relationship Model. 75-116 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#ElmasriWH85 2003-11-28 Dipe-R: a knowledge representation language. 257-290 2003 45 Data Knowl. Eng. 3 http://dx.doi.org/10.1016/S0169-023X(02)00190-8 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke45.html#Pol03 2003-11-27 Query Optimization for Broadcast Database. 351-380 1999 29 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke29.html#SiL99 http://dx.doi.org/10.1016/S0169-023X(98)00040-8 2003-11-27 Conditional Deontic Logic Augmented with Defeasible Reasoning. 73-91 1995 16 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke16.html#Ryu95 http://dx.doi.org/10.1016/0169-023X(95)00008-G 2003-11-27 Specification of Contractual Obligations in Formal Business Communication. 309-326 1998 26 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke26.html#Ryu98 http://dx.doi.org/10.1016/S0169-023X(97)00048-7 2006-05-08 A Fuzzy Expert Database System. 287-304 1989 4 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke4.html#LeungWL89 2003-11-27 Introductory notes to the special issue on Advances in online analytical processing. 127-129 2003 45 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke45.html#Hammer03 2003-11-27 A New Approach to Modeling Personal Office Documents. 127-158 1995 17 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke17.html#MhlangaZWN95 http://dx.doi.org/10.1016/0169-023X(95)00019-O 2003-11-27 An Analysis of Selective Tuning Schemes for Nonuniform Broadcast. 319-344 1997 22 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke22.html#XuT97 http://dx.doi.org/10.1016/S0169-023X(96)00048-1 2003-11-27 Temporally oriented data definitons: Managing schema evolution in temporally oriented databases. 451-467 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#Ariav91 2003-11-27 A spatial model for complex objects with a broad boundary supporting queries on uncertain data. 285-305 2001 37 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke37.html#ClementiniF01 http://dx.doi.org/10.1016/S0169-023X(01)00010-6 2003-11-27 The metaknowledge-based intelligent routing system (MIRS). 189-217 2000 34 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke34.html#GiladiGMEE00 http://dx.doi.org/10.1016/S0169-023X(00)00015-X 2003-11-27 A network surveillance protocol for distributed database systems. 409-420 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#KimH91 2003-11-27 FORM: A Flexible Data Model for Integrated CASE Environments. 133-158 1997 22 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke22.html#KimP97 http://dx.doi.org/10.1016/S0169-023X(96)00042-0 2003-11-27 A Dynamic Accessibility Protocol for Replicated databases. 319-332 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#AbbadiD91 2003-11-27 Modeling Spatio-Temporal Constraints for Multimedia Objects. 217-238 1999 30 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#KwonFB99 http://dx.doi.org/10.1016/S0169-023X(99)00012-9 2003-11-27 A Fast Projection Algorithm for Sequence Data Searching. 321-339 1998 28 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke28.html#LamW98 http://dx.doi.org/10.1016/S0169-023X(98)00023-8 2003-11-27 Evaluations of architectural designs and implementation for database-driven web sites. 151-177 2002 43 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke43.html#LiHPCA02 http://dx.doi.org/10.1016/S0169-023X(02)00054-X 2003-11-27 CPI: Constraints-Preserving Inlining algorithm for mapping XML DTD to relational schema. 3-25 2001 39 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke39.html#LeeC01 http://dx.doi.org/10.1016/S0169-023X(01)00028-3 2003-12-01 SPY-TEC: An efficient indexing method for similarity search in high-dimensional data spaces. 77-97 2000 34 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke34.html#LeeK00 http://dx.doi.org/10.1016/S0169-023X(00)00009-4 2003-11-27 A Multistrategy Approach to Classification Learning in Databases. 67-93 1999 30 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#LeeS99 2003-11-27 Temporal Grid File: A File Structure for Interval Data. 71-97 1998 26 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke26.html#LeeT98 http://dx.doi.org/10.1016/S0169-023X(97)00027-X 2003-11-27 Faster Joins, Self-Joins and Multi-Way Joins Using Join Indices. 277-298 1998 28 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke28.html#LeiR98 http://dx.doi.org/10.1016/S0169-023X(98)00025-1 2003-11-27 Faster Joins, Self-Joins and Multi-Way Joins Using Join Indices. 179-200 1999 29 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke29.html#LeiR99 http://dx.doi.org/10.1016/S0169-023X(98)00031-7 2003-11-27 Active data warehouses: complementing OLAP with analysis rules. 241-269 2001 39 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke39.html#ThalhammerSM01 http://dx.doi.org/10.1016/S0169-023X(01)00042-8 2003-11-27 Conceptual modeling for data and knowledge management. 137-168 2000 33 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke33.html#MineauMG00 http://dx.doi.org/10.1016/S0169-023X(99)00049-X 2003-11-27 An Analysis of Multivalued and Join Dependencies Based on the Entity-Relationship Approach. 253-271 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#Ling85 2003-11-27 Integrity Constraint Checking in Deductive Databases Using the Prolog Not-Predicate. 145-168 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#Ling87 2003-11-27 A Query Generalizer for Providing Cooperative Responses in an Office Document System. 177-205 1998 27 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke27.html#LiuN98 http://dx.doi.org/10.1016/S0169-023X(97)00041-4 2003-11-28 Querying relational databases through XSLT. 103-128 2004 48 Data Knowl. Eng. 1 http://dx.doi.org/10.1016/S0169-023X(03)00121-6 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke48.html#LiuV04 2004-12-29 Workflow mining: A survey of issues and approaches. 237-267 2003 47 Data Knowl. Eng. 2 http://dx.doi.org/10.1016/S0169-023X(03)00066-1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke47.html#AalstDHMSW03 2003-11-27 Verification of Conceptual Models Based on Linguistic Knowledge. 147-163 1997 21 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#VosGR97 http://dx.doi.org/10.1016/S0169-023X(96)00030-4 2003-11-27 An experimental study of semantics-based concurrency control protocols. 53-81 2000 35 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#MakW00 http://dx.doi.org/10.1016/S0169-023X(00)00022-7 2003-11-27 An object-oriented data model formalised through hypergraphs. 205-234 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#LeveneP91 2003-11-27 Monitoring Temporal Preconditions in a Behaviour Oriented Object Model. 143-186 1994 14 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke14.html#SchwiderskiHS94 2003-11-27 Network caching strategies for reservation-based multimedia services on high-speed networks. 85-103 2002 41 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke41.html#VeeravalliY02 http://dx.doi.org/10.1016/S0169-023X(02)00022-8 2003-11-27 Inheritance Hierarchy Design in Object-Oriented Databases. 191-216 1999 30 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#BeeriFM99 http://dx.doi.org/10.1016/S0169-023X(99)00011-7 2003-11-27 Drafting ER and OO Schemas in Prototype Environments. 201-240 1996 19 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke19.html#MeyerWG96 http://dx.doi.org/10.1016/0169-023X(95)00046-U 2003-11-27 A visual data model. 227-238 1991 7 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke7.html#Orman91 2003-11-27 Automated Prototyping and Data Translation. 167-177 1990 5 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke5.html#Luqi90 2003-11-27 A New Dynamic Access Control Scheme Based on Subject-Object List. 45-56 1994 14 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke14.html#HwangY94 2003-11-27 Multilevel Secure Database Encryption with Subkeys. 117-131 1997 22 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke22.html#HwangY97 http://dx.doi.org/10.1016/S0169-023X(96)00040-7 2003-11-28 Adaptive cell-based index for moving objects. 75-101 2004 48 Data Knowl. Eng. 1 http://dx.doi.org/10.1016/S0169-023X(03)00120-4 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke48.html#ChoiML04 2003-11-27 Using NNF to Transform Conceptual Data Models to Object-Oriented Database Designs. 313-336 1998 24 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#MokE98 http://dx.doi.org/10.1016/S0169-023X(97)82108-8 2003-11-27 Web data retrieval and extraction. 347-367 2003 44 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#Lacroix03 2003-11-27 Subtyping and Polymorphism in Object-Role Modelling. 251-281 1995 15 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke15.html#HalpinP95 http://dx.doi.org/10.1016/0169-023X(95)00005-D 2003-11-27 Decomposing relationship types by pivoting and schema equivalence. 75-99 2001 39 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke39.html#Hartmann01 http://dx.doi.org/10.1016/S0169-023X(01)00031-3 2003-11-27 Query processing in DOQL: A deductive database language for the ODMG model. 1-38 2000 35 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#SampaioP00 http://dx.doi.org/10.1016/S0169-023X(00)00020-3 2003-11-27 Linking linguistic and non-linguistic information. 205-222 1992 8 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke8.html#Gerstl92 2003-11-27 Easy definition of new facets in the frame-based language Objlog+. 223-263 2001 38 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke38.html#Faucher01 http://dx.doi.org/10.1016/S0169-023X(01)00025-8 2003-11-27 A Methodology and Tool Environment for Process Analysis and Reengineering. 253-278 1999 31 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke31.html#CastanoAM99 http://dx.doi.org/10.1016/S0169-023X(99)00028-2 2003-11-27 Deriving Optimized Integrity Monitoring Triggers from Dynamic Integrity Constraints. 163-193 1996 20 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke20.html#GertzL96 http://dx.doi.org/10.1016/S0169-023X(96)00010-9 2003-11-27 Analysis, Comparison and Design of Role-Based Security Specifications. 31-55 1996 21 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#CastanoMS96 http://dx.doi.org/10.1016/S0169-023X(96)00025-0 2003-11-27 Dynamic Construction of Signature Files Based on Frame Sliced Approach. 101-120 1999 30 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#ImKYC99 http://dx.doi.org/10.1016/S0169-023X(99)00006-3 2003-11-27 A Basic Calculus for Verifying Properties of Interacting Objects. 119-145 1996 18 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke18.html#Conrad96 http://dx.doi.org/10.1016/0169-023X(95)00039-U 2003-11-27 Semantic Verb Classes and Lexical Conceptual Structures for Enhancing the Conceptual Modelling and the Access to Databases. 197-211 1997 21 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#Saint-Dizier97 http://dx.doi.org/10.1016/S0169-023X(96)00034-1 2003-11-27 Semantic Serializability: A Correctness Criterion for Processing Transactions in Advanced. 1-24 1999 30 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#BraynerHR99 http://dx.doi.org/10.1016/S0169-023X(99)00004-X 2003-11-28 IMDAS - An Integrated Manufacturing Data Administration System. 109-131 1988 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#KrishnamurthySLMB88 2003-11-27 The Linguistic Level: Contribution for Conceptual Design, View Integration, Reuse and Documentation. 111-129 1997 21 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#AmbrosioMM97 http://dx.doi.org/10.1016/S0169-023X(96)00028-6 2003-11-27 <i>n</i>-Ary Relationship Cardinality Constraints. 255-288 1998 27 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke27.html#McAllister98 http://dx.doi.org/10.1016/S0169-023X(98)00007-X 2003-11-27 Modeling Application Domains. 261-281 1997 22 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke22.html#KetabchiJ97 http://dx.doi.org/10.1016/S0169-023X(96)00056-0 2003-11-27 A Knowledge-Based Approach to Relational Database Design. 173-180 1988 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#ObretenovAMDK88 2003-11-27 Modelling of set Membership: The Notion and the Issues. 147-185 1995 16 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke16.html#Motschnig-PitrikS95 http://dx.doi.org/10.1016/0169-023X(95)00014-J 2003-11-27 ADDS: A System for Automatic Database Schema Design Based on the Binary-Relationship Model. 123-144 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#ShovalE87 2003-11-27 Database Reverse Engineering: From the Relational to the Binary Relationship model. 293-315 1993 10 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke10.html#ShovalS93 2003-11-27 Entity-Relationship and Object-Oriented Data Modeling-an Experimental Comparison of Design Quality. 297-315 1997 21 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#ShovalS97 http://dx.doi.org/10.1016/S0169-023X(97)88935-5 2003-11-27 Binary-Relationship Integration Methodology. 225-250 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#ShovalZ91 2003-11-27 Dominoes as a Domain where to use Proverbs as Heuristics. 129-137 1990 5 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke5.html#BorrajoRPP90 2003-11-27 Automated code generation of dynamic specializations: an approach based on design patterns and formal techniques. 315-353 2002 40 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke40.html#PelechanoPI02 http://dx.doi.org/10.1016/S0169-023X(02)00020-4 2003-11-27 Maintaining Replicated Authorizations in Distributed Database Systems. 55-84 1996 18 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke18.html#SamaratiAJ96 http://dx.doi.org/10.1016/0169-023X(95)00000-I 2003-11-27 Converting XML DTDs to UML diagrams for conceptual data integration. 323-346 2003 44 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#JensenMP03 2003-11-27 Modal Change Logic (MCL): Specifying the Reasoning of Knowledge-Based Systems. 243-269 1998 26 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke26.html#FenselGL98 http://dx.doi.org/10.1016/S0169-023X(98)00047-0 2003-11-27 Coordinating Distributed Organizational Knowledge. 247-268 1997 23 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke23.html#JarkeJPP97 http://dx.doi.org/10.1016/S0169-023X(97)00014-1 2003-11-27 Workshop on Comparing Description and Frame Logics. 347-352 1998 25 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke25.html#FenselRD98 http://dx.doi.org/10.1016/S0169-023X(97)00039-6 2003-11-27 A Shortest Path Algorithm to Find Minimal Deduction Graphs. 27-46 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#HorngY91 2003-11-27 STIRDAT: A system tightly integrating relational databases and a theorem prover. 1-20 2000 34 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke34.html#RaoR00 http://dx.doi.org/10.1016/S0169-023X(00)00005-7 2003-11-27 A formal basis for an abbreviated concept-based query language. 109-151 2001 36 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke36.html#OweiN01 http://dx.doi.org/10.1016/S0169-023X(00)00042-2 2003-11-27 The knowledge base partitioning problem: Mathematical formulation and heuristic clustering. 329-337 1992 8 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke8.html#RazB92 2003-11-27 Reducing the search space for conceptual schema transformation. 269-292 1992 8 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke8.html#BommelW92 2003-11-28 A formal model for temporal schema versioning in object-oriented databases. 123-167 2003 46 Data Knowl. Eng. 2 http://dx.doi.org/10.1016/S0169-023X(02)00207-0 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke46.html#GrandiM03 2003-11-27 Clustering Factor Estimation for Totally Clustered Attributes. 251-264 1995 14 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke14.html#GrandiS95 http://dx.doi.org/10.1016/0169-023X(94)00026-B 2003-11-27 On the quest for easy-to-understand splitting rules. 31-48 2003 44 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#GalianoCCM03 2003-11-27 Notes on a classification for DKE. 133-139 2002 41 Data Knowl. Eng. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke41.html#Riet02 http://dx.doi.org/10.1016/S0169-023X(02)00037-X 2003-11-27 MOKUM: An Object-Oriented Active Knowledge Base System. 21-42 1989 4 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke4.html#Riet89 2003-11-27 Introduction to the Special Issue on Deductive and Object-Oriented Databases. 255-261 1990 5 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke5.html#Riet90 2003-11-27 Complex Objects: Theory and Practice from a Data- and Knowledge Engineering Perspective, as Seen in and from Yellostone Park. 217-238 1998 25 Data Knowl. Eng. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke25.html#Riet98 http://dx.doi.org/10.1016/S0169-023X(97)86224-6 2003-11-27 Generating Belief Functions from Qualitative Preferences: An Approach to Eliciting Expert Judgments and Deriving Probability Functions. 145-159 1998 28 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke28.html#NgwenyamaB98 http://dx.doi.org/10.1016/S0169-023X(98)00008-1 2003-11-27 Explaining Incompatibilities in Data Dictionary Design through Abduction. 101-139 1994 13 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke13.html#PirriP94 2003-11-27 Extending ERD modeling notation to fuzzy management of GIS data files. 163-179 2002 40 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke40.html#VertSM02 http://dx.doi.org/10.1016/S0169-023X(01)00049-0 2003-11-27 Snoop: An Expressive Event Specification Language for Active Databases. 1-26 1994 14 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke14.html#ChakravarthyM94 2003-11-27 Efficient Evaluation of a Class of Ordered Logic Programs. 185-214 1997 23 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke23.html#LeonePR97 http://dx.doi.org/10.1016/S0169-023X(96)00050-X 2003-11-27 Time sequence ordering extensions to the Entity-Relationship model and their application to the automated manufacturing process. 421-443 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#MoyneTM91 2003-11-27 Processing and Transaction Concepts for Cooperation of Engineering Workstations and a Database Server. 87-107 1988 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#HarderHMM88 2003-11-27 Reasoning About ER Models in a Deductive Environment. 241-266 1996 19 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke19.html#Neumann96 http://dx.doi.org/10.1016/0169-023X(95)00047-V 2003-11-28 Freshness-driven adaptive caching for dynamic content Web sites. 269-296 2003 47 Data Knowl. Eng. 2 http://dx.doi.org/10.1016/S0169-023X(03)00093-4 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke47.html#LiPHCA03 2003-11-27 Enterprise Modeling for Database Specification and Design. 31-58 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#SenK87 2003-11-27 Management of Regression-Model Data. 349-363 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#Rowe91 2003-11-28 Multiple zooming in geographic maps. 207-236 2003 47 Data Knowl. Eng. 2 http://dx.doi.org/10.1016/S0169-023X(03)00060-0 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke47.html#FrigioniT03 2003-11-27 Toward Higher-Level Abstractions for Software Systems. 119-128 1990 5 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke5.html#Shaw90 2003-11-27 On Selective Tuning in Unreliable Wireless Channels. 209-231 1998 28 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke28.html#TanO98 http://dx.doi.org/10.1016/S0169-023X(98)00018-4 2003-11-27 A Dynamic Scheduler for the Infinite Air-Cache. 97-112 1997 24 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#TanY97 http://dx.doi.org/10.1016/S0169-023X(97)00003-7 2003-11-27 Linguistically based requirements engineering - The NIBA-project. 111-120 2000 35 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#FliedlKMMW00 http://dx.doi.org/10.1016/S0169-023X(00)00029-X 2003-11-27 Knowledge Engineering: Principles and Methods. 161-197 1998 25 Data Knowl. Eng. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke25.html#StuderBF98 http://dx.doi.org/10.1016/S0169-023X(97)00056-6 2003-11-27 Security in Cyberspace: A Knowledge-Base Approach. 69-96 1997 24 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#RietJG97 http://dx.doi.org/10.1016/S0169-023X(97)00002-5 2003-11-27 View integration of behavior in object-oriented databases. 153-183 2001 36 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke36.html#PreunerCS01 http://dx.doi.org/10.1016/S0169-023X(00)00043-4 2003-11-28 Techniques for the evaluation of XML queries: a survey. 225-246 2003 46 Data Knowl. Eng. 2 http://dx.doi.org/10.1016/S0169-023X(02)00211-2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke46.html#ChungK03 2003-11-27 Integration of object-oriented programming languages and database systems in KOPERNIK. 271-298 1991 7 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke7.html#CzejdoT91 2003-11-28 Consistency preserving updates in deductive databases. 61-103 2003 47 Data Knowl. Eng. 1 http://dx.doi.org/10.1016/S0169-023X(03)00061-2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke47.html#MayolT03 2003-11-27 Functional Requirements for Historical and Interval Extensions to the Relational Model. 59-86 1995 17 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke17.html#LorentzosM95 http://dx.doi.org/10.1016/0169-023X(95)00026-O 2003-11-27 Modeling Collaborative Behavior Using Cooperation Contracts. 191-224 1998 26 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke26.html#SchreflKL98 http://dx.doi.org/10.1016/S0169-023X(97)00037-2 2003-11-27 Specification of Information Systems Operations in INFOMOD. 177-190 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#JardineG87a 2003-12-02 Formalization of Communication and Behaviour in Object-Oriented Analysis. 147-183 1997 23 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke23.html#HubbersH97 http://dx.doi.org/10.1016/S0169-023X(96)00039-0 2004-03-23 Automating extraction of logical domains in a web site. 179-205 2002 43 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke43.html#AyanLK02 http://dx.doi.org/10.1016/S0169-023X(02)00055-1 2003-11-28 Self-maintaining web pages: from theory to practice. 39-73 2004 48 Data Knowl. Eng. 1 http://dx.doi.org/10.1016/S0169-023X(03)00109-5 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke48.html#BernauerS04 2003-11-27 On multi-scale display of geometric objects. 91-119 2002 40 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke40.html#ChanC02 http://dx.doi.org/10.1016/S0169-023X(01)00051-9 2003-11-27 Design and Implementation of the E-Referencer. 199-218 2000 32 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke32.html#PooTK00 http://dx.doi.org/10.1016/S0169-023X(99)00032-4 2005-11-02 A General Treatment of Dynamic Integrity Constraints. 223-246 2000 32 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke32.html#Brock00 http://dx.doi.org/10.1016/S0169-023X(99)00041-5 2003-11-27 Editorial introduction. 125-132 2002 41 Data Knowl. Eng. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke41.html#ChenR02 http://dx.doi.org/10.1016/S0169-023X(02)00036-8 2003-11-27 Introduction to the Special Issue Celebrating the 25th Volume of Data & Knowledge Engineering: DKE. 1-9 1998 25 Data Knowl. Eng. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke25.html#ChenR98 http://dx.doi.org/10.1016/S0169-023X(97)00059-1 2003-11-27 Manipulation of Exclusive Disjunctive Data in Relational Databases. 39-65 1997 22 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke22.html#ChiuC97 http://dx.doi.org/10.1016/S0169-023X(96)00043-2 2003-11-27 Nonlinear pattern hypothesis generation for data mining. 273-283 2002 40 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke40.html#Wang02 http://dx.doi.org/10.1016/S0169-023X(01)00059-3 2003-11-27 Computing appropriate representations for multidimensional data. 181-203 2003 45 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke45.html#ChoongLM03 2003-11-27 Exploiting syntactic analysis of queries for information retrieval. 315-325 2002 42 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke42.html#MittendorferW02 http://dx.doi.org/10.1016/S0169-023X(02)00049-6 2003-11-28 Normalising OLAP cubes for controlling sparsity. 317-343 2003 46 Data Knowl. Eng. 3 http://dx.doi.org/10.1016/S0169-023X(03)00035-1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke46.html#NiemiNT03 2003-11-27 Enhanced Tree Quorum Algorithm for Replica Control in Distributed Database Systems. 63-81 1994 12 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke12.html#Chung94 2003-11-27 CONTEXT: A CONstrainT EXplanation Tool. 153-183 1992 8 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke8.html#UrbanD92 2003-11-27 A Logic-Based Information Modelling Language. 59-81 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#JardineG87 2006-09-07 Hyper-Semantic Data Modeling. 69-90 1989 4 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke4.html#PotterTE89 2003-11-27 Relixpert - An Expert System Shell Written in a Database Programming Language. 151-158 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#Merrett91 2003-11-27 Protection and administration of XML data sources. 237-260 2002 43 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke43.html#BertinoCFM02 http://dx.doi.org/10.1016/S0169-023X(02)00127-1 2003-11-27 AutoWF - A secure Web workflow system using autonomous objects. 1-27 2002 43 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke43.html#GudesT02 http://dx.doi.org/10.1016/S0169-023X(02)00058-7 2003-11-27 Deriving Semantic Information through Property Covering and Inheritance. 3-30 1998 28 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke28.html#AnalytiSC98 http://dx.doi.org/10.1016/S0169-023X(98)00011-1 2003-11-27 On Interpreting and Inferring Propositional Formulas of Data Dependencies in a Relational Database. 323-338 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#Yang87 2003-11-27 F_MP: A Fuzzy Match Framework for Rule-Based Programming. 183-203 1997 24 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#Yang97 http://dx.doi.org/10.1016/S0169-023X(97)00005-0 2003-11-27 19th International Conference on Conceptual Modeling (ER2000). 1-2 2001 39 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke39.html#LaenderS01 http://dx.doi.org/10.1016/S0169-023X(01)00027-1 2003-11-27 Semi-Automatic Techniques for Deriving Interscheme Properties from Database Schemes. 239-273 1999 30 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#PalopoliSU99 http://dx.doi.org/10.1016/S0169-023X(99)00013-0 2003-11-27 On query optimization in a temporal SPC algebra. 165-192 2003 44 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#WijsenB03 2003-11-27 Designing Data Warehouses. 279-301 1999 31 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke31.html#TheodoratosS99 http://dx.doi.org/10.1016/S0169-023X(99)00029-4 2003-11-27 Processing OLAP queries in hierarchically clustered databases. 205-224 2003 45 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke45.html#TheodoratosT03 2003-11-27 A General Formal Framework for Schema Transformation. 47-71 1998 28 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke28.html#PoulovassilisM98 http://dx.doi.org/10.1016/S0169-023X(98)00013-5 2003-11-27 Semantic Integration of Conceptual Schemas. 183-195 1997 21 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#Mirbel97 http://dx.doi.org/10.1016/S0169-023X(97)80001-D 2003-11-27 Conversational natural language understanding interfacing city event information. 343-360 2002 42 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke42.html#MastRSHDPVS02 http://dx.doi.org/10.1016/S0169-023X(02)00050-2 2003-11-27 The Impact of Linguistics on Conceptual Models: Consistency and Understandability. 131-146 1997 21 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#BurgR97 http://dx.doi.org/10.1016/S0169-023X(96)00029-8 2003-11-27 Different Roles and Mutual Dependencies of Data, Information, and Knowledge - An AI Perspective on their Integration. 191-222 1995 16 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke16.html#AamodtN95 http://dx.doi.org/10.1016/0169-023X(95)00017-M 2003-11-27 View selection using randomized search. 89-111 2002 42 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke42.html#KalnisMP02 http://dx.doi.org/10.1016/S0169-023X(02)00045-9 2003-11-27 Consistent policy enforcement in distributed systems using mobile policies. 261-280 2002 43 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke43.html#ChapinFJF02 http://dx.doi.org/10.1016/S0169-023X(02)00128-3 2003-11-27 EDM: A General Framework for Data Mining Based on Evidence Theory. 189-223 1996 18 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke18.html#AnandBH96 http://dx.doi.org/10.1016/0169-023X(95)00038-T 2003-11-27 A rule language compiler for SQL database servers. 89-113 1991 7 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke7.html#KiernanM91 2004-08-26 A Logic-Based Knowledge Source System for Natural Language Document. 201-231 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#SkuceMTOS85 2003-11-27 Integrity Maintenance in a Heterogeneous Engineering Database Environment. 347-363 1997 21 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#YooC97 http://dx.doi.org/10.1016/S0169-023X(96)00026-2 2003-11-27 A Survey of Database Design Transformations Based on the Entity-Relationship Model. 213-250 1995 15 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke15.html#FahrnerV95 http://dx.doi.org/10.1016/0169-023X(95)00006-E 2003-11-27 Semantic integration of heterogeneous information sources. 215-249 2001 36 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke36.html#BergamaschiCVB01 http://dx.doi.org/10.1016/S0169-023X(00)00047-1 2003-11-27 Steps towards a method for the formal modeling of dynamic objects. 509-540 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#Wieringa91 2003-11-27 Adaptive natural language interfaces to FAQ knowledge bases. 181-199 2000 35 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#Winiwarter00 http://dx.doi.org/10.1016/S0169-023X(00)00032-X 2003-11-27 Towards a Temporal Coherence Management in Real-Time Knowledge-Based Systems. 247-266 1998 25 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke25.html#BottiBC98 http://dx.doi.org/10.1016/S0169-023X(97)00025-6 2003-11-27 Efficient mining of traversal patterns. 191-214 2001 39 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke39.html#XiaoD01 http://dx.doi.org/10.1016/S0169-023X(01)00039-8 2003-11-27 Join and multi-join processing in data integration systems. 217-239 2002 40 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke40.html#TanEOZ02 http://dx.doi.org/10.1016/S0169-023X(01)00055-6 2003-11-27 Updating Intensional Predicates in Deductive Databases. 37-70 1998 26 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke26.html#LaurentLS98 http://dx.doi.org/10.1016/S0169-023X(97)00028-1 2003-11-27 Equality Testing for Complex Objects Based on Hashing. 101-111 1993 10 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke10.html#TurauD93 2003-11-27 Toward Principles for the Representation of Hierarchical Knowledge in Formal Ontologies. 99-113 1999 31 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke31.html#JonesP99 http://dx.doi.org/10.1016/S0169-023X(99)00022-1 2003-11-27 A Language for Simple Interactive Retrieval from a Database System. 303-321 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#JonesS87 2003-11-27 Analysis of Binary/Ternary Cardinality Combinations in Entity-Relationship Modeling. 39-64 1996 19 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke19.html#JonesS96 http://dx.doi.org/10.1016/0169-023X(95)00036-R 2003-11-27 A New Method for Integrity Constraint Checking in Deductive Database. 63-102 1995 15 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke15.html#Seljee95 http://dx.doi.org/10.1016/0169-023X(94)00032-A 2003-11-28 Methodologies, tools and languages for building ontologies: Where is their meeting point? 41-64 2003 46 Data Knowl. Eng. 1 http://dx.doi.org/10.1016/S0169-023X(02)00195-7 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke46.html#CorchoFG03 2003-11-27 Evaluating aggregates in possibilistic relational databases. 239-267 1991 7 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke7.html#RundensteinerB91 2003-11-27 Heterogeneous information resources need semantic access. 211-213 2001 36 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke36.html#FenselBRW01 http://dx.doi.org/10.1016/S0169-023X(00)00046-X 2003-11-27 Design and Implementation of Chimera Active Rule Language. 39-67 1997 24 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#GuerriniM97 http://dx.doi.org/10.1016/S0169-023X(97)00016-5 2003-11-27 Design and Implementation of Derivation Rules in Information Systems. 225-241 1998 26 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke26.html#Winter98 http://dx.doi.org/10.1016/S0169-023X(97)00044-X 2003-11-27 Towards Concept-Oriented Databases. 23-55 1999 30 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#DubitzkyBHB99 http://dx.doi.org/10.1016/S0169-023X(99)00005-1 2003-11-28 Negoisst: a negotiation support system for electronic business-to-business negotiations in e-commerce. 371-401 2003 47 Data Knowl. Eng. 3 http://dx.doi.org/10.1016/S0169-023X(03)00065-X http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke47.html#SchoopJL03 2003-11-27 Information Retrieval Based on Fuzzy Reasoning. 29-44 1993 10 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke10.html#GuardalbenL93 2003-11-27 Towards a configurable security architecture. 121-145 2001 38 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke38.html#Olivier01 http://dx.doi.org/10.1016/S0169-023X(01)00019-2 2003-11-27 Data Abstractions: Why and How? 293-311 1999 29 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke29.html#GoldsteinS99 http://dx.doi.org/10.1016/S0169-023X(98)00043-3 2003-11-27 Graph Rewriting Systems for the Entity-Relationship Approach. 215-243 1995 17 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke17.html#BreitenederM95 http://dx.doi.org/10.1016/0169-023X(95)00028-Q 2003-11-27 Relational decomposition through partial functional dependencies. 207-234 2002 43 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke43.html#BerzalCCM02 http://dx.doi.org/10.1016/S0169-023X(02)00056-3 2003-11-27 Mining multiple-level spatial association rules for objects with a broad boundary. 251-270 2000 34 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke34.html#ClementiniFK00 http://dx.doi.org/10.1016/S0169-023X(00)00017-3 2003-11-27 Timetabling through a Deductive Database: A Case Study. 1-27 1988 3 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#Monfroglio88 2005-03-18 TBAR: An efficient method for association rule mining in relational databases. 47-64 2001 37 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke37.html#BerzalCMS01 http://dx.doi.org/10.1016/S0169-023X(00)00055-0 2003-11-27 NLDB'99: Applications of natural language to information systems. 107-109 2000 35 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#MetaisM00 http://dx.doi.org/10.1016/S0169-023X(00)00036-7 2005-01-04 On the Selection of Secondary Indices in Relational Databases. 207- 1993 11 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke11.html#ChoenniBC93 2003-11-27 Time-Dependent Concepts: Representation and Reasoning Using Temporal Description Logics. 1-38 1997 22 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke22.html#Bettini97 http://dx.doi.org/10.1016/S0169-023X(96)00036-5 2003-11-27 On the completeness of visual operations for a semantic data model. 19-44 1992 9 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke9.html#MiuraM92 2003-11-27 Resilient Data Management for Replicated Mobile Database Systems. 43-55 1999 29 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke29.html#ByunM99 http://dx.doi.org/10.1016/S0169-023X(98)00028-7 2003-11-27 A Logic Programming Perspective on Decision Table Theory and Practice. 191-212 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#ReillySY87 2003-11-27 A Generic Model for 3-Dimensional Conceptual Modelling. 119-161 1996 20 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke20.html#CreasyP96 http://dx.doi.org/10.1016/0169-023X(95)00043-R 2003-11-27 Workflow Evolution. 211-238 1998 24 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#CasatiCPP98 http://dx.doi.org/10.1016/S0169-023X(97)00033-5 2003-11-27 Wavelet transformation-based management of integrated summary data for distributed query processing. 293-312 2001 39 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke39.html#JoeWK01 http://dx.doi.org/10.1016/S0169-023X(01)00044-1 2003-11-27 Dynamic Hierarchical Control for Distributed Problem Solving. 285-301 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#FindlerG87 2003-11-27 Landscaping the information space of large multi-database networks. 251-281 2001 36 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke36.html#PapazoglouPY01 http://dx.doi.org/10.1016/S0169-023X(00)00050-1 2003-11-27 Minimal model generation for refined answering of generalized queries in disjunctive deductive databases. 219-249 2000 34 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke34.html#Yahya00 http://dx.doi.org/10.1016/S0169-023X(00)00016-1 2003-11-27 An integrated object-role oriented database model. 113-141 2002 42 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke42.html#CoulondreL02 http://dx.doi.org/10.1016/S0169-023X(02)00059-9 2003-11-28 A framework for abstracting data sources having heterogeneous representation formats. 1-38 2004 48 Data Knowl. Eng. 1 http://dx.doi.org/10.1016/S0169-023X(03)00092-2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke48.html#RosaciTU04 2003-11-27 Graphical Query Formulation for an Entity-Relationship Model. 89-121 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#CampbellEC87 2003-11-27 Conceptual Schemas with Abstractions: Making Flat Conceptual Schemas More Comprehensible. 39-85 1996 20 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke20.html#CampbellHP96 http://dx.doi.org/10.1016/0169-023X(96)00005-5 2003-11-27 Natural Language for Data Bases - Preface to the Special Issue. 109-110 1997 21 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#Bouzeghoub97 http://dx.doi.org/10.1016/S0169-023X(96)00027-4 2003-11-27 Efficient Data Retrieval and Manipulation Using Boolean Entity Lattice. 211-226 1996 20 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke20.html#YangC96 http://dx.doi.org/10.1016/S0169-023X(96)00006-7 2003-11-27 Parallel Algorithms for Solving the Satisfaction Problem of Functional and Multivalued Data Dependencies. 323-338 1989 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#YangS89 2003-11-27 Towards a Semantic Image Database System. 207-227 1997 22 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke22.html#YangW97 http://dx.doi.org/10.1016/S0169-023X(96)00053-5 2003-11-27 A foundation for vacuuming temporal databases. 1-29 2003 44 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#SkytJM03 2003-11-27 Geometric Query Types for Data Retrieval in Relational Databases. 207-229 1998 27 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke27.html#SourinaB98 http://dx.doi.org/10.1016/S0169-023X(97)00061-X 2003-11-27 ACT-P: A Configurable Theorem-Power. 277-296 1994 12 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke12.html#HatzilygeroudisR94 2003-11-27 Handling Inheritance in a System Integrating Logic in Objects. 253-280 1997 21 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#HatzilygeroudisR97 http://dx.doi.org/10.1016/S0169-023X(96)00044-4 2003-11-27 Traceability between models and texts through terminology. 31-43 2001 38 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke38.html#CerbahE01 http://dx.doi.org/10.1016/S0169-023X(01)00015-5 2003-11-27 Intensional and extensional integration and abstraction of heterogeneous databases. 201-237 2000 35 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#PalopoliPTU00 http://dx.doi.org/10.1016/S0169-023X(00)00028-8 2003-11-27 A Conceptual Design Aid Environment for Expert-Database Systems. 31-73 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#Yasdi85 2003-11-27 DEByE - Data Extraction By Example. 121-154 2002 40 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke40.html#LaenderRS02 http://dx.doi.org/10.1016/S0169-023X(01)00047-7 2003-11-27 A technique for deriving hyponymies and overlappings from database schemes. 285-314 2002 40 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke40.html#PalopoliSTU02 http://dx.doi.org/10.1016/S0169-023X(01)00060-X 2003-11-27 On the representation of roles in object-oriented and conceptual modelling. 83-106 2000 35 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#Steimann00 http://dx.doi.org/10.1016/S0169-023X(00)00023-9 2003-11-27 Entity-Relationship and Object-Oriented Model Automatic Clustering. 87-117 1996 20 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke20.html#AkokaC96 http://dx.doi.org/10.1016/S0169-023X(96)00007-9 2003-11-27 Extending OMT to Support Bottom-Up Design Modelling in a Heterogeneous Distributed Database Environment. 191-205 1997 22 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke22.html#QutaishatFG97 http://dx.doi.org/10.1016/S0169-023X(97)81410-3 2003-11-27 View selection for designing the global data warehouse. 219-240 2001 39 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke39.html#TheodoratosLS01 http://dx.doi.org/10.1016/S0169-023X(01)00041-6 2003-11-27 EFTA: A Database Retrieval Algebra for Feature-Terms. 125-149 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#LudwigW91 2003-11-27 A model-driven ERP environment with search facilities. 327-341 2002 42 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke42.html#GullaB02 http://dx.doi.org/10.1016/S0169-023X(02)00051-4 2003-11-27 XML queries and algebra in the Enosys integration platform. 299-322 2003 44 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#PapakonstantinouBOSSVV03 2003-11-27 Utilizing the Multiple Facets of WWW Contents. 255-275 1998 28 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke28.html#KoganMSS98 http://dx.doi.org/10.1016/S0169-023X(98)00026-3 2003-11-28 An approach for the extensional integration of data sources with heterogeneous representation formats. 291-331 2003 45 Data Knowl. Eng. 3 http://dx.doi.org/10.1016/S0169-023X(02)00192-1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke45.html#PontieriUZ03 2003-11-27 On Mapping Production Systems Onto Multiprocessors. 1-27 1996 18 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke18.html#IgnatiusM96 http://dx.doi.org/10.1016/0169-023X(96)00032-8 2003-11-27 Design and Implementation of a Database Inference Controller. 271- 1993 11 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke11.html#ThuraisinghamFCO93 2003-11-27 Databases for knowledge bases: empirical study of a knowledge base management system for a semantic network. 115-154 1991 7 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke7.html#LockemannNW91 2003-11-28 The atoms, molecules and fibers of organizations. 301-325 2003 47 Data Knowl. Eng. 3 http://dx.doi.org/10.1016/S0169-023X(03)00062-4 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke47.html#Dietz03 2003-11-27 A Case study of Automatic Authoring: From a Textbook to a Hyper-Textbook. 1-30 1998 27 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke27.html#CrestaniM98 http://dx.doi.org/10.1016/S0169-023X(97)00043-8 2003-11-27 Towards object-oriented conceptual modeling. 479-508 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#SernadasF91 2003-11-27 Efficient Indexing of High-Dimensional Data Through Dimensionality Reduction. 115-130 2000 32 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke32.html#GohLOT00 http://dx.doi.org/10.1016/S0169-023X(99)00031-2 2003-11-27 Indexing Temporal Data Using Existing B+-Trees. 147-165 1996 18 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke18.html#GohLOT96 http://dx.doi.org/10.1016/0169-023X(95)00034-P 2003-11-27 Some Aspects of a Physical Database Design and Reorganisation Tool (PDRT). 303-322 1989 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#StewartBM89 2003-11-27 QAL: A Query Algebra of Complex Objects. 57-94 1999 30 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#SavnikTM99 http://dx.doi.org/10.1016/S0169-023X(98)00049-4 2003-11-27 Reasoning for Web document associations and its applications in site map construction. 121-150 2002 43 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke43.html#CandanL02 http://dx.doi.org/10.1016/S0169-023X(02)00053-8 2003-11-27 A Compact Sparse Matrix Representation Using Random Hash Functions. 29-49 2000 32 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke32.html#JiangCC00 http://dx.doi.org/10.1016/S0169-023X(99)00017-8 2003-11-27 Efficient Maintenance of Explicit Transitive Closures with Set-Oriented Update Propagation and Parallel Processing. 197-220 1994 13 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke13.html#CheineyH94 2003-11-27 Enabling the creation of knowledge about software assets. 141-158 2002 41 Data Knowl. Eng. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke41.html#KlintV02 http://dx.doi.org/10.1016/S0169-023X(02)00038-1 2003-11-27 A Temporal Blackboard for a Multi-Agent Environment. 189-211 1995 15 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke15.html#BottiBCOGRGH95 http://dx.doi.org/10.1016/0169-023X(95)00007-F 2003-11-27 The processing of a class of transitive-closure queries on uniprocessor and shared-nothing multiprocessor systems. 57-89 1992 8 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke8.html#QadahK92 2003-11-27 Using reordering technique for mobile transaction management in broadcast environments. 79-100 2003 45 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke45.html#KimLH03 2003-11-27 Hierarchical data placement for navigational multimedia applications. 49-80 2003 44 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#VakaliTBE03 2003-11-27 An integrated representational architecture for a decision management system. 155-180 1991 7 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke7.html#ReuberB91 2003-11-27 Combining Knowledge with Many-Valued Logics. 297-315 1997 23 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke23.html#Messing97 http://dx.doi.org/10.1016/S0169-023X(97)00012-8 2003-11-27 Making Multiple Views Self-Maintainable in a Data Warehouse. 121-134 1999 30 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke30.html#LiangLWO99 http://dx.doi.org/10.1016/S0169-023X(99)00009-9 2003-11-27 Semantic data modelling and visualisation using Noetica. 241-276 2000 33 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke33.html#GreenhillV00 http://dx.doi.org/10.1016/S0169-023X(00)00003-3 2003-11-27 Peter Chen honoured with the Stevens Award for advancing software development methods. 273-282 2002 41 Data Knowl. Eng. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke41.html#Riet02a http://dx.doi.org/10.1016/S0169-023X(02)00044-7 2003-11-27 Architectures and Monitoring Techniques for Active Databases: An Evaluation. 1-26 1995 16 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke16.html#Chakravarthy95 http://dx.doi.org/10.1016/0169-023X(95)00010-P 2003-11-27 Using information extraction and natural language generation to answer e-mail. 85-100 2001 38 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke38.html#KosseimBL01 http://dx.doi.org/10.1016/S0169-023X(01)00018-0 2003-11-27 Combining paradigms in knowledge engineering. 1-18 1992 9 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke9.html#GainesRS92 2003-11-27 A semantical perspective on verification of knowledge. 33-70 2002 40 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke40.html#LeemansTW02 http://dx.doi.org/10.1016/S0169-023X(01)00045-3 2003-11-27 Argumentative Logics: Reasoning with Classically Inconsistent Information. 125-145 1995 16 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke16.html#Elvang-GoranssonH95 http://dx.doi.org/10.1016/0169-023X(95)00013-I 2003-11-27 Database Design with User-Definable Modelling Concepts. 229-257 1993 10 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke10.html#LockemannMNRR93 2003-11-27 Interval-based approach to lexicograhpic representation and compression of numeric data. 339-351 1992 8 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke8.html#Rishe92 2003-11-27 A Methodology and Tool for Top-Down Relational Database Design. 259-291 1993 10 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke10.html#Rishe93 2003-11-27 EVORM: A Conceptual Modelling Technique for Evolving Application Domains. 313-359 1994 12 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke12.html#ProperW94 2003-11-27 Information Disclosure in Evolving Information Systems: Taking as Shot at a Moving Target. 135-168 1995 15 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke15.html#ProperW95 http://dx.doi.org/10.1016/0169-023X(94)00035-D 2003-11-27 An approximate user-complexity measure for relational query language systems. 393-407 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#HansenH91 2003-11-27 A Probabilistic Object-Oriented Data Model. 143-166 1994 12 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke12.html#KornatzkyS94 2003-11-27 Conceptual Design of Object-Oriented Database Schemas Using the Binary-Relationship Model. 265-288 1995 14 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke14.html#KornatzkyS95 http://dx.doi.org/10.1016/0169-023X(94)00027-C 2003-11-27 NL Structures and Conceptual Modelling: Grammalizing for KISS. 79-92 1997 23 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke23.html#HoppenbrouwersVH97 http://dx.doi.org/10.1016/S0169-023X(97)00011-6 2003-11-27 Data Schema Design as a Schema Evolution Process. 159-189 1997 22 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke22.html#Proper97 http://dx.doi.org/10.1016/S0169-023X(96)00045-6 2003-11-27 Implementation of a Logic-Based Support System for Concurrent Engineering. 31-61 1995 15 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke15.html#GreefFYO95 http://dx.doi.org/10.1016/0169-023X(95)94024-3 2003-11-27 Knowledge-Based Techniques to Increase the Flexibility of Workflow Management. 269-315 1997 23 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke23.html#DellenMP97 http://dx.doi.org/10.1016/S0169-023X(97)00015-3 2003-11-27 A schedule of join operations to reduce I/O cost in spatial database systems. 299-317 2000 35 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke35.html#XiaoZJZ00 http://dx.doi.org/10.1016/S0169-023X(00)00026-4 2003-11-27 Supporting Schema Integration by Linguistic Instruments. 165-182 1997 21 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke21.html#Johannesson97 http://dx.doi.org/10.1016/S0169-023X(96)00031-6 2003-11-27 An Evaluation of Commercial Expert System Building Tools. 279-304 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#WallABGO85 2003-11-27 Inter-transactional association rules for multi-dimensional contexts for prediction and their application to studying meteorological data. 85-115 2001 37 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke37.html#FengDL01 http://dx.doi.org/10.1016/S0169-023X(01)00003-9 2003-11-27 Engineering Large Knowledge-Based Systems. 105-117 1990 5 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke5.html#Habermann90 2003-11-27 Lying versus refusal for known potential secrets. 199-222 2001 38 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke38.html#BiskupB01 http://dx.doi.org/10.1016/S0169-023X(01)00024-6 2003-11-27 Descriptive Specification of Database Object Behaviour. 47-73 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#Saake91 2003-11-27 ER Isomorphisms and Uniqueness Conditions. 271-290 1998 26 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke26.html#Knapp98 http://dx.doi.org/10.1016/S0169-023X(97)00046-3 2003-11-28 Estimating the quality of answers when querying over description logic ontologies. 105-129 2003 47 Data Knowl. Eng. 1 http://dx.doi.org/10.1016/S0169-023X(03)00067-3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke47.html#PeimFP03 2003-11-27 An Entity-Based Approach to Query Processing in Relational Databases. Part I: Entity Type Representation. 117-150 1993 10 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke10.html#JarvelinN93 2003-11-27 Coping with Indefinite and Negative Data in Deductive Databases: A Survey. 259-284 1987 2 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke2.html#ChisholmCFTW87 2003-11-27 Cover story management. 177-201 2001 37 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke37.html#CuppensG01 http://dx.doi.org/10.1016/S0169-023X(01)00006-4 2003-11-27 Logical Foundations of Multilevel Databases. 259-291 1999 29 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke29.html#CuppensG99 http://dx.doi.org/10.1016/S0169-023X(98)00044-5 2003-11-27 The Deontic Pattern - a Framework for Domain Analysis in Information Systems Design. 135-153 1999 31 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke31.html#JohannessonW99 http://dx.doi.org/10.1016/S0169-023X(99)00019-1 2003-11-27 A Multi-Threshold, Internal Rule Representation Form Used to Support User Modifiable Knowledge-Based Systems. 327-336 1985 1 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke1.html#MazlackBKV85 2003-11-28 Encapsulation and information hiding as the keys to enhanced hypermedia development and maintenance. 65-96 2003 46 Data Knowl. Eng. 1 http://dx.doi.org/10.1016/S0169-023X(02)00196-9 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke46.html#Lemahieu03 2003-11-27 Conceptual Modeling in a Document Management Environment Using Part-of Reasoning in Description Logics. 51-86 2000 32 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke32.html#LambrixP00 http://dx.doi.org/10.1016/S0169-023X(99)00033-6 2003-11-27 Lossless Join Property in Fuzzy Relational Databases. 109- 1993 11 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke11.html#BhuniyaN93 2003-11-27 Unifying Data, Behaviours, and Messages in Object-Oriented Databases. 29-54 1996 18 Data Knowl. Eng. 1 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke18.html#OsbornY96 http://dx.doi.org/10.1016/0169-023X(96)00000-6 2003-11-27 Formal Properties of Net-Based Knowledge Representation Schemes. 137-147 1988 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#AtzeniP88 2003-11-27 Updating intensional predicates in Datalog. 1-17 1992 8 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke8.html#AtzeniT92 2003-11-27 An Integrated Temporal Data Model Incorporating Time Series Concept. 257-276 1998 24 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke24.html#LeeEW98 http://dx.doi.org/10.1016/S0169-023X(97)00034-7 2003-11-28 The semantics of an extended referential integrity for a multilevel secure relational data model. 129-152 2004 48 Data Knowl. Eng. 1 http://dx.doi.org/10.1016/S0169-023X(03)00122-8 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke48.html#LeeKK04 2003-11-27 Coupling Committed and Trial Binding Resolution Engines. 159-178 1991 6 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke6.html#Taylor91 2003-11-27 Updates and object-generating views in ODBS. 125-163 2000 34 Data Knowl. Eng. 2 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke34.html#Bellahsene00 http://dx.doi.org/10.1016/S0169-023X(00)00011-2 2003-11-27 Data integration over the Web. 265-266 2003 44 Data Knowl. Eng. 3 http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke44.html#Bellahsene03 2006-10-23 Information System Dynamics Representation in Production Environment. 149-161 1988 3 Data Knowl. Eng. http://www.informatik.uni-trier.de/~ley/db/journals/dke/dke3.html#DilevaG88