URLs

Geometric mesh partitioning: implementation and experiments, GilMilTen-TR-94, ftp://parcftp.xerox.com/pub/gilbert/csl9413.ps.Z
Partitioning meshes with lines and planes, CaoGilTen-TR-96, ftp://parcftp.xerox.com/pub/gilbert/csl9601.ps.Z
Locally-adaptive grid generation using quadtrees, VerPanPuc-TR-95, ftp://ftp.cs.mcgill.ca/pub/tech-reports/library/reports/95/TR95.3.ps.gz
Optimal folding of bit-sliced stacks, PaiSah-TR-91, ftp://ftp.cis.ufl.edu/cis/tech-reports/tr91/tr91-026.ps
Zippered polygon meshes from range images, http://www-graphics.stanford.edu/papers/zipper/
A (usually?) connected subgraph of the minimum weight triangulation, http://www.middlebury.edu/~dickerso/mwtskel.html
Dynamic Euclidean minimum spanning trees and extrema of binary functions, http://www.ics.uci.edu/~eppstein/pubs/p-dynmst.html
Geometric lower bounds for parametric matroid optimization, http://www.ics.uci.edu/~eppstein/pubs/p-geomlb.html
Algorithmic techniqes for geometric optimization, http://www.cs.duke.edu/~pankaj/papers/geom-opt-survey.ps.gz
Trekking in the Alps without freezing or getting tired, BerKre-TR-94, ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-02.ps.gz
Computing half-plane and strip discrepancy of planar point sets, Ber-TR-94, ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-34.ps.gz
Parallel algorithms for series parallel graphs, BodFlu-TR-96, ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1996/1996-13.ps.gz
Concept learning with simple geometric hypotheses, DobGun-TR-94-481, http://ncstrl.cs.princeton.edu/expand.php3?id=TR-481-94
The maximum discrepancy of simple geometric ranges, DobGun-TR-94-480, http://ncstrl.cs.princeton.edu/expand.php3?id=TR-480-94
Computing the maximum bichromatic discrepancy with applications to computer graphics and machine learning, DobGunMaa-TR-94, http://ncstrl.cs.princeton.edu/expand.php3?id=TR-467-94
Computing the rectangle discrepancy, DobGun-TR-94-443, http://ncstrl.cs.princeton.edu/expand.php3?id=TR-443-94
Computing the maximum bichromatic discrepancy with applications to computer graphics and machine learning, DobGunMaa-ECCC-94, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1994/TR94-025/index.html
Computing the maximum bichromatic discrepancy with applications to computer graphics and machine learning, DobGunMaa-NC-95, ftp://cscx.cs.rhbnc.ac.uk/pub/neurocolt/tech_reports/nc-tr-95-008.ps.Z
3-coloring in time $O(1.3446^n)$: a no-MIS algorithm, BeiEpp-ECCC-95, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1995/TR95-033/index.html
Color-coding, http://www.math.tau.ac.il/~zwick/color-code.ps.gz
Steiner triangulation for isotropic and stretched elements, http://www.nas.nasa.gov/~barth/delaunay/delaunay.html
Linear and $O(n\log n)$ time minimum-cost matching algorithms for quasi-convex tours, ftp://euclid.ucsd.edu/pub/sbuss/research/quasiconvex.ps
Dealing with higher dimensions: the well-separated pair decomposition and its applications, Cal-PhD-95, ftp://ftp.cs.jhu.edu/pub/callahan/dissertation.ps.Z
Optimal parallel all-nearest-neighbors using the well-separated pair decomposition, Cal-FOCS-93, ftp://ftp.cs.jhu.edu/pub/callahan/ckfocs93.ps.Z
Algorithms for dynamic closest pair and $n$-body potential fields, CalKos-SODA-95, ftp://ftp.cs.jhu.edu/pub/callahan/cksoda95.ps.Z
Prefix graphs and their applications, http://www.mpi-sb.mpg.de/~shiva/publications/prefix.ps.gz
Optimal manipulation strategies for orienting planar workpieces by pushing, CheIerHun-TR-94, ftp://usc.edu/pub/csinfo/tech-reports/papers/94-597.ps.Z
Planar orientations with low out-degree and compaction of adjacency matrices, ChrEpp-TCS-91, http://www.ics.uci.edu/~eppstein/pubs/ChrEpp-TCS-91.pdf
Temporally coherent conservative visibility, CooTel-SCG-96, http://graphics.lcs.mit.edu/~satyan/pubs/temporalvis-cg96.ps.Z
Longest common subsequences, PatDan-TR-94, http://www.dcs.warwick.ac.uk/pub/reports/rr/268.html
Expected Length of Longest Common Subsequences, Dan-PhD-94, ftp://ftp.dcs.warwick.ac.uk/people/Vladimir.Dancik/thesis/
Algorithms for all single deletions in a minimum spanning tree, simultaneously, http://geisel.csl.uiuc.edu/~das/mst.ps.Z
Perspectives of Monge properties in optimization, BurKliRud-TR-95, ftp://ftp.tu-graz.ac.at/pub/papers/math/sfb2.ps
Optimal placement of convex polygons to maximize point containment, DicSch-SODA-96, http://www.middlebury.edu/~scharste/rotate/rotate.ps.gz
On triangulating three-dimensional polygons, BarDicEpp-SCG-96, ftp://ftp.cs.technion.ac.il/pub/barequet/papers/3dt-socg96.ps.gz
Concept learning with simple geometric hypotheses, DobGun-COLT-95, http://www.cs.princeton.edu/~dpd/Papers/DobkinGunopolous.ps.Z
Computing the discrepancy with applications to supersampling patterns, http://www.cs.princeton.edu/~dpd/Papers/DobkinEppsteinMitchell.ps.Z
Computational geometry and computer graphics, http://www.cs.princeton.edu/~dpd/Papers/DobkinIEEE.ps.Z
Computing the maximum bichromatic discrepancy with applications to computer graphics and machine learning, DobGunMaa-JCSS-96, http://www.cs.princeton.edu/~dpd/Papers/DobkinGunopolousMaass.ps.Z
Counting triangle crossings and halving planes, DeyEde-TR-92, http://www.cs.uiuc.edu/Dienst/UI/2.0/Describe/ncstrl.uiuc_cs/UIUCDCS-R-92-1781
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications, http://www.math.tau.ac.il/~alone/shallow.ps.gz
Iterated nearest neighbors and finding minimal polytopes, EppEri-DCG-94, http://www.cs.duke.edu/~jeffe/pubs/small.html
On mixed connectivity certificates, EveItkRaj-ESA-95, http://theory.lcs.mit.edu/~rajsbaum/esa95itkis.ps
Fully Dynamic Graph Algorithms and their Data Structures, Rauch-TR-93, http://ncstrl.cs.princeton.edu/expand.php3?id=TR-402-92
Trees in \TeX, Epp-Tb-85, http://www.ics.uci.edu/~eppstein/pubs/p-ttree.tex.Z
On the number of arrangements of pseudolines, Fel-TR-95, http://www.inf.fu-berlin.de/~felsner/numarr.ps.gz
Extending range queries and nearest neighbors, FlaSte-CCCG-95, http://www.cs.rpi.edu/~flatland/pspapers/cccg95.ps.Z
New lower bounds for halfspace emptiness, Eri-CGC-96, http://www.cs.jhu.edu/labs/cgc/workshop/F250.ps
New lower bounds for halfspace emptiness, Eri-FOCS-96, http://www.cs.duke.edu/~jeffe/pubs/halfempty.ps.gz
Incremental update of the visibility map as seen by a moving viewpoint in two dimensions, GhaSte-EWCAS-96, ftp://dgp.toronto.edu/pub/ghali/EWCAS96.ps.gz
Maintenance of the set of segments visible from a moving viewpoint in two dimensions, GhaSte-SCG-96, ftp://dgp.toronto.edu/pub/ghali/SCG96.ps.gz
Orienting polygonal parts without sensors, Gol-Algo-93, file://usc.edu/pub/iris/algo.ps.Z
Linear-size nonobtuse triangulation of polygons, BerMitRup-RNR-94, http://www.nas.nasa.gov/NAS/TechReports/RNRreports/jruppert/RNR-94-003/RNR-94-003.html
A Delaunay refinement algorithm for 2-dimensional mesh generation, Rup-RNR-94, http://www.nas.nasa.gov/NAS/TechReports/RNRreports/jruppert/RNR-94-002/RNR-94-002.html
Finding subsets maximizing minimum structures, http://www.raunvis.hi.is/~mmh/Papers/jmst.html
The centroid of points with approximate weights, BerEppGui-ESA-95, http://www.ics.uci.edu/~eppstein/pubs/BerEppGui-ESA-95.ps.gz
Computing the discrepancy with applications to supersampling patterns, DobEppMit-ToG-96, http://doi.acm.org/10.1145/234535.234536
Geometry in Action, http://www.ics.uci.edu/~eppstein/geom.html
Strategic directions in computational geometry: working group report, http://www.cs.brown.edu/people/rt/sdcr/report/report.html
Efficient parallel algorithms for geometric clustering and partitioning problems, Dat-TR-94, http://www.informatik.uni-freiburg.de/TechReports/1994/abstract64.html
On finding single-source single-destination $k$ shortest paths, ChoMadMor-ICCI-95, http://phoenix.trentu.ca/jci/papers/icci95/A206/P001.html
Parallel Algorithms for the $k$ Shortest Paths and Related Problems, Rup-MS-96, http://www.cs.utoronto.ca/~ruppert/thesis.ps.gz
Dynamic programming with convexity, concavity and sparsity, GalPar-TR-90, ftp://ftp.cs.columbia.edu/reports/reports-1990/cucs-066-90.ps.Z
Fully dynamic algorithms for 2-edge-connectivity, GalIta-TR-91a, ftp://ftp.cs.columbia.edu/reports/reports-1991/cucs-016-91.ps.Z
Maintaining the 3-edge connected components of a graph online, GalIta-TR-91b, ftp://ftp.cs.columbia.edu/reports/reports-1991/cucs-017-91.ps.Z
Maintaining biconnected components of dynamic planar graphs, GalIta-TR-91c, ftp://ftp.cs.columbia.edu/reports/reports-1991/cucs-018-91.ps.Z
Dynamic data structures for graphs, Ita-TR-91, ftp://ftp.cs.columbia.edu/reports/reports-1991/cucs-019-91.ps.Z
Parallel dynamic programming, GalPark-TR-91, ftp://ftp.cs.columbia.edu/reports/reports-1991/cucs-040-91.ps.Z
Parallel string matching algorithms, BreGal-TR-92, ftp://ftp.cs.columbia.edu/reports/reports-1992/cucs-002-92.ps.Z
Efficient String Algorithmics, Bre-TR-92, ftp://ftp.cs.columbia.edu/reports/reports-1992/cucs-024-92.ps.Z
On-line and dynamic algorithms for shortest path problems, DjiPanZar-TR-94, http://www.mpi-sb.mpg.de/papers/reports/MPI-I-94-114.dvi.Z
Computational molecular biology, VinLenMut-TR-96, http://www.mpi-sb.mpg.de/papers/reports/MPI-I-96-1-015.ps.gz
Strong self-reducibility precludes strong immunity, HemZim-TR-95, ftp://ftp.cs.rochester.edu/pub/papers/theory/95.tr480rev.Strong_self-reducibility_precludes_strong_immunity.ps.gz
Existential theorems in computational complexity: size and robustness, Zim-PhD-96, http://www.cs.rochester.edu/users/grads/zimand/thesis.html
Minkowski-type theorems and least-squares clustering, AurHofAro-TR-92, http://www.inf.fu-berlin.de/inst/pubs/tr-b-92-09.abstract.html
Approximate regular expression pattern matching with concave gap penalties, KniMye-Algo-95, http://www.cs.arizona.edu/people/gene/PAPERS/reg.concave.ps
Chaining multiple-alignment fragments in sub-quadratic time, MyeMil-SODA-95, http://www.cs.arizona.edu/people/gene/PAPERS/sparse.dp.ps
Flipping edges in triangulations, HurNoyUrr-SCG-96, http://www.csi.uottawa.ca/~jorge/online_papers/Flipping.ps.gz
Fully dynamic transitive closure in plane dags with one source and one sink, Hus-TR-94, http://www.brics.dk/RS/94/30/BRICS-RS-94-30.ps.gz
Fully dynamic transitive closure in plane dags with one source and one sink, Hus-ESA-95, http://www.daimi.au.dk/~thore/Papers/dtc-esa.ps.gz
Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest path trees, BarHut-TRA-95, http://www.ai.uiuc.edu/~barbehen/papers/trans.ps
To provide or to bound: sampling in fully dynamic graph algorithms, HenTho-TR-96, http://gatekeeper.dec.com/pub/DEC/SRC/research-reports/abstracts/src-rr-143.html
Fully dynamic biconnectivity in graphs, Rau-Algo-95, http://www.cs.cornell.edu/Info/People/mhr/papers/2-vertex-paper1.ps
Data structures for two-edge connectivity in planar graphs, HerRauSur-TCS-94, http://www.cs.cornell.edu/Info/People/mhr/papers/2-edge.ps
Fully dynamic planarity testing in planar embedded graphs, ItaLaPRau-ESA-93, http://www.cs.cornell.edu/Info/People/mhr/papers/planarity-testing.ps
Improved data structures for fully dynamic biconnectivity, Rau-STOC-94, http://www.cs.cornell.edu/Info/People/mhr/papers/2-vertex-paper2.ps
Fully dynamic cycle-equivalence in graphs, Rau-FOCS-94, http://www.cs.cornell.edu/Info/People/mhr/papers/cycle-equiv.ps
Average case analysis of dynamic graph algorithms, AlbHen-SODA-95, http://www.cs.cornell.edu/Info/People/mhr/papers/average.ps
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology, HenKinWar-SODA-96, http://www.cs.cornell.edu/Info/People/mhr/papers/bio.ps
Approaching the $5/4$-approximation for rectilinear Steiner trees, BerFosKar-ESA-94, http://www.cs.virginia.edu/~alexz/postscript/esa.ps
On certificates and lookahead in dynamic graph problems, KhaMotWil-SODA-96, http://theory.stanford.edu/people/sanjeev/postscriptum/soda96.ps.gz
Approximate regular expression pattern matching with concave gap penalties, KniMye-TR-92, ftp://ftp.cs.arizona.edu/reports/1992/TR92-12.ps
Discrete Pattern Matching over Sequences and Interval Sets, Kni-TR-93, ftp://ftp.cs.arizona.edu/reports/1993/TR93-28.ps
An approximation scheme for planar graph TSP, GriKouPap-FOCS-95, http://daphne.cs.ucla.edu/elias/publications/abstracts.html#gkp95
Applications of 3D Delaunay triangulation algorithms in geoscientific modelling, LatRap-GISRUK-95, http://www.iah.bbsrc.ac.uk/phd/gisruk95.html
Average case analysis of dynamic graph algorithms, AlbHen-TR-95, http://www.inf.fu-berlin.de/inst/pubs/tr-b-95-03.abstract.html
Implementation of the dynamic connectivity algorithm by Monika Rauch Henzinger and Valerie King, Alb-TR-95, http://www.inf.fu-berlin.de/inst/pubs/tr-b-95-10.abstract.html
On the number of arrangements of pseudolines, Fel-TR-95, http://www.inf.fu-berlin.de/inst/pubs/tr-b-95-20.abstract.html
Cutting dense point sets in half, EdeValWel-TR-94, http://www.inf.fu-berlin.de/inst/pubs/tr-b-94-06.abstract.html
Random Sampling in Graph Optimization Problems, Kar-TR-95, http://elib.stanford.edu/Dienst/UI/2.0/Describe/stanford.cs/CS-TR-95-1541
Efficient algorithms for geometric optimization, AgaSha-TR-96, http://www.cs.duke.edu/~pankaj/papers/geom-full.ps.gz
Enumerating suboptimal alignments of multiple biological sequences efficiently, ShiIma-PSB-97, http://www-smi.stanford.edu/people/altman/psb97/shibuya.pdf
New flexible approaches for multiple sequence alignment, ShiIma-RECOMB-97, http://naomi.is.s.u-tokyo.ac.jp/papers/genome/recomb97.ps.gz
Finding a realistic detour by AI search techniques, ShiIkeIma-ITS-95, http://naomi.is.s.u-tokyo.ac.jp/papers/navigation/suboptimal-routes/ITS95/its.ps.gz
Detour queries in geographical databases for navigation and related algorithm animations, ShiImaNis-CODAS-96, http://naomi.is.s.u-tokyo.ac.jp/papers/databases/codas96.ps.gz
The efficient location of neighbors for locally refined $n$-simplicial grids, Mau-IMR-96, http://sass577.endo.sandia.gov/9225/Personnel/samitch/roundtable96/papers/maubach.ps.gz
Control volume meshes using sphere packing: generation, refinement and coarsening, MilTalTen-IMR-96, http://sass577.endo.sandia.gov/9225/Personnel/samitch/roundtable96/papers/miller-final2631.ps.gz
On the radius-edge condition in the control volume method, MilTalTen-TR-96, http://www.cs.cmu.edu/~tdafna/cv.html
Developing a practical projection-based parallel Delaunay algorithm, BleMilTal-SCG-96, http://www.cs.cmu.edu/afs/cs.cmu.edu/project/scandal/public/papers/delaunay-cg96.html
Map labeling and its generalizations, DodMarMir-SODA-97, http://www.cs.unm.edu/~moret/map.ps
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations, MucSaiZhu-SCG-96, http://www.c3.lanl.gov/~isaac/publications/96-geometry.ps
PadFEM: a portable parallel FEM-tool, DieDraNeu-HPCN-96, http://www.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/PadFEM_HPCN96.ps.Z
Uniform circuits and exclusive read PRAMs, NieRos-FSTTCS-91, ftp://flop.informatik.tu-muenchen.de/pub/theory/complexity/sel.dvi
Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator, She-WACG-96, http://www.cs.cmu.edu/~quake/tripaper/triangle0.html
A parallel solution strategy for irregular dynamic problems, Ver-PhD-96, http://www-acaps.cs.mcgill.ca/~clump/papers/thesis.ps.gz
Optimizing systems for effective block-processing: the $k$-delay problem, LalPapPot-DAC-96, http://kona.ee.pitt.edu/33dac/papers/1996/dac96/psfiles/44_4.ps
Optimizing systems for effective block-processing: the $k$-delay problem, LalPapPot-TR-96, http://www.cs.yale.edu/pub/marios/k-delay-dac96.ps.gz
An algorithm for finding the weakly visible faces from a polygon in 3d, Pla-CCCG-92, http://ccel.wheaton.edu/~whp/papers/poly-vis-CCCG.ps.gz
Conservative visibility preprocessing for efficient walkthroughs of 3D scenes, Pla-GI-93, http://ccel.wheaton.edu/~whp/papers/GI93-visibility-preproc.ps.gz
The edge-flipping distance of triangulations, HanOttSch-JUCS-96, http://medoc.springer.de:8000/0xc25e2a28_0x0003f4fb
Output-sensitive results on convex hulls, extreme points, and related problems, Cha-DCG-96, http://link.springer.de/link/service/journals/00454/htabst/16_369-387.html
Decremental 2- and 3-connectivity on planar graphs, GiaIta-Algo-96, http://link.springer.de/link/service/journals/00453/htabst/16_263-287.html
A near-linear algorithm for the planar segment-center problem, EfrSha-DCG-96, http://link.springer.de/link/service/journals/00454/htabst/16_239-257.html
An optimal bound for high-quality conforming triangulations, Tan-DCG-96, http://link.springer.de/link/service/journals/00454/htabst/15_169-193.html
Simulating quadratic dynamical systems is PSPACE-complete, http://wstud.cs.technion.ac.il/~rabani/pss/Publications/AroraRV94.ps.gz
A computational view of population genetics, http://wstud.cs.technion.ac.il/~rabani/pss/Publications/RabaniRS95.ps.gz
New algorithms for the longest common subsequence problem, Ric-TR-94, http://web.informatik.uni-bonn.de/IV/Mitarbeiter/rick/lcs.ps.Z
A new flexible algorithm for the longest common subsequence problem, Ric-CPM-95, http://web.informatik.uni-bonn.de/IV/Mitarbeiter/rick/lcs.dvi.Z
Surface modeling using quadtrees, Siv-TR-96, http://www.cfar.umd.edu/ftp/TRs/CVL-Reports-1996/TR3609-Sivan.ps.gz
On-line and dynamic algorithms for shortest path problems, DjiPanZar-STACS-95, http://www.mpi-sb.mpg.de/~zaro/publications/Zaro-STACS95.ps
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms, KanMicShv-NJC-95, http://theory.lcs.mit.edu/~alex/nordic.html
Efficient parallelism vs reliable distribution: a trade-off for concurrent computations, KanMicShv-TR-94-29, http://www.cs.brown.edu/publications/techreports/reports/CS-94-29.html
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms, KanMicShv-TR-94-23, http://www.cs.brown.edu/publications/techreports/reports/CS-94-23.html
Fault-Tolerant and Efficient Parallel Computation, Shv-TR-92, http://www.cs.brown.edu/publications/techreports/reports/CS-92-23.html
Dynamic expression trees, CohTam-TR-90, http://www.cs.brown.edu/publications/techreports/reports/CS-90-35.html
Combine and conquer: a general technique for dynamic algorithms, CohTam-TR-92, http://www.cs.brown.edu/publications/techreports/reports/CS-92-19.html
Combine and Conquer, Coh-TR-92, http://www.cs.brown.edu/publications/techreports/reports/CS-92-45.html
A framework for dynamic graph drawing, CohdiBTam-TR-92, http://www.cs.brown.edu/publications/techreports/reports/CS-92-34.html
On-line convex planarity testing, DiBTamVis-TR-95, http://www.cs.brown.edu/publications/techreports/reports/CS-95-26.html
Output-sensitive reporting of disjoint paths, DiBTamVis-TR-96, http://www.cs.brown.edu/publications/techreports/reports/CS-96-25.html
An empirical study of dynamic graph algorithms, AlbCatIta-SODA-96, http://www.unisa.it/cattaneo.dir/papers/soda96.ps.gz
Experimental analysis of dynamic minimum spanning tree algorithms, AmaCatIta-SODA-97, http://www.unisa.it/cattaneo.dir/papers/soda97.ps.gz
Enclosing $k$ points in the smallest axis parallel rectangle, SegKed-CCCG-96, http://www.cs.bgu.ac.il/~segal/segalklara.ps
A dynamic algorithm for line graph recognition, DegSim-WG-95, htp://ftp.inf.ethz.ch/doc/papers/ti/ga/DS94.ps
Constructing efficient decision trees by using optimized numeric association rules, FukMorMor-VLDB-96, http://www.informatik.uni-trier.de/~ley/db/conf/vldb/FukudaMMT96.html
Dyn-FO: a parallel, dynamic complexity class, http://www.cs.umass.edu/~immerman/pub/dynfo.ps
Strategic directions in computational geometry: working group report, Tam-CS-96, http://www.acm.org/pubs/citations/journals/surveys/1996-28-4/p591-tamassia/
Output-Sensitive Construction of Convex Hulls, Cha-PhD-95, http://www.cs.miami.edu/~tchan/th_main.ps.gz
Approximate center points in dense point sets, Ver-EWCG-97, http://www-info1.informatik.uni-wuerzburg.de/CG97/abstracts/verbarg.ps
Strong self-reducibility precludes strong immunity, HemZim-MST-96, http://link.springer.de/link/service/journals/00224/htabst/29_535-550.html
An efficient algorithm for terrain simplification, AgaDes-SODA-97, http://www.cs.duke.edu/~pankaj/papers/terrain.ps.gz
Best-case results for nearest-neighbor learning, SalDelHeaKas-PAMI-95, http://www.cs.jhu.edu/~salzberg/bestcase.ps
Optimal Two-Dimensional Triangulations, Tan-PhD-93, http://www.iscs.nus.sg/~tants/Paper/thesis.ps.gz
Edge insertion for optimal triangulation, BerEdeEpp-DCG-93, http://www.iscs.nus.sg/~tants/Paper/eis.ps.gz
An upper bound for conforming Delaunay triangulations, EdeTan-DCG-93, http://www.iscs.nus.sg/~tants/Paper/cdt.ps.gz
An optimal bound for high-quality conforming triangulations, Tan-DCG-96, http://www.iscs.nus.sg/~tants/Paper/highQual.ps.gz
Optimal triangulation problems, Tan-ICIAM-95, http://www.iscs.nus.sg/~tants/Paper/iciam95.ps.gz
Chaining multiple-alignment blocks, ZhaRagHar-JCB-94, http://trantor.cse.psu.edu/~zzhang/jcb1.ps
Local multiple alignment via subgraph enumeration, ZhaHeMil-DAM-96, http://trantor.cse.psu.edu/~zzhang/dam.ps
Pointers versus arithmetic in PRAMs, DymFicNis-TR-93, ftp://ftp.cs.washington.edu/tr/1993/03/UW-CSE-93-03-06.PS.Z
Limits on the power of parallel random-access machines with weak forms of write conflict resolution, FicImpKap-STACS-93, http://www.csc.uvic.ca/~bmkapron/Publications/stacs93.ps.gz
The Complexity of Computation on the Parallel Random Access Machine, Fic-SPA-93, http://www-old.cs.toronto.edu/~fich/PRAMsurvey.ps
Parallel algorithms with processor failures and delays, BusKanRag-Algs-96, http://plg.uwaterloo.ca:80/~jfbuss/write-all.ps
Color-coding, AloYusZwi-ECCC-94, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1994/TR94-009/index.html
Fully dynamic 2-edge-connectivity algorithm in polylogarithmic time per operation, HenKin-SRC-97, http://gatekeeper.dec.com/pub/DEC/SRC/technical-notes/abstracts/src-tn-1997-004.html
Incremental clustering and dynamic information retrieval, ChaCheFed-STOC-97, http://www-cs-students.stanford.edu/~moses/clustering.ps.gz
Sparse dynamic programming I: linear cost functions, EppGalGia-JACM-92-I, http://www.acm.org/pubs/citations/journals/jacm/1992-39-3/p519-eppstein/
Sparse dynamic programming II: convex and concave cost functions, EppGalGia-JACM-92-II, http://www.acm.org/pubs/citations/journals/jacm/1992-39-3/p546-eppstein/
Geometric lower bounds for parametric matroid optimization, Epp-STOC-95, http://www.acm.org/pubs/citations/proceedings/stoc/225058/p662-eppstein
Separator based sparsification for dynamic planar graph algorithms, EppGalIta-STOC-93, http://www.acm.org/pubs/citations/proceedings/stoc/167088/p208-eppstein/
Parallel algorithms for series parallel graphs, BodFlu-TR-97-21, ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1997/1997-21.ps.gz
Parallel algorithms for treewidth two, BodFlu-TR-97-23, ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1997/1997-23.ps.gz
Mesh generation: theory, algorithms, and software, Vav-FF-96, http://www.tc.cornell.edu/er96/ff01winter/ff10meshgen.html
Numerische simulationen f�r granulare Medien, Sch-Dip-95, http://chaos.nat.uni-magdeburg.de/~schinner/dip/dip.html
An optimal algorithm for approximate nearest neighbor searching in fixed dimensions, AryMouNet-TR-95, http://www.cfar.umd.edu/ftp/TRs/Text-files-of-published-TRs/TR3568-Arya.tex
Mesh generation and optimal triangulation in three dimensions, Med-CESCG-97, http://www.cg.tuwien.ac.at/studentwork/CESCG97/medvid/
Robust and efficient cartesian mesh generation for component-based geometry, AftBerMel-AIAA-97, http://george.arc.nasa.gov/~aftosmis/AIAA-97-0196.pdf
Comparison algorithm of protein sequences by introducing a lookup table, NakYos-JCS-96, http://moldesign.chem.eng.himeji-tech.ac.jp/jcs/v3n3/a1/abst.html
Complexity and modeling aspects of mesh refinement into quadrilaterals, MohMue-TR-97, ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-554-1997.ps.Z
Mesh refinement via bidirected flows: modeling, complexity, and computational results, MohMueWei-TR-96, ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-520-1996.ps.Z
Minimum strictly-convex quadrangulations of convex polygons, MueWei-TR-96, ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-519-1996.ps.Z
Improved approximations for minimum cardinality quadrangulations of finite element meshes, MueWei-TR-97, ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-559-1997.ps.Z
Molecular computing, bounded nondeterminism, and efficient recursion, BeiFu-TR-96, http://www.cs.yale.edu/pub/TR/tr1116.ps.gz
Molecular computing, bounded nondeterminism, and efficient recursion, BeiFu-ICALP-97, http://www.cs.yale.edu/HTML/YALE/CS/HyPlans/fu-bin/Papers/icalp.ps
Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree, HolLicTho-TR-97-17, http://www.diku.dk/research/published/97-17.ps.gz
An $O(\log k)$-approximation algorithm for the $k$ minimum spanning tree problem in the plane, GarHoc-Algo-97, http://link.springer.de/link/service/journals/00453/htabst/18_111-121.html
Finding and counting given length cycles, AloYusZwi-Algo-97, http://link.springer.de/link/service/journals/00453/htabst/17_209-223.html
Delaunay Refinement Mesh Generation, She-PhD-97, http://www.cs.cmu.edu/~quake-papers/delaunay-refinement.ps.gz
Machine transliteration, KniGra-ACL-97, http://www.isi.edu/natural-language/mt/transliterate.ps
An empirical study of dynamic graph algorithms, AlbCatIta-JEA-97, http://www.jea.acm.org/1997/AlbertsDynamic/
Parallel searching in generalized Monge arrays with applications, AgaKraPar-Algo-97, http://link.springer.de/link/service/journals/00453/htabst/19n3p291.html
Poly-logarithmic deterministic fully-dynamic graph algorithms II: 2-edge and biconnectivity, HolLicTho-TR-97-26, http://www.diku.dk/research/published/97-26.ps.gz
Protein structure alignment using dynamic programming and iterative improvement, Aku-TIS-96, http://www.hgc.ims.u-tokyo.ac.jp/organize/miyano/takutsu/ieice96pap2.ps
Computing similarity between RNA strings, BafMutRav-TR-96, ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1996/96-30.ps.gz
Mesh smoothing using a posteriori error estimates, BanSmi-SJNA-97, ftp://sdna3.ucsd.edu/pub/reb/reports/a67.ps.Z
An efficient parallel algorithm for min-cost flow on directed series-parallel graphs, JaiCha-IPPS-93, http://corrine.cpc.cs.ucf.edu/published/esp-ipps.ps
Decimation of isosurfaces with deformable models, Del-CVRMed-97, ftp://www.inria.fr/epidaure/Publications/Delingette/CVRMED.ps.gz
General object reconstruction based on simplex meshes, Del-TR-97, ftp://ftp.inria.fr/INRIA/tech-reports/RR/RR-3111.ps.gz
Exploiting domain geometry in analogical route planning, HaiSheVel-ETAI-97, http://www.cs.cmu.edu/~khaigh/papers/khaigh97d.abstract.html
Computing extreme origami bases, DemDem-TR-97, http://daisy.uwaterloo.ca/~eddemain/papers/ConvexExtremeTR/
Faster approximation algorithms for the rectilinear Steiner problem, FosKauZel-DCG-97, http://link.springer.de/link/service/journals/00454/bibs/18n1p93.html
On triangulating planar graphs under the four-connectivity constraint, BieKanKau-Algo-97, http://link.springer.de/link/service/journals/00453/bibs/19n4p427.html
Depth in an arrangement of hyperplanes, http://win-www.uia.ac.be/u/statis/publicat/arrang_abstr.html
Global Visibility Computations, Bit-MS-97, http://sgi.felk.cvut.cz/~bittner/diplom/diplom.html
Fully Unstructured Delaunay Mesh Generation Using a Modified Advancing Front Approach for Applications in Technology CAD, FleSil-TCAD-97, http://www.ieee.org/journal/tcad/accepted/fleischmann-aug97/
JavaMesh – A Two Dimensional Triangular Mesh Generator for Finite Elements, Lin-MS-97, http://www.steven.pop.net.tw/javamesh/my_html/project.html
A software library of dynamic graph algorithms, AlbCatIta-ALEX-98, http://rtm.science.unitn.it/alex98/book/alberts.ps.gz
Quadrilateral Mesh Generation in Computer-Aided Design, Mue-PhD-97, http://www.math.tu-berlin.de/~mhannema/pub/p97-4.html
On the discrete core of quadrilateral mesh refinement, MueWei-TR-98, http://www.math.tu-berlin.de/~mhannema/pub/p98-1.html
Segmentation problems, KlePapRag-STOC-98, http://simon.cs.cornell.edu/home/kleinber/stoc98-seg.ps
Tetrahedral mesh improvement using face swapping and smoothing, FreOll-IJNME-97, ftp://info.mcs.anl.gov/pub/tech_reports/plassman/lori_improve.ps.Z
On combining Laplacian and optimization-based mesh smoothing techniques, Fre-McNU-97, ftp://info.mcs.anl.gov/pub/tech_reports/plassman/lori_combined.ps.Z
A parallel algorithm for mesh smoothing, FreJonPla-PPSC-97, ftp://info.mcs.anl.gov/pub/tech_reports/plassman/smoothing_pp97.ps.gz
A computational study of the effect of unstructured mesh quality on solution efficiency, BatFreOll-AIAA-97, ftp://info.mcs.anl.gov/pub/tech_reports/plassman/lori_quality.ps.Z
New Approaches to Flexible Alignment of Multiple Biological Sequences, Shi-MS-97, http://naomi.is.s.u-tokyo.ac.jp/papers/THESIS/MASTER/shibuya.ps.gz
Mesh generation, BerPla-TR-97, ftp://info.mcs.anl.gov/pub/tech_reports/plassman/meshgen.ps.Z
Subexponential-time algorithms for minimum-weight triangulation and related problems, Lin-CCCG-98, http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-lingas-subexponential.ps
Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria, TajIma-CCCG-98, http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-tajima-computational.ps
On the multiple label placement problem, KakTol-CCCG-98, http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-kakoulis-multiple.ps
Systematic derivation of incremental programs, LuiTei-SCP-95, ftp://ftp.cs.cornell.edu/pub/yanhong/Inc-SCP95.ps.Z
The farthest point strategy for progressive image sampling, EldLinPor-TR-96, http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi?1996/CIS/CIS9613
A data-parallel implementation of the geometric partitioning algorithm, HuTenJoh-PPSC-97, http://sal.cs.uiuc.edu/~steng/data_geo.html
A data-parallel implementation of the geometric partitioning algorithm, HuTenJoh-TR-96, http://www.cs.uh.edu/~johnsson/rpt/tr-15-96.ps.gz
Volume Bounded Molecular Computation, Fu-PhD-97, http://www.eecs.lehigh.edu/~beigel/papers/fu-thesis.PS.gz
Color printer characterization using a computational geometry approach, HarSch-CIC-97, http://www-ima.enst.fr/~hardeber/work/CIC1997/cic1997.html
Dynamic Data Structures for String Matching Problems, Fer-PhD-97, http://www.di.unipi.it/~ferragin/Latex/tesi-lett.ps.gz
Bibliography on $k$ shortest paths and other “$k$ best solutions” problems, http://www.ics.uci.edu/~eppstein/bibs/kpath.bib
A constant-factor approximation algorithm for the geometric $k$-MST problem in the plane, http://www.cs.cmu.edu/~avrim/Papers/planarktrees.ps.gz
The natural element method in solid mechanics, SukMorBel-IJNME-98, http://www.tam.nwu.edu/suku/nem/nem_I.ps.gz
Clustering in large graphs and matrices, DriFriKan-SODA-99, http://www-math.mit.edu/~vempala/papers/clus.ps
Computation and maintenance of visibility and shadows in the plane, Gha-WSCG-98, http://www.dgp.toronto.edu/~ghali/papers/wscg98.ps.gz
Geometric lower bounds for parametric matroid optimization, Epp-DCG-98, http://link.springer.de/link/service/journals/00454/bibs/20n4p463.html
Angular properties of Delaunay diagrams in any dimension, SchSpe-DCG-99, http://link.springer.de/link/service/journals/00454/bibs/21n1p17.html
Approximating minimum-weight triangulations in three dimensions, AroFor-DCG-99, http://link.springer.de/link/service/journals/00454/papers/21n4p527.pdf
On the power of some PRAM models, AklChe-TR-97, http://www.qucis.queensu.ca/home/akl/techreports/pram.ps
Partitioned neighborhood spanners of minimal outdegree, FisLukZie-CCCG-99, http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp36.pdf
Ununfoldable polyhedra, BerDemEpp-CCCG-99, http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp38.pdf
Hinged dissections of polyominoes and polyforms, DemDemEpp-CCCG-99, http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp37.pdf
Rectilinear 2-center problems, BesKir-CCCG-99, http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp55.pdf
Obnoxious facility location: complete service with minimal harm, BenKatSeg-CCCG-99, http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp11.pdf
How to subdivide pyramids, prisms, and hexahedra into tetrahedra, DomLabVal-TR-99, http://www.cerca.umontreal.ca/adp3d/8IMRT/8IMRT.html
Hexahedral mesh generation using the embedded Voronoi graph, SheEtzRap-IMR-98, http://www.andrew.cmu.edu/user/sowen/abstracts/Sh595.html
Simultaneous refinement and coarsening adaptive meshing with moving boundaries, LiTenUng-IMR-98, http://www.andrew.cmu.edu/user/sowen/abstracts/Li583.html
An approach to combined Laplacian and optimization-based smoothing for triangular, quadrilateral, and quad-dominant meshes, CanTriSta-IMR-98, http://www.andrew.cmu.edu/user/sowen/abstracts/Ca513.html
Fully dynamic planarity testing with applications, GalItaSar-JACM-99, http://www.acm.org/pubs/citations/journals/jacm/1999-46-1/p28-galil/
Robotic Manipulation for Parts Transfer and Orienting: Mechanics, Planning, and Shape Uncertainty, Ake-PhD-96, http://www.ri.cmu.edu/pub_files/pub1/akella_srinivas_1996_1/akella_srinivas_1996_1.pdf
Ununfoldable polyhedra with triangular faces, BerDemEpp-WCG-99, http://www.cs.jhu.edu/~cgc/abstracts99/old/eric.uptf.ps
An optimal algorithm for hyperplane depth in the plane, LanSte-WCG-99, http://www.cs.jhu.edu/~cgc/abstracts99/stefan.ps
Regression depth and center points, AmeBerEpp-CGC-98, http://www.cs.brown.edu/cgc/cgc98/final/final9.pdf
Geometric Data Structures and Applications, Ram-PhD-98, http://www.cs.jhu.edu/~kumar/thesis/thesis.html
There Are Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs, Sub-TR-95, ftp://ftp.cs.brown.edu/pub/techreports/95/cs95-04.ps.Z
Manipulating algebraic parts in the plane, GolRao-TRA-95, http://ford.ieor.berkeley.edu/~goldberg/pubs/algebraic.ps.gz
Randomized parallel algorithms for the homing sequence problem, RavXio-ICPP-96, http://homepage.cs.uri.edu/faculty/ravikumar/icpp.ps
Oriented matroids today, Zie-EJC-98, http://www.combinatorics.org/Surveys/ds4.pdf
A multivariate two-sample test using the Voronoi diagram, DwySqu-TR-93, ftp://ftp.csc.ncsu.edu/pub/tech/93/TR-93-21.ps.Z
Efficient Parallel Algorithms for Closest Point Problems, Su-TR-94, ftp://ftp.cs.duke.edu/pub/dist/techreport/1994/1994-22.ps.Z
Analysis of a class of $k$-dimensional merge procedures, with an application to 2D Delaunay triangulation in expected linear time after two-directional sorting, LemMor-CCCG-97, http://www.dgp.toronto.edu/cccg/cccg97/papers/44/44.html
Connectivity of planar graphs, FraOss-TR-99, http://www.ehess.fr/centres/cams/papers/173.ps.gz
Faster finding of simple cycles in planar graphs on a randomized EREW PRAM, DorWir-WRPC-97, http://www.cis.ufl.edu/~raj/pap2.ps
A simple linear time algorithm for embedding maximal planar graphs, Sta-TR-93, ftp://www.informatik.uni-bonn.de/pub/paper/tr/IAI-TR-93-10.ps.gz
A note on improving the running time of a class of parallel algorithms using randomization, DorWir-TR-96, http://cs.uni-bonn.de/info5/publications/abstract/85159-cs.abstract-en.html
Characterization and recognition of point-halfspace and related orders, TanGooSch-GD-94, http://ftp.arl.mil/~pjt/publications/gd94.ps
Generalized LMT-skeleton heuristics for several new classes of optimal triangulations, DaiKat-TR-98, ftp://ftp.is.titech.ac.jp/pub/tech-reports/B/B-344.ps.gz
Real-time hidden-line elimination for a rotating polyhedral scene using the aspect representation, PlaDyeSea-GI-90, http://www.ccel.wheaton.edu/~whp/papers/an-rot.ps.gz
Hierarchical visibility in terrains, Ste-EGRW-97, http://www.dgp.toronto.edu/people/JamesStewart/papers/egwr97.html
Navigating through triangle meshes implemented as linear quadtrees, LeeSam-TR-98, http://www.cfar.umd.edu./ftp/TRs/CVL-Reports-1998/TR3900-lee.ps.gz
Min-max-boundary domain decomposition, KiwSpiTen-COCOON-98, http://www.dim.uchile.cl/~mkiwi/publications/kss-cocoon98-abs.html
Quadtree decomposition, Steiner triangulation, and ray shooting, CheLee-TR-98, http://www.cs.ust.hk/tcsc/RR/1998-09.ps.gz
Parallelization methods for a characteristic's pressure correction scheme, BlaBorDra-TR-96, http://www.uni-paderborn.de/SFB376/techreports/abstract028.html
Grid and geometry techniques for multi-layer process simulation, SahDutNoe-SISDEP-93, http://www-tcad.stanford.edu/tcad/pubs/sahul/sisdep93.ps.Z
Routing in LEO-based satellite networks., GouPraAbu-ETWCS-99, http://www.utdallas.edu/~ravip/papers/ets99.satellite.ps
Conceptual level design for assembly analysis using state transitional approach, HsuLimLee-CRA-96, http://www.iscs.nus.edu.sg/~whsu/publication/raconf96.ps
Low-cost fault-tolerant spanning graphs for point sets in the Euclidean plane, NarSteWid-TR-97a, ftp://ftp.inf.ethz.ch/pub/publications/tech-reports/2xx/262.ps.gz
Splitting a complex of convex polytopes in any dimension, BajPas-SCG-96, http://www.cs.purdue.edu/homes/pascucci/ps-definitivi/SoCG96.ps.gz
Interactive Rendering of Parametric Spline Surfaces, Kum-TR-96-039, ftp://ftp.cs.unc.edu/pub/publications/techreports/96-039.ps.Z
Combining hierarchical radiosity and discontinuity meshing, LisTamGre-SIGGRAPH-93, http://www.cs.huji.ac.il/~danix/papers/s93paper.ps.gz
Construction of a human torso model from magnetic resonance images for problems in computational electrocardiography, MacJohErs-TR-94, http://www.cs.utah.edu/sci/publications/tr-mridoc.ps.Z
Anisotropic mesh generation with particles, Bos-TR-96, http://www.cs.cmu.edu/afs/cs/user/ph/www/bossen.letter.ps.gz
Finite volume methods on Voronoi meshes, Mic-TR-96-09, http://www.isc.tamu.edu/iscpubs/9609.ps
Visual grid quality assessment for 3D unstructured meshes, Hai-AIAA-93, http://raphael.mit.edu/visual3/cfd93.ps
Drawing nice projections of objects in space, BosGomRam-JVCIR-99, http://www.scs.carleton.ca/~jit/publications/papers/regular.ps.gz
Repairing CAD models, BarKum-Vis-97, ftp://condor.cs.jhu.edu/pub/barequet/papers/unv-vis97.ps.gz
RSVP: a geometric toolkit for controlled repair of solid models, BarDunKum-TVCG-98, http://www.cgc.cs.jhu.edu/~cduncan/papers/unv-tvcg.ps.gz
DCEL: a polyhedral database and programming environment, Bar-IJCGA-98, ftp://condor.cs.jhu.edu/pub/barequet/papers/dcl-ijcga.ps.gz
Incremental Computation: A Semantics-Based Systematic Transformational Approach, Liu-PhD-95, ftp://ftp.cs.cornell.edu/pub/yanhong/Thesis-TR95.ps.Z
Asymptotic theory of greedy approximations to minimal $K$-point random graphs, HerMit-TIT-99, ftp://ftp.eecs.umich.edu/people/hero/Preprints/it98_final_draft.ps.Z
Stochastic methods in global illumination – state of the art report, Szi-TR-98, http://www.cg.tuwien.ac.at/research/TR/98/TR-186-2-98-23Abstract.html
Analysis of the quasi-Monte Carlo integration of the rendering equation, SziPur-TR-98, http://www.cg.tuwien.ac.at/research/TR/98/TR-186-2-98-24Abstract.html
New results on the old $k$-opt algorithm for the TSP, ChaKarTov-SODA-94, ftp://ftp.cs.umd.edu/pub/faculty/khuller/858/howard.ps
SIFFEA: scalable integrated framework for finite element method, JiaLiMa-ISCOPE-99, http://www.cse.uiuc.edu/~xli2/paper/iscope99.ps.gz
An efficient multi-path forwarding method, CheDruSub-INFOCOM-98, http://www.cs.rice.edu/~druschel/infocom98.ps.gz
Enhanced hypertext categorization using hyperlinks, ChaDomInd-SIGMOD-98, http://www.almaden.ibm.com/cs/k53/irpapers/sigmod98.ps
Vertex cover: further observations and further improvements, CheKanJia-WG-99, http://www.cs.tamu.edu/faculty/chen/wg.ps
Circuit evaluation: thoughts on a killer application in DNA computing, OgiRay-CwBM-98, http://www.cs.rochester.edu/u/ogihara/research/DNA/new-review.pdf.gz
Executing parallel logical operations with DNA, OgiRay-CEC-99, http://www.cs.rochester.edu/u/ogihara/research/DNA/cec.pdf.gz
An efficient exact algorithm for constraint bipartite vertex cover, FerNie-TR-99, http://www-fs.informatik.uni-tuebingen.de/~niedermr/publications/cbvc.ps.Z
Constrained square center problems, KatKedSeg-SWAT-98, http://www.cs.cornell.edu/kedem/papers/Const-cgta-submit.ps
Improved Laplacian smoothing of noisy surface meshes, VolMenMul-TR-99, ftp://ls7-ftp.cs.uni-dortmund.de/pub/reports/ls7/1999/rr-711.ps.gz
One-Pass Delaunay filtering for homeomorphic 3D surface reconstruction, AmeCho-TR-99, http://net.cs.utexas.edu/users/amenta/pubs/filter.ps.gz
Area optimization of simple polygons, Fek-TR-97, http://www.zpr.Uni-Koeln.DE/~paper/paper.php3?paper=256
Deviation algorithms for ranking shortest paths, MarPasSan-IJFCS-99, http://www.mat.uc.pt/~eqvm/cientificos/investigacao/Artigos/deviation.ps.gz
On the volume of the Minkowski sum of line sets, and the entropy-power inequality, ZamFed-TIT-98, http://www.eng.tau.ac.il/~zamir/papers/bmi.ps.gz
Parallel computing: performance metrics and models, SahTha-TR-96, ftp://ftp.cis.ufl.edu/pub/tech-reports/tr96/tr96-008.ps.Z
Fast randomized parallel methods for planar convex hull construction, GhoGoo-CGTA-97, http://www.cgc.cs.jhu.edu/~goodrich/pubs/inplace.ps
General purpose parallel computing, McC-ALCOM-93, http://users.comlab.ox.ac.uk/oucl/users/bill.mccoll/p2.ps.Z
A case for the PRAM as a standard programmer's model, Vis-WPAEU-93, http://www.umiacs.umd.edu/users/vishkin/PUBLICATIONS/paderborn.ps
Parallel complexity of computations with general and Toeplitz-like matrices Filled with integers and extensions, Pan-TR-99, http://www.msri.org/publications/preprints/online/1999-007.html
Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains, BerMatRag-Algs-98, http://www.math.tau.ac.il/~matias/papers/triply.ps
A survey of parallel search algorithms for discrete optimization problems, GraKum-OJC-95, http://www.cs.purdue.edu/homes/ayg/publications/ps/survey_discrete_opt.ps
Rectilinear Steiner tree minimization on a workstation, ThoAlpCar-CSDM-94, http://www.cs.ucsd.edu/users/carter/Papers/steiner.ps
Process Discovery and Validation through Event-Data Analysis, Coo-TR-96, http://www.cs.nmsu.edu/~jcook/papers/thesistr.ps.gz
Software process validation: quantitatively measuring the correspondence of a process to a model using event-based data, CooWol-TR-96, http://www.cs.nmsu.edu/~jcook/papers/vjournal.ps.gz
Bridging the algorithm gap: A linear-time functional program for paragraph formatting, deMGib-SCP-99, http://users.comlab.ox.ac.uk/oege.demoor/papers/para.ps.gz
Learning the Voronoi centers of a mobile robot's configuration space, VlaPapTsa-ECPD-97, http://carol.wins.uva.nl/~vlassis/publications/papers/ecpd97.ps.gz
Tetrahedral meshes from planar cross sections, BajCoyLin-CMAME-99, http://king.ticam.utexas.edu/CCV/papers/mesh.pdf
A sensory uncertainty field model for unknown and non-stationary mobile robot environments, VlaTsa-ICRA-98, http://carol.wins.uva.nl/~vlassis/publications/papers/icra98.ps.gz
Survey of polygonal surface simplification algorithms, HecGar-TR-97, ftp://ftp.cs.cmu.edu/afs/cs/project/anim/ph/paper/multi97/release/heckbert/simp.pdf
Piecewise linear hypersurfaces using the marching cubes algorithm, RobHil-VDEA-99, http://www.cs.ukc.ac.uk/pubs/1999/700/index.html
Lower Bounds for Fundamental Geometric Problems, Eri-PhD-96, http://compgeom.cs.uiuc.edu/~jeffe/pubs/thesis.html
A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions, GuiHalHir-ICRA-95, http://robotics.stanford.edu/users/assembly/ICRA95-GHHLW.ps.gz
On parallel complexity of planar triangulations, LevLinWan-FSTTCS-95, http://www.dna.lth.se/Research/Algorithms/Papers/andrzej5.ps
Algorithms and data structures for handling a fully flexible refinement approach in mesh generation, Hit-IMR-95, http://www.andrew.cmu.edu/user/sowen/abstracts/Hi181.html
Decremental biconnectivity on planar graphs, LukStr-TR-97, http://www.uni-paderborn.de/~alcom-it/publications/1997/DecBiPlanar.ps.gz
Efficient Data Parallel Implementations of Highly Irregular Problems, Hu-PhD-97, http://www.cs.rice.edu/~ychu/ps/thesis.ps.gz
Decision Support Systems With Multiple Choice Structure, Alt-TR-99, http://www.minet.uni-jena.de/Math-Net/reports/shadows//99-31report.html
Two-handed assembly sequencing, WilKavLat-IJRR-95, http://www.cs.rice.edu/CS/Robotics/papers/2hand.ps.gz
On the number of star-shaped polygons and polyhedra, Ulb-CCCG-99, http://www.cs.ubc.ca/conferences/CCCG/elec_proc/c20.pdf
History consideration in reconstructing polyhedral surfaces from parallel slice, BarShaTal-Vis-96, ftp://ftp.cs.technion.ac.il/pub/barequet/papers/stg-vis96.ps.gz
Fast evaluation of internal loops in RNA secondary structure prediction, LynZukPed-BI-99, http://www.daimi.au.dk/~cstorm/papers/bioinformatics_rna.ps
Internal loops in RNA secondary structure prediction, LynZukPed-RECOMB-99, http://www.daimi.au.dk/~cstorm/papers/recomb99_rna.ps
An improved algorithm for RNA secondary structure prediction, LynZukPed-TR-99, http://www.daimi.au.dk/~cstorm/papers/brics_rna.ps
A monotone finite element scheme for convection-diffusion equations, XuZik-MC-99, http://www.ams.org/jourcgi/jour-pbprocess?fn=110&arg1=S0025-5718-99-01148-5&u=/mcom/1999-68-228/
A fully dynamic algorithm for recognizing and representing proper interval graphs, HelShaSha-ESA-99, http://www.math.tau.ac.il/~roded/dynamic.ps.gz
Immunity and simplicity for exact counting and other counting classes, Rot-TR-98, ftp://ftp.cs.rochester.edu/pub/papers/theory/98.tr679.Immunity_and_simplicity_for_exact_counting_and_other_classes.ps.gz
Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method, HusRau-ICALP-98, http://www.brics.dk/~theis/Publications/icalp98.pdf
Toward accurate recovery of shape from shading under diffuse lighting, SteLan-PAMI-97, http://www.dgp.toronto.edu/people/JamesStewart/papers/pami97.html
A randomized approximation scheme for metric MAX-CUT, FerKen-FOCS-98, http://www.lri.fr/~kenyon/Publis/lalo.ps.gz
TSP-based curve reconstruction in polynomial time, AltMeh-SODA-00, http://www.mpi-sb.mpg.de/~mehlhorn/ftp/TSP-curve.ps
Experiments on curve reconstruction, AltMehNah-ALENEX-00, http://www.mpi-sb.mpg.de/~mehlhorn/ftp/exp-curve.ps
Results on $k$-sets and $j$-facets via continuous motion, AndAroHar-SCG-98, http://www.inf.ethz.ch/personal/andrzeja/my-papers/kset.ps.gz
Halving point sets, AndWel-ICM-98, http://www.inf.ethz.ch/personal/andrzeja/my-papers/Halving-DOCUMENTAMATH.ps.gz
Empirical design of geometric algorithms, WeiBraLie-SCG-99, ftp://ftp.fmi.uni-konstanz.de/pub/preprints/1999/preprint-082.ps.Z
Geometric searching in walkthrough animations with weak spanners in real time, FisLukZie-ESA-98, http://www.uni-paderborn.de/cs/ag-madh/WWW/DFG-SPP/Paper/ESA98FLZ.pdf
Partitioned neighborhood spanners of minimal outdegree, FisLukZie-CCCG-99, http://www.uni-paderborn.de/cs/ag-madh/WWW/DFG-SPP/Paper/CCCG99FLZ_full.pdf
A new approach on solving 3-satisfiability, Rod-AISMC-96, http://www-icparc.doc.ic.ac.uk/papers/a_new_approach_on_solving_3-satisfiabili.ps
Approximating the stretch factor of Euclidean graphs, NarSmi-TR-99, http://www.msci.memphis.edu/~giri/papers/stretchtr.ps
Deciding first-order properties of locally tree-decomposable graphs, FriGro-ICALP-99, http://sunpool.mathematik.uni-freiburg.de/home/grohe/pub/ltree.ps
Hamiltonian triangulations for fast rendering, ArkHelMit-ESA-94, ftp://ams.sunysb.edu/pub/geometry/esa94.ps.gz
A cost/benefit analysis of simplicial mesh improvement techniques as measured by solution efficiency, FreGoo-TR-98, ftp://info.mcs.anl.gov/pub/tech_reports/reports/P722.ps.Z
Theoretical foundations of association rules, ZakOgi-DMKD-98, ftp://ftp.cs.rochester.edu/pub/papers/systems/98.DMKD.Theoretical_foundations_of_association_rules.ps.gz
Scalable algorithms for association mining, Zak-TKDE-00, http://www.cs.rpi.edu/~zaki/PS/TKDE.ps.gz
Regression depth and center points, AmeBerEpp-DCG-00, http://link.springer-ny.com/link/service/journals/00454/bibs/0023003/00230305.html
The deepest regression method, AelRouHub-TR-00, http://win-www.uia.ac.be/u/statis/publicat/deepreg_abstr.html
Application challenges to computational geometry, CGITF-TR-96, http://ncstrl.cs.princeton.edu/expand.php3?id=TR-521-96
Fast hierarchical clustering and other applications of dynamic closest pairs, Epp-JEA-00, http://www.jea.acm.org/2000/EppsteinDynamic/
Clustering for edge-cost minimization, http://citeseer.nj.nec.com/schulman-clustering.html
Gliders in Life-like cellular automata, http://www.ics.uci.edu/~eppstein/ca/
A heuristic approach to program inversion, Epp-IJCAI-85, http://www.ics.uci.edu/~eppstein/pubs/Epp-IJCAI-85.pdf
On the NP-completeness of cryptarithms, Epp-SN-87, http://www.ics.uci.edu/~eppstein/pubs/Epp-SN-87.pdf
Speeding up dynamic programming, EppGalGia-FOCS-88, http://www.ics.uci.edu/~eppstein/pubs/EppGalGia-FOCS-88.pdf
Efficient algorithms for sequence analysis with concave and convex gap costs, Epp-PhD-89, http://www.ics.uci.edu/~eppstein/pubs/Epp-PhD-89.pdf
Sets of points with many halving lines, Epp-TR-92-86, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-86.pdf
The farthest point Delaunay triangulation minimizes angles, Epp-TR-90-45, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-90-45.pdf
Parallel recognition of series parallel graphs, Epp-IC-92, http://www.ics.uci.edu/~eppstein/pubs/Epp-IC-92.pdf
Finding the $k$ smallest spanning trees, Epp-BIT-92, http://www.ics.uci.edu/~eppstein/pubs/Epp-BIT-92.pdf
Polynomial-size non-obtuse triangulation of polygons, BerEpp-IJCGA-92, http://www.ics.uci.edu/~eppstein/pubs/BerEpp-IJCGA-92.pdf
Efficient algorithms for sequence analysis, EppGalGia-IAWS-91, http://www.ics.uci.edu/~eppstein/pubs/EppGalGia-IAWS-91.pdf
Improved bounds for intersecting triangles and halving planes, Epp-TR-91-60, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-91-60.pdf
Connectivity, graph minors, and subgraph multiplicity, Epp-TR-92-06, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-06.pdf
Dynamic three-dimensional linear programming, Epp-TR-91-53, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-91-53.pdf
Persistence, offline algorithms, and space compaction, Epp-TR-91-54, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-91-54.pdf
Approximating the minimum weight Steiner triangulation, Epp-TR-91-55, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-91-55.pdf
Tree-weighted neighbors and geometric $k$ smallest spanning trees, Epp-TR-92-77, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-77.pdf
Arboricity and bipartite subgraph listing algorithms, Epp-TR-94-11, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-11.pdf
Offline algorithms for dynamic minimum spanning tree problems, Epp-TR-92-04, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-04.pdf
Dynamic Euclidean minimum spanning trees and extrema of binary functions, Epp-DCG-95, http://www.ics.uci.edu/~eppstein/pubs/Epp-DCG-95.pdf
Dynamic algorithms for half-space reporting, proximity problems, and geometric minimum spanning trees, AgaEppMat-FOCS-92, http://www.ics.uci.edu/~eppstein/pubs/AgaEppMat-FOCS-92.pdf
Asymptotic speed-ups in constructive solid geometry, Epp-TR-92-87, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-87.pdf
Mesh generation and optimal triangulation, BerEpp-CEG-95, http://www.ics.uci.edu/~eppstein/pubs/BerEpp-CEG-95.pdf
Improved sparsification, EppGalIta-TR-93, http://www.ics.uci.edu/~eppstein/pubs/EppGalIta-TR-93-20.pdf
Algorithms for proximity problems in higher dimensions, DicEpp-CGTA-96, http://dx.doi.org/10.1016/0925-7721(95)00009-7
Faster circle packing with application to nonobtuse triangulation, Epp-TR-94-33, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-33.pdf
Worst-case bounds for subadditive geometric graphs, BerEpp-SCG-93, http://www.ics.uci.edu/~eppstein/pubs/BerEpp-SCG-93.pdf
Finding the $k$ shortest paths, Epp-TR-94-26, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-26.pdf
Finding the $k$ shortest paths, Epp-SJC-98, http://dx.doi.org/10.1137/S0097539795290477
Dihedral bounds for mesh generation in high dimensions, BerCheEpp-SODA-95, http://www.ics.uci.edu/~eppstein/pubs/BerCheEpp-SODA-95.pdf
Subgraph isomorphism in planar graphs and related problems, Epp-TR-94-25, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-94-25.pdf
The diameter of nearest neighbor graphs, Epp-TR-92-76, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-76.pdf
Faster geometric $k$-point MST approximation, Epp-TR-95-13, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-95-13.pdf
Representing all minimum spanning trees with applications to counting and generation, Epp-TR-95-50, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-95-50.pdf
Linear complexity hexahedral mesh generation, Epp-TR-95-51, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-95-51.pdf
Linear complexity hexahedral mesh generation, Epp-SCG-96, http://www.ics.uci.edu/~eppstein/pubs/Epp-SCG-96.pdf
Finding common ancestors and disjoint paths in DAGs, Epp-TR-95-52, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-95-52.pdf
Zonohedra and zonotopes, Epp-TR-95-53, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-95-53.pdf
On nearest neighbor graphs, EppPatYao-DCG-97, http://www.ics.uci.edu/~eppstein/pubs/EppPatYao-DCG-97.pdf
Faster construction of planar two-centers, Epp-TR-96-12, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-96-12.pdf
Faster construction of planar two-centers, Epp-SODA-97, http://www.ics.uci.edu/~eppstein/pubs/Epp-SODA-97.pdf
Dynamic connectivity in digital images, Epp-TR-96-13, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-96-13.pdf
Beta-skeletons have unbounded dilation, Epp-TR-96-15, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-96-15.pdf
Spanning trees and spanners, Epp-TR-96-16, http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-96-16.pdf
Optimal point placement for mesh smoothing, AmeBerEpp-SODA-97, http://www.ics.uci.edu/~eppstein/pubs/AmeBerEpp-SODA-97.pdf
Quadrilateral meshing by circle packing, BerEpp-IMR-97, http://www.ics.uci.edu/~eppstein/pubs/BerEpp-MRT-97.pdf
Fast hierarchical clustering and other applications of dynamic closest pairs, Epp-SODA-98, http://www.ics.uci.edu/~eppstein/pubs/Epp-SODA-98.pdf
Parametric and kinetic minimum spanning trees, AgaEppGui-FOCS-98, http://www.ics.uci.edu/~eppstein/pubs/AgaEppGui-FOCS-98.pdf
Multivariate regression depth, BerEpp-SCG-00, http://www.ics.uci.edu/~eppstein/pubs/BerEpp-SCG-00.pdf
Aspects of sensitivity analysis for the traveling salesman problem, vdP-PhD-97, http://www.ub.rug.nl/eldoc/dis/eco/e.s.van.der.poort/
Dealing with additional constraints in the $k$-shortest path problem, TakBorLoe-WM-00, http://www.cs.chalmers.se/~ilya/WM2000/proceedings.html
Finding the $k$ shortest paths in parallel, Rup-Algo-00, http://link.springer-ny.com/link/service/journals/00453/contents/00/10038/
Dynamically switching vertices in planar graphs, FriIta-Algo-00, http://link.springer-ny.com/link/service/journals/00453/contents/00/10032/
One-dimensional peg solitaire, and duotaire, EppMoo-TR-00, http://www.santafe.edu/sfi/publications/Abstracts/00-09-050abs.html
Upper bound on the products of particle interactions in cellular automata, HorShaCru-TR-00, http://www.santafe.edu/sfi/publications/Abstracts/00-09-052abs.html
Folding and cutting paper, DemDemLub-JDCG-98, http://daisy.uwaterloo.ca/~eddemain/papers/JCDCG98
Ununfoldable polyhedra, BerDemEpp-TR-99, ftp://cs-archive.uwaterloo.ca/cs-archive/CS-99-09/
Three untetrahedralizable objects, http://www.ics.uci.edu/~eppstein/junkyard/untetra/
Automated metabolic reconstruction at the molecular level, Ari-GIW-98, http://www.genome.ad.jp/manuscripts/GIW98/Poster/GIW98P22.pdf
Finding precursor compounds in secondary metabolism, AriAsaNis-GIW-99, http://www.jsbi.org/journal/GIW99/GIW99F12.pdf
Graph modeling of metabolism, AriAsaNis-RECOMB-00, http://recomb2000.ims.u-tokyo.ac.jp/Posters/pdf/84.pdf
Unstructured mesh generation: Theory, practice, and perspectives, TenWon-IJCGA-00, http://www-sal.cs.uiuc.edu/~steng/mesh97_changed.ps
Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices, BarShaTal-VC-00, http://link.springer.de/link/service/journals/00371/bibs/0016002/00160116.htm
Implementation and experimental evaluation of graph connectivity algorithms using LEDA, FatSpiZar-WAE-99, http://citeseer.nj.nec.com/fatourou-implementation.html
Computing the $K$ shortest paths: A new algorithm and an experimental comparison, JimMar-WAE-99, http://terra.act.uji.es/REA/papers/wae99.ps.gz
Minimal tetrahedralizations of a class of polyhedra, YanWan-CCCG-00, http://www.cs.unb.ca/conf/cccg/eProceedings/32.ps.gz
Spanners in $l_1$, CacGriMar-CCCG-00, http://www.cs.unb.ca/conf/cccg/eProceedings/23.ps.gz
Finding $k$-closest-pairs efficiently for high dimensional data , LopLia-CCCG-00, http://www.cs.unb.ca/conf/cccg/eProceedings/29.ps.gz
Enumerating triangulation paths, DumGaePed-CCCG-00, http://www.cs.unb.ca/conf/cccg/eProceedings/10.ps.gz
Orienting polyhedral parts by pushing, BerOveSta-TR-00, ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-2000/2000-21.ps.gz
Surface triangulation: a survey, Kum-TR-96-011, ftp://ftp.cs.unc.edu/pub/publications/techreports/96-011.ps.Z
Algorithms for Graphs of Small Treewidth, Flu-PhD-97, http://pablo.ubu.ruu.nl/~proefsch/01847381/inhoud.htm
Incremental and decremental maintenance of planar width, Epp-Algs-00, http://dx.doi.org/10.1006/jagm.2000.1107
A $K$-best paths algorithm for highly reliable communication networks, LeeWu-IEICE-99, http://citeseer.nj.nec.com/lee99kbest.html
New Results on Geometric Spanners and Their Applications, Luk-PhD-99, http://wwwhni.upb.de/~tamas/thesis.ps.gz
Lipschitzian crowded ball packings and Delaunay spheres, BisMor-TR-96, http://www.emse.fr/ECOLE/FRENCH/SIMADE/LISSE/PUBLIS/PS/1993-1996/bm-tr-1996.14.ps.gz
Curve reconstruction in arbitrary dimension and the traveling salesman problem, Gie-DGCI-99, http://www.inf.ethz.ch/personal/giesen/dgci.ps.gz
On the planar two-watchtower problem, WanZhu-WCG-00, http://www.ams.sunysb.edu/~jsbm/cgworkshop-papers/034.ps.gz
On the reflexivity of point sets, ArkFekHur-WCG-00, http://www.ams.sunysb.edu/~jsbm/cgworkshop-papers/030.ps.gz
Efficient computation of proximity graphs, HurLioMei-WCG-00, http://www.ams.sunysb.edu/~jsbm/cgworkshop-papers/020.ps.gz
Dynamic graph algorithms, EppGalIta-ATCH-99, http://www.info.uniroma2.it/~italiano/Papers/dyn-survey.ps.Z
AUTOCLUST: Automatic clustering via boundary extraction for mining massive point-data sets, EstLee-TR-00, ftp://ftp.cs.newcastle.edu.au/pub/techreports/tr2000-03.ps.Z
Force-directed methods for smoothing unstructured triangular and tetrahedral meshes, Dji-IMR-00, http://www.andrew.cmu.edu/user/sowen/abstracts/Dj763.html
Spacing control and sliver-free Delaunay mesh, Li-IMR-00, http://www.andrew.cmu.edu/user/sowen/abstracts/Li754.html
Hexahedral mesh generation for the simulation of the human mandible, KobMue-IMR-00, http://www.andrew.cmu.edu/user/sowen/abstracts/Ko765.html
Local approach to dynamic visibility in the plane, NecTob-WSCG-99, http://wscg.zcu.cz/wscg99/papers/G23-final.ps.gz
Fast horizon computation at all points of a terrain with visibility and shading applications, Ste-VCG-98, http://citeseer.nj.nec.com/stewart98fast.html
Some Computations on Beta-Skeletons, Rao-PhD-98, http://www.cse.iitk.ac.in/research/phd/svrao.html
Kinetic Data Structures, Bas-PhD-99, http://graphics.stanford.EDU/~jbasch/publications/phdthesis/
Straight skeletons for general polygonal figures in the plane, AicAur-VIMS-98, http://www.cis.tugraz.at/igi/oaich/psfiles/aa-ssgpf-98.ps.gz
Deformable free space tilings for kinetic collision detection, AgaBasGui-WAFR-00, http://citeseer.nj.nec.com/agarwal00deformable.html
Kinetic collision detection between simple polygons, BasEriGui-SODA-99, http://compgeom.cs.uiuc.edu/~jeffe/pubs/cdsimple.html
Approximate quality mesh generation based on small edge details, SimHitRiv-IMR-00, http://www.andrew.cmu.edu/user/sowen/abstracts/Si764.html
Tessellations of cuboids with Steiner points, HirNavFar-IMR-00, http://www.andrew.cmu.edu/user/sowen/abstracts/Hi752.html
Static and kinetic geometric spanners with applications, KarGui-SODA-01, http://graphics.stanford.edu/~menelaos/myweb/papers/spanners.pdf
Experimental results on quadrangulations of sets of fixed points, BosRamTou-TR-00, http://cgm.cs.mcgill.ca/~godfried/publications/quadsexp.ps.gz
Multigrid Equation Solvers for Large Scale Nonlinear Finite Element Simulations, Ada-PhD-98, http://www.cs.berkeley.edu/~madams/adams_dissertation.ps.gz
Randomized point sampling for output-sensitive rendering of complex dynamic scenes, WanFisMey-TR-00-217, http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/DFG-SPP/Paper/TR-ri-00-217.pdf
Image-consistent surface triangulation, MorKan-CVPR-00, http://www.ri.cmu.edu/pub_files/pub2/morris_daniel_2000_1/morris_daniel_2000_1.pdf
Top-trees and dynamic graph algorithms, HolLic-TR-98, http://www.diku.dk/research/published/98-17.ps.gz
Design and performance of convergence routing on multiple spanning trees, YenOfeYun-CN-99, http://www.bell-labs.com/user/yener/PAPERS/comnet99V31.ps
An experimental study of polylogarithmic fully-dynamic connectivity algorithms, IyeKarRah-ALENEX-00, http://www.cs.unm.edu/Conferences/ALENEX00/iyer.ps
Experiments with computing geometric minimum spanning trees, NarZhuZac-ALENEX-00, http://www.cs.unm.edu/Conferences/ALENEX00/giri.ps
Improved algorithms for point placement, Sub-TR-96, http://www.cs.umd.edu/~ksmani/public/cad1.ps
The translation-scale diagram for point-containing placements of a convex polygon, BarDic-CCCG-00, http://www.cs.unb.ca/conf/cccg/eProceedings/20.ps.gz
Cell probe complexity — a survey, Mil-ADS-99, http://www.daimi.au.dk/~bromille/Papers/survey3.ps
Efficiency by incrementalization: an introduction, Liu-HOSC-00, ftp://ftp.cs.indiana.edu/pub/liu/IncEff-HOSC00.ps
Mesh Generation for Technology CAD in Three Dimensions, Fle-PhD-99, http://www.iue.tuwien.ac.at/diss/fleischmann/diss_new/diss.html
The universal resolving algorithm: Inverse computation in a functional language, AbrGlu-MPC-00, ftp://ftp.diku.dk/diku/semantics/papers/D-425.ps.gz
Efficient optimistic parallel simulations using reverse computation, CarPerFuj-TOMACS-99, http://www.cc.gatech.edu/computing/pads/PAPERS/rc-tomacs-2000.ps
Efficient optimistic parallel simulations using reverse computation, CarPerFuj-PADS-99, http://www.cc.gatech.edu/computing/pads/PAPERS/rc-pads99.pdf
Techniques for Efficient Parallel Simulation and their Application to Large-scale Telecommunication Network Models, Per-PhD-99, http://www.cc.gatech.edu/computing/pads/PAPERS/kalyan-phd-thesis.ps.Z
Dynamic Load Balancing For Parallel Adaptive Mesh Refinement, Li-MS-99, http://www.cse.uiuc.edu/~xli2/thesis/msthesis.ps.gz
Dynamic load balancing for parallel adaptive mesh refinement{}, LiTen-IRREG-98, http://www.cse.uiuc.edu/~xli2/paper/Conf/LoadBalan-irregular98.ps.gz
Sliver-Free Three-Dimensional Delaunay Mesh Generation, Li-TR-00, http://www.cs.uiuc.edu/Dienst/UI/2.0/Describe/ncstrl.uiuc_cs/UIUCDCS-R-2000-2176
Efficient expected-case algorithms for planar point location, AryCheMou-SWAT-00, http://www.cs.ust.hk/faculty/arya/pub/swat.ps
Zufall und Quasi-Monte Carlo Ans�tze: Einige Anmerkungen zu Grundlagen und Anwendungen in Statistik und �konometrie, WinFan-JNOS-99, http://www.vwl.uni-mannheim.de/franz/Mitarbeiter/qumc06.ps
The expected extremes in a Delaunay triangulation, BerEppYao-IJCGA-91, http://www.ics.uci.edu/~eppstein/pubs/BerEppYao-IJCGA-91.pdf
Upper bounds for MaxSat: Further improved, BanRam-ISAAC-99, http://www.cs.cmu.edu/~nikhil/maxsat.ps.gz
Equipartitions of graphs, EppFeiLi-DM-91, http://dx.doi.org/10.1016/0012-365X(90)90233-8
Finding minimum area $k$-gons, EppOveRot-DCG-92, http://www.ics.uci.edu/~eppstein/pubs/EppOveRot-DCG-92.pdf
Simultaneous strong separations of probabilistic and unambiguous complexity classes, EppHemTis-MST-92, http://www.ics.uci.edu/~eppstein/pubs/EppHemTis-MST-92.pdf
Triangulating polygons without large angles, BerDobEpp-IJCGA-95, http://www.ics.uci.edu/~eppstein/pubs/BerDobEpp-IJCGA-95.ps.gz
On triangulating three-dimensional polygons, BarDicEpp-CGTA-98, http://dx.doi.org/10.1016/S0925-7721(98)00005-4
The crust and the $\beta$-skeleton: combinatorial curve reconstruction, AmeBerEpp-GMIP-98, http://www.cs.utexas.edu/users/amenta/pubs/crust.ps.gz
Using sparsification for parametric minimum spanning tree problems, FerSluEpp-SWAT-96, http://www.ics.uci.edu/~eppstein/pubs/FerSluEpp-SWAT-96.ps.gz
Using sparsification for parametric minimum spanning tree problems, FerSluEpp-NJC-96, http://www.ics.uci.edu/~eppstein/pubs/FerSluEpp-NJC-96.pdf
On levels in arrangements of curves, Cha-FOCS-00, http://www.cs.uwaterloo.ca/~tmchan/curve_focs.ps.gz
A deterministic linear time algorithm for geometric separators and its applications, EppMilTen-SCG-93, http://www.acm.org/pubs/citations/proceedings/compgeom/160985/p99-eppstein/
A deterministic linear time algorithm for geometric separators and its applications, EppMilTen-FI-95, http://www.ics.uci.edu/~eppstein/pubs/EppMilTen-FI-95.ps.gz
A disk-packing algorithm for an origami magic trick, BerDemEpp-Fun-98, http://www.ics.uci.edu/~eppstein/pubs/BerDemEpp-Fun-98.ps.gz
Seeing conserved signals: Using algorithms to detect similarities between biosequences, Mye-NAS-95, http://books.nap.edu/books/0309048869/html/56.html
Parallel neighborhood modelling, HutLanMah-AGIS-96, http://www.cs.duke.edu/~hutchins/nemo_ACMGIS96.ps.gz
Asymptotic theory of greedy approximations to minimal $K$-point random graphs, HerMic-TR-98, http://www.eecs.umich.edu/techreports/systems/cspl/cspl-315.ps.gz
Resource-constrained geometric network optimization, ArkMitNar-SCG-98, http://citeseer.nj.nec.com/6954.html
Approximation algorithms for the bottleneck stretch factor problem, NarSmi-TR-00, http://isgwww.cs.uni-magdeburg.de/~michiel/bottleneck.ps.gz
Implementation of dynamic trees with in-subtree operations, Rad-TR-98, http://www.dcs.kcl.ac.uk/staff/radzik/dt_techrep.ps
Implementations of dynamic tree collections based on splay trees, Rad-WAE-97, http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap2.ps.gz
Surface parameterization for meshing by triangulation flattening, ShedeS-IMR-00, http://www.andrew.cmu.edu/user/sowen/abstracts/Sh742.html
Surface parameterization for meshing by triangulation flattening, ShedeS-TR-00b, http://www-faculty.cs.uiuc.edu/~sturler/surface-par.ps
Parameterization of CAD surfaces for meshing by triangulation flattening, ShedeS-TR-00a, http://www-faculty.cs.uiuc.edu/~sturler/par-cad.ps
Metrics for image retrieval by colour content, Pes-TR-98, http://citeseer.nj.nec.com/pestov98metric.html
Approximation of geometric dispersion problems, BauFek-APPROX-98, http://www.zpr.uni-koeln.de/~paper/paper.php3?paper=296
Connectivity compression for irregular quadrilateral meshes, KinRosSzm-TR-99, http://www.gvu.gatech.edu/~jarek/papers/quads.pdf
Numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains, BarSet-JCP-98, http://www.math.berkeley.edu/~sethian/Papers/sethian.barth.ps.gz
Approximation of staircases by staircases, Smi-TR-92, http://citeseer.nj.nec.com/smith92approximation.html
A global minimization-based, automatic quadrilateral meshing algorithm, WolJunDoh-IMR-98, http://www.andrew.cmu.edu/user/sowen/abstracts/Wo575.html
Planarizing graphs — a survey and annotated bibliography, Lie-JGAA-01, http://www.cs.brown.edu/publications/jgaa/accepted/01/Liebers01.5.1.pdf
Implicit and nonparametric shape reconstruction from unorganized data using a variational level set method , ZhaOshMer-TR-98, ftp://ftp.math.ucla.edu/pub/camreport/cam98-7.ps.gz
Space efficient algorithms for series-parallel graphs, JakLisRei-TR-00, http://www.tcs.mu-luebeck.de/Forschung/A0017.ps
Approximating uniform triangular meshes in polygons, AurKatKoj-COCOON-00, http://www.jkh.vc-graz.ac.at/igi/auren/psfiles/akkox-autmp-00b.pdf
Optimal triangulations, AurXu-EO-99, http://www.jkh.vc-graz.ac.at/igi/auren/psfiles/ax-ot-99.ps.gz
An experimental study of dynamic algorithms for transitive closure, GriMilNan-TR-00, http://www.ceid.upatras.gr/faculty/zaro/pub/CTI-TR-2000-08-03.ps.gz
Diameter and treewidth in minor-closed graph families, Epp-Algo-00, http://dx.doi.org/10.1007/s004530010020
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time, NikReiSpi-ICALP-95, http://citeseer.nj.nec.com/nikoletseas95stochastic.html
A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, BarSim-TR-92, http://www.nas.nasa.gov/Pubs/TechReports/RNRreports/sbarnard/RNR-92-033/RNR-92-033.html
One strike against the min-max degree triangulation problem�, Jan-CGTA-93, http://www.informatik.uni-kiel.de/inf/Jansen/kj/triangul93.ps.gz
On computing new classes of optimal triangulations with angular constraints, DaiKat-COCOON-98, http://www.is.titech.ac.jp/~dai/ratioCo.ps
Parallel algorithms for series parallel graphs and graphs with treewidth two, BodFlu-Algo-01, http://link.springer-ny.com/link/service/journals/00453/contents/00/10070/
Managing large terrain data sets with a multiresolution structure, MagBer-ASDM-00, http://citeseer.nj.nec.com/magillo00managing.html
Experimental analysis of dynamic algorithms for the single-source shortest path problem, FriIofNan-JEA-98, http://www.jea.acm.org/1998/FrigioniDynamic/
Integer-coordinate crystalline meshes, ChaPre-Swiss-99, http://ftp.cs.brown.edu/people/vc/paperswiss.ps
Introduction to integer-coordinate crystalline meshes, ChaPre-TR-99, http://ftp.cs.brown.edu/people/vc/fullpaper.ps
Linear-time reconstruction of Delaunay triangulations with applications, SnoKre-ESA-97, http://citeseer.nj.nec.com/195365.html
Simplification Envelopes, CohVarMan-TR-96, ftp://ftp.cs.unc.edu/pub/technical-reports/96-017.ps.Z
Fast horizon computation for accurate terrain rendering, Ste-TR-96, http://citeseer.nj.nec.com/428946.html
Interactive sensor planning, StaAl-CVPR-98, http://citeseer.nj.nec.com/stamos98interactive.html
Intervisibility on terrains, DeFMag-GIS-99, http://citeseer.nj.nec.com/351023.html
Efficient Hidden-Surface Removal in Theory and in Practice , Mur-PhD-98, http://robotics.stanford.edu/~murali/papers/thesis/
Algorithms for SAT and upper bounds on their complexity, DanHirIva-ECCC-01, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2001/TR01-012/index.html
Computational complexity of games and puzzles, http://www.ics.uci.edu/~eppstein/cgt/hard.html
Parallel algorithms for finite automata problems, Rav-IPPS-98, http://citeseer.nj.nec.com/374523.html
The CCCG 2001 logo, DemDemLub-CCCG-01, http://compgeo.math.uwaterloo.ca/~cccg01/proceedings/short/eddemaine-67778.ps
Reaching folded states of a rectangular piece of paper, DemMit-CCCG-01, http://compgeo.math.uwaterloo.ca/~cccg01/proceedings/short/eddemaine-33029.ps
Approximating the shortest path in line arrangements, Har-CCCG-01, http://compgeo.math.uwaterloo.ca/~cccg01/proceedings/short/dhart-59460.ps
Tiling 3D Euclidean space with acute tetrahedra, Ung-CCCG-01, http://compgeo.math.uwaterloo.ca/~cccg01/proceedings/short/ungor-50788.ps
Efficient large-scale sequence comparison by locality-sensitive hashing, Buh-BI-01, http://www.cs.wustl.edu/~jbuhler/research/buhler-lsh-all-pairs.pdf
Geometric thickness in a grid of linear area, Woo-COMB-01, http://www.cs.usyd.edu.au/~davidw/papers/Wood-COMB01.ps
Fast approximation schemes for $K_{3,3}$-minor-free or $K_5$-minor-free graphs, HajNisRag-COMB-01, http://plg.uwaterloo.ca/~plragde/papers/minorfree_COMB.ps
Smallest color-spanning objects, AbeHurIck-TR-01, http://wwwpi6.fernuni-hagen.de/Publikationen/tr283.pdf
A*Prune: An algorithm for finding $K$ shortest paths subject to multiple constraints, LiuRam-INFOCOM-01, http://www.ieee-infocom.org/2001/paper/199.ps
Selective flooding for improved quality-of-service routing, ClaKan-TR-01, ftp://ftp.cs.wpi.edu/pub/techreports/01-12.ps.gz
Detecting boundaries for surface reconstruction using co-cones, DeyGieLee-IJCGCC-01, http://www.cis.ohio-state.edu/~tamaldey/paper/boundary/boundary.pdf.gz
Computing and Comprehending Topology: Persistence and Hierarchical Morse Complexes, Zom-PhD-01, http://graphics.stanford.edu/~afra/thesis.html
Computing and Comprehending Topology: Persistence and Hierarchical Morse Complexes, Zom-TR-01, http://www.cs.uiuc.edu/Dienst/UI/2.0/Describe/ncstrl.uiuc_cs/UIUCDCS-R-2001-2240
A meta-algorithm for the generation of referring expressions, KraErkVer-EWNLG-01, http://acl.ldc.upenn.edu/W/W01/W01-0805.pdf
Fast approximation schemes for $K_{3,3}$-minor-free or $K_5$-minor-free graphs, HajNisRaf-ENDM-01, http://www.elsevier.com/gej-ng/31/29/24/49/27/63/endm10038.ps
Geometric thickness in a grid of linear area, Woo-ENDM-01, http://www.elsevier.com/gej-ng/31/29/24/49/27/97/endm10073.ps
Polyhedron man, Pet-SN-01, http://www.sciencenews.org/20011222/bob13.asp
Small strictly convex quadrilateral meshes of point sets, BreHurRam-ISAAC-01, http://hpc.rutgers.edu/~rsuneeta/research/quadran.ps.gz
Regular and non-regular point sets: Properties and reconstruction, PetBoy-CGTA-01, http://www.loria.fr/~petitjea/Publis/cgta01.pdf
Orienting micro-scale parts with squeeze and roll primitives, MolGolErd-ICRA-02, http://www-2.cs.cmu.edu/~mmoll/publications/micromanip.pdf
An expert system for analyzing firewall rules, EroZit-NordSec-01, http://www.cs.hut.fi/~peronen/publications/nordsec_2001.pdf
Computing a high depth point in the plane, LanSte-ICORS-01, http://cgm.cs.mcgill.ca/~sl/papers/icors01full.ps
Graph partitioning algorithms for distributing workloads of parallel computations, Cha-TR-98, http://www.cs.washington.edu/homes/brad/cv/pubs/degree/generals.html
Fast software for box intersection, ZomEde-SCG-00, http://graphics.stanford.edu/~afra/papers/socg00/socg2000.ps.gz
3-colorability $\in\cal{P}$ for $P_6$-free graphs, RanSch-TR-01, http://rutcor.rutgers.edu/pub/rrr/reports2001/39.ps
Time and space efficient multi-method dispatching, AlsBroGoe-TR-01, http://www.it-c.dk/people/stephen/Papers/ITU-TR-2001-8.pdf
Optimally cutting a surface into a disk, EriHar-SCG-02, http://compgeom.cs.uiuc.edu/~jeffe/pubs/schema.html
Seventeen proofs of Euler's formula: $V-E+F=2$, http://www.ics.uci.edu/~eppstein/junkyard/euler/
On Computing Geometric Estimators of Location, Alo-MS-01, http://cgm.cs.mcgill.ca/~athens/G_A_thesis.ps.gz
Epsilon-cutset effect on iterative belief propagation, BidDec-TR-01, http://www1.ics.uci.edu/~bbidyuk/bntr01.ps
Soft kinetic data structures, CzuSoh-SODA-01, http://www.cis.njit.edu/~czumaj/PUBLICATIONS/SODA2001.ps.gz
Sensing, tracking, and reasoning with relations, Gui-SPM-02, http://www.parc.xerox.com/spl/projects/cosense/pub/ieee_spm_guibas.pdf
Geometric spanner for routing in mobile networks, GaoGuiHer-MobiHoc-01, http://www.db.stanford.edu/~anzhu/routing.ps
Fast surface reconstruction and deformation using the level set method, ZhaOshFed-VLSM-01, http://math.uci.edu/~zhao/publication/mypapers/pdf/surface2.pdf
Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms, 2001, Fun-PhD-01, http://www.mpi-sb.mpg.de/~funke/DISS_A4_FinalPrint.pdf
Revised version of ”Efficient Cross-Trees for External Memory“, GroIta-TR-00, ftp://ftp.di.unipi.it/pub/techreports/TR-00-16.ps.Z
Qualitative visualization of distance information, Hei-PP-01, http://www-ifm.math.uni-hannover.de/~heitzig/visual.pdf
Dynamic subgraph connectivity with geometric applications , Cha-STOC-02, http://www.cs.uwaterloo.ca/~tmchan/conn_stoc.ps.gz
Static versus dynamic establishment of protection paths in WDM networks, AnaQia-JHSN-01, http://www.cs.buffalo.edu/~vanand/paper/jhsn.ps
Fully dynamic maintenance of $k$-connectivity in parallel, LiaBreShe-TPDS-01, http://cs.anu.edu.au/people/Weifa.Liang/papers/parallel.pdf
Natural neighbor coordinates of points on a surface, BoiCaz-CGTA-01, http://www-sop.inria.fr/prisme/personnel/cazals/papers/cgta01-NatNeeighCoordsPtsSurf.ps.gz
A polynomial time approximation scheme for the problem of interconnecting highways, CheKimLu-JCO-01, http://www-users.cs.umn.edu/~cheng/JobApp/Papers/highway.pdf
Polygon decomposition for efficient construction of Minkowski sums, AgaFlaHal-CGTA-02, http://www.cs.tau.ac.il/~flato/DecompJur/decompjur.ps.gz
Robust and Efficient Construction of Planar Minkowski Sums, Fla-MS-00, http://www.cs.tau.ac.il/~flato/thesis/
On the number of maximal independent sets in a graph, Nie-TR-02, http://www.brics.dk/RS/02/15/
Dynamic rectilinear point location using hashing, Iac-CGC-01, http://geometry.poly.edu/cgwpapers/john_pl.ps
Shelling hexahedral complexes for mesh generation, Mue-JGAA-01, http://www.cs.brown.edu/publications/jgaa/accepted/01/deFraysseixOssonadeMendez01.5.5.pdf
On the number of maximal bipartite subgraphs of a graph, MadNieSkj-TR-02, http://www.brics.dk/RS/02/17/
On sampling and reconstructing surfaces with boundaries, Gop-CCCG-02, http://www.cs.uleth.ca/~wismath/cccg/papers/19.ps
A near-quadratic algorithm for the alpha-connected two-center decision problem, HuaTsaTan-CCCG-02, http://www.cs.uleth.ca/~wismath/cccg/papers/36.ps
Constructing differentiable homeomorphisms between isomorphic triangulations, CriSou-CCCG-02, http://www.cs.uleth.ca/~wismath/cccg/papers/13.ps
Open problems from CCCG 2001, DemORo-CCCG-02, http://www.cs.uleth.ca/~wismath/cccg/papers/open.pdf
Sur le Calcul et la Majoration de la Discr�pance � l'Origine, Thi-PhD-00, http://rosowww.epfl.ch/et/these.html
Frozen development in graph coloring, CulGen-TR-00, http://www.dcs.st-and.ac.uk/~apes/reports/apes-19.ps.gz
One-dimensional Phutball, GroNow-MSRI-02, http://www.msri.org/publications/books/Book42/files/grossman.pdf
Phutball endgames are hard, DemDemEpp-MSRI-02, http://www.msri.org/publications/books/Book42/files/dephut.pdf
One-dimensional peg solitaire, and duotaire, MooEpp-MSRI-02, http://www.msri.org/publications/books/Book42/files/moore.pdf
Searching for spaceships, Epp-MSRI-02, http://www.msri.org/publications/books/Book42/files/eppstein.pdf
Global optimization of mesh quality, Epp-IMR-01, http://www.ics.uci.edu/~eppstein/pubs/Epp-IMR-01.pdf
Acute square triangulation, Epp-acute-square, http://www.ics.uci.edu/~eppstein/junkyard/acute-square/
Building space-time meshes over arbitrary spatial domains, EriGuoSul-IMR-01, http://www.andrew.cmu.edu/user/sowen/abstracts/Er876.html
Fully incremental 3d Delaunay refinement mesh generation, MilPavWal-IMR-02, http://www.andrew.cmu.edu/user/sowen/abstracts/Mi851.html
Parallel Delaunay refinement: algorithms and analyses, SpiTenUng-IMR-02, http://www.andrew.cmu.edu/user/sowen/abstracts/Sp860.html
Conformal refinement of all-quadrilateral and all-hexahedral meshes according to an anisotropic metric, TchDomCam-IMR-02, http://www.andrew.cmu.edu/user/sowen/abstracts/Tc862.html
ETREE — a database oriented method for generating large octree meshes, TuOHaLop-IMR-02, http://www.andrew.cmu.edu/user/sowen/abstracts/Tu879.html
Finding the $k$ shortest simple paths: a new algorithm and its implementation, HerMaxSur-ALENEX-03, http://www.siam.org/meetings/alenex03/Abstracts/jhershberger.pdf
Practical construction of metric $t$-spanners, NavPar-ALENEX-03, http://www.siam.org/meetings/alenex03/Abstracts/gnavarro.pdf
On the threshold, Hay-AS-03, http://www.americanscientist.org/Issues/Comsci03/2003-01Hayes.pdf
Map Labeling Problems, Itu-PhD-99, http://www.cs.unb.ca/profs/citurria/Research/final-thesis.ps
Approximating geometric bottleneck shortest paths, BosMahNar-STACS-03, http://www.scs.carleton.ca/~michiel/airport.ps.gz
Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles, BieChaDem-CCCG-02, http://www.cs.uleth.ca/~wismath/cccg/papers/C95.ps
Semiring frameworks and algorithms for shortest-distance problems, Moh-JALC-02, http://www.research.att.com/~mohri/postscript/jalc.ps
$K$ shortest paths and other “$K$ best” problems, http://www.ics.uci.edu/~eppstein/bibs/kpath.bib
LAGAN and Multi-LAGAN: Efficient tools for large-scale multiple alignment of genomic DNA, BruDoCoo-GR-03, http://lagan.stanford.edu/mlagan_gr.pdf
On halving line arrangements, BeyRad-DM-02, http://www.cs.rit.edu/~spr/PUBL/paper41.pdf
On the difficulty of some shortest path problems, HerSurBho-STACS-03, http://www.cs.ucsb.edu/~bhosle/publications/stacs03.pdf
Local search algorithms for the $k$-cardinality tree problem, BluEhr-TR-01, http://iridia.ulb.ac.be/~cblum/downloads/techrep-12-01.pdf
Local search algorithms for the $k$-cardinality tree problem, BluEhr-TR-99, http://iridia.ulb.ac.be/~cblum/downloads/gelb_48.pdf
Edge distributed admission control in MPLS networks, BosMamManUba-CL-03, http://www.coritel.it/publications/IP_download/CL2002-616.pdf
Colouring random graphs in expected polynomial time, CojTar-STACS-03, http://www.informatik.hu-berlin.de/~taraz/paper/col.ps
A enumera��o dos $K$ trajectos mais curtos, Pas-IO-00, http://www.mat.uc.pt/~marta/Publicacoes/faro.ps.gz
A new improvement for a $K$ shortest paths algorithm, MarPasSan-IO-01, http://www.mat.uc.pt/~marta/Publicacoes/ms_improved.ps.gz
Graph Algorithms for Complex Networks, Wan-PhD-03, http://www.ics.uci.edu/~eppstein/pubs/notmine/Wan-PhD-03.ps.gz
Fold-and-cut magic, Pet-SN-02, http://www.sciencenews.org/20021130/mathtrek.asp
A particle-partition of unity method II: Efficient cover construction and reliable integration, GriSch-SJSC-02, http://wissrech.iam.uni-bonn.de/research/pub/schweitz/particle-pum-partII.pdf
3-SAT $\in RTIME(O(1.32793^n))$: Improving randomized local search by initializing strings of 3-clauses, Rol-ECCC-03, http://www.eccc.uni-trier.de/eccc-reports/2003/TR03-054/index.html
A mesh warping algorithm based on weighted Laplacian smoothing, ShoVav-IMR-03, http://www.imr.sandia.gov/papers/imr12/shontz03.pdf
BSP-assisted constrained tetrahedralization, JosOur-IMR-03, http://www.imr.sandia.gov/papers/imr12/joshi03.pdf
Topology modification of hexahedral meshes using atomic dual-based operations, TauKno-IMR-03, http://www.imr.sandia.gov/papers/imr12/tautges03.pdf
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard, Cab-TR-03, http://www.cs.uu.nl/research/techreps/UU-CS-2003-031.html
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard, Cab-EWCG-04, http://www.us.es/ewcg04/Articulos/cabello.ps
Optimal spanners for axis-aligned rectangles, AsaBerChe-EWCG-04, http://www.us.es/ewcg04/Articulos/haverkort.ps
Geometric dilation of closed planar curves: a new lower bound, EbbGruKle-EWCG-04, http://www.us.es/ewcg04/Articulos/Ebbers-baumann.ps
Region inter-visibility in terrains, KreMoeOos-EWCG-04, http://www.us.es/ewcg04/Articulos/oostrum-t.ps
Supporting cuts and finite element deformation in interactive surgery simulation, NieSta-TR-01, http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-2001/2001-16.pdf
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio, ChePoo-TR-02, http://www.cs.ust.hk/tcsc/RR/2002-07.ps.gz
The randomized z-buffer algorithm: interactive rendering of highly complex scenes, WanFisPet-SIGGRAPH-01, http://www.cg.cs.tu-bs.de/v3d2/pubs.collection/Wand-2001-TheRandomized.pdf
Dynamic visibility in the plane, NecTob-SCCG-99, http://fractal.dam.fmph.uniba.sk/~sccg/proceedings/1999/nechvile.ps.gz
Uninscribable 4-regular polyhedron, EppDil-EGM-03, http://www.eg-models.de/2003.08.001/
Short path queries in planar graphs in constant time, KowKur-STOC-03, http://portal.acm.org/citation.cfm?id=780565
The minimum expectation selection problem, EppLue-RSA-02, http://dx.doi.org/10.1002/rsa.10061
Consequences of stratified sampling in graphics, Mit-CGIT-96, http://portal.acm.org/citation.cfm?id=237265
Traversals of object structures: specification and efficient implementation, LiePatOrl-TOPLAS-04, http://portal.acm.org/citation.cfm?id=973102
Mobile facility location, BesBhaKir-MOBILE-00, http://portal.acm.org/citation.cfm?id=345858
Spatiotemporal multicast in sensor networks, HuaLuRom-ENSS-03, http://portal.acm.org/citation.cfm?id=958516
On local algorithms for topology control and routing in ad hoc networks, JiaRamSch-SPAA-03, http://portal.acm.org/citation.cfm?id=777447
Approximating and intersecting surfaces from points, AdaAle-GP-03, http://portal.acm.org/citation.cfm?id=882401
Efficient extraction of mapping rules of atoms from enzymatic reaction data, Aku-RECOMB-03, http://portal.acm.org/citation.cfm?id=640076
Power efficient encoding techniques for off-chip data buses, SurAgrYan-CASES-03, http://portal.acm.org/citation.cfm?id=951745
The cable trench problem:�combining the shortest path and minimum spanning tree problems, VasBarRie-COR-02, http://portal.acm.org/citation.cfm?id=586406
Shortest path along an MST, Epp-ct-99, http://groups.google.com/groups?threadm=14098.38770.666234.83882@euclid.ics.uci.edu
Free-form shape design using triangulated surfaces, WelWit-SIGGRAPH-94, http://portal.acm.org/citation.cfm?id=192216
Bounded aspect ratio triangulation of smooth solids, MooWar-SMA-91, http://portal.acm.org/citation.cfm?id=112580
Clustering spatial data using random walks, HarKor-KDD-01, http://portal.acm.org/citation.cfm?id=502552
Minimax parametric optimization problems and multi-dimensional parametric searching, Tok-STOC-01, http://portal.acm.org/citation.cfm?id=380777
BANANAS:�an evolutionary framework for explicit and multipath routing in the internet, KauKalWei-CCR-03, http://portal.acm.org/citation.cfm?id=972426.944766
Grid generation and optimization based on centroidal Voronoi tessellations, DuGun-AMC-02, http://portal.acm.org/citation.cfm?id=635179
Approximation and Geometric Processing of Digital Images with Adaptive Triangular Meshes, Vin-PhD-00, http://www.tdx.cesca.es/TESIS_UPC/AVAILABLE/TDX-0322101-183542/
A segmentation system with model assisted completion of video objects, FarWitEff-VCIM-03, http://www.informatik.uni-mannheim.de/informatik/pi4/publications/library/Farin2003c.pdf
Algorithms for Graphs of (Locally) Bounded Treewidth, Haj-MS-01, http://www-math.mit.edu/~hajiagha/thesis.pdf
An efficient algorithm for the $N$-best-strings problem, MohRil-ICSLP-02, http://www.research.att.com/~mohri/postscript/nbest.ps
Geometric Shape Matching and Drug Design, Ven-PhD-99, http://www.research.att.com/~suresh/Papers/thesis.pdf
Shortest paths in two intersecting pencils of lines, Har-CCCG-03, http://torch.cs.dal.ca/~cccg/papers/48.pdf
Hinged dissection of polygons is hard, HeaDemFre-CCCG-03, http://torch.cs.dal.ca/~cccg/papers/45.pdf
Equiprojective polyhedra, HasLub-CCCG-03, http://torch.cs.dal.ca/~cccg/papers/33.pdf
The Geometry Junkyard: Zonohedra, http://www.ics.uci.edu/~eppstein/junkyard/zono.html
Coloring objects built from bricks, GalORo-CCCG-03, http://torch.cs.dal.ca/~cccg/papers/25.pdf
An algorithm for the maxmin area triangulation of a convex polygon, KeiVas-CCCG-03, http://torch.cs.dal.ca/~cccg/papers/19.pdf
On shortest paths in line arrangements, KavVar-CCCG-03, http://torch.cs.dal.ca/~cccg/papers/17.pdf
The spanning ratio of $\beta$-skeletons, WanLiMoa-CCCG-03, http://torch.cs.dal.ca/~cccg/papers/7.pdf
Sparse LCS common substring alignment, LanSchZiv-IPL-03, http://dx.doi.org/10.1016/j.ipl.2003.09.006
Efficient parallel algorithms on restartable fail-stop processors, KanShv-PODC-91, http://portal.acm.org/citation.cfm?id=112603
Towards practical deteministic write-all algorithms, ChlDobKow-SPAA-01, http://portal.acm.org/citation.cfm?id=378685
In-place techniques for parallel convex hull algorithms, GhoGoo-SPAA-91, http://portal.acm.org/citation.cfm?id=113397
Sparse normalized local alignment, EfrLan-CPM-04, http://cs.haifa.ac.il/~landau/gadi/Nadav.pdf
An algorithmic study of manufacturing paperclips and other folded structures, ArkFekMit-CGTA-03, http://dx.doi.org/10.1016/S0925-7721(02)00133-5
Fast and scalable conflict detection for packet classifiers, BabVar-JCTN-03, http://dx.doi.org/10.1016/S1389-1286(03)00213-5
Algorithms for quantified Boolean formulas, Wil-SODA-02, http://portal.acm.org/citation.cfm?id=545421
Finding approximate shape regularities in reverse engineered solid models bounded by simple surfaces, LanMilMar-SMA-01, http://portal.acm.org/citation.cfm?id=376981
Filling holes in meshes, Lie-GP-03, http://portal.acm.org/citation.cfm?id=882397
Computational geometry column 42, MitORo-SIGACT-01, http://portal.acm.org/citation.cfm?id=500562
Fully dynamic shortest paths in digraphs with arbitrary arc weights, FriMarNan-Algs-03, http://dx.doi.org/10.1016/S0196-6774(03)00082-8
Automatisches Generieren von Wanderrouten, CziWin-AGI-02, ftp://ftp.geoinfo.tuwien.ac.at/winter/cziferszky02automatisches.pdf
Route specifications with a linear dual graph, Win-ASDH-02, ftp://ftp.geoinfo.tuwien.ac.at/winter/winter02route.pdf
Optimal graph orientation with storage applications, AicAurRot-TR-95, http://www.cis.tugraz.at/igi/oaich/publications/postscript/paper-13a.ps
Learnability and definability in trees and similar structures, GroTur-STACS-02, http://www.informatik.hu-berlin.de/~grohe/pub/vc.ps
Orienting parts by inside-out pulling, BerGolOve-ICRA-01, http://www.cs.unc.edu/~berretty/pulling_icra.ps
Multiple path QoS routing, JiaNikGbu-ICC-01, http://www.cs.ualberta.ca/~pawel/PAPERS/icc01.ps
Alternative paths vs. inaccurate link state information in realistic network topologies, JiaNikGbu-SPECTS-02, http://www.cs.ualberta.ca/~pawel/PAPERS/spects02.pdf
Qualitative link state dissemination control in QoS routing, JiaNikGbu-IC-02, http://www.cs.ualberta.ca/~pawel/PAPERS/ic02.pdf
Algorithms for Language Reconstruction, Kon-PhD-02, http://www.cs.ualberta.ca/~kondrak/thesis.ps
Phonetic alignment and similarity, Kon-CH-03, http://www.cs.ualberta.ca/~kondrak/chum.pdf
Determining the number of solutions to binary CSP instances, AngJonLin-PPCP-02, http://www.ida.liu.se/~olaan/papers/counting_solutions.ps
Fast internet packet filtering on any number of attributes via multi-dimensional point stabbing, Pel-TR-01, http://www.imc.pi.cnr.it/~pellegrini/papiri/tr-hyperboxstabbing.ps
It is tough to be a plumber, KraMajSga-KD-02, http://kam.mff.cuni.cz/~kamserie/serie/clanky/2002/s563.ps
It is tough to be a plumber, KraMajSga-ITI-02, http://iti.mff.cuni.cz/series/files/iti061ps.zip
The Computational Measure of Uniformity, Li-FSU-00, http://www.cs.fsu.edu/research/reports/TR-000704.ps
Larger than Life: digital creatures in a family of two-dimensional cellular automata, Eva-DMCCG-01, http://dmtcs.loria.fr/proceedings/html/dmAA0113.abs.html
The resolution complexity of random graph $k$-colorability, BeaCulMit-ECCC-04, http://eccc.uni-trier.de/eccc-reports/2004/TR04-012/
A near-quadratic algorithm for fence design, AgaBerCol-WAFR-02, http://math.stanford.edu/~collins/pubs/fence2wafr.pdf
Configuration Spaces in Robotic Manipulation and Motion Planning, Col-PhD-02, http://math.stanford.edu/~collins/pubs/annethesis.pdf
Computing topological adjacency relations between iso-contours, HuaZha-QR-00, http://www2.parc.com/spl/members/zhao/papers/qr00.ps
Graph-based generation of referring expressions, KraErkVer-CL-03, http://fdlwww.kub.nl/~krahmer/Pubs/krahmer-02-revised.ps
Optimal tetrahedralizations of some convex polyhedra, WanYan-EWCG-00, http://www.cs.bgu.ac.il/~cg2000/PS/17.ps
The $\lambda$-complex and surface reconstruction, AdaGieJoh-EWCG-00, http://www.cs.bgu.ac.il/~cg2000/PS/31.ps
The cost of balancing generalized quadtrees, Moo-SMA-95, http://portal.acm.org/citation.cfm?id=218078
Using PRAM algorithms on a uniform-memory-access shared-memory architecture, BadIllMor-WAE-01, http://www.cs.unm.edu/~moret/bimw_wae.pdf
Fixed-parameter algorithms for minor-closed graphs (of locally bounded treewidth), DemHaj-TR-03-fpa, http://www.lcs.mit.edu/publications/specpub.php?id=1687
An efficient data structure for advance bandwidth reservations on the internet, BroNil-CSEE-02, http://www.sm.luth.se/~andreas/publications/symp-CSEE2002.pdf
Recent developments in linear-space alignment methods: a survey, ChaHarMil-JCB-94, http://www.csie.ntu.edu.tw/~kmchao/papers/survey/survey.ps
Efficient computation of gap-weighted string kernels on large alphabets , RouSha-LMTUM-04, http://www.pascal-network.org/workshops/lmtum/programme/fv15.ps
Approximation algorithms for maximum two-dimensional pattern matching, AriDesLin-TR-01, http://www.ccs.lanl.gov/ccs5/documents/ps/2001/LA-UR-01-2527.ps
Adaptive contour sampling and coding using skeleton and curvature, JaiGhaMel-ICIP-00, http://www-rp.lip6.fr/~ghamri/icip2000.ps
Enumerating triangulations of convex polytopes, Bes-DMCCG-01, http://dmtcs.loria.fr/proceedings/html/dmAA0107.abs.html
Space efficient algorithms for directed series-parallel graphs, JakLisRei-ECCC-02, http://eccc.uni-trier.de/eccc-reports/2002/TR02-021/
Polynomial-time approximation schemes for metric min-sum median clustering, FerKarKen-ECCC-02, http://eccc.uni-trier.de/eccc-reports/2002/TR02-025/
An algorithm for fully reversible optimistic parallel simulation, PetCar-WSC-03, http://www.cs.rpi.edu/~chrisc/publications/peters-wsc-2003.html
Fully dynamic algorithms for bounded genus graphs, HenIbaKin-TR-97, http://facweb.cs.depaul.edu/ibarra/papers/genus.ps
Easy Instances for Model Checking, Fri-PhD-01, http://www.dcs.ed.ac.uk/home/mfrick/frickprints/diss.pdf
On levels in arrangements of curves, II: a simple inequality and its consequences, Cha-FOCS-03, http://www.math.uwaterloo.ca/~tmchan/ii_focs.pdf
Short cycles in planar graphs, Kow-WG-03, http://www.mimuw.edu.pl/~kowalik/papers/cycles.pdf
Solipsis: a massively multi-participant virtual world, KelSim-PDPTA-03, http://www.irisa.fr/adept/membres/gwendal/pdpta03-kellerSimon.pdf
Looking for a common view for mobile worlds, GraRaySim-FTDCS-03, http://www.irisa.fr/adept/membres/gwendal/ftdcs03.pdf
Axisymmetric dynamical models for SAURON and OASIS observations of NGC 3377, CopCreEms-AA-04, http://dx.doi.org/10.1051/0004-6361:20034076
Dynamic capacitated minimum spanning trees, JotRag-ICN-04, http://www.utdallas.edu/~raja/Pub/dcmst.pdf
Bidimensional parameters and local treewidth, DemFomHaj-LATIN-04, http://www.lsi.upc.es/~sedthilk/papers/morelocal.pdf
Dominating sets and local treewidth, FomThi-ESA-03, http://www.lsi.upc.es/~sedthilk/papers/localtw.pdf
A simple and fast approach for solving problems on planar graphs, FomThi-STACS-04, http://www.lsi.upc.es/~sedthilk/papers/planar.pdf
Fixed-parameter algorithms for the $(k,r)$-center in planar graphs and map graphs, DemFomHaj-ICALP-03, http://www.lsi.upc.es/~sedthilk/papers/mapgraph.pdf
1.5-Approximation for treewidth of graphs excluding a graph with one crossing as a minor, DemHajThi-APPROX-02, http://www.lsi.upc.es/~sedthilk/papers/single.pdf
Low-dimensional linear programming with violations, Cha-FOCS-02, http://www.math.uwaterloo.ca/~tmchan/vio_focs.pdf
Application of the local nonobtuse tetrahedral refinement techniques near Fichera-like corners, BeiKorKri-TR-03, http://www.phi.chalmers.se/pub/preprints/ps/phiprint-2003-02.ps
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs, AlbFia-TCS-02, http://kam.mff.cuni.cz/~fiala/papers/fpt-indep.ps
Chordal embeddings of planar graphs, BouMazTod-TR-01, http://www.univ-orleans.fr/SCIENCES/LIFO/prodsci/rapports/RR/RR2001/RR-2001-03.ps.gz
An impossibility theorem for clustering, Kle-NIPS-02, http://www.cs.cornell.edu/home/kleinber/nips15.ps
Topology control and routing in ad hoc networks: a survey, Raj-SN-02, http://www.ccs.neu.edu/home/rraj/Pubs/adhocSurvey.ps
Exponential speedup of fixed parameter algorithms on graphs excluding a graph with one crossing as a minor, DemHajThi-TR-02, http://www.lcs.mit.edu/publications/specpub.php?id=1611
Small induced-universal graphs and compact implicit graph representations, AlsRau-FOCS-02, http://www.itu.dk/people/theis/Publications/rauhet_induced.pdf
Effective rule induction from molecular structures represented by labeled graphs, HocHorWro-FGML-03, http://kd.cs.uni-magdeburg.de/~hoche/hocheHorvathWrobel_FGML03_crv.ps
Effective rule induction from molecular structures represented by labeled graphs, HocHorWro-MGTS-03, http://www.ar.sanken.osaka-u.ac.jp/~washio/list/3.pdf
Efficient parallel algorithms for manipulating sorted sets, Kat-ACSC-94, http://www.diku.dk/hjemmesider/ansatte/jyrki/Paper/ACSC94.ps
A note on maximum independent sets in rectangle intersection graphs, Cha-IPL-04, http://www.math.uwaterloo.ca/~tmchan/rect.pdf
Untangling mapped quadrilateral meshes with concave boundaries, FrePla-TR-01, ftp://info.mcs.anl.gov/pub/tech_reports/reports/P920.ps.Z
Complexity, appeal and challenges of combinatorial games, Fra-TCS-04, http://www.wisdom.weizmann.ac.il/~fraenkel/Papers/caa.ps
On the approximation ratio of the MST-based heuristic for the energy-efficient Broadcast problem in static ad-hoc radio networks, CleHuiRos-IPDS-03, http://axp.mat.uniroma2.it/~rossig/papers/wman2003.pdf
A Worst-case Analysis of a MST-based Heuristic to Construct Energy-efficient Broadcast Subtrees in Wireless Networks, CleCrePen-TR-01, http://www.mat.uniroma2.it/~penna/papers/stacs01-TR.ps.gz
Generating surface geometry in higher dimensions using local cell tilers, HilRob-TR-98, http://www.cs.kent.ac.uk/pubs/1998/577/
List detection for multi-access channels, ReiGraAle-GLOBECOM-02, http://www.itr.unisa.edu.au/itrusers/areid/public_html/publications/globecom2002.pdf
List detection for symmetric multi-access channels, ReiGraAle-ACTW-02, http://www.itr.unisa.edu.au/itrusers/areid/public_html/publications/ausctw2002.pdf
Optimal Delaunay triangulations, CheXu-JCM-04, http://www.cc.ac.cn/~jcm/2004-2/XJC.ps
Improved approximation of maximum planar subgraph, Zel-TR-96, http://alla.cs.gsu.edu/~alexz/postscript/cactus.ps
Gradual abstract proof search, Caz-ICGA-02, http://www.ai.univ-paris8.fr/~cazenave/gaps.pdf
Recherche s�lective et g�n�ration automatique de programmes, Caz-Hab-03, http://www.ai.univ-paris8.fr/~cazenave/habil.pdf
The farthest point Delaunay triangulation minimizes angles, Epp-CGTA-92, http://dx.doi.org/10.1016/S0925-7721(98)00031-5
Arboricity and bipartite subgraph listing algorithms, Epp-IPL-94, http://dx.doi.org/10.1016/0020-0190(94)90121-X
Offline algorithms for dynamic minimum spanning tree problems, Epp-Algs-94, http://dx.doi.org/10.1006/jagm.1994.1033
Sparsification — A technique for speeding up dynamic graph algorithms, EppGalIta-JACM-97, http://doi.acm.org/10.1145/265910.265914
Separator based sparsification I: planarity testing and minimum spanning trees, EppGalIta-JCSS-96, http://dx.doi.org/10.1006/jcss.1996.0002
Separator based sparsification II: edge and vertex connectivity, EppGalIta-SJC-99, http://dx.doi.org/10.1137/S0097539794269072
Average case analysis of dynamic geometric optimization, Epp-CGTA-96, http://dx.doi.org/10.1016/0925-7721(95)00018-6
Minimum range balanced cuts via dynamic subset sums, Epp-Algs-97, http://dx.doi.org/10.1006/jagm.1996.0841
Choosing subsets with maximum weighted average, EppHir-Algs-97, http://dx.doi.org/10.1006/jagm.1996.0849
Beta-skeletons have unbounded dilation, Epp-CGTA-02, http://dx.doi.org/10.1016/S0925-7721(01)00055-4
Optimal point placement for mesh smoothing, AmeBerEpp-Algs-99, http://dx.doi.org/10.1006/jagm.1998.0984
Setting parameters by example, Epp-SJC-03, http://dx.doi.org/10.1137/S0097539700370084
Ununfoldable polyhedra with convex faces, BerDemEpp-CGTA-03, http://dx.doi.org/10.1016/S0925-7721(02)00091-3
Tiling space and slabs with acute tetrahedra, EppSulUng-CGTA-04, http://dx.doi.org/10.1016/j.comgeo.2003.11.003
Identifying common connected components of graphs, GaiHabPau-TR-03, http://www.lirmm.fr/bibli/Document.htm&numrec=031975368915710
PHAROAH, a Beam Search Decoder for Phrase-Based Statistical Machine Translation Models: User Manual and Description, Koe-ISI-03, http://www.isi.edu/licensed-sw/pharaoh/manual.ps
Noun Phrase Translation, Koe-PhD-03, http://www.isi.edu/~koehn/publications/thesis-readable.ps
Generation and Comparison of Constraint-Based Heuristics Using the Structure of Constraints, Rod-PhD-97, http://www.icparc.ic.ac.uk/papers/robert-thesis.ps
Fault tolerance and load balancing in QoS provisioning with multiple MPLS paths, LeeGer-IWQoS-01, http://www.cs.ucla.edu/NRL/hpi/papers/2001-iwqos-0.ps
Recognition of user-defined video object models using weighted graph homomorphisms , FarWitEff-IVCP-03, http://www.spie.org/scripts/abstract.pl?bibcode=2003SPIE.5022..542F
A fast expected time algorithm for the point pattern matching problem, WamLiIye-TR-99, http://www.math.lsu.edu/~preprint/1999/pvw19991.pdf
Drawing planar graphs symmetrically III: one-connected planar graphs, HonEad-TR-01-III, http://www.cs.usyd.edu.au/~shhong/one.ps
Drawing planar graphs symmetrically I: triconnected planar graphs, HonEad-TR-01-I, http://www.cs.usyd.edu.au/~shhong/tri.ps
Drawing planar graphs symmetrically II: biconnected planar graphs, HonEad-TR-01-II, http://www.cs.usyd.edu.au/~shhong/bi.ps
Estimating the weight of metric minimum spanning trees in sublinear-time, CzuSoh-STOC-04, http://www.cis.njit.edu/~czumaj/PUBLICATIONS/STOC-2004-Proceedings.html
The long-time behaviour of the thermoconvective flow in a porous medium, EfeFuhZel-TR-00, http://www.wias-berlin.de/publications/preprints/547/
On the efficiency of nearest neighbor searching with data Clustered in lower dimensions, ManMou-ICCS-01, http://www.cs.umd.edu/~mount/Papers/iccs01.ps
On the efficiency of nearest neighbor searching with data Clustered in lower dimensions, ManMou-TR-01, http://www.cs.umd.edu/~mount/Papers/kflat.ps
Users Manual for OPt-MS: Local Methods for Simplicial Mesh Smoothing and Untangling, Fre-ANL-99, http://www-unix.mcs.anl.gov/~freitag/Opt-MS/manual.ps
Users Manual for OPt-MS: Local Methods for Simplicial Mesh Smoothing and Untangling, Fre-TR-99, ftp://info.mcs.anl.gov/pub/tech_reports/reports/TM239.ps.Z
Computational geometry and statistical depth measures, RafSou-TARRM-04, http://www.cs.tufts.edu/r/geometry/data_depth/geom_ICORS.pdf
Proximity and Applications in General Metrics, Cal-PhD-98, http://pages.cpsc.ucalgary.ca/~marina/thesis/thesis.html
Gradient superconvergence on uniform simplicial partitions of polytopes , BraKri-IMANA-03, http://staff.science.uva.nl/~brandts/UVANUM/PREPS/UN05.ps
An existential locality theorem, GroWoe-CSL-01, http://www-i7.informatik.rwth-aachen.de/download/papers/woehrle/grwo01b.pdf
An existential locality theorem, GroWoe-TR-01, http://www-i7.informatik.rwth-aachen.de/download/papers/woehrle/grwo01.ps
Fixed-parameter algorithms for the $(k,r)$-center in planar graphs and map graphs, DemFomHaj-TR-03, http://www.ii.uib.no/publikasjoner/texrap/ps/2003-245.ps
Finite Volume and Finite Volume Element Methods for Nonsymmetric Problems, Mic-TR-96-04, http://www.isc.tamu.edu/iscpubs/9604.ps
Multi-constrained optimal path selection, KorKru-INFOCOM-01, http://www.ieee-infocom.org/2001/paper/126.ps
Motion planning for knot untangling, LadKav-TR-02, http://cs-tr.cs.rice.edu/doc/TR02-400/TR02-400.ps
On-line and dynamic algorithms for shortest path problems, DjiPanZar-Rice-94, http://cs-tr.cs.rice.edu/doc/TR94-224/TR94-224.ps
The objective method: probabilistic combinatorial optimization and local weak convergence, AldSte-PDS-03, http://www-stat.wharton.upenn.edu/~steele/Publications/PDF/OMSurvey.ps
Incremental computation for transformational software development, LiuTei-TR-95, http://historical.ncstrl.org/tr/ps/cornellcs/TR95-1499.ps
Systematic derivation of incremental programs, LiuTei-TR-94, http://historical.ncstrl.org/tr/ps/cornellcs/TR94-1444.ps
Optimal net surface problems with applications, WuChe-ICALP-02, http://www.cs.panam.edu/~xwu/publication/optnet.ps
The Complexities of Puzzles, Cross Sum and their Another Solution Problems (ASP), Set-Thesis-01, http://www-imai.is.s.u-tokyo.ac.jp/~seta/paper/senior_thesis/seniorthesis.ps
Complexity and Completeness of Finding Another Solution and its Application to Puzzles, Yat-MS-03, http://www-imai.is.s.u-tokyo.ac.jp/~yato/data2/MasterThesis.ps
On the NP-completeness of the Slither Link Puzzle, Yat-IPSJSN-00, http://www-imai.is.s.u-tokyo.ac.jp/~yato/data2/SIGAL74-3.pdf
Failure-sensitive analysis of parallel algorithms with controlled memory access concurrency, GeoRusShv-OPODIS-02, http://www.engr.uconn.edu/~cg2/publications/GRS_OPODIS02.ps
A dynamic algorithm for topologically sorting directed acyclic graphs, PeaKel-WEA-04, http://www.doc.ic.ac.uk/~phjk/Publications/DynTopoSortWEA2004.pdf
Multilevel accelerated optimization for problems in grid generation, BerSha-IMR-03, http://www.imr.sandia.gov/papers/imr12/berndt03.pdf
Multilevel accelerated optimization for problems in grid generation, BerSha-TR-03, http://cnls.lanl.gov/~shashkov/papers/ml1_opt.ps
$K$-ary clustering with optimal leaf ordering for gene expression data, BarDemGif-WABI-02, http://www.psrg.lcs.mit.edu/pubs/k-aryWABI.pdf
Optimization system in networks using ACO, CarJesMar-JMDA-02, http://ma1.eii.us.es/Jornadas/trabajos%5Ccardoso.ps
Small point sets whose graph of triangulations is not connected (abridged), San-JMDA-02, http://ma1.eii.us.es/Jornadas/trabajos%5Csantos.ps
On graph problems in a semi-streaming model, FeiKanMcG-TR-03, http://cs-www.cs.yale.edu/homes/jf/tr1262.ps
Traffic engineering techniques and algorithms for the internet, BasKauKal-TR-02, http://www.ecse.rpi.edu/Homepages/shivkuma/research/papers/survey-paper-v3.pdf
Algorithms for normal curves and surfaces, SchSedSte-COCOON-02, http://ovid.cs.depaul.edu/documents/topo.ps
Worst-case analysis, 3-SAT decision and lower bounds: approaches for improved SAT algorithms, Kul-SPTA-97, http://cs-svr1.swan.ac.uk/~csoliver/Artikel/procfin2e.ps
New Results on Combinatorial Algorithms, Dess-PhD-1998, http://www.cs.lth.se/Research/Algorithms/Papers/andersd2.ps
L'espoir est cette chose avec des plumes — Algorithmes combinatoires et biologie mol�culaire, Sag-Hab-00, http://www.inrialpes.fr/helix/people/sagot/hdr/hdr.ps
Causal Architecture, Complexity and Self-Organization for Time Series and Cellular Automata, Sha-PhD-01, http://cscs.umich.edu/~crshalizi/thesis/single-spaced-thesis.ps
Multi-way Graph and Hypergraph Partitioning, Alp-PhD-96, http://vlsicad.cs.ucla.edu/~cheese/papers/thesis.ps
Balanced vertex-orderings of graphs, BieChaGan-TR-02, http://www.scs.carleton.ca/~davidw/papers/BCGHW-TechRep.ps
An incremental Delaunay meshing algorithm, MilPavWal-TR-02, http://www.math.cmu.edu/~nw0z/publications/02-CNA-023/023abs/
Minimum weight Euclidean matching and weighted relative neighborhood graphs, Mir-WADS-93, http://www.cs.yorku.ca/~andy/pubs/Matching.ps
A space-efficient algorithm for aligning large genomic sequences , Mor-BI-00, http://bioinformatics.oupjournals.org/cgi/screenpdf/16/10/948.pdf
A hierarchical approach to aligning collinear regions of genomes, RoyOguSha-BI-02, http://bioinformatics.oupjournals.org/cgi/screenpdf/18/12/1673.pdf
Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes, ChaSmi-ETNA-94, http://etna.mcs.kent.edu/vol.2.1994/pp171-182.dir/pp171-182.html
Appia: formalization of its topology assignment problem, Peh-TR-98, http://www.hpl.hp.com/research/ssp/papers/HPL-SSP-98-12.pdf
Primal/dual spatial relationships and applications, Gol-SDH-00, http://www.voronoi.com/pdfs/2000-2003/Primal_dual_spatial_relationships_and_applications.pdf
Terrain modelling from contours, GolDak-DMG-01, http://www.voronoi.com/pdfs/2000-2003/Terrain_Modelling_from_Contours.pdf
Terrain modelling based on contours and slopes, GolDak-SDH-02, http://www.voronoi.com/pdfs/2000-2003/Terrain_Modelling_Based_on_Contours_and_Slopes.pdf
$C^1$-continuous terrain reconstruction from sparse contours, HorSpiSch-VMV-03, http://www.multires.caltech.edu/pubs/TerrRecon.pdf
Delete and insert operations in Voronoi/Delaunay methods and applications, MosGolDak-CG-03, http://dusk.geo.orst.edu/buffgis/voronoi_2003.pdf
Extracting meaningful slopes from terrain contours, DakGol-ICSS-02, http://www.voronoi.com/pdfs/2000-2003/Extracting_Meaningful_Slopes_from_Terrain_Contours.pdf
Visualizing Terrain Models from Contours — Plausible Ridge, Valley and Slope Estimation, DakGol-VAL-02, http://www.acrors.ait.ac.th/kunming/download/maciej.pdf
Terrain reconstruction from contours by skeleton retraction, ThiGol-GI-00, http://www.voronoi.com/pdfs/1995-1999/Terrain_Reconstruction_from_Contours_by_Skeleton_Retraction.pdf
Map generalization by skeleton retraction, GolThi-ICC-01, http://www.voronoi.com/pdfs/2000-2003/Map_Generalization_by_Skeleton_Retraction.pdf
An algorithmic approach to a marine GIS, Gol-MCGIS-00, http://www.voronoi.com/pdfs/2000-2003/Chapter4_An_Algorithm_Approach_to_a_Marine_GIS.pdf
Distributed optimal admission controllers for service level agreements in interconnected networks, SheAkbMan-ICAI-03, http://panda.csc.uvic.ca/papers/storage/DistOptAC4SLA.pdf
3d terrain mapping: a stochastic approach, LeaSchDis-ACRA-01, http://www.araa.asn.au/acra/acra2001/Papers/Leal.pdf
Lower bounds for dynamic connectivity, PatDem-STOC-04, http://theory.lcs.mit.edu/~edemaine/papers/DynamicConnectivity_STOC2004/
The farthest color Voronoi diagram and related problems, AbeHurIck-EWCG-01, http://wwwpi6.fernuni-hagen.de/publ/ahiklmps-fcvdr-01.pdf
Voronoi diagrams, AurKle-TR-00, http://wwwpi6.fernuni-hagen.de/publ/tr198.pdf
Parametric alignment of multiple biological sequences, ShiIma-GIW-96, http://www.jsbi.org/journal/GIW96/Oral/GIW96O05.pdf
Multibeam data processing: a detailed algorithm to compute (adaptive) triangulations and potential indicators of data quality, Len-THJ-03, http://www.hydrographicsociety.org/PDF/Journal-107-Article1.pdf
Multibeam data processing: data reduction, adaptive triangular meshing and comments resulting from Brouns et al. (THJ No. 101, 2001), Len-THJ-01, http://www.hydrographicsociety.org/Articles/journal/2001/102-3.htm
Improvement of mesh quality using a statistical approach, EgoKojHag-VIIP-03, http://www.mech.titech.ac.jp/~karlson/papers/enh.pdf
Improving back-transliteration by combining information sources, BilTan-IJCNLP-04, http://tanaka-www.cs.titech.ac.jp/publication/archive/289.pdf
Phase unwrapping with GAMMA ISP, WegWerStr-TR-02, http://www.gamma-rs.ch/docs/unwrapping.pdf
Quadrilateral meshes for the registration of human brain images, SiqSunRam-WMACG-03, http://www.seas.upenn.edu/~marcelos/dimacs2003.pdf
A new algorithm for generating quadrilateral meshes and its application to FE-based image registration, RamSiqSun-IMR-03, http://www.seas.upenn.edu/~marcelos/imr2003.pdf
The Resolution Complexity of Constraint Satisfaction, Mit-PhD-02, http://www.cs.sfu.ca/~mitchell/papers/thesis.ps
Algebraic relational approach for geospatial feature correlation, KovSch-CISST-02, http://www.cwu.edu/~borisk/pub/CWUMethod.pdf
Report on the 2nd Web Dynamics Workshop, at WWW2002, LevPou-SIGMOD-02, http://www.dcs.bbk.ac.uk/~ap/pubs/webDyn2Report.pdf
On decreased importance of algorithmic strategies in current ACM curricula for graphics & visual computing, Fer-CGE-02, http://virtual.inesc.pt/cge02/pdfs/ferko.pdf
Autonomous vehicle technologies for small fixed wing UAVs, KinBeaMcL-AIAA-03, http://www.ee.byu.edu/grad1/users/beard/www_docs/papers/preprints/KingstonEtAl03.pdf
Experimental demonstration of multiple robot cooperative target intercept, McLBeaKel-TR-02, http://www.ee.byu.edu/~beard/papers/reprints/McLainBeardKelsey02.pdf
Multiple UAV cooperative search under collision avoidance and limited range communication constraints, BeaMcL-CDC-03, http://www.ee.byu.edu/grad1/users/beard/www_docs/papers/preprints/BeardMcLain03.pdf
Working Group 1: Education, Addendum ‘Publiceren met LaTeX’, vdL-MAPS-92, http://www.ntg.nl/maps/pdf/8_10.pdf
Exact algorithms for computing the locatino depth and the $k$-th depth regions based on parallel arrangement constructions, FukRos-DIMACS-02, http://dimacs.rutgers.edu/Workshops/CompGeom/abstracts/028.pdf
The iron laws of air traffic control, ArnGibHor-UMAP-00, http://www.cwu.edu/~boersmas/mcm/protected/2000A3.pdf
Heesch tiles with surround numbers 3 and 4, Fri-G-99, http://www.stetson.edu/~efriedma/papers/heesch.pdf
Heesch's problem, http://www.ics.uci.edu/~eppstein/junkyard/heesch/
Routing and wavelength assignment in single hop all optical networks with minimum blocking, JauHem-TR-04, http://www.gerad.ca/fichiers/cahiers/G-2004-12.pdf
The shortest path problem with forbidden paths, VilDes-TR-02, http://www.gerad.ca/fichiers/cahiers/G-2002-41.pdf
Automatic grid finding in calibration patterns using Delaunay triangulation, ShuBruFia-TR-03, http://www.cv.iit.nrc.ca/research/CAMcal/gridfind_report.pdf
Closing ranks in vehicle formations based on rigidity, EreBelMor-CDC-02, http://entity.eng.yale.edu/controls/2002/ClosingRanks.pdf
Towards fully automatic generation of city models, Bre-ISPRS-00, http://www.ifp.uni-stuttgart.de/publications/2000/Brenner_amsterdam.pdf
A fast algorithm for Delaunay based surface reconstruction, GaoLu-WSCG-03, http://wscg.zcu.cz/wscg2003/Papers_2003/C83.pdf
Voxelization of solids using simplicial coverings, RueSegFei-WSCG-04, http://wscg.zcu.cz/wscg2004/Papers_2004_Short/J53.pdf
Refinement and hierarchical coarsening schemes for triangulated surfaces, SuaPla-WSCG-03, http://wscg.zcu.cz/wscg2003/Papers_2003/H73.pdf
Robust incremental polygon triangulation for surface rendering, Kum-WSCG-00, http://wscg.zcu.cz/wscg2000/Papers_2000/Z43.pdf
A local chaining algorithm and its applications in comparative genomics, AboOhl-WABI-03, http://theorie.informatik.uni-ulm.de/Personen/eo/PAPERS/WABI03.pdf
Multiple genome aligment: chaining algorithms revisited, AboOhl-CPM-03, http://theorie.informatik.uni-ulm.de/Personen/eo/PAPERS/CPM03.pdf
In silico atomic tracing by substrate-product relationships in Escherichia coli intermediary metabolism, Ari-GR-03, http://dx.doi.org/10.1101/gr.1212003
Design of wavelength-routed optical network topologies to minimise lightpath blocking probabilities, LauKil-LCS-03, http://www.ee.ucl.ac.uk/lcs/papers2003/131.pdf
City models — automation in research and practice, Bre-PW-01, http://www.ifp.uni-stuttgart.de/publications/phowo01/Brenner.pdf
Subdivision Surfaces in Computer Games, Cho-MS-01, http://www.dcs.shef.ac.uk/teaching/eproj/ug2001/pdf/u8cytc.pdf
ShareCam part II: approximate and distributed algorithms for a collaboratively controlled robotic webcam, SonGolPas-IROS-03, http://www.tele-actor.net/sharecam/pubs/dez-sharecam-algorithm-iros2003-v08.pdf
Exact and distributed algorithms for collaborative camera control, SonStaGol-WAFR-02, http://www.tele-actor.net/sharecam/pubs/dez-sharecam-algorithm-iros2003-v08.pdf
An extremely inexpensive multisampling scheme, Ake-TR-03, http://www.ce.chalmers.se/staff/tomasm/pubs/fliptri_tr.pdf
Triangulirajmo Mnogokotnik, LamZal-GV-00, http://www.geodetski-vestnik.com/44/gv44-12.pdf
On the use of CAD-native predicates and geometry in surface meshing, Aft-TR-99, http://people.nas.nasa.gov/~aftosmis/publications/nasaTM_1999_208782.pdf
I/O-efficient structures for orthogonal range-max and stabbing-max queries, AgaArgYan-ESA-03, http://www.cs.duke.edu/~yike/max.pdf
Points and combinatorics, AicAurKra-TM-02, http://www.igi.tugraz.at/telematik/tele1-02_aich-combi.pdf
An exact algorithm for the robust shortest path problem with interval data, MonGam-COR-04, http://www.idsia.ch/~roberto/papers/Montemanni_Gambardella.pdf
An exact algorithm for the robust shortest path problem with interval data, MonGam-TR-02, http://www.idsia.ch/idsiareport/IDSIA-05-02.pdf
Orbit determination with very short arcs: admissible regions, MilGrodeM-AASDDA-04, http://copernico.dm.unipi.it/~milani/preprints/orblink.pdf
Lecture notes for ICS180, Winter 1997: Strategy and board game programming, http://www.ics.uci.edu/~eppstein/180a/w99.html
Computational origami: reexamining an old problem, GibHub-TR-02, http://www.cs.georgiasouthern.edu/techreports/jhuband.pdf
NCSA MinMaxer: User's and Programmer's Guide, MinMax-92, http://graphics.stanford.edu/courses/cs348a-04-winter/Papers/MinMaxerR1.1.pdf
Routing reliability analysis of partially disjoint paths, PuManSho-PACRIM-01, http://panda.csc.uvic.ca/papers/storage/RelyDisjointPath.pdf
A new algorithm to compute alternate paths in reliable OSPF (ROSPF), PuManSho-PDPTA-01, http://panda.csc.uvic.ca/papers/storage/ROSPF_Algorithm.pdf
Optimal admission controllers for service level agreements in enterprise networks, AkbManWat-SCI-02, http://panda.csc.uvic.ca/papers/storage/AdmCtrlOptSLA.pdf
Reliable routing in MPLS networks, PuManSho-CCN-02, http://panda.csc.uvic.ca/papers/storage/RelyMPLSRouting.pdf
Inverse conic programming and applications, IyeKan-TR-03, http://www.corc.ieor.columbia.edu/reports/techreports/tr-2003-02.pdf
A numerical method for interface tracking, DaiWanPer-ILASS-02, http://www.ecs.umass.edu/mie/faculty/schmidt/ILASS2002.pdf
Alternatives to Traditional 3d Modelling Methods, Syn-BE-03, http://innovexpo.itee.uq.edu.au/2003/exhibits/s363254/thesis.pdf
Glocal alignment: finding rearrangements during alignment, BruMalPol-BI-03, http://dx.doi.org/10.1093/bioinformatics/btg1005
Edge-constrained marching triangles, McCFis-TR-02, http://www.inf.ed.ac.uk/publications/online/0188.pdf
Parallel decomposition of generalized series-parallel graphs, HoHsiChe-JISE-99, http://www.iis.sinica.edu.tw/JISE/1999/199905_06.pdf
Animationsorientierte Optimierung von Polygonnetzen, Bun-Dab-96, http://www.khm.de/~actor/publications/bunsen/anim_meshing.pdf
Modelling and solving English peg solitaire, JefMigMig-CPAIOR-03, http://www.cs.york.ac.uk/aig/projects/implied/docs/CPAIOR03.pdf
Interpreting sloppy stick figures by graph rectification and constraint-based matching, MahFro-GREC-01, http://www2.parc.com/spl/members/fromherz/publications/sf-grec2001.pdf
Programmierwettbewerb Philosophen-Fu�ball, Wal-GAOS-02, http://www.informatik.uni-leipzig.de/~joe/wettbewerb/phutball/gaos.ps
Automatische Geb�udeerfassung aus digitalen Oberfl�chenmodellen und Grundrissen, Bre-KI-01, http://www.kuenstliche-intelligenz.de/archiv/2001_4/brenner.pdf
Neue Untersuchungen zur Integration von DGM und DSM mittels Triangulationen zur Berechnung integrierter 2.5D-Landschaftsmodelle, LenHei-MBKG-02, http://www.ipi.uni-hannover.de/html/publikationen/2002/paper/aga01_mit_bildern.pdf
Konzeption und Implementierung von geometrischen 3D-Datentype, Sie-Dab-99, http://www.geo.informatik.uni-bonn.de/publications/1999/dipl-siebeck/siebeck_diplom.ps.gz
Modellierung der SOFC-Brennstoffzelle und die numerische L�sung mit einem adaptiven Full-Multigrid-Verfahren, Sch-TR-97, http://www.fz-juelich.de/zam/files/docs/juel/juel-3380.ps
Graphical representations and infinite virtual worlds in a logic and functional programming course, Lab-WFLP-03, http://www.di.uniovi.es/~labra/FTP/Papers/wflp03.pdf
Low-latency photon mapping via block hashing, MaMcC-TR-02, http://www.cgl.uwaterloo.ca/Projects/rendering/Papers/CS-2002-15.pdf
Low-latency photon mapping via block hashing, MaMcC-GHW-02, http://www.cgl.uwaterloo.ca/Projects/rendering/Papers/phothash.pdf
Surface reconstruction from problem point clouds, EmeSka-GC-02, http://www.graphicon.ru/2002/pdf/Emelyanov_En_Re.pdf
Interactive co-design of high-throughput multimedia, OmnFraCat-DAC-00, http://doi.acm.org/10.1145/337292.337430
Closed-form maximum likelihood estimates of nearest neighbor spatial dependence, PacZou-GA-00, http://www.spatial-statistics.com/pace_manuscripts/closest_neighbors/pdf/closest_neighbor.pdf
Topology alteration for virtual sculpting using spatial deformation, SteGai-AFRIGRAPH-03, http://doi.acm.org/10.1145/602330.602343
Multiobjective optimisation on network models, CosMooWin-TR-01, http://www.cs.may.ie/research/reports/2001/nuim-cs-tr-2001-08.pdf
Modelling built environments from large range images using adaptive triangular meshes, SapDevGar-IRS-00, http://www.etse.urv.es/recerca/rivi/pub/vision/isirs00.pdf
Approximating the medial axis from the Voronoi diagram with a convergence guarantee, DeyZha-Algo-04, http://www.cse.ohio-state.edu/~tamaldey/paper/medial.pdf
Dynamic programming as a software component, deM-CSCC-99, http://web.comlab.ox.ac.uk/oucl/work/oege.de.moor/papers/cscc.pdf
Stochastic simulation in surface reconstruction and application to 3D mapping, LeaSchDis-ICRA-02, http://www.acfr.usyd.edu.au/publications/downloads/2003/Leal180/icra2002.pdf
A simple and fast approach for solving problems on planar graphs, FomThi-TR-03, http://www.ii.uib.no/publikasjoner/texrap/pdf/2003-258.pdf
Comparison of image-transformation methods used in matching 2d gel electrophoresis images, KacWaldeJ-AC-03, http://www.us.edu.pl/uniwersytet/jednostki/wydzialy/chemia/acta/ac13/zrodla/01_AC13.pdf
Analysis of the quasi-Monte Carlo integration of the rendering equation, SziPur-WSCG-99, http://wscg.zcu.cz/wscg99/papers/h51-final.ps.gz
An efficient parallel strategy for computing $K$-terminal reliability and finding most vital edges in 2-trees and partial 2-trees, HoHsiChe-IPDPS-97, http://ipdps.eece.unm.edu/1997/s17/353.pdf
Higher order Delaunay triangulations, GudHamKre-CGTA-02, http://www.win.tue.nl/~hgudmund/HP_links/PAPERS/HOD.pdf
Algorithms for disk covering problems with the most points, XiaZhuHe-PDCS-03, http://www.utd.edu/~edsha/papers/bin/PDCS2003.pdf
Aggregation approach for the minimum binary cost tension problem, Bac-TR-04, http://www.isima.fr/limos/publi/paper/2004/RR0408.pdf
Clustering-based production-line binning of ICs Based on $I_{DDQ}$, TurJayMal-DBT-2003, http://www.cs.colostate.edu/~malaiya/turakhia_paper.pdf
A mapping-independent primitive for the triangulation of parametric surfaces, AttFalSpa-GM-03, http://dx.doi.org/10.1016/S1524-0703(03)00048-1
Bi-directional search in QoS routing, KuiMie-QoFIS-03, http://www.nas.its.tudelft.nl/people/Piet/papers/hamcraqofis03.pdf
Beautification of Reverse Engineered Geometric Models, Lan-PhD-03, http://cyl.cs.cf.ac.uk/research/BoRG/beautification.pdf
Words guaranteeing minimal image, MarPinVol-ICWLC-00, http://www.liafa.jussieu.fr/~jep/PDF/Kyoto.pdf
Minimum convex-cost tension problems on series-parallel graphs, BacMah-TR-03, http://www.isima.fr/mahey/RR03-06.PDF
A framework for advancing front techniques of finite element mesh generation, FraSim-TR-93, http://www.cs.uwaterloo.ca/cs-archive/CS-1993/38/93-38.pdf
Neural networks, adaptive optimization, and RNA secondary structure prediction, Ste-AIMB-93, http://www.biosino.org/mirror/www.aaai.org/E-Books/Hunter/03-Steeg.pdf
Generating perfect reversals of simple linear-codes, Per-TR-03, http://www.cercs.gatech.edu/tech-reports/tr2003/git-cercs-03-04.pdf
Combinatorial aspects of dual-based hexahedral mesh modification , Tau-CSC-04, http://www.tau.ac.il/~stoledo/csc04/Tautges.pdf
A decoupled GLS-based path flow estimator for inferring origin-destination matrices, NieZhaRec-ITSRO-03, http://www.its.berkeley.edu/publications/ITSReviewonline/spring2003/trb2003/recker.pdf
Extremal Constructions for Polytopes and Spheres, Pfe-PhD-03, http://edocs.tu-berlin.de/diss/2003/pfeifle_julian.pdf
An efficient point location method for visualization in Large unstructured grids, LanSchTri-VMV-03, http://www-scheuer.informatik.uni-kl.de/~tricoche/pdfs/vmv03.pdf
Metabolic reconstruction using shortest paths, Ari-SPT-00, http://www.metabolome.jp/software/simulPractTheor2000.pdf
Dynamic compressed hyperoctrees with application to the $N$-body problem, AluSev-FSTTCS-99, http://vulcan.ee.iastate.edu/~aluru/publications/p/FSTTCS-1999-DynCompressedHyperoctrees.pdf
An alternative method to the scrambled Halton sequence for removing correlation between standard Halton sequences in high dimensions, HesPol-ERSA-03, http://www.jyu.fi/ersa2003/cdrom/abstracts/a406.html
Fast optimal leaf ordering for hierarchical clustering, BarGifJaa-BI-01, http://www.psrg.lcs.mit.edu/pubs/BarGifJaa-ismb01.pdf
Categorical range queries in large databases, NanBoz-SSTD-03, http://delab.csd.auth.gr/papers/SSTD03nb.pdf
Improved methods for signature-tree construction, TouNanMan-CJ-00, http://delab.csd.auth.gr/papers/TCJ00tnm.pdf
Match-bounded string rewriting systems, GesHofWal-NIA-03, http://research.nianet.org/pubs/2003/2003-09.pdf
Global conformal surface parameterization, GuYau-GP-03, http://www.cise.ufl.edu/~gu/papers/sgp_final.pdf
Increasing the number and volume of hexahedral and prism elements in a hex-dominant mesh by topological transformations, YamShi-IMR-03, http://www.imr.sandia.gov/papers/imr12/yamakawa03.pdf
Design and analysis of spatiotemporal multicast protocols for wireless sensor networks, HuaLuRom-TR-03-45, http://www.cse.seas.wustl.edu/techreportfiles/getreport.asp?282
Spatiotemporal multicast in sensor networks, HuaLuRom-TR-03-18, http://www.cse.seas.wustl.edu/techreportfiles/getreport.asp?254
On greedy geographic routing algorithms in sensing-covered networks, XueLuPle-MobiHoc-04, http://www.cse.wustl.edu/~lu/papers/mobihoc04.pdf
A Delaunay approach to interactive cutting in triangulated surfaces, NieSta-WAFR-02, http://www.cs.uu.nl/groups/AA/virtual/surgery/wafr2002/wafr02nienhuys-final.pdf
Cutting in Deformable Objects, Nie-PhD-03, http://www.cs.uu.nl/groups/AA/virtual/surgery/thesis/
Collaborative frame selection: exact and distributed algorithms for a networked robotic camera with discrete zoom levels, SonStaGol-TR-03, http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-2003/2003-017.pdf
Efficient algorithms for maximum regression depth, KreMitRou-TR-02, http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-2002/2002-039.pdf
Constrained higher order Delaunay triangulations, GudHavKre-TR-04, http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-2004/2004-007.pdf
Realistic input models for geometric algorithms, BerKatSta-TR-98, http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-1998/1998-13.pdf
Treewidth: algorithmic techniques and results, Bod-TR-97, http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-1997/1997-31.pdf
Approximation of implicit curves using the bad edge refinement concept, Moe-MS-03, http://www.cs.uu.nl/people/esther/master/thesis.pdf
On simplifying dot maps, BerBosChe-TR-02, http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-2002/2002-038.pdf
Precise relative positioning of multiple moving platforms using GPS carrier phase observables, Luo-PhD-01, http://www.geomatics.ucalgary.ca/Papers/Thesis/GL/00.20147.NingLuo.pdf
Preference mining: a novel approach on mining user preferences for individualized applications, HolEstKie-TR-03, http://www.informatik.uni-augsburg.de/forschung/techBerichte/reports/2003-5.pdf
Additional patterns for parallel application programs, MasMatSan-PLoP-03, http://jerry.cs.uiuc.edu/~plop/plop2003/Papers/massingill-parallel.pdf
Simulation of automatic switched optical transport networks, HueJaeSed-FPN-02, http://www.transinet.de/Veroffentlichungen/AG-c/Fachtagung_ITG_April_2002_Paper_1_.pdf
Evaluation of novel resilience schemes in dynamic optical transport networks, JaeHueSch-APOC-02, http://www.lkn.ei.tum.de/~ds/papers/APOC2002_final.pdf
Topology-free cut-and-paste editing over meshes, FuTaiZha-GMP-04, http://ihome.ust.hk/~fuhb/doc/cutpaste_gmp04.pdf
Know why your access was denied: regulating feedback for usable security, KapSamCam-TR-04, http://choices.cs.uiuc.edu/~akapadia/papers/know.pdf
Approximate shape fitting via linearization, HarVar-FOCS-01, http://valis.cs.uiuc.edu/~sariel/research/papers/01/linearize.pdf
A formal analysis of a dynamic distributed spanning tree algorithm, MooWes-TR-03, http://www.win.tue.nl/oas/iqps/pub/MW2003.pdf
Delaunay Refinement Algorithms, Pav-PhD-03, http://www.math.cmu.edu/~nw0z/publications/phdtheses/pav/pavabs/pav.pdf
Adaptive multiresolution and quality 3D meshing from imaging data, ZhaBajSoh-TR-02, http://www.ticam.utexas.edu/reports/2002/0242.pdf
A smooth subdivision scheme for hexahedral meshes, BajWarXue-TR-01, http://www.ticam.utexas.edu/reports/2001/0105.pdf
From point cloud to surface: the modeling and visualization problem, Fab-VARM-03, http://www.photogrammetry.ethz.ch/general/persons/fabio/tarasp_modeling.pdf
Atomic meshes: from seismic images to reservoir simulation, Hal-ECMOR-02, http://sepwww.stanford.edu/oldsep/hale/Hale083002AtomicMeshes.pdf
Finding the K shortest hyperpaths: algorithms and applications, NiePreAnd-TR-02, http://home.imf.au.dk/relund/download/k-sbt.pdf
An overview of sequence comparison algorithms in molecular biology, Mye-TR-91, http://www.eecs.berkeley.edu/~gene/Papers/compbio.survey.pdf
Manifold reconstruction from unorganized points, Free-ACSSC-00, http://www.cs.rpi.edu/~freedd/publications/freedman_asil00.pdf
Triangle-mesh simplification using error polyhedra, EasMad-TR-01, http://www.dcs.shef.ac.uk/~marke/pubs/ErrorPolyhedraCS0107.pdf
Triangle-mesh simplification using error polyhedra, EasMad-EGUK-01, http://www.dcs.shef.ac.uk/~marke/pubs/ErrorPolyhedraEGUK.pdf
The etree library: a system for manipulating large octrees on disk, TuOHaLop-TR-03, http://epicenter.usc.edu/cmeportal/docs/etree-tr.pdf
Coverage control for mobile sensing networks, CorMarKar-ICRA-02, http://motion.csl.uiuc.edu/~bullo/papers/2001k-cmkb.pdf
Firewall policy advisor for anomaly detection and rule editing, AlSHam-IM-03, http://www.mnlab.cs.depaul.edu/~ehab/papers/im03-cr.pdf
Modeling and management of firewall policies, AlSHam-TNSM-04, http://www.mnlab.cs.depaul.edu/projects/FPA/files/tnsm04.pdf
Discovery of policy anomalies in distributed firewalls, AlSHam-INFOCOMM-04, http://www.mnlab.cs.depaul.edu/~ehab/papers/infocomm04.pdf
Management and translation of filtering security policies, AlSHam-ICC-03, http://www.mnlab.cs.depaul.edu/~ehab/papers/ICC03-fw.pdf
A Markovian Approach to the Mathematical Control of New Product Development Projects, Dra-PhD-03, http://alexandria.tue.nl/extra2/200313426.pdf
Computing the maximum detour and spanning ratio of planar paths, trees and cycles, LanMorSos-STACS-02, http://cg.scs.carleton.ca/~morin/publications/spanner/detour-stacs.pdf
On simplifying dot maps, BerBosChe-CGTA-04, http://cg.scs.carleton.ca/~morin/publications/cartography/dotmaps-cgta.pdf
Covering with ellipses, EfrHofKna-Algo-03, http://dx.doi.org/10.1007/s00453-003-1047-0
Firewall design: consistency, completeness and compactness, LiuGou-ICDCS-04, http://www.cs.utexas.edu/users/alex/publications/fdd.pdf
Surface Reconstruction and Simplificiation, Aga-MS-01, http://www.homepages.inf.ed.ac.uk/s0234242/MSc/Chapters1-2.pdf
Recognizing geometric patterns for beautification of reconstructed solid models , LanMilMar-ICSMA-01, http://ralph.cs.cf.ac.uk/papers/Geometry/GeometricPatterns.pdf
Finding the shortest path for quality assurance of electric components, KagShi-DETC-02, http://www.andrew.cmu.edu/org/cielab/papers2/02-asme-dac-kageura.pdf
Geometric properties of the local refinement in unstructured triangular meshes, SuaPlaCar-IIG-02, http://departamentos.unican.es/digteg/ingegraf/cd/ponencias/247.pdf
Shortest paths in chemical kinetic applications, EglKra-PCCP-03, http://pubs.rsc.org/ej/CP/2003/b301216f.pdf
Robust Surface Reconstruction Strategy for Large Clouds of Points: State of the Art and Concept of Doctoral Thesis, Jem-TR-03, http://www.kiv.zcu.cz/publications/2003/tr-2003-07.pdf
Quality meshing with weighted Delaunay refinement, CheDey-TR-03, http://repository.ust.hk/retrieve/630/200305.pdf
Identifying projected clusters from gene expression profiles, YipCheNg-BIBE-04, http://www.cs.hku.hk/~dcheung/publication/bibe2004.pdf
Consensus algorithms for the generation of all maximal bicliques, AleAleCra-TR-02, http://rutcor.rutgers.edu/pub/rrr/reports2002/41_2002.pdf
A note on the bounded fragmentation property and its applications in network reliability, HajHaj-EJC-03, http://www-math.mit.edu/~hajiagha/bndfrag.pdf
Finding anchors for genomic sequence comparison, LipZhaFlo-RECOMB-04, http://doi.acm.org/10.1145/974614.974645
C$^2$P: clustering based on closest pairs, NanTheMan-VLDB-01, http://www.vldb.org/conf/2001/P331.pdf
Energy Minimization Methods for Feature Displacement in Map Generalization, Bad-PhD-01, http://www.geo.unizh.ch/gis/phd_publications/mbader/
Computer Graphics and Geometric Ornamental Design, Kap-PhD-02, http://www.cgl.uwaterloo.ca/~csk/phd/kaplan_diss_outer_matter_print.pdf
The Geometry Junkyard: Penrose tiling, http://www.ics.uci.edu/~eppstein/junkyard/penrose.html
Information lack localization in architectural laser scanning surveys: the Venice test site, SalDurAch-Ancona-VTD3A-03, http://www.commission5.isprs.org/wg4/workshop_ancona/proceedings/72.pdf
Note on approximate comparison of sequences with normalization, Rai-TR-95, http://www.cs.uta.fi/reports/pdf/A-1995-4.pdf
Constructions of Cubical Polytopes, Sch-PhD-04, http://edocs.tu-berlin.de/diss/2004/schwartz_alexander.pdf
Simple linear regression: a PAPIRIS example, ShaBosMor-HRME-02, http://math.unipa.it/~grim/SiShawer.PDF
Lecture notes for ICS280, Spring 1999: Computational Statistics, http://www.ics.uci.edu/~eppstein/280/
Statistical Cue Estimation for Model-Based Shape and Motion Tracking, Gol-PhD-02, http://www.ic.unicamp.br/~siome/papers/Dissertation.pdf
Els sistemes de representaci� dels nombres reals (I), ViaParMir-BSCM-01, http://www.iecat.net/institucio/societats/SCMatematiques/WebSCMAT/butlletins/16_2/viader.pdf
Route Choice in Stochastic Time-Dependent Networks: Theory, Algorithms and Computational Experience, LRN-PhD-03, http://home.imf.au.dk/relund/download/thesis.pdf
Representation and Detection of Shapes in Images, Fel-PhD-03, http://www.cs.cornell.edu/~pff/papers/pff.pdf
Algorithms in Computational Biology, Ped-PhD-99, http://www.birc.dk/Publications/Theses/cstorm_phd_sep99.pdf
Theory and Practice of Sampling and Reconstruction of Manifolds with Boundaries, Gop-PhD-01, http://www.cs.unc.edu/~gopi/dis.pdf
Algorithms in Computational Biology, Ped-TR-00, http://www.brics.dk/DS/00/4/BRICS-DS-00-4.pdf
$K$-alternative algorithms for sum type problems, Alt-WDO-00, http://www.mathe.tu-freiberg.de/~dempe/Holzhau/Abstracts/althoef.ps
High-Dimensional Computational Geometry, Ind-PhD-00, http://theory.lcs.mit.edu/~indyk/thesis.ps
Functional Sequence Comparison, Twe-MS-96, http://www.cs.bris.ac.uk/~tweed/c95dtDiss.ps.gz
Kinetic Maintenance of Proximity Structures, Zha-PhD-00, http://www.hpl.hp.com/personal/Li_Zhang/papers/thesis.ps
A Geometric Theory of Outliers and Perturbation, Dun-PhD-02, http://research.microsoft.com/~jdunagan/
Applications of 3D Delaunay triangulation algorithms in geoscientific modelling, LatRap-IGEM-96, http://www.ncgia.ucsb.edu/conf/SANTA_FE_CD-ROM/sf_papers/lattuada_roberto/paper.html
Simplicial Mesh Generation with Applications, Moo-TR-92, http://historical.ncstrl.org/tr/ps/cornellcs/TR92-1322.ps
Complexity of Certificates, Heuristics, and Counting Types, with Applicatins to Cryptography and Circuit Theory, Rot-Hab-99, http://www.cs.uni-duesseldorf.de/~rothe/HABILITATION/main.ps
Maintaining Consistency and Behavior of Object-Oriented Systems During Evolution, Hue-PhD-95, http://ftp.ccs.neu.edu/pub/people/lieber/theses/huersch/thesis.ps
Computational Experiments on Graph Width Metrics, Fou-PhD-03, http://www.mcs.vuw.ac.nz/~downey/fthes.ps
Approximation Algorithms for VLSI Routing, Man-PhD-00, http://www.engr.uconn.edu/~ion/FILES/pub/th.ps
Geometric Decompositions and Networks: Approximation Bounds and Algorithms, Gud-PhD-00, http://www.cs.lth.se/Research/Algorithms/Papers/joachimD.ps
Algorithmic problems on proximity and location under metric constraints, Pal-PhD-03, http://www.infor.uva.es/~b.palop/palop.ps
Parallel Algorithms For Graph Problems, Met-PhD-92, http://www.wellesley.edu/CS/pmetaxas/th.ps
Parallel Algorithms For Graph Problems, Met-TR-92, http://www.cs.dartmouth.edu/reports/abstracts/TR92-178/
Scalable Data Mining for Rules, Zak-PhD-98, http://www.cs.rpi.edu/~zaki/PS/THESIS.ps.gz
Circuits, CNFs, and Satisfiability, Zan-PhD-98, http://cm.bell-labs.com/cm/ms/who/francis/papers/thesis.ps
Data Structures for Bandwidth Reservations and Quality of Service on the Internet, Nil-Lic-03, http://www.sm.luth.se/~andreas/publications/Lic.ps
A Geometric Framework for Computer Graphics Addressing Modeling, Visibility, and Shadows, Gha-PhD-99, http://www.cs.ualberta.ca/~ghali/thesis/index.html
Spatial Data Representations for Rapid Visualization and Analysis, Sca-PhD-93, http://www.sci.brooklyn.cuny.edu/~lori/dissertation/Prelim.pdf
Heuristic methods for delay-constrained least cost routing problem using $k$-shortest-path algorithms, JiaVar-INFOCOM-01, http://paleale.eecs.berkeley.edu/~varaiya/papers_ps.dir/kdclc-ieeev4.pdf
Practical issues and algorithms for analyzing terrorist networks, CarKarSha-WMC-02, http://www.cas.mcmaster.ca/~gk/papers/wmc2002.pdf
Tosiaikainen ajoneuvoliikenteen reitinsuunnittelu (real-time vehicle traffic route planning), BloCamKar-IMW-02, http://www.math.tut.fi/workshop02/Matrex_ratkaisu.pdf
SPeCRA: a stochastic performance comparison routing algorithm for LSP setup in MPLS networks, OliMarSco-GLOBECOM-02, http://users.ece.gatech.edu/~jau/QoS-Project/papers/globecom.pdf
Geometric Problems in Cartographic Networks, Cab-PhD-04, http://www.fmf.uni-lj.si/~cabello/publications/thesis-sergio.pdf
A new algorithm for $K$ shortest paths problem, Cha-IJMS-01, http://203.247.218.66/korea/journal/26_3_6.pdf
From hierarchies to heterarchies: application of network optimization to design of organizational structures, LevYuPat-ICCRTS-03, http://www.dodccrp.org/events/2003/8th_ICCRTS/pdf/024.pdf
On the generation of alternative solutions for discrete optimization problems with uncertain data: an experimental analysis of the penalty method, Sam-TR-04, http://www.minet.uni-jena.de/Math-Net/reports/shadows/04-01report.html
Online algorithms for maintaining the topological order of a directed acyclic graph, PeaKel-TR-03a, http://www.doc.ic.ac.uk/~djp1/files/tr0703.pdf
Online algorithms for topological order and strongly connected components, PeaKel-TR-03b, http://www.doc.ic.ac.uk/~djp1/files/tr0903.pdf
Quality of service provisioning for supporting premium services in IP networks, TriBauPav-GLOBECOM-02, http://www.ist-tequila.org/publications/globecom02-nd.pdf
Selective Flooding for Better QoS Routing, Kan-MS-00, http://www.cs.wpi.edu/~claypool/ms/hsf/report.pdf
Viking: a multi-spanning-tree ethernet architecture for metropolitan area and cluster networks, ShaGopNan-INFOCOM-04, http://www.ieee-infocom.org/2004/Papers/47_3.PDF
Kinetic minimum-power routing and clustering in mobile ad-hoc networks, GenHaeVan-VTCF-02, http://www.eurecom.fr/~haerri/998.pdf
Graph distances in the streaming model: the value of space, FeiKanMcG-TR-04, http://www.cs.yale.edu/homes/jf/tr1288.pdf
An algorithm for calculating the $K$ most reliable disjoint paths with a maximum number of arcs, GomCraMar-ESREL-01, http://www.aidic.it/italiano/congressi/esrel2001/webpapersesrel2001/219.pdf
Multi-objective optimisation on transportation networks, CosMooWin-ACGS-01, http://agile.isegi.unl.pt/Conference/Brno2001/Usability.pdf
Routing and wavelength assignment of scheduled lightpath demands in a WDM optical transport network, KurPueGag-ICOCN-02, http://www.infres.enst.fr/~kuri/docs/icocn02_paper141_kuri.pdf
Routing and wavelength assignment of scheduled lightpath demands, Kur-JSAC-03, http://www.infres.enst.fr/~kuri/docs/jkuri_jsac03.pdf
Diverse routing of scheduled lightpath demands in an optical transport network, KurPueGag-DRCN-03, http://www.infres.enst.fr/~kuri/docs/jkuri_drcn03.pdf
Kinetic Data Structures for Collision Detection, Spe-PhD-01, http://www.win.tue.nl/~speckman/papers/thesis-final.zip
Dilation-free planar graphs, http://www.ics.uci.edu/~eppstein/junkyard/dilation-free/
Dynamical Configuration of Transparent Optical Telecommunication Networks, Tuc-Dip-03, http://www.zib.de/groetschel/info/diploma_thesis.pdf
Global mapping of nucleic acid conformational space: dinucleoside monophosphate conformations and transition pathways among conformational classes, SimKim-NAR-03, http://nar.oupjournals.org/cgi/content/abstract/31/19/5607
Deformable spanners and applications, GaoGuiNgu-SCG-04, http://graphics.stanford.edu/~anguyen/papers/spanner.pdf
Curvature criteria to fit curves to discrete data, AlbEchRod-EWCG-04, http://www.us.es/ewcg04/Articulos/alboul.ps
The Geometry Junkyard: Inscribed square problem, http://www.ics.uci.edu/~eppstein/junkyard/jordan-square.html
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs, AlbFia-Algs-04, http://dx.doi.org/10.1016/j.jalgor.2003.10.001
A program inverter for a functional language with equality and constructors, GluKaw-TR-03, ftp://ftp.diku.dk/diku/semantics/papers/D-491.ps.gz
Derivation of deterministic inverse programs based on LR parsing, GluKaw-TR-04, ftp://ftp.diku.dk/diku/semantics/papers/D-506.ps.gz
Re: Geometry problem: Optimal direction. Known results?, Epp-smr-04, http://mathforum.org/epigone/sci.math.research/slexyaxsle
3-coloring in time $O(1.3289^n)$, BeiEpp-Algs-05, http://dx.doi.org/10.1016/j.jalgor.2004.06.008
The effect of faults on network expansion, BagBhaCha-SPAA-04, http://doi.acm.org/10.1145/1007912.1007960
The lattice dimension of a graph, Epp-EJC-05, http://dx.doi.org/10.1016/j.ejc.2004.05.001
The Geometry Junkyard: Polyominoes and Other Animals, http://www.ics.uci.edu/~eppstein/junkyard/polyomino.html
Dynamic inverse optimization, GenSalFer-ACC-01, http://gewurtz.lids.mit.edu/papers/GSF01.pdf
Partial inverse linear programming, Gen-TR-01, http://gewurtz.lids.mit.edu/papers/G01.pdf
Drawing planar bipartite graphs with small area, BieBra-CCCG-05, http://cccg.cs.uwindsor.ca/papers/11.pdf
Space-efficient algorithms for Klee's measure problem, CheCha-CCCG-05, http://cccg.cs.uwindsor.ca/papers/18.pdf
Staying in the middle: exact and approximate medians in $R^1$ and $R^2$ for moving points, AgaBerGao-CCCG-05, http://cccg.cs.uwindsor.ca/papers/19.pdf
Finding a triangular mesh with a constant number of different edge lengths, TanKat-CCCG-05, http://cccg.cs.uwindsor.ca/papers/41.pdf
A fast algorithm for point labeling problem, RoyBhaDas-CCCG-05, http://cccg.cs.uwindsor.ca/papers/42.ps
The translation-scale-rotation diagram for point-containing placements of a convex polygon, BarSch-CCCG-05, http://cccg.cs.uwindsor.ca/papers/46.pdf
Approximation algorithms for maximum cliques in 3D unit-disk graphs, AfsCha-CCCG-05, http://cccg.cs.uwindsor.ca/papers/69.pdf
Fast approximation of centrality, EppWan-JGAA-04, http://www.cs.brown.edu/publications/jgaa/accepted/2004/EppsteinWang2004.8.1.pdf
Memory reference caching for activity reduction on address buses, GivEpp-MICPRO-05, http://www.ics.uci.edu/~givargis/pubs/J12.pdf
Skip-webs: efficient distributed data structures for multi-dimensional data sets, ArgEppGoo-PODC-05, http://doi.acm.org/10.1145/1073827
Stacks, queues and tracks: layouts of graph subdivisions, DujWoo-DMTCS-05, http://www.dmtcs.org/volumes/abstracts/dm070111.abs.html
Merging range images of arbitrarily shaped objects, RutStrTro-CVPR-94, http://ieeexplore.ieee.org/xpl/abs_free.jsp?arNumber=323797
Pseudo-triangulations from surfaces and a novel type of edge flip, AicAurKra-SJC-03, http://dx.doi.org/10.1137/S0097539702411368
Triangulations and meshes in computational geometry, Ede-AN-00, http://www.journals.cambridge.org/action/displayAbstract?fromPage=online&aid=68669
Efficient and reliable triangulation of polygons, Hel-CGI-98, http://doi.ieeecomputersociety.org/10.1109/CGI.1998.694322
Crossings in Clustered Level Graphs, For-PhD-04, http://www.opus-bayern.de/uni-passau/volltexte/2005/48/pdf/Dissertation%20Michael%20Forster.pdf
Unwed numbers, Hay-AS-06, http://www.americanscientist.org/template/AssetDetail/assetid/48550
Sudoku as a constraint problem, Sim-MRCSP-05, http://4c.ucc.ie/~brahim/mod-proc.pdf
Games, Puzzles, and Computation, Hea-PhD-06, http://www.swiss.ai.mit.edu/~bob/hearn-thesis-final.pdf
Quadrilateral and tetrahedral mesh stripification using 2-factor partitioning of the dual graph, DiaGop-VC-05, http://www.ics.uci.edu/~gopi/PAPERS/PG05.pdf
Hierarchyless simplification, stripification and compression of triangulated two-manifolds, DiaGopPaj-EG-05, http://www.ics.uci.edu/~gopi/PAPERS/Euro05.pdf
Optimal polygon placement, BosMor-CCCG-06, http://www.cs.queensu.ca/cccg/papers/cccg23.pdf
Practical and efficient geometric $\epsilon$-approximations, AkcBroMar-CCCG-06, http://www.cs.queensu.ca/cccg/papers/cccg31.pdf
Removing outliers to minimize area and perimeter, AtaMorWuh-CCCG-06, http://www.cs.queensu.ca/cccg/papers/cccg35.pdf