Table of Contents

• Confronting hardness using a hybrid approachVirginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo. 1-10 [doi]
• A new approach to proving upper bounds for MAX-2-SATArist Kojevnikov, Alexander S. Kulikov. 11-17 [doi]
• Measure and conquer: a simple O(2:::0.288::::n:::::::) independent set algorithmFedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch. 18-25 [doi]
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graphVadim V. Lozin, Martin Milanic. 26-30 [doi]
• The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicityWolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang. 31-40 [doi]
• Local versus global properties of metric spacesSanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala. 41-50 [doi]
• Directed metrics and directed graph partitioning problemsMoses Charikar, Konstantin Makarychev, Yury Makarychev. 51-60 [doi]
• Improved embeddings of graph metrics into random treesKedar Dhamdhere, Anupam Gupta, Harald Räcke. 61-69 [doi]
• Small hop-diameter sparse spanners for doubling metricsHubert T.-H. Chan, Anupam Gupta. 70-78 [doi]
• Metric cotypeManor Mendel, Assaf Naor. 79-88 [doi]
• On nash equilibria for a network creation gameSusanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty. 89-98 [doi]
• Approximating unique gamesAnupam Gupta, Kunal Talwar. 99-106 [doi]
• Computing sequential equilibria for two-player gamesPeter Bro Miltersen, Troels Bjerre Sørensen. 107-116 [doi]
• A deterministic subexponential algorithm for solving parity gamesMarcin Jurdzinski, Mike Paterson, Uri Zwick. 117-123 [doi]
• Finding nucleolus of flow gameXiaotie Deng, Qizhi Fang, Xiaoxun Sun. 124-131 [doi]
• Predicting the unpredictable Rakesh V. Vohra. 132 [doi]
• A near-tight approximation lower bound and algorithm for the kidnapped robot problemSven Koenig, Apurva Mudgal, Craig A. Tovey. 133-142 [doi]
• An asymptotic approximation algorithm for 3D-strip packingKlaus Jansen, Roberto Solis-Oba. 143-152 [doi]
• Facility location with hierarchical facility costsZoya Svitkina, Éva Tardos. 153-161 [doi]
• Combination can be hard: approximability of the unique coverage problemErik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour. 162-171 [doi]
• Computing steiner minimum trees in Hamming metricErnst Althaus, Rouven Naujoks. 172-181 [doi]
• Robust shape fitting via peeling and grating coresetsPankaj K. Agarwal, Sariel Har-Peled, Hai Yu. 182-191 [doi]
• Tightening non-simple paths and cycles on surfacesÉric Colin de Verdière, Jeff Erickson. 192-201 [doi]
• Anisotropic surface meshingSiu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Rephael Wenger. 202-211 [doi]
• Simultaneous diagonal flips in plane triangulationsProsenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood. 212-221 [doi]
• Morphing orthogonal planar graph drawingsAnna Lubiw, Mark Petrick, Michael J. Spriggs. 222-230 [doi]
• OverhangMike Paterson, Uri Zwick. 231-240 [doi]
• On the capacity of information networksMicah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman. 241-250 [doi]
• Lower bounds for asymmetric communication channels and distributed source codingMicah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu. 251-260 [doi]
• Self-improving algorithmsNir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu. 261-270 [doi]
• Cake cutting really is not a piece of cakeJeff Edmonds, Kirk Pruhs. 271-278 [doi]
• Testing triangle-freeness in general graphsNoga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron. 279-288 [doi]
• Constraint solving via fractional edge coversMartin Grohe, Dániel Marx. 289-298 [doi]
• Testing graph isomorphismEldar Fischer, Arie Matsliah. 299-308 [doi]
• Efficient construction of unit circular-arc modelsMin Chih Lin, Jayme Luiz Szwarcfiter. 309-315 [doi]
• On the chromatic number of some geometric hypergraphsShakhar Smorodinsky. 316-323 [doi]
• A robust maximum completion time measure for schedulingMoses Charikar, Samir Khuller. 324-333 [doi]
• Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time schedulingHo-Leung Chan, Tak Wah Lam, Kin-Shing Liu. 334-343 [doi]
• Improved approximation algorithms for broadcast schedulingNikhil Bansal, Don Coppersmith, Maxim Sviridenko. 344-353 [doi]
• Distributed selfish load balancingPetra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin. 354-363 [doi]
• Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power managementPhilippe Baptiste. 364-367 [doi]
• Rank/select operations on large alphabets: a tool for text indexingAlexander Golynski, J. Ian Munro, S. Srinivasa Rao. 368-373 [doi]
• ::::O::::(log log ::::n::::)-competitive dynamic binary search treesChengwen Chris Wang, Jonathan Derryberry, Daniel Dominic Sleator. 374-383 [doi]
• The rainbow skip graph: a fault-tolerant constant-degree distributed data structureMichael T. Goodrich, Michael J. Nelson, Jonathan Z. Sun. 384-393 [doi]
• Design of data structures for mergeable treesLoukas Georgiadis, Robert Endre Tarjan, Renato Fonseca F. Werneck. 394-403 [doi]
• Implicit dictionaries with ::::O::::(1) modifications per update and fast searchGianni Franceschini, J. Ian Munro. 404-413 [doi]
• Sampling binary contingency tables with a greedy startIvona Bezáková, Nayantara Bhatnagar, Eric Vigoda. 414-423 [doi]
• Asymmetric balanced allocation with simple hash functionsPhilipp Woelfel. 424-433 [doi]
• Balanced allocation on graphsKrishnaram Kenthapadi, Rina Panigrahy. 434-443 [doi]
• Superiority and complexity of the spaced seedsMing Li, Bin Ma, Louxin Zhang. 444-453 [doi]
• Solving random satisfiable 3CNF formulas in expected polynomial timeMichael Krivelevich, Dan Vilenchik. 454-463 [doi]
• Analysis of incomplete data and an intrinsic-dimension Helly theoremJie Gao, Michael Langberg, Leonard J. Schulman. 464-473 [doi]
• Finding large sticks and potatoes in polygonsOlaf Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, Arik Sityon. 474-483 [doi]
• Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range countingHaim Kaplan, Micha Sharir. 484-493 [doi]
• Vertical ray shooting and computing depth orders for fat objectsMark de Berg, Chris Gray. 494-503 [doi]
• On the number of plane graphsOswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser. 504-513 [doi]
• All-pairs shortest paths for unweighted undirected graphs in ::::o(mn):::: timeTimothy M. Chan. 514-523 [doi]
• An ::::O (n log n):::: algorithm for maximum ::::st::::-flow in a directed planar graphGlencora Borradaile, Philip N. Klein. 524-533 [doi]
• A simple GAP-canceling algorithm for the generalized maximum flow problemMateo Restrepo, David P. Williamson. 534-543 [doi]
• Four point conditions and exponential neighborhoods for symmetric TSPVladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger. 544-553 [doi]
• Upper degree-constrained partial orientationsHarold N. Gabow. 554-563 [doi]
• On the tandem duplication-random loss model of genome rearrangementKamalika Chaudhuri, Kevin Chen, Radu Mihaescu, Satish Rao. 564-570 [doi]
• Reducing tile complexity for self-assembly through temperature programmingMing-Yang Kao, Robert T. Schweller. 571-580 [doi]
• Cache-oblivious string dictionariesGerth Stølting Brodal, Rolf Fagerberg. 581-590 [doi]
• Cache-oblivious dynamic programmingRezaul Alam Chowdhury, Vijaya Ramachandran. 591-600 [doi]
• A computational study of external-memory BFS algorithmsDeepak Ajwani, Roman Dementiev, Ulrich Meyer. 601-610 [doi]
• Tight approximation algorithms for maximum general assignment problemsLisa Fleischer, Michel X. Goemans, Vahab S. Mirrokni, Maxim Sviridenko. 611-620 [doi]
• Approximating the ::::k::::-multicut problemDaniel Golovin, Viswanath Nagarajan, Mohit Singh. 621-630 [doi]
• The prize-collecting generalized steiner tree problem via a new approach of primal-dual schemaMohammad Taghi Hajiaghayi, Kamal Jain. 631-640 [doi]
• 8/7-approximation algorithm for (1, 2)-TSPPiotr Berman, Marek Karpinski. 641-648 [doi]
• Improved lower and upper bounds for universal TSP in planar metricsMohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton. 649-658 [doi]
• Leontief economies encode nonzero sum two-player gamesBruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye. 659-667 [doi]
• Bottleneck links, variable demand, and the tragedy of the commonsRichard Cole, Yevgeniy Dodis, Tim Roughgarden. 668-677 [doi]
• The complexity of quantitative concurrent parity gamesKrishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger. 678-687 [doi]
• Equilibria for economies with production: constant-returns technologies and production planning constraintsKamal Jain, Kasturi R. Varadarajan. 688-697 [doi]
• Approximation algorithms for wavelet transform coding of data streamsSudipto Guha, Boulos Harb. 698-707 [doi]
• Simpler algorithm for estimating frequency moments of data streamsLakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, Chandan Saha. 708-713 [doi]
• Trading off space for passes in graph streaming problemsCamil Demetrescu, Irene Finocchi, Andrea Ribichini. 714-723 [doi]
• Maintaining significant stream statistics over sliding windowsLap-Kei Lee, H. F. Ting. 724-732 [doi]
• Streaming and sublinear approximation of entropy and information distancesSudipto Guha, Andrew McGregor, Suresh Venkatasubramanian. 733-742 [doi]
• FPTAS for mixed-integer polynomial optimization with a fixed number of variablesJesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel. 743-748 [doi]
• Linear programming and unique sink orientationsBernd Gärtner, Ingo Schurr. 749-757 [doi]
• Generating all vertices of a polyhedron is hardLeonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich. 758-765 [doi]
• A semidefinite programming approach to tensegrity theory and realizability of graphsAnthony Man-Cho So, Yinyu Ye. 766-775 [doi]
• Ordering by weighted number of wins gives a good ranking for weighted tournamentsDon Coppersmith, Lisa Fleischer, Atri Rudra. 776-782 [doi]
• Weighted isotonic regression under the ::::L::::::1:: normStanislav Angelov, Boulos Harb, Sampath Kannan, Li-San Wang. 783-791 [doi]
• Oblivious string embeddings and edit distance approximationsTugkan Batu, Funda Ergün, Süleyman Cenk Sahinalp. 792-801 [doi]
• Spanners and emulators with sublinear distance errorsMikkel Thorup, Uri Zwick. 802-809 [doi]
• Certifying large branch-widthSang-il Oum, Paul D. Seymour. 810-813 [doi]
• DAG-width: connectivity measure for directed graphsJan Obdrzálek. 814-821 [doi]
• On the diameter of Eulerian orientations of graphsLászló Babai. 822-831 [doi]
• Max-tolerance graphs as intersection graphs: cliques, cycles, and recognitionMichael Kaufmann, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran R. Subramanian. 832-841 [doi]
• Subgraph characterization of Red/Blue-Split Graph and König Egerváry GraphsEphraim Korach, Thành Nguyen, Britta Peis. 842-850 [doi]
• Critical chromatic number and the complexity of perfect packings in graphsDaniela Kühn, Deryk Osthus. 851-859 [doi]
• On the number of crossing-free matchings, (cycles, and partitions)Micha Sharir, Emo Welzl. 860-869 [doi]
• Slow mixing of glauber dynamics via topological obstructionsDana Randall. 870-879 [doi]
• Quantum verification of matrix productsHarry Buhrman, Robert Spalek. 880-889 [doi]
• Counting without sampling: new algorithms for enumeration problems using statistical physicsAntar Bandyopadhyay, David Gamarnik. 890-899 [doi]
• Accelerating simulated annealing for the permanent and combinatorial counting problemsIvona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda. 900-907 [doi]
• Query-efficient algorithms for polynomial interpolation over compositesParikshit Gopalan. 908-917 [doi]
• New lower bounds for oblivious routing in undirected graphsMohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke. 918-927 [doi]
• Anytime algorithms for multi-armed bandit problemsRobert D. Kleinberg. 928-936 [doi]
• Robbing the bandit: less regret in online geometric optimization against an adaptive adversaryVarsha Dani, Thomas P. Hayes. 937-943 [doi]
• On the competitive ratio of evaluating priced functionsFerdinando Cicalese, Eduardo Sany Laber. 944-953 [doi]
• Randomized online algorithms for minimum metric bipartite matchingAdam Meyerson, Akash Nanavati, Laura J. Poplawski. 954-959 [doi]
• Random graphsAlan M. Frieze. 960 [doi]
• Analyzing BitTorrent and related peer-to-peer networksDavid Arthur, Rina Panigrahy. 961-969 [doi]
• Oblivious network designAnupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke. 970-979 [doi]
• The price of being near-sightedFabian Kuhn, Thomas Moscibroda, Roger Wattenhofer. 980-989 [doi]
• Scalable leader electionValerie King, Jared Saia, Vishal Sanwalani, Erik Vee. 990-999 [doi]
• Deterministic boundary recognition and topology extraction for large sensor networksAlexander Kröller, Sándor P. Fekete, Dennis Pfisterer, Stefan Fischer. 1000-1009 [doi]
• Improved lower bounds for embeddings into ::::L::::::1::Robert Krauthgamer, Yuval Rabani. 1010-1017 [doi]
• ::::l:::::::2:::::2:: spreading metrics for vertex ordering problemsMoses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao. 1018-1027 [doi]
• Trees and Markov convexityJames R. Lee, Assaf Naor, Yuval Peres. 1028-1037 [doi]
• An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routingDomingos Dellamonica Jr., Yoshiharu Kohayakawa. 1038-1044 [doi]
• A tight upper bound on the probabilistic embedding of series-parallel graphsYuval Emek, David Peleg. 1045-1053 [doi]
• Single-value combinatorial auctions and implementation in undominated strategiesMoshe Babaioff, Ron Lavi, Elan Pavlov. 1054-1063 [doi]
• An improved approximation algorithm for combinatorial auctions with submodular biddersShahar Dobzinski, Michael Schapira. 1064-1073 [doi]
• Revenue maximization when bidders have budgetsZoë Abrams. 1074-1082 [doi]
• Knapsack auctionsGagan Aggarwal, Jason D. Hartline. 1083-1092 [doi]
• Single-minded unlimited supply pricing on sparse instancesPatrick Briest, Piotr Krysta. 1093-1102 [doi]
• The complexity of matrix completionNicholas J. A. Harvey, David R. Karger, Sergey Yekhanin. 1103-1111 [doi]
• Relating singular values and discrepancy of weighted directed graphsSteven Butler. 1112-1116 [doi]
• Matrix approximation and projective clustering via volume samplingAmit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang. 1117-1126 [doi]
• Sampling algorithms for ::::l::::::2:: regression and applicationsPetros Drineas, Michael W. Mahoney, S. Muthukrishnan. 1127-1136 [doi]
• The hunting of the bump: on maximizing statistical discrepancyDeepak Agarwal, Jeff M. Phillips, Suresh Venkatasubramanian. 1137-1146 [doi]
• A general approach for incremental approximation and hierarchical clusteringGuolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson. 1147-1156 [doi]
• The space complexity of pass-efficient algorithms for clusteringKevin L. Chang, Ravi Kannan. 1157-1166 [doi]
• Correlation clustering with a fixed number of clustersIoannis Giotis, Venkatesan Guruswami. 1167-1176 [doi]
• On ::::k::::-Median clustering in high dimensionsKe Chen. 1177-1185 [doi]
• Entropy based nearest neighbor search in high dimensionsRina Panigrahy. 1186-1195 [doi]
• A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queriesTimothy M. Chan. 1196-1202 [doi]
• Efficient algorithms for substring near neighbor problemAlexandr Andoni, Piotr Indyk. 1203-1212 [doi]
• Many distances in planar graphsSergio Cabello. 1213-1220 [doi]
• Pattern matching with address errors: rearrangement distancesAmihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne. 1221-1229 [doi]
• Squeezing succinct data structures into entropy boundsKunihiko Sadakane, Roberto Grossi. 1230-1239 [doi]