Abstract is missing.
- Assigning Papers to RefereesKurt Mehlhorn. 1-2 [doi]
- SDP-Based Algorithms for Maximum Independent Set Problems on HypergraphsGeir Agnarsson, Magnús M. Halldórsson, Elena Losievskaja. 12-23 [doi]
- Correlation Clustering Revisited: The "True" Cost of Error Minimization ProblemsNir Ailon, Edo Liberty. 24-36 [doi]
- Sorting and Selection with Imprecise ComparisonsMiklós Ajtai, Vitaly Feldman, Avinatan Hassidim, Jelani Nelson. 37-48 [doi]
- Fast FASTNoga Alon, Daniel Lokshtanov, Saket Saurabh. 49-58 [doi]
- Bounds on the Size of Small Depth Circuits for Approximating MajorityKazuyuki Amano. 59-70 [doi]
- Counting Subgraphs via HomomorphismsOmid Amini, Fedor V. Fomin, Saket Saurabh. 71-82 [doi]
- External SamplingAlexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld. 83-94 [doi]
- Functional Monitoring without MonotonicityChrisil Arackaparambil, Joshua Brody, Amit Chakrabarti. 95-106 [doi]
- De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental ResultsYuriy Arbitman, Moni Naor, Gil Segev. 107-118 [doi]
- Towards a Study of Low-Complexity GraphsSanjeev Arora, David Steurer, Avi Wigderson. 119-131 [doi]
- Decidability of Conjugacy of Tree-Shifts of Finite TypeNathalie Aubrun, Marie-Pierre Béal. 132-143 [doi]
- Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root RuleNikhil Bansal, Ho-Leung Chan, Kirk Pruhs, Dmitriy Katz. 144-155 [doi]
- Competitive Analysis of Aggregate Max in Windowed StreamingLuca Becchetti, Elias Koutsoupias. 156-170 [doi]
- Faster Regular Expression MatchingPhilip Bille, Mikkel Thorup. 171-182 [doi]
- A Fast and Simple Parallel Algorithm for the Monotone Duality ProblemEndre Boros, Kazuhisa Makino. 183-194 [doi]
- Unconditional Lower Bounds against AdviceHarry Buhrman, Lance Fortnow, Rahul Santhanam. 195-209 [doi]
- Approximating Decision Trees with Multiway BranchesVenkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal. 210-221 [doi]
- Annotations in Data StreamsAmit Chakrabarti, Graham Cormode, Andrew McGregor. 222-234 [doi]
- The Tile Complexity of Linear AssembliesHarish Chandran, Nikhil Gopalkrishnan, John H. Reif. 235-253 [doi]
- A Graph Reduction Step Preserving Element-Connectivity and ApplicationsChandra Chekuri, Nitish Korula. 254-265 [doi]
- Approximating Matches Made in HeavenNing Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Atri Rudra. 266-278 [doi]
- Strong and Pareto Price of Anarchy in Congestion GamesSteve Chien, Alistair Sinclair. 279-291 [doi]
- A Better Algorithm for Random ::::k::::-SATAmin Coja-Oghlan. 292-303 [doi]
- Exact and Approximate BandwidthMarek Cygan, Marcin Pilipczuk. 304-315 [doi]
- Approximation Algorithms via Structural Results for Apex-Minor-Free GraphsErik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi. 316-327 [doi]
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar GraphsErik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein. 328-340 [doi]
- On Cartesian Trees and Range Minimum QueriesErik D. Demaine, Gad M. Landau, Oren Weimann. 341-353 [doi]
- Applications of a Splitting TrickMartin Dietzfelbinger, Michael Rink. 354-365 [doi]
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and RobustnessBenjamin Doerr, Tobias Friedrich, Thomas Sauerwald. 366-377 [doi]
- Incompressibility through Colors and IDsMichael Dom, Daniel Lokshtanov, Saket Saurabh. 378-389 [doi]
- Partition Arguments in Multiparty Communication ComplexityJan Draisma, Eyal Kushilevitz, Enav Weinreb. 390-402 [doi]
- High Complexity Tilings with Sparse ErrorsBruno Durand, Andrei E. Romashchenko, Alexander Shen. 403-414 [doi]
- Tight Bounds for the Cover Time of Multiple Random WalksRobert Elsässer, Thomas Sauerwald. 415-426 [doi]
- Online Computation with AdviceYuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén. 427-438 [doi]
- Dynamic Succinct Ordered TreesArash Farzan, J. Ian Munro. 439-450 [doi]
- Universal Succinct Representations of Trees?Arash Farzan, Rajeev Raman, S. Srinivasa Rao. 451-462 [doi]
- Distortion Is Fixed Parameter TractableMichael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh. 463-474 [doi]
- Towards Optimal Range MediansBeat Gfeller, Peter Sanders. 475-486 [doi]
- B-Treaps: A Uniquely Represented Alternative to B-TreesDaniel Golovin. 487-499 [doi]
- Testing Fourier Dimensionality and SparsityParikshit Gopalan, Ryan O Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer. 500-512 [doi]
- Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order StreamsSudipto Guha, Zhiyi Huang. 513-524 [doi]
- Wireless Communication Is in APXMagnús M. Halldórsson, Roger Wattenhofer. 525-536 [doi]
- The Ehrenfeucht-Silberger ProblemStepan Holub, Dirk Nowotka. 537-548 [doi]
- Applications of Effective Probability Theory to Martin-Löf RandomnessMathieu Hoyrup, Cristobal Rojas. 549-561 [doi]
- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral VariablesKlaus Jansen. 562-573 [doi]
- Popular Mixed MatchingsTelikepalli Kavitha, Julián Mestre, Meghana Nasre. 574-584 [doi]
- Factoring Groups EfficientlyNeeraj Kayal, Timur Nezhmetdinov. 585-596 [doi]
- Learning Halfspaces with Malicious NoiseAdam R. Klivans, Philip M. Long, Rocco A. Servedio. 609-621 [doi]
- General Scheme for Perfect Quantum Network Coding with Free Classical CommunicationHirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler. 622-633 [doi]
- Greedy D{/ensuremath{/Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular CostChristos Koufogiannakis, Neal E. Young. 634-652 [doi]
- Limits and Applications of Group Algebras for Parameterized ProblemsIoannis Koutis, Ryan Williams. 653-664 [doi]
- Sleep with Guilt and Work Faster to Minimize Flow Plus EnergyTak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Isaac Kar-Keung To, Prudence W. H. Wong. 665-676 [doi]
- Improved Bounds for Flow Shop SchedulingMonaldo Mastrolilli, Ola Svensson. 677-688 [doi]
- A 3/2-Approximation Algorithm for General Stable MarriageEric McDermid. 689-700 [doi]
- Limiting Negations in FormulasHiroki Morizumi. 701-712 [doi]
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related ProblemsJesper Nederlof. 713-725 [doi]
- Superhighness and Strong Jump TraceabilityAndré Nies. 726-737 [doi]
- Amortized Communication Complexity of DistributionsJérémie Roland, Mario Szegedy. 738-749 [doi]
- The Number of Symbol Comparisons in QuickSort and QuickSelectBrigitte Vallée, Julien Clément, James Allen Fill, Philippe Flajolet. 750-763 [doi]
- Computing the Girth of a Planar Graph in ::::O::::(::::n:::: log::::n::::) TimeOren Weimann, Raphael Yuster. 764-773 [doi]
- Elimination GraphsYuli Ye, Allan Borodin. 774-785 [doi]