Table of Contents

• Computing all maps into a sphereMartin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner. 1-10 [doi]
• The maximum number of faces of the Minkowski sum of two convex polytopesMenelaos I. Karavelas, Eleni Tzanaki. 11-28 [doi]
• Polytope approximation and the Mahler volumeSunil Arya, Guilherme Dias da Fonseca, David M. Mount. 29-42 [doi]
• 1James R. Lee, Arnaud de Mesmay, Mohammad Moharrami. 43-50 [doi]
• On multiplicative λ-approximations and some geometric applicationsIlan Newman, Yuri Rabinovich. 51-67 [doi]
• Kernelization of packing problemsHolger Dell, Dániel Marx. 68-81 [doi]
• H-minor-free graphsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. 82-93 [doi]
• Compression via matroids: a randomized polynomial kernel for odd cycle transversalStefan Kratsch, Magnus Wahlström. 94-103 [doi]
• Weak compositions and their applications to polynomial lower bounds for kernelizationDanny Hermelin, Xi Wu. 104-113 [doi]
• Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problemStefan Kratsch. 114-122 [doi]
• Popularity vs maximum cardinality in the stable marriage settingTelikepalli Kavitha. 123-134 [doi]
• A matroid approach to stable matchings with lower quotasTamás Fleiner, Naoyuki Kamiyama. 135-142 [doi]
• On the (in)security of hash-based oblivious RAM and a new balancing schemeEyal Kushilevitz, Steve Lu, Rafail Ostrovsky. 143-156 [doi]
• Privacy-preserving group data access via stateless oblivious RAM simulationMichael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia. 157-167 [doi]
• Private data release via learning thresholdsMoritz Hardt, Guy N. Rothblum, Rocco A. Servedio. 168-187 [doi]
• Structural and logical approaches to the graph isomorphism problemMartin Grohe. 188 [doi]
• Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphsAaron Bernstein. 189-201 [doi]
• Approximate distance oracles with improved preprocessing timeChristian Wulff-Nilsen. 202-208 [doi]
• Exact distance oracles for planar graphsShay Mozes, Christian Sommer. 209-222 [doi]
• Single source distance oracle for planar digraphs avoiding a failed node or linkSurender Baswana, Utkarsh Lath, Anuradha S. Mehta. 223-232 [doi]
• Physarum can compute shortest pathsVincenzo Bonifaci, Kurt Mehlhorn, Girish Varma. 233-240 [doi]
• The condensation transition in random hypergraph 2-coloringAmin Coja-Oghlan, Lenka Zdeborová. 241-250 [doi]
• A new approach to the orientation of random hypergraphsMarc Lelarge. 251-264 [doi]
• The MAX-CUT of sparse random graphsHervé Daudé, Conrado Martínez, Vonjy Rasendrahasina, Vlady Ravelomanana. 265-271 [doi]
• d coloursCharilaos Efthymiou. 272-280 [doi]
• The maximum degree of random planar graphsMichael Drmota, Omer Giménez, Marc Noy, Konstantinos Panagiotou, Angelika Steger. 281-287 [doi]
• Computing the distance between piecewise-linear bivariate functionsGuillaume Moroz, Boris Aronov. 288-293 [doi]
• Packing anchored rectanglesAdrian Dumitrescu, Csaba D. Tóth. 294-305 [doi]
• Algorithms for the transportation problem in geometric settingsR. Sharathkumar, Pankaj K. Agarwal. 306-317 [doi]
• Jaywalking your dog: computing the Fréchet distance with shortcutsAnne Driemel, Sariel Har-Peled. 318-337 [doi]
• Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applicationsHaim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir. 338-355 [doi]
• The entropy rounding method in approximation algorithmsThomas Rothvoß. 356-372 [doi]
• Approximating CSPs with global cardinality constraints using SDP hierarchiesPrasad Raghavendra, Ning Tan. 373-387 [doi]
• k-subgraphAditya Bhaskara, Moses Charikar, Aravindan Vijayaraghavan, Venkatesan Guruswami, Yuan Zhou. 388-405 [doi]
• Linear index coding via semidefinite programmingEden Chlamtac, Ishay Haviv. 406-419 [doi]
• Concentration inequalities for nonlinear matroid intersectionKonstantin Makarychev, Warren Schudy, Maxim Sviridenko. 420-436 [doi]
• Concentration and moment inequalities for polynomials of independent random variablesWarren Schudy, Maxim Sviridenko. 437-446 [doi]
• Width of points in the streaming modelAlexandr Andoni, Huy L. Nguyen. 447-452 [doi]
• The shifting sands algorithmAndrew McGregor, Paul Valiant. 453-458 [doi]
• Analyzing graph structure via linear measurementsKook Jin Ahn, Sudipto Guha, Andrew McGregor. 459-467 [doi]
• On the communication and streaming complexity of maximum bipartite matchingAshish Goel, Michael Kapralov, Sanjeev Khanna. 468-485 [doi]
• Lower bounds for number-in-hand multiparty communication complexity, made easyJeff M. Phillips, Elad Verbin, Qin Zhang. 486-501 [doi]
• SINR diagram with interference cancellationChen Avin, Asaf Cohen, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg. 502-515 [doi]
• Wireless connectivity and capacityMagnús M. Halldórsson, Pradipta Mitra. 516-526 [doi]
• Gathering despite mischiefYoann Dieudonné, Andrzej Pelc, David Peleg. 527-540 [doi]
• Stochastic coalescence in logarithmic timePo-Shen Loh, Eyal Lubetzky. 541-550 [doi]
• Towards robust and efficient computation in dynamic peer-to-peer networksJohn Augustine, Gopal Pandurangan, Peter Robinson, Eli Upfal. 551-569 [doi]
• Using hashing to solve the dictionary problemJohn Iacono, Mihai Patrascu. 570-582 [doi]
• I/O-efficient data structures for colored range and prefix reportingKasper Green Larsen, Rasmus Pagh. 583-592 [doi]
• Confluent persistence revisitedSébastien Collette, John Iacono, Stefan Langerman. 593-601 [doi]
• Fully persistent B-treesGerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas. 602-614 [doi]
• A little advice can be very helpfulArkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi. 615-625 [doi]
• An efficient polynomial-time approximation scheme for Steiner forest in planar graphsDavid Eisenstat, Philip N. Klein, Claire Mathieu. 626-638 [doi]
• A polynomial-time approximation scheme for planar multiway cutMohammadHossein Bateni, MohammadTaghi Hajiaghayi, Philip N. Klein, Claire Mathieu. 639-655 [doi]
• Finding an induced path of given parity in planar graphs in polynomial timeMarcin Kaminski, Naomi Nishimura. 656-670 [doi]
• Spanning closed walks and TSP in 3-connected planar graphsKen-ichi Kawarabayashi, Kenta Ozeki. 671-682 [doi]
• Approximate tree decompositions of planar graphs in linear timeFrank Kammer, Torsten Tholey. 683-698 [doi]
• Bypassing UGC from some optimal geometric inapproximability resultsVenkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu. 699-717 [doi]
• Inapproximability of the multi-level uncapacitated facility location problemRavishankar Krishnaswamy, Maxim Sviridenko. 718-734 [doi]
• On the hardness of pricing loss-leadersPreyas Popat, Yi Wu. 735-749 [doi]
• The complexity of conservative valued CSPsVladimir Kolmogorov, Stanislav Zivny. 750-759 [doi]
• The set of solutions of random XORSAT formulaeMorteza Ibrahimi, Yashodhan Kanoria, Matt Kraning, Andrea Montanari. 760-779 [doi]
• k-route cut problemJulia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou. 780-799 [doi]
• Approximate duality of multicommodity multiroute flows and cuts: single source casePetr Kolman, Christian Scheideler. 800-810 [doi]
• On a linear program for minimum-weight triangulationArman Yousefi, Neal E. Young. 811-823 [doi]
• Constant factor approximation algorithm for the knapsack median problemAmit Kumar. 824-832 [doi]
• Subquadratic time approximation algorithms for the girthLiam Roditty, Virginia Vassilevska Williams. 833-845 [doi]
• A universally-truthful approximation scheme for multi-unit auctionsBerthold Vöcking. 846-855 [doi]
• Optimal crowdsourcing contestsShuchi Chawla, Jason D. Hartline, Balasubramanian Sivan. 856-868 [doi]
• Sequential auctions and externalitiesRenato Paes Leme, Vasilis Syrgkanis, Éva Tardos. 869-886 [doi]
• Mechanism design via consensus estimates, cross checking, and profit extractionBach Q. Ha, Jason D. Hartline. 887-895 [doi]
• Black-box reductions for cost-sharing mechanism designKonstantinos Georgiou, Chaitanya Swamy. 896-913 [doi]
• Counting perfect matchings as fast as RyserAndreas Björklund. 914-921 [doi]
• Approximate counting via correlation decay in spin systemsLiang Li, Pinyan Lu, Yitong Yin. 922-940 [doi]
• Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphsAlistair Sinclair, Piyush Srivastava, Marc Thurley. 941-953 [doi]
• Approximating fixation probabilities in the generalized Moran processJosep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, Paul G. Spirakis. 954-960 [doi]
• 0Russell Impagliazzo, William Matthews, Ramamohan Paturi. 961-972 [doi]
• The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining gameVijay V. Vazirani. 973-992 [doi]
• Beyond myopic best response (in Cournot competition)Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky. 993-1005 [doi]
• Metastability of logit dynamics for coordination gamesVincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Giuseppe Persiano. 1006-1024 [doi]
• Sketching valuation functionsAshwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden. 1025-1035 [doi]
• Voting with limited information and many alternativesFlavio Chierichetti, Jon M. Kleinberg. 1036-1055 [doi]
• Partial match queries in random quadtreesNicolas Broutin, Ralph Neininger, Henning Sulzbach. 1056-1065 [doi]
• k document retrieval in optimal time and linear spaceGonzalo Navarro, Yakov Nekrich. 1066-1077 [doi]
• LSH-preserving functions and their applicationsFlavio Chierichetti, Ravi Kumar. 1078-1094 [doi]
• A linear time algorithm for seeds computationTomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 1095-1112 [doi]
• Tight bounds on the maximum size of a set of permutations with bounded VC-dimensionJosef Cibulka, Jan Kyncl. 1113-1122 [doi]
• A near-optimal sublinear-time algorithm for approximating the minimum vertex cover sizeKrzysztof Onak, Dana Ron, Michal Rosen, Ronitt Rubinfeld. 1123-1131 [doi]
• Space-efficient local computation algorithmsNoga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie. 1132-1139 [doi]
• Testing odd-cycle-freeness in Boolean functionsArnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira. 1140-1149 [doi]
• Networks cannot compute their diameter in sublinear timeSilvio Frischknecht, Stephan Holzer, Roger Wattenhofer. 1150-1162 [doi]
• Parallelism and time in hierarchical self-assemblyHo-Lin Chen, David Doty. 1163-1182 [doi]
• Simple and practical algorithm for sparse Fourier transformHaitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price. 1183-1194 [doi]
• Sparser Johnson-Lindenstrauss transformsDaniel M. Kane, Jelani Nelson. 1195-1206 [doi]
• Optimal column-based low-rank matrix reconstructionVenkatesan Guruswami, Ali Kemal Sinop. 1207-1214 [doi]
• Sublinear time, measurement-optimal, sparse recovery for allEly Porat, Martin J. Strauss. 1215-1227 [doi]
• Resource augmentation for weighted flow-time explained by dual fittingS. Anand 0002, Naveen Garg, Amit Kumar. 1228-1241 [doi]
• Scheduling heterogeneous processors isn't as easy as you thinkAnupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs. 1242-1253 [doi]
• Online scheduling with general cost functionsSungjin Im, Benjamin Moseley, Kirk Pruhs. 1254-1265 [doi]
• Race to idle: new algorithms for speed scaling with a sleep stateSusanne Albers, Antonios Antoniadis. 1266-1285 [doi]
• A faster algorithm to recognize even-hole-free graphsHsien-Chih Chang, Hsueh-I Lu. 1286-1297 [doi]
• Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programsYuri Faenza, Gianpaolo Oriolo, Gautier Stauffer. 1298-1308 [doi]
• Global minimum cuts in surface embedded graphsJeff Erickson, Kyle Fox, Amir Nayyeri. 1309-1318 [doi]
• 6-graphProsenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot. 1319-1328 [doi]
• A near-linear algorithm for projective clustering integer pointsKasturi Varadarajan, Xin Xiao. 1329-1342 [doi]
• Data reduction for weighted and outlier-resistant clusteringDan Feldman, Leonard J. Schulman. 1343-1354 [doi]
• Local homology transfer and stratification learningPaul Bendich, Bei Wang, Sayan Mukherjee. 1355-1370 [doi]
• k-modal distributions via testingConstantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio. 1371-1385 [doi]
• 2) time algorithm for alternating Büchi gamesKrishnendu Chatterjee, Monika Henzinger. 1386-1399 [doi]
• Efficient algorithms for maximum weight matchings in general graphs with small edge weightsChien-Chung Huang, Telikepalli Kavitha. 1400-1412 [doi]
• A scaling algorithm for maximum weight matching in bipartite graphsRan Duan, Hsin-Hao Su. 1413-1424 [doi]
• List-coloring graphs without subdivisions and without immersionsKen-ichi Kawarabayashi, Yusuke Kobayashi. 1425-1435 [doi]
• Fast zeta transforms for lattices with few irreduciblesAndreas Björklund, Mikko Koivisto, Thore Husfeldt, Jesper Nederlof, Petteri Kaski, Pekka Parviainen. 1436-1444 [doi]
• Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithmsDaniel Dadush, Santosh Vempala. 1445-1456 [doi]
• Constructing high order elements through subspace polynomialsQi Cheng, Shuhong Gao, Daqing Wan. 1457-1463 [doi]
• Improved output-sensitive quantum algorithms for Boolean matrix multiplicationFrançois Le Gall. 1464-1476 [doi]
• A proof of the Boyd-Carr conjectureFrans Schalekamp, David P. Williamson, Anke van Zuylen. 1477-1486 [doi]
• Traffic-redundancy aware network designSiddharth Barman, Shuchi Chawla. 1487-1498 [doi]
• Approximating rooted Steiner networksJoseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta. 1499-1511 [doi]
• Matroidal degree-bounded minimum spanning treesRico Zenklusen. 1512-1521 [doi]
• Approximation algorithms for stochastic orienteeringAnupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi. 1522-1538 [doi]
• Expanders are universal for the class of all spanning treesDaniel Johannsen, Michael Krivelevich, Wojciech Samotij. 1539-1551 [doi]
• Directed nowhere dense classes of graphsStephan Kreutzer, Siamak Tazari. 1552-1562 [doi]
• Bidimensionality and geometric graphsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh. 1563-1575 [doi]
• Weighted capacitated, priority, and geometric set cover via improved quasi-uniform samplingTimothy M. Chan, Elyot Grant, Jochen Könemann, Malcolm Sharpe. 1576-1585 [doi]
• Submodular functions are noise stableMahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee. 1586-1592 [doi]
• Random walks, electric networks and the transience class problem of sandpilesAyush Choure, Sundar Vishwanathan. 1593-1611 [doi]
• d-dimensional spaceHenry Lam, Zhenming Liu, Michael Mitzenmacher, Xiaorui Sun, Yajun Wang. 1612-1622 [doi]
• Rumor spreading and vertex expansionGeorge Giakkoupis, Thomas Sauerwald. 1623-1641 [doi]
• Ultra-fast rumor spreading in social networksNikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald. 1642-1660 [doi]
• The mixing time of the Newman: Watts small worldLouigi Addario-Berry, Tao Lei. 1661-1668 [doi]
• Outperforming LRU via competitive analysis on parametrized inputs for pagingGabriel Moruz, Andrei Negoescu. 1669-1680 [doi]
• k)-competitive algorithm for generalized cachingAnna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke. 1681-1689 [doi]
• Simultaneous approximations for adversarial and stochastic online budgeted allocationVahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam. 1690-1701 [doi]
• Improved competitive ratio for the matroid secretary problemSourav Chakraborty, Oded Lachish. 1702-1712 [doi]
• Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutsetRajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx. 1713-1725 [doi]
• Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packingNaonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi. 1726-1736 [doi]
• Subexponential parameterized algorithm for minimum fill-inFedor V. Fomin, Yngve Villanger. 1737-1746 [doi]
• Shortest cycle through specified elementsAndreas Björklund, Thore Husfeldt, Nina Taslaman. 1747-1753 [doi]