![[ICO]](/icons/blank.gif) | Name | Last modified | Size | Description |
|
![[PARENTDIR]](/icons/back.gif) | Parent Directory | | - | |
![[ ]](/icons/a.gif) | A+central+limit+theorem+for+convex+chains+in+th..> | 1999-04-22 15:21 | 218K | |
![[ ]](/icons/a.gif) | A+dynamic+programming+algorithm+for+constructin..> | 2001-07-09 13:29 | 333K | |
![[ ]](/icons/a.gif) | A+new+metric+between+polygons,+and+how+to+compu..> | 1999-04-22 15:13 | 228K | |
![[ ]](/icons/a.gif) | A+simple+linear+time+greedy+triangulation+algor..> | 1999-04-22 15:18 | 205K | |
![[ ]](/icons/a.gif) | A+visibility+representation+for+graphs+in+three..> | 1999-04-22 15:23 | 2.0M | |
![[ ]](/icons/a.gif) | An+upper+bound+on+the+number+of+facets+of+a+0-1..> | 1999-04-27 19:10 | 54K | |
![[ ]](/icons/a.gif) | Approximating+a+convex+figure+by+a+pairs+of+hom..> | 1999-04-27 18:36 | 150K | |
![[ ]](/icons/a.gif) | Approximation+of+an+open+polygonal+curve+with+a..> | 2006-05-31 11:51 | 438K | |
![[ ]](/icons/a.gif) | Approximation+of+convex+figures+by+pairs+of+rec..> | 1999-04-27 18:36 | 150K | |
![[ ]](/icons/a.gif) | Binary+trees+having+a+given+number+of+nodes+wit..> | 1999-04-27 18:14 | 93K | |
![[ ]](/icons/a.gif) | Computing+the+Frechet+distance+between+piecewis..> | 2004-11-24 10:31 | 547K | |
![[ ]](/icons/a.gif) | Computing+the+minimum+Hausdorff+distance+betwee..> | 1999-04-22 15:11 | 78K | |
![[ ]](/icons/a.gif) | Constant-level+greedy+triangulations+approximat..> | 1999-04-22 15:57 | 240K | |
![[ ]](/icons/a.gif) | Counting+convex+polygons+in+planar+point+sets.ps | 1999-04-27 19:34 | 163K | |
![[ ]](/icons/a.gif) | Counting+polyominoes+on+twisted+cylinders.ps | 2004-12-22 16:42 | 582K | |
![[ ]](/icons/a.gif) | Counting+triangulations+and+pseudo-triangulatio..> | 2001-10-26 18:27 | 464K | |
![[ ]](/icons/a.gif) | Crossing+the+bridge+at+night.ps | 2002-08-21 16:10 | 147K | |
![[ ]](/icons/a.gif) | Curve+intersection+by+the+Subdivision-Supercomp..> | 2008-05-16 12:18 | 1.5M | |
![[ ]](/icons/a.gif) | Curves+with+increasing+chords.ps | 1999-04-22 15:14 | 221K | |
![[ ]](/icons/a.gif) | Decomposition+of+a+polytope+into+two+congruent+..> | 1999-04-27 18:16 | 163K | |
![[ ]](/icons/a.gif) | Degenerate+convex+hulls+in+high+dimensions+with..> | 1999-04-22 15:12 | 153K | |
![[ ]](/icons/a.gif) | Determinants+and+Pfaffians:+algebraic+and+combi..> | 2000-06-27 16:12 | 257K | |
![[ ]](/icons/a.gif) | Division-free+algorithms+for+the+determinant+an..> | 2001-07-09 13:29 | 441K | |
![[ ]](/icons/a.gif) | Embedding+3-polytopes+on+a+small+grid.ps | 2007-03-27 17:01 | 648K | |
![[ ]](/icons/a.gif) | Expansive+motions+and+the+polytope+of+pointed+p..> | 2002-10-30 17:02 | 1.1M | |
![[ ]](/icons/a.gif) | Expansive+motions+on+the+line+and+the+associahe..> | 2001-06-27 14:15 | 157K | |
![[ ]](/icons/a.gif) | Fast+2-variable+integer+programming.ps | 2001-02-26 19:01 | 221K | |
![[ ]](/icons/a.gif) | Fast+reduction+of+ternary+quadratic+forms.ps | 2001-09-27 10:31 | 211K | |
![[ ]](/icons/a.gif) | Finding+a+curve+in+a+map.ps | 2003-03-24 18:04 | 235K | |
![[ ]](/icons/a.gif) | Finding+a+shortest+vector+in+a+two-dimensional+..> | 1999-04-22 15:16 | 81K | |
![[ ]](/icons/a.gif) | Flip+graphs+of+bounded-degree+pseudotriangulati..> | 2009-05-05 15:29 | 635K | |
![[ ]](/icons/a.gif) | Flip+graphs+of+bounded-degree+triangulations-v1.ps | 2009-05-05 15:29 | 635K | |
![[ ]](/icons/a.gif) | Fractured+lattices,+integer+programming,+and+Di..> | 2007-07-20 17:45 | 512K | |
![[ ]](/icons/a.gif) | Generalized+self-approaching+curves.ps | 1999-04-27 20:09 | 1.0M | |
![[ ]](/icons/a.gif) | Geometric+clusterings.ps | 2002-04-05 13:48 | 226K | |
![[ ]](/icons/a.gif) | How+difficult+is+it+to+walk+the+dog.ps | 2007-03-27 15:09 | 322K | |
![[ ]](/icons/a.gif) | Incremental+constructions+con+BRIO.ps | 2003-03-31 11:04 | 1.7M | |
![[ ]](/icons/a.gif) | Infinitesimally+locked+self-touching+linkages+w..> | 2002-03-10 22:17 | 443K | |
![[ ]](/icons/a.gif) | Integer+point+sets+minimizing+average+pairwise+..> | 2010-04-23 15:01 | 829K | |
![[ ]](/icons/a.gif) | Maintaining+the+approximate+width+of+a+set+of+p..> | 1999-04-27 18:37 | 565K | |
![[ ]](/icons/a.gif) | Matching+convex+shapes+with+respect+to+the+symm..> | 1999-04-22 15:20 | 254K | |
![[ ]](/icons/a.gif) | Matching+planar+maps.ps | 2003-05-28 16:21 | 1.8M | |
![[ ]](/icons/a.gif) | Matching+shapes+with+a+reference+point.ps | 1999-04-22 15:17 | 268K | |
![[ ]](/icons/a.gif) | Matrix+scaling+by+network+flow.ps | 2006-10-02 15:26 | 446K | |
![[ ]](/icons/a.gif) | Matrix+scaling+by+network+flows.ps | 2006-07-05 19:42 | 384K | |
![[ ]](/icons/a.gif) | Minimizing+the+number+of+tardy+jobs+on+a+single..> | 1999-04-29 02:01 | 124K | |
![[ ]](/icons/a.gif) | Minimum-link+paths+among+obstacles+in+the+plane.ps | 1999-04-22 15:11 | 360K | |
![[ ]](/icons/a.gif) | Minimum-weight+triangulation+is+NP-hard.ps | 2008-03-27 17:57 | 2.4M | |
![[ ]](/icons/a.gif) | Non-crossing+frameworks+with+non-crossing+recip..> | 2004-06-01 21:50 | 3.7M | |
![[ ]](/icons/a.gif) | Obnoxious+centers+for+graphs.ps | 2010-12-15 11:56 | 633K | |
![[ ]](/icons/a.gif) | Obnoxious+centers+in+graphs.ps | 2007-01-12 16:24 | 464K | |
![[ ]](/icons/a.gif) | On+constrained+minimum+pseudotriangulations.ps | 2003-04-16 11:24 | 355K | |
![[ ]](/icons/a.gif) | On+the+Frechet+distance+of+a+set+of+curves.ps | 2004-06-30 18:04 | 262K | |
![[ ]](/icons/a.gif) | On+the+complexity+of+the+linkage+reconfiguratio..> | 2004-01-13 10:38 | 608K | |
![[ ]](/icons/a.gif) | On+the+distribution+of+sums+of+vectors+in+gener..> | 1999-04-27 20:02 | 1.2M | |
![[ ]](/icons/a.gif) | On+the+geometric+dilation+of+closed+curves,+gra..> | 2005-08-25 17:41 | 1.3M | |
![[ ]](/icons/a.gif) | On+the+geometric+dilation+of+curves+and+point+s..> | 2004-07-08 19:42 | 635K | |
![[ ]](/icons/a.gif) | On+the+maximum+size+of+an+anti-chain+of+linearl..> | 2008-01-11 14:52 | 363K | |
![[ ]](/icons/a.gif) | On-line+q-adic+covering+by+the+method+of+the+n-..> | 2001-07-09 13:29 | 230K | |
![[ ]](/icons/a.gif) | Optimal+logistics+for+expeditions+-+the+jeep+pr..> | 1999-04-22 15:21 | 441K | |
![[ ]](/icons/a.gif) | Path+problems+in+graphs.ps | 1999-04-22 15:10 | 324K | |
![[ ]](/icons/a.gif) | Piecewise+linear+Morse+theory.ps | 2007-06-12 19:30 | 205K | |
![[ ]](/icons/a.gif) | Planar+embeddings+of+graphs+with+specified+edge..> | 2003-08-26 17:49 | 6.6M | |
![[ ]](/icons/a.gif) | Pseudo-triangulations+-+a+survey.ps | 2007-10-16 13:39 | 1.5M | |
![[ ]](/icons/a.gif) | Pseudo-triangulations+-+a+survey.psQ.ps | 2007-10-17 11:12 | 1.5M | |
![[ ]](/icons/a.gif) | Quasi-Monte-Carlo+methods+and+the+dispersion+of..> | 1999-04-22 15:15 | 213K | |
![[ ]](/icons/a.gif) | Reachability+of+fuzzy+matrix+period.ps | 1999-04-27 19:18 | 240K | |
![[ ]](/icons/a.gif) | Recovering+structure+from+r-sampled+objects.ps | 2009-07-20 17:58 | 5.2M | |
![[ ]](/icons/a.gif) | Sequences+with+subword+complexity+2n.ps | 1999-04-22 15:13 | 174K | |
![[ ]](/icons/a.gif) | Simple+and+optimal+output-sensitive+constructio..> | 2004-05-14 19:46 | 12M | |
![[ ]](/icons/a.gif) | Solution+to+problem+74.ps | 1999-04-22 15:20 | 250K | |
![[ ]](/icons/a.gif) | Spherical+dispersion+with+an+application+to+pol..> | 1999-04-22 15:15 | 102K | |
![[ ]](/icons/a.gif) | The+N-line+traveling+salesman+problem.ps | 1999-04-22 15:08 | 212K | |
![[ ]](/icons/a.gif) | The+convergence+rate+of+the+Sandwich+algorithm+..> | 1999-04-22 15:12 | 382K | |
![[ ]](/icons/a.gif) | The+convex-hull-and-line+traveling+salesman+pro..> | 1999-04-22 15:14 | 227K | |
![[ ]](/icons/a.gif) | The+number+of+spanning+trees+in+a+planar+graph.ps | 2005-04-29 16:21 | 229K | |
![[ ]](/icons/a.gif) | The+obnoxious+center+problem+on+a+tree.ps | 2001-07-30 11:10 | 246K | |
![[ ]](/icons/a.gif) | The+quadratic+assignment+problem+with+a+monoton..> | 2001-07-09 13:30 | 336K | |
![[ ]](/icons/a.gif) | The+zigzag+path+of+a+pseudo-triangulation.ps | 2003-05-28 14:54 | 696K | |
![[ ]](/icons/a.gif) | There+are+not+too+many+magic+configurations.ps | 2007-03-09 11:10 | 661K | |
![[ ]](/icons/a.gif) | Three-clustering+of+points+in+the+plane.ps | 1999-04-22 15:16 | 131K | |
![[ ]](/icons/a.gif) | Threshold+arrangements+and+the+knapsack+problem.ps | 2005-05-13 13:08 | 243K | |
![[ ]](/icons/a.gif) | Time+complexity+and+linear-time+approximation+o..> | 1999-04-22 15:23 | 136K | |
![[ ]](/icons/a.gif) | Toward+optimal+diffusion+matrices.ps | 2002-07-17 14:32 | 338K | |
![[ ]](/icons/a.gif) | Triangulations+intersect+nicely.ps | 1999-04-22 15:19 | 283K | |
![[ ]](/icons/a.gif) | Two+solvable+cases+of+the+traveling+salesman+pr..> | 2002-12-10 23:01 | 962K | |
![[ ]](/icons/a.gif) | Upper+bounds+on+the+maximal+number+of+facets+of..> | 1999-04-27 19:13 | 168K | |
![[ ]](/icons/a.gif) | Vehicle+routing+in+an+automated+warehouse:+anal..> | 1999-04-22 15:12 | 145K | |
![[ ]](/icons/a.gif) | Webs,+iteration+groups,+and+equivalent+changes+..> | 1999-04-22 15:16 | 411K | |
![[ ]](/icons/a.gif) | matching-planar-maps.ps | 2003-10-20 18:12 | 1.4M | |
|