Conferences in DBLP
Flexible Path Planning Using Corridor Maps. [Citation Graph (, )][DBLP ] A Bridging Model for Multi-core Computing. [Citation Graph (, )][DBLP ] Robust Kinetic Convex Hulls in 3D. [Citation Graph (, )][DBLP ] On Dominance Reporting in 3D. [Citation Graph (, )][DBLP ] Stabbing Convex Polygons with a Segment or a Polygon. [Citation Graph (, )][DBLP ] An Efficient Algorithm for 2D Euclidean 2-Center with Outliers. [Citation Graph (, )][DBLP ] A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry. [Citation Graph (, )][DBLP ] Cache-Oblivious Red-Blue Line Segment Intersection. [Citation Graph (, )][DBLP ] The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. [Citation Graph (, )][DBLP ] Space-Time Tradeoffs for Proximity Searching in Doubling Spaces. [Citation Graph (, )][DBLP ] A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. [Citation Graph (, )][DBLP ] Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs. [Citation Graph (, )][DBLP ] Straight Skeletons of Three-Dimensional Polyhedra. [Citation Graph (, )][DBLP ] Randomized Competitive Analysis for Two-Server Problems. [Citation Graph (, )][DBLP ] Decompositions and Boundary Coverings of Non-convex Fat Polyhedra. [Citation Graph (, )][DBLP ] Approximating Multi-criteria Max-TSP. [Citation Graph (, )][DBLP ] An Integer Programming Algorithm for Routing Optimization in IP Networks. [Citation Graph (, )][DBLP ] A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. [Citation Graph (, )][DBLP ] Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. [Citation Graph (, )][DBLP ] Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. [Citation Graph (, )][DBLP ] A Practical Quicksort Algorithm for Graphics Processors. [Citation Graph (, )][DBLP ] Bloomier Filters: A Second Look. [Citation Graph (, )][DBLP ] Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy. [Citation Graph (, )][DBLP ] A New Approach to Exact Crossing Minimization. [Citation Graph (, )][DBLP ] A Characterization of 2-Player Mechanisms for Scheduling. [Citation Graph (, )][DBLP ] A Local-Search 2-Approximation for 2-Correlation-Clustering. [Citation Graph (, )][DBLP ] The Alcuin Number of a Graph. [Citation Graph (, )][DBLP ] Time-Dependent SHARC-Routing. [Citation Graph (, )][DBLP ] Detecting Regular Visit Patterns. [Citation Graph (, )][DBLP ] Improved Approximation Algorithms for Relay Placement. [Citation Graph (, )][DBLP ] Selfish Bin Packing. [Citation Graph (, )][DBLP ] Improved Randomized Results for That Interval Selection Problem. [Citation Graph (, )][DBLP ] Succinct Representations of Arbitrary Graphs. [Citation Graph (, )][DBLP ] Edge Coloring and Decompositions of Weighted Graphs. [Citation Graph (, )][DBLP ] The Complexity of Sorting with Networks of Stacks and Queues. [Citation Graph (, )][DBLP ] Faster Steiner Tree Computation in Polynomial-Space. [Citation Graph (, )][DBLP ] Fitting a Step Function to a Point Set. [Citation Graph (, )][DBLP ] Faster Swap Edge Computation in Minimum Diameter Spanning Trees. [Citation Graph (, )][DBLP ] The Partial Augment-Relabel Algorithm for the Maximum Flow Problem. [Citation Graph (, )][DBLP ] An Optimal Dynamic Spanner for Doubling Metric Spaces. [Citation Graph (, )][DBLP ] RFQ: Redemptive Fair Queuing. [Citation Graph (, )][DBLP ] Range Medians. [Citation Graph (, )][DBLP ] Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. [Citation Graph (, )][DBLP ] Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison. [Citation Graph (, )][DBLP ] On the Complexity of Optimal Hotlink Assignment. [Citation Graph (, )][DBLP ] Oblivious Randomized Direct Search for Real-Parameter Optimization. [Citation Graph (, )][DBLP ] Path Minima in Incremental Unrooted Trees. [Citation Graph (, )][DBLP ] Improved Competitive Performance Bounds for CIOQ Switches. [Citation Graph (, )][DBLP ] Two-Stage Robust Network Design with Exponential Scenarios. [Citation Graph (, )][DBLP ] An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. [Citation Graph (, )][DBLP ] More Robust Hashing: Cuckoo Hashing with a Stash. [Citation Graph (, )][DBLP ] Better and Simpler Approximation Algorithms for the Stable Marriage Problem. [Citation Graph (, )][DBLP ] Edit Distances and Factorisations of Even Permutations. [Citation Graph (, )][DBLP ] Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count. [Citation Graph (, )][DBLP ] Facility Location in Dynamic Geometric Data Streams. [Citation Graph (, )][DBLP ] The Effects of Local Randomness in the Adversarial Queueing Model. [Citation Graph (, )][DBLP ] Parallel Imaging Problem. [Citation Graph (, )][DBLP ] An Online Algorithm for Finding the Longest Previous Factors. [Citation Graph (, )][DBLP ] Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. [Citation Graph (, )][DBLP ] Improved BDD Algorithms for the Simulation of Quantum Circuits. [Citation Graph (, )][DBLP ] Mobile Route Planning. [Citation Graph (, )][DBLP ] How Reliable Are Practical Point-in-Polygon Strategies?. [Citation Graph (, )][DBLP ] Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach. [Citation Graph (, )][DBLP ] Approximability of Average Completion Time Scheduling on Unrelated Machines. [Citation Graph (, )][DBLP ] Relative Convex Hulls in Semi-dynamic Subdivisions. [Citation Graph (, )][DBLP ] An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms. [Citation Graph (, )][DBLP ] On the Size of the 3D Visibility Skeleton: Experimental Results. [Citation Graph (, )][DBLP ] An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions. [Citation Graph (, )][DBLP ] Deterministic Sampling Algorithms for Network Design. [Citation Graph (, )][DBLP ]