|
|
Conferences in DBLP
Some Open Questions Related to Cuckoo Hashing. [Citation Graph (, )][DBLP]
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. [Citation Graph (, )][DBLP]
Improved Approximation Algorithms for Label Cover Problems. [Citation Graph (, )][DBLP]
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. [Citation Graph (, )][DBLP]
On Inducing Polygons and Related Problems. [Citation Graph (, )][DBLP]
Computing 3D Periodic Triangulations. [Citation Graph (, )][DBLP]
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. [Citation Graph (, )][DBLP]
Approximability of Sparse Integer Programs. [Citation Graph (, )][DBLP]
Iterative Rounding for Multi-Objective Optimization Problems. [Citation Graph (, )][DBLP]
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. [Citation Graph (, )][DBLP]
Constructing Delaunay Triangulations along Space-Filling Curves. [Citation Graph (, )][DBLP]
Piercing Translates and Homothets of a Convex Body. [Citation Graph (, )][DBLP]
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. [Citation Graph (, )][DBLP]
On Revenue Maximization in Second-Price Ad Auctions. [Citation Graph (, )][DBLP]
Clustering-Based Bidding Languages for Sponsored Search. [Citation Graph (, )][DBLP]
Altruism in Atomic Congestion Games. [Citation Graph (, )][DBLP]
Geometric Spanners for Weighted Point Sets. [Citation Graph (, )][DBLP]
k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. [Citation Graph (, )][DBLP]
Narrow-Shallow-Low-Light Trees with and without Steiner Points. [Citation Graph (, )][DBLP]
Bounded Budget Betweenness Centrality Game for Strategic Network Formations. [Citation Graph (, )][DBLP]
Exact and Approximate Equilibria for Optimal Group Network Formation. [Citation Graph (, )][DBLP]
On the Performance of Approximate Equilibria in Congestion Games. [Citation Graph (, )][DBLP]
Optimality and Competitiveness of Exploring Polygons by Mobile Robots. [Citation Graph (, )][DBLP]
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. [Citation Graph (, )][DBLP]
Dynamic vs. Oblivious Routing in Network Design. [Citation Graph (, )][DBLP]
Algorithms Meet Art, Puzzles, and Magic. [Citation Graph (, )][DBLP]
Polynomial-Time Algorithm for the Leafage of Chordal Graphs. [Citation Graph (, )][DBLP]
Breaking the O(m2n) Barrier for Minimum Cycle Bases. [Citation Graph (, )][DBLP]
Shape Fitting on Point Sets with Probability Distributions. [Citation Graph (, )][DBLP]
An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract). [Citation Graph (, )][DBLP]
Complete Parsimony Haplotype Inference Problem and Algorithms. [Citation Graph (, )][DBLP]
Linear-Time Recognition of Probe Interval Graphs. [Citation Graph (, )][DBLP]
Wireless Scheduling with Power Control. [Citation Graph (, )][DBLP]
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. [Citation Graph (, )][DBLP]
Approximability of OFDMA Scheduling. [Citation Graph (, )][DBLP]
Maximum Flow in Directed Planar Graphs with Vertex Capacities. [Citation Graph (, )][DBLP]
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. [Citation Graph (, )][DBLP]
On Optimally Partitioning a Text to Improve Its Compression. [Citation Graph (, )][DBLP]
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling. [Citation Graph (, )][DBLP]
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. [Citation Graph (, )][DBLP]
Preemptive Online Scheduling with Reordering. [Citation Graph (, )][DBLP]
d-Dimensional Knapsack in the Streaming Model. [Citation Graph (, )][DBLP]
Sparse Cut Projections in Graph Streams. [Citation Graph (, )][DBLP]
Bipartite Graph Matchings in the Semi-streaming Model. [Citation Graph (, )][DBLP]
The Oil Searching Problem. [Citation Graph (, )][DBLP]
Hyperbolic Dovetailing. [Citation Graph (, )][DBLP]
On the Expansion and Diameter of Bluetooth-Like Topologies. [Citation Graph (, )][DBLP]
Minimum Makespan Multi-vehicle Dial-a-Ride. [Citation Graph (, )][DBLP]
Google's Auction for TV Ads. [Citation Graph (, )][DBLP]
Inclusion/Exclusion Meets Measure and Conquer. [Citation Graph (, )][DBLP]
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. [Citation Graph (, )][DBLP]
Counting Paths and Packings in Halves. [Citation Graph (, )][DBLP]
Accelerating Multi-modal Route Planning by Access-Nodes. [Citation Graph (, )][DBLP]
Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation. [Citation Graph (, )][DBLP]
Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem. [Citation Graph (, )][DBLP]
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth. [Citation Graph (, )][DBLP]
Kernel Bounds for Disjoint Cycles and Disjoint Paths. [Citation Graph (, )][DBLP]
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. [Citation Graph (, )][DBLP]
Rank-Pairing Heaps. [Citation Graph (, )][DBLP]
3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit. [Citation Graph (, )][DBLP]
Hash, Displace, and Compress. [Citation Graph (, )][DBLP]
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. [Citation Graph (, )][DBLP]
Contraction Bidimensionality: The Accurate Picture. [Citation Graph (, )][DBLP]
Minimizing Movement: Fixed-Parameter Tractability. [Citation Graph (, )][DBLP]
Storing a Compressed Function with Constant Time Access. [Citation Graph (, )][DBLP]
Experimental Variations of a Theoretically Good Retrieval Data Structure. [Citation Graph (, )][DBLP]
Short Labels for Lowest Common Ancestors in Trees. [Citation Graph (, )][DBLP]
Disproof of the Neighborhood Conjecture with Implications to SAT. [Citation Graph (, )][DBLP]
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. [Citation Graph (, )][DBLP]
|
