|
|
Conferences in DBLP
On the Optimality of Spiral Search. [Citation Graph (, )][DBLP]
An Improved Competitive Algorithm for Reordering Buffer Management. [Citation Graph (, )][DBLP]
How to Meet Asynchronously (Almost) Everywhere. [Citation Graph (, )][DBLP]
A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. [Citation Graph (, )][DBLP]
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. [Citation Graph (, )][DBLP]
Testing Monotone Continuous Distributions on High-dimensional Real Cubes. [Citation Graph (, )][DBLP]
Property Testing and Parameter Testing for Permutations. [Citation Graph (, )][DBLP]
Near-Optimal Sublinear Time Algorithms for Ulam Distance. [Citation Graph (, )][DBLP]
Lower Bounds for Testing Triangle-freeness in Boolean Functions. [Citation Graph (, )][DBLP]
Counting Stars and Other Small Subgraphs in Sublinear Time. [Citation Graph (, )][DBLP]
Cell-Probe Lower Bounds for Succinct Partial Sums. [Citation Graph (, )][DBLP]
On the Cell Probe Complexity of Dynamic Membership. [Citation Graph (, )][DBLP]
Fully-Functional Succinct Trees. [Citation Graph (, )][DBLP]
Data Structures for Range Minimum Queries in Multidimensional Arrays. [Citation Graph (, )][DBLP]
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. [Citation Graph (, )][DBLP]
Differential Privacy in New Settings. [Citation Graph (, )][DBLP]
Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. [Citation Graph (, )][DBLP]
Genus and the Geometry of the Cut Graph. [Citation Graph (, )][DBLP]
Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP]
Inapproximability for Planar Embedding Problems. [Citation Graph (, )][DBLP]
Towards a Calculus for Non-Linear Spectral Gaps. [Citation Graph (, )][DBLP]
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. [Citation Graph (, )][DBLP]
PTAS for Maximum Weight Independent Set Problem with Random Weights in Bounded Degree Graphs. [Citation Graph (, )][DBLP]
Belief Propagation for Min-cost Network Flow: Convergence & Correctness. [Citation Graph (, )][DBLP]
Finding the Jaccard Median. [Citation Graph (, )][DBLP]
The Focus of Attention Problem. [Citation Graph (, )][DBLP]
Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. [Citation Graph (, )][DBLP]
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. [Citation Graph (, )][DBLP]
The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. [Citation Graph (, )][DBLP]
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. [Citation Graph (, )][DBLP]
An (almost) Linear Time Algorithm for Odd Cyles Transversal. [Citation Graph (, )][DBLP]
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP]
A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. [Citation Graph (, )][DBLP]
Region Growing for Multi-Route Cuts. [Citation Graph (, )][DBLP]
Asymmetric Traveling Salesman Path and Directed Latency Problems. [Citation Graph (, )][DBLP]
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls. [Citation Graph (, )][DBLP]
Quantum Algorithms for Highly Non-Linear Boolean Functions. [Citation Graph (, )][DBLP]
Compact Ancestry Labeling Schemes for XML Trees. [Citation Graph (, )][DBLP]
Generating a d-dimensional Linear Subspace Efficiently. [Citation Graph (, )][DBLP]
Algorithms for Ray Class Groups and Hilbert Class Fields. [Citation Graph (, )][DBLP]
A Space-Time Tradeoff for Permutation Problems. [Citation Graph (, )][DBLP]
Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. [Citation Graph (, )][DBLP]
Bidimensionality and Kernels. [Citation Graph (, )][DBLP]
Solving MAX-r-SAT Above a Tight Lower Bound. [Citation Graph (, )][DBLP]
Inapproximability for VCG-Based Combinatorial Auctions. [Citation Graph (, )][DBLP]
Price of Anarchy for Greedy Auctions. [Citation Graph (, )][DBLP]
Incentive Compatible Budget Elicitation in Multi-unit Auctions. [Citation Graph (, )][DBLP]
Utilitarian Mechanism Design for Multi-Objective Optimization. [Citation Graph (, )][DBLP]
Pricing Randomized Allocations. [Citation Graph (, )][DBLP]
Universal epsilon-approximators for Integrals. [Citation Graph (, )][DBLP]
Optimally Reconstructing Weighted Graphs Using Queries. [Citation Graph (, )][DBLP]
Online Learning with Queries. [Citation Graph (, )][DBLP]
Coresets and Sketches for High Dimensional Subspace Approximation Problems. [Citation Graph (, )][DBLP]
Convergence, Stability, and Discrete Approximation of Laplace Spectra. [Citation Graph (, )][DBLP]
Sharp Kernel Clustering Algorithms and Their Associated Grothendieck Inequalities. [Citation Graph (, )][DBLP]
Fast SDP Algorithms for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications. [Citation Graph (, )][DBLP]
Correlation Clustering with Noisy Input. [Citation Graph (, )][DBLP]
A Polynomial Time Approximation Scheme for k-Consensus Clustering. [Citation Graph (, )][DBLP]
Google's Auction for TV Ads. [Citation Graph (, )][DBLP]
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs. [Citation Graph (, )][DBLP]
Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time. [Citation Graph (, )][DBLP]
Bounding Variance and Expectation of Longest Path Lengths in DAGs. [Citation Graph (, )][DBLP]
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. [Citation Graph (, )][DBLP]
Maximum Flows and Parametric Shortest Paths in Planar Graphs. [Citation Graph (, )][DBLP]
On the Equilibria of Alternating Move Games. [Citation Graph (, )][DBLP]
Monotonicity in Bargaining Networks. [Citation Graph (, )][DBLP]
Sharp Dichotomies for Regret Minimization in Metric Spaces. [Citation Graph (, )][DBLP]
Solving Simple Stochastic Tail Games. [Citation Graph (, )][DBLP]
One-Counter Markov Decision Processes. [Citation Graph (, )][DBLP]
On Nonlinear Forbidden 0-1 Matrices: A Refutation of a Füredi-Hajnal Conjecture. [Citation Graph (, )][DBLP]
An Improved Construction of Progression-Free Sets. [Citation Graph (, )][DBLP]
Geometric Optimization and Sums of Algebraic Functions. [Citation Graph (, )][DBLP]
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. [Citation Graph (, )][DBLP]
How Far Can You Reach? [Citation Graph (, )][DBLP]
A Model of Computation for MapReduce. [Citation Graph (, )][DBLP]
Synchrony and Asynchrony in Neural Networks. [Citation Graph (, )][DBLP]
Distributed Agreement with Optimal Communication Complexity. [Citation Graph (, )][DBLP]
How Good is the Chord Algorithm?. [Citation Graph (, )][DBLP]
Deterministic Algorithms for the Lovász Local Lemma. [Citation Graph (, )][DBLP]
A Deterministic Truthful PTAS for Scheduling Related Machines. [Citation Graph (, )][DBLP]
A Fourier Space Algorithm for Solving Quadratic Assignment Problems. [Citation Graph (, )][DBLP]
EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard. [Citation Graph (, )][DBLP]
Reconstructing Approximate Phylogenetic Trees from Quartet Samples. [Citation Graph (, )][DBLP]
Shape Replication through Self-Assembly and RNase Enzymes. [Citation Graph (, )][DBLP]
On the Possibility of Faster SAT Algorithms. [Citation Graph (, )][DBLP]
Paired Approximation Problems and Incompatible Inapproximabilities. [Citation Graph (, )][DBLP]
Correlation Robust Stochastic Optimization. [Citation Graph (, )][DBLP]
Approximability of Robust Network Design. [Citation Graph (, )][DBLP]
Differentially Private Combinatorial Optimization. [Citation Graph (, )][DBLP]
Efficiently Decodable Non-adaptive Group Testing. [Citation Graph (, )][DBLP]
1-Pass Relative-Error Lp-Sampling with Applications. [Citation Graph (, )][DBLP]
On the Exact Space Complexity of Sketching and Streaming Small Norms. [Citation Graph (, )][DBLP]
A Locality-Sensitive Hash for Real Vectors. [Citation Graph (, )][DBLP]
Lower Bounds for Sparse Recovery. [Citation Graph (, )][DBLP]
Flow-Cut Gaps for Integer and Fractional Multiflows. [Citation Graph (, )][DBLP]
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks. [Citation Graph (, )][DBLP]
Testing Additive Integrality Gaps. [Citation Graph (, )][DBLP]
Classified Stable Matching. [Citation Graph (, )][DBLP]
Basis Reduction and the Complexity of Brand-and-Bound. [Citation Graph (, )][DBLP]
Randomized Shellsort: A Simple Oblivious Sorting Algorithm. [Citation Graph (, )][DBLP]
Data-Specific Analysis of String Sorting. [Citation Graph (, )][DBLP]
Fast Distance Multiplication of Unit-Monge Matrices. [Citation Graph (, )][DBLP]
Regular Expression Matching with Multi-Strings and Intervals. [Citation Graph (, )][DBLP]
Road Network Reconstruction for Organizing Paths. [Citation Graph (, )][DBLP]
The Power of Convex Relaxation: The Surprising Stories of Matrix Completion and Compressed Sensing. [Citation Graph (, )][DBLP]
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling. [Citation Graph (, )][DBLP]
Resource Minimization for Fire Containment. [Citation Graph (, )][DBLP]
Algorithms and Complexity for Periodic Real-Time Scheduling. [Citation Graph (, )][DBLP]
Energy Efficient Scheduling via Partial Shutdown. [Citation Graph (, )][DBLP]
SRPT is 1.86-Competitive for Completion Time Scheduling. [Citation Graph (, )][DBLP]
The Rank of Diluted Random Graphs. [Citation Graph (, )][DBLP]
The Scaling Window for a Random Graph with a Given Degree Sequence. [Citation Graph (, )][DBLP]
Efficient Broadcast on Random Geometric Graphs. [Citation Graph (, )][DBLP]
Speeding Up Random Walks with Neighborhood Exploration. [Citation Graph (, )][DBLP]
Vertices of Degree k in Random Maps. [Citation Graph (, )][DBLP]
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. [Citation Graph (, )][DBLP]
Applications of Forbidden 0-1 Matrices to Search Tree and Path Compression-Based Data Structures. [Citation Graph (, )][DBLP]
Faster Exponential Time Algorithms for the Shortest Vector Problem. [Citation Graph (, )][DBLP]
Streaming Algorithms for Extent Problems in High Dimensions. [Citation Graph (, )][DBLP]
Deletion Without Rebalancing in Balanced Binary Trees. [Citation Graph (, )][DBLP]
On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. [Citation Graph (, )][DBLP]
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. [Citation Graph (, )][DBLP]
Tree Embeddings for Two-Edge-Connected Network Design. [Citation Graph (, )][DBLP]
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. [Citation Graph (, )][DBLP]
Self-improving Algorithms for Convex Hulls. [Citation Graph (, )][DBLP]
The Forest Hiding Problem. [Citation Graph (, )][DBLP]
Terrain Guarding is NP-Hard. [Citation Graph (, )][DBLP]
Hardness Results for Homology Localization. [Citation Graph (, )][DBLP]
Orthogonal Ham-Sandwich Theorem in R3. [Citation Graph (, )][DBLP]
The (1 + beta)-Choice Process and Weighted Balls-into-Bins. [Citation Graph (, )][DBLP]
Quasirandom Load Balancing. [Citation Graph (, )][DBLP]
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. [Citation Graph (, )][DBLP]
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. [Citation Graph (, )][DBLP]
Rumour Spreading and Graph Conductance. [Citation Graph (, )][DBLP]
|
