Abstract is missing.
- Additive Approximation for Edge-Deletion Problems (Abstract)Noga Alon, Asaf Shapira, Benny Sudakov. 1-2 [doi]
- Testing Graph Isomorphism in Parallel by Playing a GameMartin Grohe, Oleg Verbitsky. 3-14 [doi]
- The Spectral Gap of Random Graphs with Given Expected DegreesAmin Coja-Oghlan, André Lanka. 15-26 [doi]
- Embedding Bounded Bandwidth Graphs into l::1::Douglas E. Carroll, Ashish Goel, Adam Meyerson. 27-37 [doi]
- On Counting Homomorphisms to Directed Acyclic GraphsMartin E. Dyer, Leslie Ann Goldberg, Mike Paterson. 38-49 [doi]
- Fault-Tolerance Threshold for a Distance-Three Quantum CodeBen Reichardt. 50-61 [doi]
- Lower Bounds on Matrix Rigidity Via a Quantum ArgumentRonald de Wolf. 62-71 [doi]
- Self-testing of Quantum CircuitsFrédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier. 72-83 [doi]
- Deterministic Extractors for Independent-Symbol SourcesChia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai. 84-95 [doi]
- Gap Amplification in PCPs Using Lazy Random WalksJaikumar Radhakrishnan. 96-107 [doi]
- Stopping Times, Metrics and Approximate CountingMagnus Bordewich, Martin E. Dyer, Marek Karpinski. 108-119 [doi]
- Algebraic Characterization of the Finite Power PropertyMichal Kunc. 120-131 [doi]
- P-completeness of Cellular Automaton Rule 110Turlough Neary, Damien Woods. 132-143 [doi]
- Small Sweeping 2NFAs Are Not Closed Under ComplementChristos A. Kapoutsis. 144-156 [doi]
- Expressive Power of Pebble AutomataMikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin. 157-168 [doi]
- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTsR. Ravi, Mohit Singh. 169-180 [doi]
- Better Algorithms for Minimizing Average Flow-Time on Related MachinesNaveen Garg, Amit Kumar. 181-190 [doi]
- A Push-Relabel Algorithm for Approximating Degree Bounded MSTsKamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar. 191-201 [doi]
- Edge Disjoint Paths in Moderately Connected GraphsSatish Rao, Shuheng Zhou. 202-213 [doi]
- A Robust APTAS for the Classical Bin Packing ProblemLeah Epstein, Asaf Levin. 214-225 [doi]
- Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-DeletionSubhash Khot, Ashok Kumar Ponnuswami. 226-237 [doi]
- Approximating the Orthogonal Knapsack Problem for HypercubesRolf Harren. 238-249 [doi]
- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed GraphsRamesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn. 250-261 [doi]
- Finding the Smallest ::::H::::-Subgraph in Real Weighted Graphs and Related ProblemsVirginia Vassilevska, Ryan Williams, Raphael Yuster. 262-273 [doi]
- Weighted Bipartite Matching in Matrix Multiplication TimePiotr Sankowski. 274-285 [doi]
- Optimal Resilient Sorting and Searching in the Presence of Memory FaultsIrene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano. 286-298 [doi]
- Reliable and Efficient Computational Geometry Via Controlled PerturbationKurt Mehlhorn, Ralf Osbild, Michael Sagraloff. 299-310 [doi]
- Tight Bounds for Selfish and Greedy Load BalancingIoannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli. 311-322 [doi]
- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin TautologiesArist Kojevnikov, Dmitry Itsykson. 323-334 [doi]
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One LawsLance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang. 335-345 [doi]
- The Connectivity of Boolean Satisfiability: Computational and Structural DichotomiesParikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou. 346-357 [doi]
- Suffix Trays and Suffix Trists: Structures for Faster Text IndexingRichard Cole, Tsvi Kopelowitz, Moshe Lewenstein. 358-369 [doi]
- Optimal Lower Bounds for Rank and Select IndexesAlexander Golynski. 370-381 [doi]
- Dynamic Interpolation Search RevisitedAlexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis. 382-394 [doi]
- Dynamic Matrix RankGudmund Skovbjerg Frandsen, Peter Frands Frandsen. 395-406 [doi]
- Nearly Optimal Visibility Representations of Plane GraphsXin He, Huaming Zhang. 407-418 [doi]
- Planar Crossing Numbers of Genus ::::g:::: GraphsHristo Djidjev, Imrich Vrto. 419-430 [doi]
- How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree CoverToshihiro Fujito. 431-442 [doi]
- Tight Approximation Algorithm for Connectivity Augmentation ProblemsGuy Kortsarz, Zeev Nutov. 443-452 [doi]
- On the Bipartite Unique Perfect Matching ProblemThanh Minh Hoang, Meena Mahajan, Thomas Thierauf. 453-464 [doi]
- Comparing Reductions to NP-Complete SetsJohn M. Hitchcock, Aduri Pavan. 465-476 [doi]
- Design Is as Easy as OptimizationDeeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani. 477-488 [doi]
- On the Complexity of 2D Discrete Fixed Point ProblemXi Chen, Xiaotie Deng. 489-500 [doi]
- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency FunctionsMartin Gairing, Burkhard Monien, Karsten Tiemann. 501-512 [doi]
- The Game World Is Flat: The Complexity of Nash Equilibria in Succinct GamesConstantinos Daskalakis, Alex Fabrikant, Christos H. Papadimitriou. 513-524 [doi]
- Network Games with Atomic PlayersRoberto Cominetti, José R. Correa, Nicolás E. Stier Moses. 525-536 [doi]
- Finite-State Dimension and Real ArithmeticDavid Doty, Jack H. Lutz, Satyadev Nandakumar. 537-547 [doi]
- Exact Algorithms for Exact Satisfiability and Number of Perfect MatchingsAndreas Björklund, Thore Husfeldt. 548-559 [doi]
- The Myriad Virtues of Wavelet TreesPaolo Ferragina, Raffaele Giancarlo, Giovanni Manzini. 560-571 [doi]
- Atomic Congestion Games Among CoalitionsDimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis. 572-583 [doi]
- Computing Equilibrium Prices in Exchange Economies with Tax DistortionsBruno Codenotti, Luis Rademacher, Kasturi R. Varadarajan. 584-595 [doi]
- New Constructions of Mechanisms with VerificationVincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Carmine Ventre. 596-607 [doi]
- On the Price of Stability for Designing Undirected Networks with Fair Cost AllocationsAmos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo. 608-618 [doi]
- Dynamic Routing Schemes for General GraphsAmos Korman, David Peleg. 619-630 [doi]
- Energy Complexity and Entropy of Threshold CircuitsKei Uchizawa, Rodney J. Douglas, Wolfgang Maass. 631-642 [doi]
- New Algorithms for Regular Expression MatchingPhilip Bille. 643-654 [doi]
- A Parameterized View on Matroid Optimization ProblemsDániel Marx. 655-666 [doi]
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree ReconstructionGuy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar. 667-678 [doi]
- Length-Bounded Cuts and FlowsGeorg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella. 679-690 [doi]
- An Adaptive Spectral Heuristic for Partitioning Random GraphsAmin Coja-Oghlan. 691-702 [doi]
- Some Results on Matchgates and Holographic AlgorithmsJin-yi Cai, Vinay Choudhary. 703-714 [doi]
- Weighted Popular MatchingsJulián Mestre. 715-726 [doi]