![[ICO]](/icons/blank.gif) | Name | Last modified | Size | Description |
|
![[PARENTDIR]](/icons/back.gif) | Parent Directory | | - | |
![[ ]](/icons/compressed.gif) | matching-planar-maps.ps.gz | 2004-01-13 10:42 | 402K | |
![[ ]](/icons/compressed.gif) | contour-submitted.ps.gz | 2002-12-05 20:13 | 582K | |
![[ ]](/icons/compressed.gif) | Webs,+iteration+groups,+and+equivalent+changes+..> | 1999-05-05 22:17 | 128K | |
![[ ]](/icons/compressed.gif) | Vehicle+routing+in+an+automated+warehouse:+anal..> | 1999-05-05 22:17 | 56K | |
![[ ]](/icons/compressed.gif) | Upper+bounds+on+the+maximal+number+of+facets+of..> | 1999-05-05 22:17 | 66K | |
![[ ]](/icons/compressed.gif) | Two+solvable+cases+of+the+traveling+salesman+pr..> | 2002-12-10 23:03 | 225K | |
![[ ]](/icons/compressed.gif) | Triangulations+intersect+nicely.ps.gz | 1999-05-05 22:17 | 91K | |
![[ ]](/icons/compressed.gif) | Toward+optimal+diffusion+matrices.ps.gz | 2002-07-17 14:48 | 88K | |
![[ ]](/icons/compressed.gif) | Time+complexity+and+linear-time+approximation+o..> | 1999-05-05 22:17 | 53K | |
![[ ]](/icons/compressed.gif) | Threshold+arrangements+and+the+knapsack+problem..> | 2005-05-13 13:10 | 114K | |
![[ ]](/icons/compressed.gif) | Three-clustering+of+points+in+the+plane.ps.gz | 1999-05-05 22:17 | 52K | |
![[ ]](/icons/compressed.gif) | There+are+not+too+many+magic+configurations.ps.gz | 2007-03-09 12:15 | 245K | |
![[ ]](/icons/compressed.gif) | The+zigzag+path+of+a+pseudo-triangulation.ps.gz | 2003-05-28 16:23 | 189K | |
![[ ]](/icons/compressed.gif) | The+quadratic+assignment+problem+with+a+monoton..> | 2001-07-09 13:32 | 120K | |
![[ ]](/icons/compressed.gif) | The+obnoxious+center+problem+on+a+tree.ps.gz | 2001-07-30 11:14 | 92K | |
![[ ]](/icons/compressed.gif) | The+number+of+spanning+trees+in+a+planar+graph...> | 2005-04-29 16:23 | 106K | |
![[ ]](/icons/compressed.gif) | The+convex-hull-and-line+traveling+salesman+pro..> | 1999-05-05 22:17 | 75K | |
![[ ]](/icons/compressed.gif) | The+convergence+rate+of+the+Sandwich+algorithm+..> | 1999-05-05 22:17 | 140K | |
![[ ]](/icons/compressed.gif) | The+N-line+traveling+salesman+problem.ps.gz | 1999-05-05 22:17 | 80K | |
![[ ]](/icons/compressed.gif) | Straightening+polygonal+arcs+and+convexifying+p..> | 2001-01-24 11:38 | 245K | |
![[ ]](/icons/compressed.gif) | Spherical+dispersion+with+an+application+to+pol..> | 1999-05-05 22:17 | 41K | |
![[ ]](/icons/compressed.gif) | Solution+to+problem+74.ps.gz | 1999-05-05 22:17 | 49K | |
![[ ]](/icons/compressed.gif) | Simple+and+optimal+output-sensitive+constructio..> | 2004-05-14 19:49 | 823K | |
![[ ]](/icons/compressed.gif) | Sequences+with+subword+complexity+2n.ps.gz | 1999-05-05 22:17 | 66K | |
![[ ]](/icons/compressed.gif) | Recovering+structure+from+r-sampled+objects.ps.gz | 2009-07-20 18:12 | 1.7M | |
![[ ]](/icons/compressed.gif) | Reachability+of+fuzzy+matrix+period.ps.gz | 1999-05-05 22:17 | 92K | |
![[ ]](/icons/compressed.gif) | Quasi-Monte-Carlo+methods+and+the+dispersion+of..> | 1999-05-05 22:17 | 80K | |
![[ ]](/icons/compressed.gif) | Pseudo-triangulations+-+a+survey.psQ.ps.gz | 2010-12-16 19:44 | 541K | |
![[ ]](/icons/compressed.gif) | Pseudo-triangulations+-+a+survey.ps.gz | 2007-10-16 18:30 | 537K | |
![[ ]](/icons/compressed.gif) | Planar+embeddings+of+graphs+with+specified+edge..> | 2007-09-04 15:21 | 3.3M | |
![[ ]](/icons/compressed.gif) | Planar+embeddings+of+graphs+with+specified+edge..> | 2007-09-04 15:20 | 644K | |
![[ ]](/icons/compressed.gif) | Piecewise+linear+Morse+theory.ps.gz | 2007-06-12 19:45 | 98K | |
![[ ]](/icons/compressed.gif) | Path+problems+in+graphs.ps.gz | 1999-05-05 22:17 | 113K | |
![[ ]](/icons/compressed.gif) | Optimal+logistics+for+expeditions+-+the+jeep+pr..> | 1999-05-05 22:17 | 135K | |
![[ ]](/icons/compressed.gif) | On-line+q-adic+covering+by+the+method+of+the+n-..> | 2001-07-09 13:32 | 86K | |
![[ ]](/icons/compressed.gif) | On+the+maximum+size+of+an+anti-chain+of+linearl..> | 2008-01-11 14:54 | 154K | |
![[ ]](/icons/compressed.gif) | On+the+geometric+dilation+of+curves+and+point+s..> | 2004-07-08 19:46 | 191K | |
![[ ]](/icons/compressed.gif) | On+the+geometric+dilation+of+closed+curves,+gra..> | 2005-08-25 17:42 | 502K | |
![[ ]](/icons/compressed.gif) | On+the+distribution+of+sums+of+vectors+in+gener..> | 1999-05-05 22:17 | 700K | |
![[ ]](/icons/compressed.gif) | On+the+complexity+of+the+linkage+reconfiguratio..> | 2004-01-13 10:42 | 115K | |
![[ ]](/icons/compressed.gif) | On+the+Frechet+distance+of+a+set+of+curves.ps.gz | 2004-06-30 18:05 | 79K | |
![[ ]](/icons/compressed.gif) | On+constrained+minimum+pseudotriangulations.ps.gz | 2003-05-05 21:13 | 103K | |
![[ ]](/icons/compressed.gif) | Obnoxious+centers+in+graphs.ps.gz | 2007-02-12 20:17 | 207K | |
![[ ]](/icons/compressed.gif) | Obnoxious+centers+for+graphs.ps.gz | 2010-12-15 11:58 | 262K | |
![[ ]](/icons/compressed.gif) | Non-crossing+frameworks+with+non-crossing+recip..> | 2004-06-01 21:53 | 2.0M | |
![[ ]](/icons/compressed.gif) | Minimum-weight+triangulation+is+NP-hard.ps.gz | 2008-03-27 17:58 | 718K | |
![[ ]](/icons/compressed.gif) | Minimum-link+paths+among+obstacles+in+the+plane..> | 1999-05-05 22:17 | 109K | |
![[ ]](/icons/compressed.gif) | Minimizing+the+number+of+tardy+jobs+on+a+single..> | 1999-05-05 22:17 | 50K | |
![[ ]](/icons/compressed.gif) | Matrix+scaling+by+network+flows.ps.gz | 2006-09-18 11:56 | 175K | |
![[ ]](/icons/compressed.gif) | Matrix+scaling+by+network+flow.ps.gz | 2006-12-22 15:41 | 207K | |
![[ ]](/icons/compressed.gif) | Matching+shapes+with+a+reference+point.ps.gz | 1999-05-05 22:17 | 70K | |
![[ ]](/icons/compressed.gif) | Matching+planar+maps.ps.gz | 2003-05-28 16:23 | 347K | |
![[ ]](/icons/compressed.gif) | Matching+convex+shapes+with+respect+to+the+symm..> | 1999-05-05 22:17 | 81K | |
![[ ]](/icons/compressed.gif) | Maintaining+the+approximate+width+of+a+set+of+p..> | 1999-05-05 22:17 | 277K | |
![[ ]](/icons/compressed.gif) | Integer+point+sets+minimizing+average+pairwise+..> | 2010-04-23 15:04 | 321K | |
![[ ]](/icons/compressed.gif) | Infinitesimally+locked+self-touching+linkages+w..> | 2002-04-04 16:18 | 144K | |
![[ ]](/icons/compressed.gif) | Incremental+constructions+con+BRIO.ps.gz | 2003-03-31 11:10 | 460K | |
![[ ]](/icons/compressed.gif) | How+difficult+is+it+to+walk+the+dog.ps.gz | 2007-03-27 15:34 | 155K | |
![[ ]](/icons/compressed.gif) | Geometric+clusterings.ps.gz | 2002-04-05 15:54 | 90K | |
![[ ]](/icons/compressed.gif) | Geometric+clustering:+fixed-parameter+tractabil..> | 2007-10-12 15:19 | 241K | |
![[ ]](/icons/compressed.gif) | Generalized+self-approaching+curves.ps.gz | 1999-05-05 22:19 | 0 | |
![[ ]](/icons/compressed.gif) | Fractured+lattices,+integer+programming,+and+Di..> | 2007-07-20 17:53 | 186K | |
![[ ]](/icons/compressed.gif) | Flip+graphs+of+bounded-degree+triangulations-v1..> | 2012-07-03 15:22 | 213K | |
![[ ]](/icons/compressed.gif) | Flip+graphs+of+bounded-degree+pseudotriangulati..> | 2012-07-03 15:22 | 213K | |
![[ ]](/icons/compressed.gif) | Finding+a+shortest+vector+in+a+two-dimensional+..> | 1999-05-05 22:19 | 33K | |
![[ ]](/icons/compressed.gif) | Finding+a+curve+in+a+map.ps.gz | 2003-03-24 18:10 | 64K | |
![[ ]](/icons/compressed.gif) | Fast+reduction+of+ternary+quadratic+forms.ps.gz | 2001-09-27 10:32 | 82K | |
![[ ]](/icons/compressed.gif) | Fast+2-variable+integer+programming.ps.gz | 2001-02-26 19:03 | 86K | |
![[ ]](/icons/compressed.gif) | Expansive+motions+on+the+line+and+the+associahe..> | 2001-07-09 13:32 | 60K | |
![[ ]](/icons/compressed.gif) | Expansive+motions+and+the+polytope+of+pointed+p..> | 2002-12-10 23:03 | 264K | |
![[ ]](/icons/compressed.gif) | Expansive+motions+and+the+polytope+of+pointed+p..> | 2002-12-10 23:03 | 325K | |
![[ ]](/icons/compressed.gif) | Embedding+3-polytopes+on+a+small+grid.ps.gz | 2007-03-27 17:01 | 183K | |
![[ ]](/icons/compressed.gif) | Division-free+algorithms+for+the+determinant+an..> | 2001-07-09 13:32 | 173K | |
![[ ]](/icons/compressed.gif) | Determinants+and+Pfaffians:+algebraic+and+combi..> | 2000-06-27 16:13 | 98K | |
![[ ]](/icons/compressed.gif) | Degenerate+convex+hulls+in+high+dimensions+with..> | 1999-05-05 22:19 | 54K | |
![[ ]](/icons/compressed.gif) | Decomposition+of+a+polytope+into+two+congruent+..> | 1999-05-05 22:19 | 54K | |
![[ ]](/icons/compressed.gif) | Curves+with+increasing+chords.ps.gz | 1999-05-05 22:19 | 71K | |
![[ ]](/icons/compressed.gif) | Curve+intersection+by+the+Subdivision-Supercomp..> | 2008-06-25 15:11 | 262K | |
![[ ]](/icons/compressed.gif) | Crossing+the+bridge+at+night.ps.gz | 2002-08-21 16:13 | 61K | |
![[ ]](/icons/compressed.gif) | Counting+triangulations+and+pseudo-triangulatio..> | 2002-04-04 16:18 | 189K | |
![[ ]](/icons/compressed.gif) | Counting+polyominoes+on+twisted+cylinders.ps.gz | 2004-12-22 16:55 | 186K | |
![[ ]](/icons/compressed.gif) | Counting+convex+polygons+in+planar+point+sets.p..> | 1999-05-05 22:19 | 67K | |
![[ ]](/icons/compressed.gif) | Constant-level+greedy+triangulations+approximat..> | 1999-05-05 22:18 | 90K | |
![[ ]](/icons/compressed.gif) | Computing+the+minimum+Hausdorff+distance+betwee..> | 1999-05-05 22:18 | 32K | |
![[ ]](/icons/compressed.gif) | Computing+the+Frechet+distance+between+piecewis..> | 2004-11-24 10:52 | 184K | |
![[ ]](/icons/compressed.gif) | Binary+trees+having+a+given+number+of+nodes+wit..> | 1999-05-05 22:18 | 38K | |
![[ ]](/icons/compressed.gif) | Approximation+of+convex+figures+by+pairs+of+rec..> | 1999-05-05 22:18 | 52K | |
![[ ]](/icons/compressed.gif) | Approximation+of+an+open+polygonal+curve+with+a..> | 2006-09-18 11:56 | 192K | |
![[ ]](/icons/compressed.gif) | Approximation+of+an+open+polygonal+curve+with+a..> | 2007-07-13 11:56 | 192K | |
![[ ]](/icons/compressed.gif) | Approximating+a+convex+figure+by+a+pairs+of+hom..> | 1999-05-05 22:18 | 52K | |
![[ ]](/icons/compressed.gif) | An+upper+bound+on+the+number+of+facets+of+a+0-1..> | 1999-05-05 22:18 | 23K | |
![[ ]](/icons/compressed.gif) | A+visibility+representation+for+graphs+in+three..> | 1999-05-05 22:18 | 232K | |
![[ ]](/icons/compressed.gif) | A+systolic+array+algorithm+for+the+algebraic+pa..> | 2001-10-26 16:46 | 1.4M | |
![[ ]](/icons/compressed.gif) | A+simple+linear+time+greedy+triangulation+algor..> | 1999-05-05 22:18 | 75K | |
![[ ]](/icons/compressed.gif) | A+new+metric+between+polygons,+and+how+to+compu..> | 1999-05-05 22:18 | 66K | |
![[ ]](/icons/compressed.gif) | A+dynamic+programming+algorithm+for+constructin..> | 2001-07-09 13:31 | 108K | |
![[ ]](/icons/compressed.gif) | A+central+limit+theorem+for+convex+chains+in+th..> | 1999-05-05 22:18 | 80K | |
|