|
|
Conferences in DBLP
Optimal Exploration of Terrains with Obstacles. [Citation Graph (, )][DBLP]
Reconstructing a Simple Polygon from Its Angles. [Citation Graph (, )][DBLP]
Semidefinite Programming and Approximation Algorithms: A Survey. [Citation Graph (, )][DBLP]
Strictly-Regular Number System and Data Structures. [Citation Graph (, )][DBLP]
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. [Citation Graph (, )][DBLP]
The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition. [Citation Graph (, )][DBLP]
A Bottom-Up Method and Fast Algorithms for max independent set. [Citation Graph (, )][DBLP]
Capacitated Domination Faster Than O(2n). [Citation Graph (, )][DBLP]
Isomorphism for Graphs of Bounded Feedback Vertex Set Number. [Citation Graph (, )][DBLP]
On Feedback Vertex Set New Measure and New Structures. [Citation Graph (, )][DBLP]
Conflict-Free Coloring Made Stronger. [Citation Graph (, )][DBLP]
Polychromatic Coloring for Half-Planes. [Citation Graph (, )][DBLP]
A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem. [Citation Graph (, )][DBLP]
Minimum and Maximum against k Lies. [Citation Graph (, )][DBLP]
Feasible and Accurate Algorithms for Covering Semidefinite Programs. [Citation Graph (, )][DBLP]
The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms. [Citation Graph (, )][DBLP]
Systems of Linear Equations over \mathbbF2\mathbb{F}_2 and Problems Parameterized above Average. [Citation Graph (, )][DBLP]
Capacitated max -Batching with Interval Graph Compatibilities. [Citation Graph (, )][DBLP]
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs. [Citation Graph (, )][DBLP]
Representing a Functional Curve by Curves with Fewer Peaks. [Citation Graph (, )][DBLP]
Bregman Clustering for Separable Instances. [Citation Graph (, )][DBLP]
Improved Methods For Generating Quasi-gray Codes. [Citation Graph (, )][DBLP]
The MST of Symmetric Disk Graphs Is Light. [Citation Graph (, )][DBLP]
Vector Bin Packing with Multiple-Choice. [Citation Graph (, )][DBLP]
Bin Packing with Fixed Number of Bins Revisited. [Citation Graph (, )][DBLP]
Cops and Robber Game without Recharging. [Citation Graph (, )][DBLP]
Path Schematization for Route Sketches. [Citation Graph (, )][DBLP]
Approximation Algorithms for Free-Label Maximization. [Citation Graph (, )][DBLP]
Phase Transitions in Sampling Algorithms and the Underlying Random Structures. [Citation Graph (, )][DBLP]
Polynomial Kernels for Hard Problems on Disk Graphs. [Citation Graph (, )][DBLP]
Faster Parameterized Algorithms for Minor Containment. [Citation Graph (, )][DBLP]
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. [Citation Graph (, )][DBLP]
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput. [Citation Graph (, )][DBLP]
Online Function Tracking with Generalized Penalties. [Citation Graph (, )][DBLP]
Better Bounds on Online Unit Clustering. [Citation Graph (, )][DBLP]
Online Selection of Intervals and t-Intervals. [Citation Graph (, )][DBLP]
Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. [Citation Graph (, )][DBLP]
Improved Algorithm for Degree Bounded Survivable Network Design Problem. [Citation Graph (, )][DBLP]
Minimizing the Diameter of a Network Using Shortcut Edges. [Citation Graph (, )][DBLP]
|
