ALGORITHM THEORY - SWAT 2002

By D. PAONI

COMBINING PATTERN DISCOVERY AND PROBABILISTIC MODELING IN DATA MINING SCHEDULING TIME AND SPACE E?CIENT MULTI-METHOD DISPATCHING LINEAR TIME APPROXIMATION SCHEMES FOR VEHICLE SCHEDULING MINIMIZING MAKESPAN FOR THE LAZY BUREAUCRAT PROBLEM A PTAS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH CONTROLLABLE PROCESSING TIMES COMPUTATIONAL GEOMETRY OPTIMUM INAPPROXIMABILITY RESULTS FOR FINDING MINIMUM HIDDEN GUARD SETS IN POLYGONS AND TERRAINS SIMPLEX RANGE SEARCHING AND K NEAREST NEIGHBORS OF A LINE SEGMENT IN 2D ADAPTIVE ALGORITHMS FOR CONSTRUCTING CONVEX HULLS AND TRIANGULATIONS OF POLYGONAL CHAINS EXACT ALGORITHMS AND APPROXIMATION SCHEMES FOR BASE STATION PLACEMENT PROBLEMS A FACTOR-2 APPROXIMATION FOR LABELING POINTS WITH MAXIMUM SLIDING LABELS OPTIMAL ALGORITHM FOR A SPECIAL POINT-LABELING PROBLEM RANDOM ARC ALLOCATION AND APPLICATIONS ON NEIGHBORS IN GEOMETRIC PERMUTATIONS GRAPH ALGORITHMS POWERS OF GEOMETRIC INTERSECTION GRAPHS AND DISPERSION ALGORITHMS E?CIENT DATA REDUCTION FOR DOMINATING SET: A LINEAR PROBLEM KERNEL FOR THE PLANAR CASE PLANAR GRAPH COLORING WITH FORBIDDEN SUBGRAPHS: WHY TREES AND PATHS ARE DANGEROUS APPROXIMATION HARDNESS OF THE STEINER TREE PROBLEM ON GRAPHS THE DOMINATING SET PROBLEM IS FIXED PARAMETER TRACTABLE FOR GRAPHS OF BOUNDED GENUS THE DYNAMIC VERTEX MINIMUM PROBLEM AND ITS APPLICATION TO CLUSTERING-TYPE APPROXIMATION ALGORITHMS A POLYNOMIAL TIME ALGORITHM TO FIND THE MINIMUM CYCLE BASIS OF A REGULAR MATROID APPROXIMATION ALGORITHMS FOR EDGE-DILATION K-CENTER PROBLEMS FOREWARNED IS FORE-ARMED: DYNAMIC DIGRAPH CONNECTIVITY WITH LOOKAHEAD SPEEDS UP A STATIC CLUSTERING ALGORITHM IMPROVED ALGORITHMS FOR THE RANDOM CLUSTER GRAPH MODEL ?-LIST VERTEX COLORING IN LINEAR TIME ROBOTICS ROBOT LOCALIZATION WITHOUT DEPTH PERCEPTION ONLINE PARALLEL HEURISTICS AND ROBOT SEARCHING UNDER THE COMPETITIVE FRAMEWORK ANALYSIS OF HEURISTICS FOR THE FREEZE-TAG PROBLEM APPROXIMATION ALGORITHMS APPROXIMATIONS FOR MAXIMUM TRANSPORTATION PROBLEM WITH PERMUTABLE SUPPLY VECTOR AND OTHER CAPACITATED STAR PACKING PROBLEMS ALL-NORM APPROXIMATION ALGORITHMS APPROXIMABILITY OF DENSE INSTANCES OF NEAREST CODEWORD PROBLEM DATA COMMUNICATION CALL CONTROL WITH K REJECTIONS ON NETWORK DESIGN PROBLEMS: FIXED COST FLOWS AND THE COVERING STEINER PROBLEM PACKET BUNDLING ALGORITHMS FOR THE MULTI-CONSTRAINED ROUTING PROBLEM COMPUTATIONAL BIOLOGY COMPUTING THE THRESHOLD FOR Q-GRAM FILTERS ON THE GENERALITY OF PHYLOGENIES FROM INCOMPLETE DIRECTED CHARACTERS DATA STORAGE AND MANIPULATION SORTING WITH A FORKLIFT TREE DECOMPOSITIONS WITH SMALL COST COMPUTING THE TREEWIDTH AND THE MINIMUM FILL-IN WITH THE MODULAR DECOMPOSITION PERFORMANCE TUNING AN ALGORITHM FOR COMPRESSING RELATIONAL TABLES A RANDOMIZED IN-PLACE ALGORITHM FOR POSITIONING THE KTH ELEMENT IN A MULTISET PAGING ON A RAM WITH LIMITED RESOURCES AN OPTIMAL ALGORITHM FOR FINDING NCA ON PURE POINTER MACHINES AMORTIZED COMPLEXITY OF BULK UPDATES IN AVL-TREES