
Conferences in DBLP
Improved bounds and new techniques for DavenportSchinzel sequences and their generalizations. [Citation Graph (, )][DBLP]
Perfect matchings via uniform sampling in regular bipartite graphs. [Citation Graph (, )][DBLP]
The ratio index for budgeted learning, with applications. [Citation Graph (, )][DBLP]
Approximation algorithms for restless bandit problems. [Citation Graph (, )][DBLP]
Better algorithms for benign bandits. [Citation Graph (, )][DBLP]
The cover time of random geometric graphs. [Citation Graph (, )][DBLP]
The complexity of simulating Brownian Motion. [Citation Graph (, )][DBLP]
Sorting by placement and shift. [Citation Graph (, )][DBLP]
Sampling biased lattice configurations using exponential metrics. [Citation Graph (, )][DBLP]
On the hitting times of quantum versus random walks. [Citation Graph (, )][DBLP]
Efficient algorithms for the 2gathering problem. [Citation Graph (, )][DBLP]
Asymptotically optimal frugal colouring. [Citation Graph (, )][DBLP]
A quadratic kernel for feedback vertex set. [Citation Graph (, )][DBLP]
Coloring trianglefree graphs on surfaces. [Citation Graph (, )][DBLP]
(Un)expected behavior of digital search tree profile. [Citation Graph (, )][DBLP]
Combinatorial stochastic processes and nonparametric Bayesian modeling. [Citation Graph (, )][DBLP]
Comparisonbased timespace lower bounds for selection. [Citation Graph (, )][DBLP]
Lineartime algorithms for geometric graphs with sublinearly many crossings. [Citation Graph (, )][DBLP]
Selfoverlapping curves revisited. [Citation Graph (, )][DBLP]
Line transversals of convex polyhedra in R^{3}. [Citation Graph (, )][DBLP]
Optimal halfspace range reporting in three dimensions. [Citation Graph (, )][DBLP]
Optimality of belief propagation for random assignment problem. [Citation Graph (, )][DBLP]
Termination criteria for solving concurrent safety and reachability games. [Citation Graph (, )][DBLP]
An efficient sparse regularity concept. [Citation Graph (, )][DBLP]
Almost all hypergraphs without Fano planes are bipartite. [Citation Graph (, )][DBLP]
Hypergraph regularity and quasirandomness. [Citation Graph (, )][DBLP]
Shortest paths in directed planar graphs with negative lengths: a linearspace O(n log^{2} n)time algorithm. [Citation Graph (, )][DBLP]
A nearlinear time algorithm for constructing a cactus representation of minimum cuts. [Citation Graph (, )][DBLP]
Testing halfspaces. [Citation Graph (, )][DBLP]
Fast edge orientation for unweighted graphs. [Citation Graph (, )][DBLP]
A unified approach to distancetwo colouring of planar graphs. [Citation Graph (, )][DBLP]
Approximate Euclidean shortest paths amid convex obstacles. [Citation Graph (, )][DBLP]
Approximate line nearest neighbor in high dimensions. [Citation Graph (, )][DBLP]
Decomposition of multiple coverings into more parts. [Citation Graph (, )][DBLP]
On stars and Steiner stars: II. [Citation Graph (, )][DBLP]
Combinatorial algorithms for nearest neighbors, nearduplicates and smallworld design. [Citation Graph (, )][DBLP]
Computing the nucleolus of weighted voting games. [Citation Graph (, )][DBLP]
High rate fingerprinting codes and the fingerprinting capacity. [Citation Graph (, )][DBLP]
On the power of two, three and four probes. [Citation Graph (, )][DBLP]
Exponential lower bounds and integrality gaps for treelike LovászSchrijver procedures. [Citation Graph (, )][DBLP]
3bit dictator testing: 1 vs. 5/8. [Citation Graph (, )][DBLP]
Inserting a vertex into a planar graph. [Citation Graph (, )][DBLP]
Fast algorithms for (max, min)matrix multiplication and bottleneck shortest paths. [Citation Graph (, )][DBLP]
Sorting and selection in posets. [Citation Graph (, )][DBLP]
Finding duplicates in a data stream. [Citation Graph (, )][DBLP]
Compressed counting. [Citation Graph (, )][DBLP]
Natural algorithms. [Citation Graph (, )][DBLP]
Maximal biconnected subgraphs of random planar graphs. [Citation Graph (, )][DBLP]
Approximate sharedmemory counting despite a strong adversary. [Citation Graph (, )][DBLP]
On smoothed kCNF formulas and the Walksat algorithm. [Citation Graph (, )][DBLP]
Improved smoothed analysis of the kmeans method. [Citation Graph (, )][DBLP]
Pairing heaps with O(log log n) decrease cost. [Citation Graph (, )][DBLP]
A simpler implementation and analysis of Chazelle's soft heaps. [Citation Graph (, )][DBLP]
Biased range trees. [Citation Graph (, )][DBLP]
The geometry of binary search trees. [Citation Graph (, )][DBLP]
Dualfailure distance and connectivity oracles. [Citation Graph (, )][DBLP]
On the maximum quadratic assignment problem. [Citation Graph (, )][DBLP]
Towards computing the Grothendieck constant. [Citation Graph (, )][DBLP]
Approximating submodular functions everywhere. [Citation Graph (, )][DBLP]
Maximizing submodular set functions subject to multiple linear constraints. [Citation Graph (, )][DBLP]
Combinatorial algorithms for wireless information flow. [Citation Graph (, )][DBLP]
Probability, algorithms and complexity. [Citation Graph (, )][DBLP]
Generating random graphs with large girth. [Citation Graph (, )][DBLP]
Expanders via random spanning trees. [Citation Graph (, )][DBLP]
The extended ktree algorithm. [Citation Graph (, )][DBLP]
Sequential cavity method for computing limits of the logpartition function for lattice models. [Citation Graph (, )][DBLP]
A universally fastest algorithm for Max 2Sat, Max 2CSP, and everything in between. [Citation Graph (, )][DBLP]
Finding shortest contractible and shortest separating cycles in embedded graphs. [Citation Graph (, )][DBLP]
Cell probe lower bounds for succinct data structures. [Citation Graph (, )][DBLP]
Succinct geometric indexes supporting point location queries. [Citation Graph (, )][DBLP]
Exact algorithms for partial curve matching via the Fréchet distance. [Citation Graph (, )][DBLP]
String hashing for linear probing. [Citation Graph (, )][DBLP]
Parameterized approximation scheme for the multiple knapsack problem. [Citation Graph (, )][DBLP]
Improved approximation algorithms for scheduling with fixed jobs. [Citation Graph (, )][DBLP]
Scalably scheduling processes with arbitrary speedup curves. [Citation Graph (, )][DBLP]
Speed scaling with an arbitrary power function. [Citation Graph (, )][DBLP]
A logarithmic approximation for unsplittable flow on line graphs. [Citation Graph (, )][DBLP]
On the complexity of Nash equilibria of actiongraph games. [Citation Graph (, )][DBLP]
How hard is it to approximate the best Nash equilibrium? [Citation Graph (, )][DBLP]
Improved equilibria via public service advertising. [Citation Graph (, )][DBLP]
Stepwise randomized combinatorial auctions achieve revenue monotonicity. [Citation Graph (, )][DBLP]
Equilibria of atomic flow games are not unique. [Citation Graph (, )][DBLP]
A generic topdown dynamicprogramming approach to prefixfree coding. [Citation Graph (, )][DBLP]
On the bitcomplexity of LempelZiv compression. [Citation Graph (, )][DBLP]
From coding theory to efficient pattern matching. [Citation Graph (, )][DBLP]
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. [Citation Graph (, )][DBLP]
On risks of using cuckoo hashing with simple universal hash classes. [Citation Graph (, )][DBLP]
Assignment problem in content distribution networks: unsplittable hardcapacitated facility location. [Citation Graph (, )][DBLP]
Efficient coordination mechanisms for unrelated machine scheduling. [Citation Graph (, )][DBLP]
Cliquewidth: on the price of generality. [Citation Graph (, )][DBLP]
Reasoning about online algorithms with weighted automata. [Citation Graph (, )][DBLP]
Appointment scheduling with discrete random durations. [Citation Graph (, )][DBLP]
Hardness of embedding simplicial complexes in R^{d}. [Citation Graph (, )][DBLP]
Overcoming the l_{1} nonembeddability barrier: algorithms for product metrics. [Citation Graph (, )][DBLP]
On low dimensional local embeddings. [Citation Graph (, )][DBLP]
The JohnsonLindenstrauss lemma almost characterizes Hilbert space, but not quite. [Citation Graph (, )][DBLP]
Maximum independent set of rectangles. [Citation Graph (, )][DBLP]
Approximating fractional hypertree width. [Citation Graph (, )][DBLP]
An almost O(log k)approximation for kconnected subgraphs. [Citation Graph (, )][DBLP]
Improved approximating algorithms for Directed Steiner Forest. [Citation Graph (, )][DBLP]
Transitiveclosure spanners. [Citation Graph (, )][DBLP]
Partitioning graphs into balanced components. [Citation Graph (, )][DBLP]
Efficient algorithms on sets of permutations, dominance, and realweighted APSP. [Citation Graph (, )][DBLP]
Discounted deterministic Markov decision processes and discounted allpairs shortest paths. [Citation Graph (, )][DBLP]
An improved approximation algorithm for the column subset selection problem. [Citation Graph (, )][DBLP]
Column subset selection, matrix factorization, and eigenvalue optimization. [Citation Graph (, )][DBLP]
Loopless generation of multiset permutations using a constant number of variables by prefix shifts. [Citation Graph (, )][DBLP]
The unreasonable effectiveness of martingales. [Citation Graph (, )][DBLP]
Dimension detection via slivers. [Citation Graph (, )][DBLP]
Persistent homology for kernels, images, and cokernels. [Citation Graph (, )][DBLP]
Analysis of scalar fields over point cloud data. [Citation Graph (, )][DBLP]
Constructing Laplace operator from point clouds in R^{d}. [Citation Graph (, )][DBLP]
Size complexity of volume meshes vs. surface meshes. [Citation Graph (, )][DBLP]
Packing multiway cuts in capacitated graphs. [Citation Graph (, )][DBLP]
On the approximability of Dodgson and Young elections. [Citation Graph (, )][DBLP]
Approximate clustering without the approximation. [Citation Graph (, )][DBLP]
Robust PCA and clustering in noisy mixtures. [Citation Graph (, )][DBLP]
Coresets and approximate clustering for Bregman divergences. [Citation Graph (, )][DBLP]
Multidimensional online tracking. [Citation Graph (, )][DBLP]
A new approach to incremental topological ordering. [Citation Graph (, )][DBLP]
Online scheduling to minimize the maximum delay factor. [Citation Graph (, )][DBLP]
Collecting weighted items from a dynamic queue. [Citation Graph (, )][DBLP]
Paging and list update under bijective analysis. [Citation Graph (, )][DBLP]
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. [Citation Graph (, )][DBLP]
Listcolorcritical graphs on a fixed surface. [Citation Graph (, )][DBLP]
Additive approximation algorithms for listcoloring minorclosed class of graphs. [Citation Graph (, )][DBLP]
Threecoloring trianglefree planar graphs in linear time. [Citation Graph (, )][DBLP]
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. [Citation Graph (, )][DBLP]
The uniform hardcore lemma via approximate Bregman projections. [Citation Graph (, )][DBLP]
Improved approximation bound for quadratic optimization problems with orthogonality constraints. [Citation Graph (, )][DBLP]
On the approximability of the maximum feasible subsystem problem with 0/1coefficients. [Citation Graph (, )][DBLP]
On the relative strength of split, triangle and quadrilateral cuts. [Citation Graph (, )][DBLP]
A simple combinatorial algorithm for submodular function minimization. [Citation Graph (, )][DBLP]
Weighted flow time does not admit O(1)competitive algorithms. [Citation Graph (, )][DBLP]
Secretary problems: weights and discounts. [Citation Graph (, )][DBLP]
Stream sampling for varianceoptimal estimation of subset sums. [Citation Graph (, )][DBLP]
An online mechanism for ad slot reservations with cancellations. [Citation Graph (, )][DBLP]
Online story scheduling in web advertising. [Citation Graph (, )][DBLP]
