Index of /~rote/Papers/postscript

[ICO]NameLast modifiedSizeDescription

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

Apache/2.4.62 (Debian) Server at page.mi.fu-berlin.de Port 80