Abstract is missing.
- Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizationsGabriel Nivasch. 1-10 [doi]
- Perfect matchings via uniform sampling in regular bipartite graphsAshish Goel, Michael Kapralov, Sanjeev Khanna. 11-17 [doi]
- The ratio index for budgeted learning, with applicationsAshish Goel, Sanjeev Khanna, Brad Null. 18-27 [doi]
- Approximation algorithms for restless bandit problemsSudipto Guha, Kamesh Munagala, Peng Shi. 28-37 [doi]
- Better algorithms for benign banditsElad Hazan, Satyen Kale. 38-47 [doi]
- The cover time of random geometric graphsColin Cooper, Alan M. Frieze. 48-57 [doi]
- The complexity of simulating Brownian MotionIlia Binder, Mark Braverman. 58-67 [doi]
- Sorting by placement and shiftSergi Elizalde, Peter Winkler. 68-75 [doi]
- Sampling biased lattice configurations using exponential metricsSam Greenberg, Amanda Pascoe, Dana Randall. 76-85 [doi]
- On the hitting times of quantum versus random walksFrédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha. 86-95 [doi]
- Efficient algorithms for the 2-gathering problemAlon Shalita, Uri Zwick. 96-105 [doi]
- Asymptotically optimal frugal colouringMichael Molloy, Bruce A. Reed. 106-114 [doi]
- A quadratic kernel for feedback vertex setStéphan Thomassé. 115-119 [doi]
- Coloring triangle-free graphs on surfacesZdenek Dvorak, Daniel Král, Robin Thomas. 120-129 [doi]
- (Un)expected behavior of digital search tree profileMichael Drmota, Wojciech Szpankowski. 130-138 [doi]
- Combinatorial stochastic processes and nonparametric Bayesian modelingMichael I. Jordan. 139 [doi]
- Comparison-based time-space lower bounds for selectionTimothy M. Chan. 140-149 [doi]
- Linear-time algorithms for geometric graphs with sublinearly many crossingsDavid Eppstein, Michael T. Goodrich, Darren Strash. 150-159 [doi]
- Self-overlapping curves revisitedDavid Eppstein, Elena Mumford. 160-169 [doi]
- Line transversals of convex polyhedra in ::::R:::::::3:::Haim Kaplan, Natan Rubin, Micha Sharir. 170-179 [doi]
- Optimal halfspace range reporting in three dimensionsPeyman Afshani, Timothy M. Chan. 180-186 [doi]
- Optimality of belief propagation for random assignment problemJ. Salez, D. Shah. 187-196 [doi]
- Termination criteria for solving concurrent safety and reachability gamesKrishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger. 197-206 [doi]
- An efficient sparse regularity conceptAmin Coja-Oghlan, Colin Cooper, Alan M. Frieze. 207-216 [doi]
- Almost all hypergraphs without Fano planes are bipartiteYury Person, Mathias Schacht. 217-226 [doi]
- Hypergraph regularity and quasi-randomnessBrendan Nagle, Annika Poerschke, Vojtech Rödl, Mathias Schacht. 227-235 [doi]
- Shortest paths in directed planar graphs with negative lengths: a linear-space ::::O::::(::::n:::: log:::2::: ::::n::::)-time algorithmPhilip N. Klein, Shay Mozes, Oren Weimann. 236-245 [doi]
- A near-linear time algorithm for constructing a cactus representation of minimum cutsDavid R. Karger, Debmalya Panigrahi. 246-255 [doi]
- Testing halfspacesKevin Matulef, Ryan O Donnell, Ronitt Rubinfeld, Rocco A. Servedio. 256-264 [doi]
- Fast edge orientation for unweighted graphsAnand Bhalgat, Ramesh Hariharan. 265-272 [doi]
- A unified approach to distance-two colouring of planar graphsOmid Amini, Louis Esperet, Jan van den Heuvel. 273-282 [doi]
- Approximate Euclidean shortest paths amid convex obstaclesPankaj K. Agarwal, R. Sharathkumar, Hai Yu. 283-292 [doi]
- Approximate line nearest neighbor in high dimensionsAlexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen. 293-301 [doi]
- Decomposition of multiple coverings into more partsGreg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos. 302-310 [doi]
- On stars and Steiner stars: IIAdrian Dumitrescu, Csaba D. Tóth, Guangwu Xu. 311-317 [doi]
- Combinatorial algorithms for nearest neighbors, near-duplicates and small-world designYury Lifshits, Shengyu Zhang. 318-326 [doi]
- Computing the nucleolus of weighted voting gamesEdith Elkind, Dmitrii V. Pasechnik. 327-335 [doi]
- High rate fingerprinting codes and the fingerprinting capacityEhsan Amiri, Gábor Tardos. 336-345 [doi]
- On the power of two, three and four probesNoga Alon, Uriel Feige. 346-354 [doi]
- Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver proceduresToniann Pitassi, Nathan Segerlind. 355-364 [doi]
- 3-bit dictator testing: 1 vs. 5/8Ryan O Donnell, Yi Wu. 365-373 [doi]
- Inserting a vertex into a planar graphMarkus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf. 375-383 [doi]
- Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest pathsRan Duan, Seth Pettie. 384-391 [doi]
- Sorting and selection in posetsConstantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin. 392-401 [doi]
- Finding duplicates in a data streamParikshit Gopalan, Jaikumar Radhakrishnan. 402-411 [doi]
- Compressed countingPing Li. 412-421 [doi]
- Natural algorithmsBernard Chazelle. 422-431 [doi]
- Maximal biconnected subgraphs of random planar graphsKonstantinos Panagiotou, Angelika Steger. 432-440 [doi]
- Approximate shared-memory counting despite a strong adversaryJames Aspnes, Keren Censor. 441-450 [doi]
- On smoothed ::::k::::-CNF formulas and the Walksat algorithmAmin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik. 451-460 [doi]
- Improved smoothed analysis of the ::::k::::-means methodBodo Manthey, Heiko Röglin. 461-470 [doi]
- Pairing heaps with ::::O::::(log log ::::n::::) decrease costAmr Elmasry. 471-476 [doi]
- A simpler implementation and analysis of Chazelle s soft heapsHaim Kaplan, Uri Zwick. 477-485 [doi]
- Biased range treesVida Dujmovic, John Howat, Pat Morin. 486-495 [doi]
- The geometry of binary search treesErik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, Mihai Patrascu. 496-505 [doi]
- Dual-failure distance and connectivity oraclesRan Duan, Seth Pettie. 506-515 [doi]
- On the maximum quadratic assignment problemViswanath Nagarajan, Maxim Sviridenko. 516-524 [doi]
- Towards computing the Grothendieck constantPrasad Raghavendra, David Steurer. 525-534 [doi]
- Approximating submodular functions everywhereMichel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni. 535-544 [doi]
- Maximizing submodular set functions subject to multiple linear constraintsAriel Kulik, Hadas Shachnai, Tami Tamir. 545-554 [doi]
- Combinatorial algorithms for wireless information flowAurore Amaudruz, Christina Fragouli. 555-564 [doi]
- Probability, algorithms and complexityVolker Strassen. 565 [doi]
- Generating random graphs with large girthMohsen Bayati, Andrea Montanari, Amin Saberi. 566-575 [doi]
- Expanders via random spanning treesNavin Goyal, Luis Rademacher, Santosh Vempala. 576-585 [doi]
- The extended ::::k::::-tree algorithmLorenz Minder, Alistair Sinclair. 586-595 [doi]
- Sequential cavity method for computing limits of the log-partition function for lattice modelsDavid Gamarnik, Dmitriy Katz. 596-605 [doi]
- A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in betweenSerge Gaspers, Gregory B. Sorkin. 606-615 [doi]
- Finding shortest contractible and shortest separating cycles in embedded graphsSergio Cabello. 616-624 [doi]
- Cell probe lower bounds for succinct data structuresAlexander Golynski. 625-634 [doi]
- Succinct geometric indexes supporting point location queriesProsenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin. 635-644 [doi]
- Exact algorithms for partial curve matching via the Fréchet distanceKevin Buchin, Maike Buchin, Yusu Wang. 645-654 [doi]
- String hashing for linear probingMikkel Thorup. 655-664 [doi]
- Parameterized approximation scheme for the multiple knapsack problemKlaus Jansen. 665-674 [doi]
- Improved approximation algorithms for scheduling with fixed jobsFlorian Diedrich, Klaus Jansen. 675-684 [doi]
- Scalably scheduling processes with arbitrary speedup curvesJeff Edmonds, Kirk Pruhs. 685-692 [doi]
- Speed scaling with an arbitrary power functionNikhil Bansal, Ho-Leung Chan, Kirk Pruhs. 693-701 [doi]
- A logarithmic approximation for unsplittable flow on line graphsNikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour. 702-709 [doi]
- On the complexity of Nash equilibria of action-graph gamesConstantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant. 710-719 [doi]
- How hard is it to approximate the best Nash equilibrium?Elad Hazan, Robert Krauthgamer. 720-727 [doi]
- Improved equilibria via public service advertisingMaria-Florina Balcan, Avrim Blum, Yishay Mansour. 728-737 [doi]
- Stepwise randomized combinatorial auctions achieve revenue monotonicityBaharak Rastegari, Anne Condon, Kevin Leyton-Brown. 738-747 [doi]
- Equilibria of atomic flow games are not uniqueUmang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang. 748-757 [doi]
- A generic top-down dynamic-programming approach to prefix-free codingMordecai Golin, Xiaoming Xu, Jiajin Yu. 758-767 [doi]
- On the bit-complexity of Lempel-Ziv compressionPaolo Ferragina, Igor Nitto, Rossano Venturini. 768-777 [doi]
- From coding theory to efficient pattern matchingRaphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild. 778-784 [doi]
- Monotone minimal perfect hashing: searching a sorted table with ::::O::::(1) accessesDjamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. 785-794 [doi]
- On risks of using cuckoo hashing with simple universal hash classesMartin Dietzfelbinger, Ulf Schellbach. 795-804 [doi]
- Assignment problem in content distribution networks: unsplittable hard-capacitated facility locationMohammadHossein Bateni, MohammadTaghi Hajiaghayi. 805-814 [doi]
- Efficient coordination mechanisms for unrelated machine schedulingIoannis Caragiannis. 815-824 [doi]
- Clique-width: on the price of generalityFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh. 825-834 [doi]
- Reasoning about online algorithms with weighted automataBenjamin Aminof, Orna Kupferman, Robby Lampert. 835-844 [doi]
- Appointment scheduling with discrete random durationsMehmet A. Begen, Maurice Queyranne. 845-854 [doi]
- Hardness of embedding simplicial complexes in ::::R:::::::d:::Jirí Matousek, Martin Tancer, Uli Wagner. 855-864 [doi]
- Overcoming the ::::l::::::1:: non-embeddability barrier: algorithms for product metricsAlexandr Andoni, Piotr Indyk, Robert Krauthgamer. 865-874 [doi]
- On low dimensional local embeddingsIttai Abraham, Yair Bartal, Ofer Neiman. 875-884 [doi]
- The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quiteWilliam B. Johnson, Assaf Naor. 885-891 [doi]
- Maximum independent set of rectanglesParinya Chalermsook, Julia Chuzhoy. 892-901 [doi]
- Approximating fractional hypertree widthDániel Marx. 902-911 [doi]
- An almost ::::O::::(log ::::k::::)-approximation for ::::k::::-connected subgraphsZeev Nutov. 912-921 [doi]
- Improved approximating algorithms for Directed Steiner ForestMoran Feldman, Guy Kortsarz, Zeev Nutov. 922-931 [doi]
- Transitive-closure spannersArnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff. 932-941 [doi]
- Partitioning graphs into balanced componentsRobert Krauthgamer, Joseph Naor, Roy Schwartz. 942-949 [doi]
- Efficient algorithms on sets of permutations, dominance, and real-weighted APSPRaphael Yuster. 950-957 [doi]
- Discounted deterministic Markov decision processes and discounted all-pairs shortest pathsOmid Madani, Mikkel Thorup, Uri Zwick. 958-967 [doi]
- An improved approximation algorithm for the column subset selection problemChristos Boutsidis, Michael W. Mahoney, Petros Drineas. 968-977 [doi]
- Column subset selection, matrix factorization, and eigenvalue optimizationJoel A. Tropp. 978-986 [doi]
- Loopless generation of multiset permutations using a constant number of variables by prefix shiftsAaron Williams. 987-996 [doi]
- The unreasonable effectiveness of martingalesYuval Peres. 997-1000 [doi]
- Dimension detection via sliversSiu-Wing Cheng, Man-Kwun Chiu. 1001-1010 [doi]
- Persistent homology for kernels, images, and cokernelsDavid Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov. 1011-1020 [doi]
- Analysis of scalar fields over point cloud dataFrédéric Chazal, Leonidas J. Guibas, Steve Oudot, Primoz Skraba. 1021-1030 [doi]
- Constructing Laplace operator from point clouds in ::::R:::::::::::d:::::::Mikhail Belkin, Jian Sun, Yusu Wang. 1031-1040 [doi]
- Size complexity of volume meshes vs. surface meshesBenoît Hudson, Gary L. Miller, Todd Phillips, Don Sheehy. 1041-1047 [doi]
- Packing multiway cuts in capacitated graphsSiddharth Barman, Shuchi Chawla. 1048-1057 [doi]
- On the approximability of Dodgson and Young electionsIoannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein. 1058-1067 [doi]
- Approximate clustering without the approximationMaria-Florina Balcan, Avrim Blum, Anupam Gupta. 1068-1077 [doi]
- Robust PCA and clustering in noisy mixturesS. Charles Brubaker. 1078-1087 [doi]
- Coresets and approximate clustering for Bregman divergencesMarcel R. Ackermann, Johannes Blömer. 1088-1097 [doi]
- Multi-dimensional online trackingKe Yi, Qin Zhang. 1098-1107 [doi]
- A new approach to incremental topological orderingMichael A. Bender, Jeremy T. Fineman, Seth Gilbert. 1108-1115 [doi]
- Online scheduling to minimize the maximum delay factorChandra Chekuri, Benjamin Moseley. 1116-1125 [doi]
- Collecting weighted items from a dynamic queueMarcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak. 1126-1135 [doi]
- Paging and list update under bijective analysisSpyros Angelopoulos, Pascal Schweitzer. 1136-1145 [doi]
- Algorithms for finding an induced cycle in planar graphs and bounded genus graphsYusuke Kobayashi, Ken-ichi Kawarabayashi. 1146-1155 [doi]
- List-color-critical graphs on a fixed surfaceKen-ichi Kawarabayashi, Bojan Mohar. 1156-1165 [doi]
- Additive approximation algorithms for list-coloring minor-closed class of graphsKen-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi. 1166-1175 [doi]
- Three-coloring triangle-free planar graphs in linear timeZdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas. 1176-1182 [doi]
- A nearly linear time algorithm for the half integral parity disjoint paths packing problemKen-ichi Kawarabayashi, Bruce A. Reed. 1183-1192 [doi]
- The uniform hardcore lemma via approximate Bregman projectionsBoaz Barak, Moritz Hardt, Satyen Kale. 1193-1200 [doi]
- Improved approximation bound for quadratic optimization problems with orthogonality constraintsAnthony Man-Cho So. 1201-1209 [doi]
- On the approximability of the maximum feasible subsystem problem with 0/1-coefficientsKhaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters. 1210-1219 [doi]
- On the relative strength of split, triangle and quadrilateral cutsAmitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot. 1220-1229 [doi]
- A simple combinatorial algorithm for submodular function minimizationSatoru Iwata, James B. Orlin. 1230-1237 [doi]
- Weighted flow time does not admit O(1)-competitive algorithmsNikhil Bansal, Ho-Leung Chan. 1238-1244 [doi]
- Secretary problems: weights and discountsMoshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar. 1245-1254 [doi]
- Stream sampling for variance-optimal estimation of subset sumsEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. 1255-1264 [doi]
- An online mechanism for ad slot reservations with cancellationsFlorin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál. 1265-1274 [doi]
- Online story scheduling in web advertisingAnirban Dasgupta, Arpita Ghosh, Hamid Nazerzadeh, Prabhakar Raghavan. 1275-1284 [doi]