ALGORITHMS AND COMPUTATION
DELAUNAY MESHING OF SURFACES ALGORITHMIC GRAPH MINOR THEORY: IMPROVED GRID MINOR BOUNDS AND WAGNER’S CONTRACTION BRANCHING AND TREEWIDTH BASED EXACT ALGORITHMS DETERMINISTIC SPLITTER FINDING IN A STREAM WITH CONSTANT STORAGE AND GUARANTEES OPTIMAL ALGORITHMS FOR TOWER OF HANOI PROBLEMS WITH RELAXED PLACEMENT RULES FLEXIBLE WORD DESIGN AND GRAPH LABELING FREQUENCY ALLOCATION PROBLEMS FOR LINEAR CELLULAR NETWORKS FINITE-STATE ONLINE ALGORITHMS AND THEIR AUTOMATED COMPETITIVE ANALYSIS O?INE SORTING BU?ERS ON LINE APPROXIMATING TREE EDIT DISTANCE THROUGH STRING EDIT DISTANCE A 6-APPROXIMATION ALGORITHM FOR COMPUTING SMALLEST COMMON AON-SUPERTREE WITH APPLICATION TO THE RECONSTRUCTION OF GLYCAN TREES IMPROVED APPROXIMATION FOR SINGLE-SINK BUY-AT-BULK APPROXIMABILITY OF PARTITIONING GRAPHS WITH SUPPLY AND DEMAND CONVEX GRID DRAWINGS OF PLANE GRAPHS WITH RECTANGULAR CONTOURS ALGORITHMS ON GRAPHS WITH SMALL DOMINATING TARGETS E?CIENT ALGORITHMS FOR WEIGHTED RANK-MAXIMAL MATCHINGS AND RELATED PROBLEMS ON ESTIMATING PATH AGGREGATES OVER STREAMING GRAPHS DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM RELATIONS BETWEEN TWO COMMON TYPES OF RECTANGULAR TILINGS QUALITY TETRAHEDRAL MESH GENERATION FOR MACROMOLECULES ON APPROXIMATING THE TSP WITH INTERSECTING NEIGHBORHOODS NEGATION-LIMITED COMPLEXITY OF PARITY AND INVERTERS THE COMPLEXITY OF QUASIGROUP ISOMORPHISM AND THE MINIMUM GENERATING SET PROBLEM INVERSE HAMILTONIAN CYCLE AND INVERSE 3-D MATCHING ARE CONP-COMPLETE PARAMETERIZED PROBLEMS ON COINCIDENCE GRAPHS ON 2-QUERY CODEWORD TESTING WITH NEAR-PERFECT COMPLETENESS POKETREE: A DYNAMICALLY COMPETITIVE DATA STRUCTURE WITH GOOD WORST-CASE PERFORMANCE E?CIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS ON LOCATING DISJOINT SEGMENTS WITH MAXIMUM SUM OF DENSITIES TWO-TIER RELAXED HEAPS THE INTERVAL LIAR GAME HOW MUCH INDEPENDENT SHOULD INDIVIDUAL CONTACTS BE TO FORM A SMALL–WORLD? FASTER CENTRALIZED COMMUNICATION IN RADIO NETWORKS ON THE RUNTIME AND ROBUSTNESS OF RANDOMIZED BROADCASTING LOCAL SEARCH IN EVOLUTIONARY ALGORITHMS: THE IMPACT OF THE LOCAL SEARCH FREQUENCY NON-COOPERATIVE FACILITY LOCATION AND COVERING GAMES OPTIMAL ALGORITHMS FOR THE PATH/TREE-SHAPED FACILITY LOCATION PROBLEMS IN TREES MULTIOBJECTIVE OPTIMIZATION: IMPROVED FPTAS FOR SHORTEST PATHS AND NON-LINEAR OBJECTIVES WITH APPLICATIONS ALGORITHMS FOR COMPUTING VARIANTS OF THE LONGEST COMMON SUBSEQUENCE PROBLEM CONSTRUCTING LABELING SCHEMES THROUGH UNIVERSAL MATRICES MAKING ARBITRARY GRAPHS TRANSITIVELY ORIENTABLE: MINIMAL COMPARABILITY COMPLETIONS ANALYZING DISTURBED DI?USION ON NETWORKS EXACT ALGORITHMS FOR FINDING THE MINIMUM INDEPENDENT DOMINATING SET IN GRAPHS ON ISOMORPHISM AND CANONIZATION OF TOURNAMENTS AND HYPERTOURNAMENTS E?CIENT ALGORITHMS FOR THE SUM SELECTION PROBLEM AND K MAXIMUM SUMS PROBLEM DETERMINISTIC RANDOM WALKS ON THE TWO-DIMENSIONAL GRID IMPROVING TIME AND SPACE COMPLEXITY FOR COMPRESSED PATTERN MATCHING IMPROVED MULTI-UNIT AUCTION CLEARING ALGORITHMS WITH INTERVAL (MULTIPLE-CHOICE) KNAPSACK PROBLEMS A SIMPLE MESSAGE PASSING ALGORITHM FOR GRAPH PARTITIONING PROBLEMS MINIMAL INTERVAL COMPLETION THROUGH GRAPH EXPLORATION BALANCED CUT APPROXIMATION IN RANDOM GEOMETRIC GRAPHS IMPROVED ALGORITHMS FOR THE MINMAX-REGRET 1-CENTER PROBLEM ON APPROXIMATING THE MAXIMUM SIMPLE SHARING PROBLEM APPROXIMATION SCHEME FOR LOWEST OUTDEGREE ORIENTATION AND GRAPH DENSITY MEASURES IMPROVED APPROXIMATION ALGORITHMS FOR MAXIMUM RESOURCE BIN PACKING AND LAZY BIN COVERING PROBLEMS PARTITIONING THE NODES OF A GRAPH TO MINIMIZE THE SUM OF SUBGRAPH RADII E?CIENT PR¨UFER-LIKE CODING AND COUNTING LABELLED HYPERTREES INTUITIVE ALGORITHMS AND T-VERTEX COVER POLITICIAN’S FIRE?GHTING RUNTIME ANALYSIS OF A SIMPLE ANT COLONY OPTIMIZATION ALGORITHM LOWER BOUNDS ON THE DETERMINISTIC AND QUANTUM COMMUNICATION COMPLEXITIES OF HAMMING-DISTANCE PROBLEMS RESOURCES REQUIRED FOR PREPARING GRAPH STATES ONLINE MULTI-PATH ROUTING IN A MAZE ON THE ON-LINE K-TRUCK PROBLEM WITH BENE?T MAXIMIZATION ENERGY-E?CIENT BROADCAST SCHEDULING FOR SPEED-CONTROLLED TRANSMISSION CHANNELS ONLINE PACKET ADMISSION AND OBLIVIOUS ROUTING IN SENSOR NETWORKS FIELD SPLITTING PROBLEMS IN INTENSITY-MODULATED RADIATION THERAPY SHAPE RECTANGULARIZATION PROBLEMS IN INTENSITY-MODULATED RADIATION THERAPY A NEW APPROXIMATION ALGORITHM FOR MULTIDIMENSIONAL RECTANGLE TILING TESSELLATION OF QUADRATIC ELEMENTS E?ECTIVE ELECTIONS FOR ANONYMOUS MOBILE AGENTS GATHERING ASYNCHRONOUS OBLIVIOUS MOBILE ROBOTS IN A RING PROVABLY SECURE STEGANOGRAPHY AND THE COMPLEXITY OF SAMPLING