Conferences in DBLP
The Robustness of Level Sets. [Citation Graph (, )][DBLP ] Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. [Citation Graph (, )][DBLP ] Non-clairvoyant Speed Scaling for Weighted Flow Time. [Citation Graph (, )][DBLP ] A Robust PTAS for Machine Covering and Packing. [Citation Graph (, )][DBLP ] Balancing Degree, Diameter and Weight in Euclidean Spanners. [Citation Graph (, )][DBLP ] Testing Euclidean Spanners. [Citation Graph (, )][DBLP ] Fast Approximation in Subspaces by Doubling Metric Decomposition. [Citation Graph (, )][DBLP ] f -Sensitivity Distance Oracles and Routing Schemes. [Citation Graph (, )][DBLP ] Fast Minor Testing in Planar Graphs. [Citation Graph (, )][DBLP ] On the Number of Spanning Trees a Planar Graph Can Have. [Citation Graph (, )][DBLP ] Contractions of Planar Graphs in Polynomial Time. [Citation Graph (, )][DBLP ] Communication Complexity of Quasirandom Rumor Spreading. [Citation Graph (, )][DBLP ] A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing. [Citation Graph (, )][DBLP ] Contribution Games in Social Networks. [Citation Graph (, )][DBLP ] Improved Bounds for Online Stochastic Matching. [Citation Graph (, )][DBLP ] Online Stochastic Packing Applied to Display Ad Allocation. [Citation Graph (, )][DBLP ] Caching Is Hard - Even in the Fault Model. [Citation Graph (, )][DBLP ] Superselectors: Efficient Constructions and Applications. [Citation Graph (, )][DBLP ] Estimating the Average of a Lipschitz-Continuous Function from One Sample. [Citation Graph (, )][DBLP ] Streaming Graph Computations with a Helpful Advisor. [Citation Graph (, )][DBLP ] Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier - (Extended Abstract). [Citation Graph (, )][DBLP ] Minimum Vertex Cover in Rectangle Graphs. [Citation Graph (, )][DBLP ] Feedback Vertex Sets in Tournaments. [Citation Graph (, )][DBLP ] n -Level Graph Partitioning. [Citation Graph (, )][DBLP ] Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. [Citation Graph (, )][DBLP ] Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound. [Citation Graph (, )][DBLP ] Budgeted Red-Blue Median and Its Generalizations. [Citation Graph (, )][DBLP ] All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. [Citation Graph (, )][DBLP ] Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems. [Citation Graph (, )][DBLP ] Robust Algorithms for Sorting Railway Cars. [Citation Graph (, )][DBLP ] Cloning Voronoi Diagrams via Retroactive Data Structures. [Citation Graph (, )][DBLP ] A Unified Approach to Approximate Proximity Searching. [Citation Graph (, )][DBLP ] Spatio-temporal Range Searching over Compressed Kinetic Sensor Data. [Citation Graph (, )][DBLP ] Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space - with Fast Point-Location. [Citation Graph (, )][DBLP ] Local Graph Exploration and Fast Property Testing. [Citation Graph (, )][DBLP ] A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. [Citation Graph (, )][DBLP ] Fast Prefix Search in Little Space, with Applications. [Citation Graph (, )][DBLP ] On the Huffman and Alphabetic Tree Problem with General Cost Functions. [Citation Graph (, )][DBLP ] Medium-Space Algorithms for Inverse BWT. [Citation Graph (, )][DBLP ] Median Trajectories. [Citation Graph (, )][DBLP ] Optimal Cover of Points by Disks in a Simple Polygon. [Citation Graph (, )][DBLP ] Stability of epsilon -Kernels. [Citation Graph (, )][DBLP ] The Geodesic Diameter of Polygonal Domains. [Citation Graph (, )][DBLP ] Polyhedral and Algorithmic Properties of Quantified Linear Programs. [Citation Graph (, )][DBLP ] Approximating Parameterized Convex Optimization Problems. [Citation Graph (, )][DBLP ] Approximation Schemes for Multi-Budgeted Independence Systems. [Citation Graph (, )][DBLP ] Algorithmic Meta-theorems for Restrictions of Treewidth. [Citation Graph (, )][DBLP ] Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. [Citation Graph (, )][DBLP ] Constructing the R* Consensus Tree of Two Trees in Subcubic Time. [Citation Graph (, )][DBLP ]