Abstract is missing.
- On the Optimality of Spiral SearchElmar Langetepe. 1-12 [doi]
- An Improved Competitive Algorithm for Reordering Buffer ManagementNoa Avigdor-Elgrabli, Yuval Rabani. 13-21 [doi]
- How to Meet Asynchronously (Almost) EverywhereJurek Czyzowicz, Arnaud Labourel, Andrzej Pelc. 22-30 [doi]
- A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival ModelBahman Bahmani, Aranyak Mehta, Rajeev Motwani. 31-39 [doi]
- Towards the Randomized k-Server Conjecture: A Primal-Dual ApproachNikhil Bansal, Niv Buchbinder, Joseph Naor. 40-55 [doi]
- Testing Monotone Continuous Distributions on High-dimensional Real CubesMichal Adamaszek, Artur Czumaj, Christian Sohler. 56-65 [doi]
- Property Testing and Parameter Testing for PermutationsCarlos Hoppen, Yoshiharu Kohayakawa, Carlos Gustavo T. de A. Moreira, Rudini Menezes Sampaio. 66-75 [doi]
- Near-Optimal Sublinear Time Algorithms for Ulam DistanceAlexandr Andoni, Huy L. Nguyen. 76-86 [doi]
- Lower Bounds for Testing Triangle-freeness in Boolean FunctionsArnab Bhattacharyya, Ning Xie. 87-98 [doi]
- Counting Stars and Other Small Subgraphs in Sublinear TimeMira Gonen, Dana Ron, Yuval Shavitt. 99-116 [doi]
- Cell-Probe Lower Bounds for Succinct Partial SumsMihai Patrascu, Emanuele Viola. 117-122 [doi]
- On the Cell Probe Complexity of Dynamic MembershipKe Yi, Qin Zhang. 123-133 [doi]
- Fully-Functional Succinct TreesKunihiko Sadakane, Gonzalo Navarro. 134-149 [doi]
- Data Structures for Range Minimum Queries in Multidimensional ArraysHao Yuan, Mikhail J. Atallah. 150-160 [doi]
- Counting Inversions, Offline Orthogonal Range Counting, and Related ProblemsTimothy M. Chan, Mihai Patrascu. 161-173 [doi]
- Differential Privacy in New SettingsCynthia Dwork. 174-183 [doi]
- Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type InequalitiesAlexandr Andoni, T. S. Jayram, Mihai Patrascu. 184-192 [doi]
- Genus and the Geometry of the Cut GraphJames R. Lee, Anastasios Sidiropoulos. 193-201 [doi]
- Testing Planarity of Partially Embedded GraphsPatrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter. 202-221 [doi]
- Inapproximability for Planar Embedding ProblemsJeff Edmonds, Anastasios Sidiropoulos, Anastasios Zouzias. 222-235 [doi]
- A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling MetricsT.-H. Hubert Chan, Khaled M. Elbassioni. 256-267 [doi]
- PTAS for Maximum Weight Independent Set Problem with Random Weights in Bounded Degree GraphsDavid Gamarnik, David Goldberg, Theophane Weber. 268-278 [doi]
- Belief Propagation for Min-cost Network Flow: Convergence & CorrectnessDavid Gamarnik, Devavrat Shah, Yehua Wei. 279-292 [doi]
- Finding the Jaccard MedianFlavio Chierichetti, Ravi Kumar, Sandeep Pandey, Sergei Vassilvitskii. 293-311 [doi]
- The Focus of Attention ProblemDries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger. 312-317 [doi]
- Recognizing a Totally Odd K::4::-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified ElementsKen-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed. 318-328 [doi]
- Decomposition, Approximation, and Coloring of Odd-Minor-Free GraphsErik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi. 329-344 [doi]
- The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected GraphsKen-ichi Kawarabayashi, Yusuke Kobayashi. 345-353 [doi]
- On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order LogicStephan Kreutzer, Siamak Tazari. 354-364 [doi]
- An (almost) Linear Time Algorithm for Odd Cyles TransversalKen-ichi Kawarabayashi, Bruce A. Reed. 365-378 [doi]
- An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman ProblemArash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi. 379-389 [doi]
- A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle RoutingAparna Das, Claire Mathieu. 390-403 [doi]
- Region Growing for Multi-Route CutsSiddharth Barman, Shuchi Chawla. 404-418 [doi]
- Asymmetric Traveling Salesman Path and Directed Latency ProblemsZachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina. 419-428 [doi]
- Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting StrollsAaron Archer, Anna Blasiak. 429-447 [doi]
- Quantum Algorithms for Highly Non-Linear Boolean FunctionsMartin Rötteler. 448-457 [doi]
- Compact Ancestry Labeling Schemes for XML TreesPierre Fraigniaud, Amos Korman. 458-466 [doi]
- Algorithms for Ray Class Groups and Hilbert Class FieldsKirsten Eisenträger, Sean Hallgren. 471-483 [doi]
- A Space-Time Tradeoff for Permutation ProblemsMikko Koivisto, Pekka Parviainen. 484-492 [doi]
- Algorithmic Lower Bounds for Problems Parameterized with Clique-WidthFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh. 493-502 [doi]
- Bidimensionality and KernelsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. 503-510 [doi]
- Solving MAX-r-SAT Above a Tight Lower BoundNoga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo. 511-517 [doi]
- Inapproximability for VCG-Based Combinatorial AuctionsDavid Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kleinberg, Elchanan Mossel, Christos H. Papadimitriou, Michael Schapira, Yaron Singer, Christopher Umans. 518-536 [doi]
- Price of Anarchy for Greedy AuctionsBrendan Lucier, Allan Borodin. 537-553 [doi]
- Incentive Compatible Budget Elicitation in Multi-unit AuctionsSayan Bhattacharya, Vincent Conitzer, Kamesh Munagala, Lirong Xia. 554-572 [doi]
- Utilitarian Mechanism Design for Multi-Objective OptimizationFabrizio Grandoni, Piotr Krysta, Stefano Leonardi, Carmine Ventre. 573-584 [doi]
- Pricing Randomized AllocationsPatrick Briest, Shuchi Chawla, Robert Kleinberg, S. Matthew Weinberg. 585-597 [doi]
- Universal epsilon-approximators for IntegralsMichael Langberg, Leonard J. Schulman. 598-607 [doi]
- Optimally Reconstructing Weighted Graphs Using QueriesHanna Mazzawi. 608-615 [doi]
- Online Learning with QueriesChao-Kai Chiang, Chi-Jen Lu. 616-629 [doi]
- Coresets and Sketches for High Dimensional Subspace Approximation ProblemsDan Feldman, Morteza Monemizadeh, Christian Sohler, David P. Woodruff. 630-649 [doi]
- Convergence, Stability, and Discrete Approximation of Laplace SpectraTamal K. Dey, Pawas Ranjan, Yusu Wang. 650-663 [doi]
- Sharp Kernel Clustering Algorithms and Their Associated Grothendieck InequalitiesSubhash Khot, Assaf Naor. 664-683 [doi]
- Fast SDP Algorithms for Constraint Satisfaction ProblemsDavid Steurer. 684-697 [doi]
- Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital CommunicationsAnthony Man-Cho So. 698-711 [doi]
- Correlation Clustering with Noisy InputClaire Mathieu, Warren Schudy. 712-728 [doi]
- A Polynomial Time Approximation Scheme for k-Consensus ClusteringTom Coleman, Anthony Wirth. 729-740 [doi]
- Google s Auction for TV AdsNoam Nisan. 741 [doi]
- A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General GraphsAaron Bernstein. 742-755 [doi]
- Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) TimeChristian Wulff-Nilsen. 756-765 [doi]
- Bounding Variance and Expectation of Longest Path Lengths in DAGsJeff Edmonds, Supratik Chakraborty. 766-781 [doi]
- Highway Dimension, Shortest Paths, and Provably Efficient AlgorithmsIttai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck. 782-793 [doi]
- On the Equilibria of Alternating Move GamesAaron Roth, Maria-Florina Balcan, Adam Kalai, Yishay Mansour. 805-816 [doi]
- Monotonicity in Bargaining NetworksYossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani. 817-826 [doi]
- Sharp Dichotomies for Regret Minimization in Metric SpacesRobert Kleinberg, Aleksandrs Slivkins. 827-846 [doi]
- Solving Simple Stochastic Tail GamesHugo Gimbert, Florian Horn. 847-862 [doi]
- One-Counter Markov Decision ProcessesTomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak. 863-874 [doi]
- On Nonlinear Forbidden 0-1 Matrices: A Refutation of a Füredi-Hajnal ConjectureSeth Pettie. 875-885 [doi]
- An Improved Construction of Progression-Free SetsMichael Elkin. 886-905 [doi]
- Geometric Optimization and Sums of Algebraic FunctionsAntoine Vigneron. 906-917 [doi]
- Approximating the Crossing Number of Graphs Embeddable in Any Orientable SurfacePetr Hlinený, Markus Chimani. 918-927 [doi]
- How Far Can You Reach?Ciprian Borcea, Ileana Streinu. 928-937 [doi]
- A Model of Computation for MapReduceHoward J. Karloff, Siddharth Suri, Sergei Vassilvitskii. 938-948 [doi]
- Synchrony and Asynchrony in Neural NetworksFabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger. 949-964 [doi]
- Distributed Agreement with Optimal Communication ComplexitySeth Gilbert, Dariusz R. Kowalski. 965-977 [doi]
- How Good is the Chord Algorithm?Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis. 978-991 [doi]
- Deterministic Algorithms for the Lovász Local LemmaKarthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler. 992-1004 [doi]
- A Deterministic Truthful PTAS for Scheduling Related MachinesGeorge Christodoulou, Annamária Kovács. 1005-1016 [doi]
- A Fourier Space Algorithm for Solving Quadratic Assignment ProblemsRisi Imre Kondor. 1017-1028 [doi]
- EDF-schedulability of Synchronous Periodic Task Systems is coNP-hardFriedrich Eisenbrand, Thomas Rothvoß. 1029-1034 [doi]
- Reconstructing Approximate Phylogenetic Trees from Quartet SamplesSagi Snir, Raphael Yuster. 1035-1044 [doi]
- Shape Replication through Self-Assembly and RNase EnzymesZachary Abel, Nadia Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Scott D. Kominers, Robert T. Schweller. 1045-1064 [doi]
- On the Possibility of Faster SAT AlgorithmsMihai Patrascu, Ryan Williams. 1065-1075 [doi]
- Correlation Robust Stochastic OptimizationShipra Agrawal, Yichuan Ding, Amin Saberi, Yinyu Ye. 1087-1096 [doi]
- Approximability of Robust Network DesignNeil Olver, F. Bruce Shepherd. 1097-1105 [doi]
- Differentially Private Combinatorial OptimizationAnupam Gupta, Katrina Ligett, Frank McSherry, Aaron Roth, Kunal Talwar. 1106-1125 [doi]
- Efficiently Decodable Non-adaptive Group TestingPiotr Indyk, Hung Q. Ngo, Atri Rudra. 1126-1142 [doi]
- 1-Pass Relative-Error L::p::-Sampling with ApplicationsMorteza Monemizadeh, David P. Woodruff. 1143-1160 [doi]
- On the Exact Space Complexity of Sketching and Streaming Small NormsDaniel M. Kane, Jelani Nelson, David P. Woodruff. 1161-1178 [doi]
- A Locality-Sensitive Hash for Real VectorsTyler Neylon. 1179-1189 [doi]
- Lower Bounds for Sparse RecoveryKhanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff. 1190-1197 [doi]
- Flow-Cut Gaps for Integer and Fractional MultiflowsChandra Chekuri, F. Bruce Shepherd, Christophe Weibel. 1198-1208 [doi]
- A Max-Flow/Min-Cut Algorithm for a Class of Wireless NetworksS. M. Sadegh Tabatabaei Yazdi, Serap A. Savari. 1209-1226 [doi]
- Testing Additive Integrality GapsFriedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin. 1227-1234 [doi]
- Classified Stable MatchingChien-Chung Huang. 1235-1253 [doi]
- Basis Reduction and the Complexity of Brand-and-BoundGábor Pataki, Mustafa Tural, Erick B. Wong. 1254-1261 [doi]
- Data-Specific Analysis of String SortingRaimund Seidel. 1278-1286 [doi]
- Fast Distance Multiplication of Unit-Monge MatricesAlexander Tiskin. 1287-1296 [doi]
- Road Network Reconstruction for Organizing PathsDaniel Chen, Leonidas J. Guibas, John Hershberger, Jian Sun. 1309-1320 [doi]
- The Power of Convex Relaxation: The Surprising Stories of Matrix Completion and Compressed SensingEmmanuel J. Candès. 1321 [doi]
- An Online Scalable Algorithm for Average Flow Time in Broadcast SchedulingSungjin Im, Benjamin Moseley. 1322-1333 [doi]
- Resource Minimization for Fire ContainmentParinya Chalermsook, Julia Chuzhoy. 1334-1349 [doi]
- Algorithms and Complexity for Periodic Real-Time SchedulingVincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, Nicole Megow. 1350-1359 [doi]
- Energy Efficient Scheduling via Partial ShutdownSamir Khuller, Jian Li, Barna Saha. 1360-1372 [doi]
- SRPT is 1.86-Competitive for Completion Time SchedulingChristine Chung, Tim Nonner, Alexander Souza. 1373-1388 [doi]
- The Rank of Diluted Random GraphsCharles Bordenave, Marc Lelarge. 1389-1402 [doi]
- The Scaling Window for a Random Graph with a Given Degree SequenceHamed Hatami, Michael Molloy. 1403-1411 [doi]
- Efficient Broadcast on Random Geometric GraphsMilan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer. 1412-1421 [doi]
- Speeding Up Random Walks with Neighborhood ExplorationPetra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald. 1422-1435 [doi]
- Vertices of Degree k in Random MapsDaniel Johannsen, Konstantinos Panagiotou. 1436-1447 [doi]
- Cache-Oblivious Dynamic Dictionaries with Update/Query TradeoffsGerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro. 1448-1456 [doi]
- Applications of Forbidden 0-1 Matrices to Search Tree and Path Compression-Based Data StructuresSeth Pettie. 1457-1457 [doi]
- Faster Exponential Time Algorithms for the Shortest Vector ProblemDaniele Micciancio, Panagiotis Voulgaris. 1468-1480 [doi]
- Streaming Algorithms for Extent Problems in High DimensionsPankaj K. Agarwal, R. Sharathkumar. 1481-1489 [doi]
- Deletion Without Rebalancing in Balanced Binary TreesSiddhartha Sen, Robert Endre Tarjan. 1490-1499 [doi]
- On Linear and Semidefinite Programming Relaxations for Hypergraph MatchingYuk Hei Chan, Lap Chi Lau. 1500-1511 [doi]
- Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a GraphAttila Bernáth, Roland Grappe, Zoltán Szigeti. 1512-1520 [doi]
- Tree Embeddings for Two-Edge-Connected Network DesignAnupam Gupta, Ravishankar Krishnaswamy, R. Ravi. 1521-1538 [doi]
- A Constant Factor Approximation Algorithm for Generalized Min-Sum Set CoverNikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy. 1539-1545 [doi]
- Self-improving Algorithms for Convex HullsKenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri. 1546-1565 [doi]
- The Forest Hiding ProblemAdrian Dumitrescu, Minghui Jiang. 1566-1579 [doi]
- Terrain Guarding is NP-HardJames King, Erik Krohn. 1580-1593 [doi]
- Hardness Results for Homology LocalizationChao Chen, Daniel Freedman. 1594-1604 [doi]
- Orthogonal Ham-Sandwich Theorem in R:::3:::Sergey Bereg. 1605-1612 [doi]
- The (1 + beta)-Choice Process and Weighted Balls-into-BinsYuval Peres, Kunal Talwar, Udi Wieder. 1613-1619 [doi]
- Quasirandom Load BalancingTobias Friedrich, Martin Gairing, Thomas Sauerwald. 1620-1629 [doi]
- Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped BodiesKarthekeyan Chandrasekaran, Daniel Dadush, Santosh Vempala. 1630-1645 [doi]
- Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular TreesPrasad Tetali, Juan Carlos Vera, Eric Vigoda, Linji Yang. 1646-1656 [doi]
- Rumour Spreading and Graph ConductanceFlavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi. 1657-1663 [doi]