Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2012

Automata, Languages, and Programming

39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I

Editors:

  1. Artur Czumaj

    1. Department of Computer Science and Centre for Discrete Mathematics and its Applications, University of Warwick, Warwick, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kurt Mehlhorn

    1. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Andrew Pitts

    1. Computer Laboratory, University of Cambridge, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Roger Wattenhofer

    1. ETH Zurich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast-track conference proceedings
  • State-of-the-art research

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 7391)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ICALP: International Colloquium on Automata, Languages, and Programming

Conference proceedings info: ICALP 2012.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (71 papers)

  1. Track A – Algorithms, Complexity and Games

    1. Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable

      • Rajesh Chitnis, Marek Cygan, Mohammadtaghi Hajiaghayi, Dániel Marx
      Pages 230-241

    2. Max-Cut Parameterized above the Edwards-Erdős Bound

      • Robert Crowston, Mark Jones, Matthias Mnich
      Pages 242-253

    3. Clique Cover and Graph Separation: New Incompressibility Results

      • Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk, Magnus Wahlström
      Pages 254-265

    4. The Inverse Shapley Value Problem

      • Anindya De, Ilias Diakonikolas, Rocco Servedio
      Pages 266-277

    5. Zero-One Rounding of Singular Vectors

      • Amit Deshpande, Ravindran Kannan, Nikhil Srivastava
      Pages 278-289

    7. Space-Constrained Interval Selection

      • Yuval Emek, Magnús M. Halldórsson, Adi Rosén
      Pages 302-313

    9. Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima

      • Arash Farzan, J. Ian Munro, Rajeev Raman
      Pages 327-338

    10. Universal Factor Graphs

      • Uriel Feige, Shlomo Jozeph
      Pages 339-350

    11. Parameterized Approximation via Fidelity Preserving Transformations

      • Michael R. Fellows, Ariel Kulik, Frances Rosamond, Hadas Shachnai
      Pages 351-362

    12. Backdoors to Acyclic SAT

      • Serge Gaspers, Stefan Szeider
      Pages 363-374

    13. Dominators, Directed Bipolar Orders, and Independent Spanning Trees

      • Loukas Georgiadis, Robert E. Tarjan
      Pages 375-386

    14. Hardness of Approximation for Quantum Problems

      • Sevag Gharibian, Julia Kempe
      Pages 387-398

    16. Stochastic Vehicle Routing with Recourse

      • Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket
      Pages 411-423

    17. The Online Metric Matching Problem for Doubling Metrics

      • Anupam Gupta, Kevin Lewi
      Pages 424-435

    18. Approximating Sparse Covering Integer Programs Online

      • Anupam Gupta, Viswanath Nagarajan
      Pages 436-448

    19. Streaming and Communication Complexity of Clique Approximation

      • Magnús M. Halldórsson, Xiaoming Sun, Mario Szegedy, Chengu Wang
      Pages 449-460

    20. Distributed Private Heavy Hitters

      • Justin Hsu, Sanjeev Khanna, Aaron Roth
      Pages 461-472
Back to top

Other Volumes

  1. Automata, Languages, and Programming

  2. Automata, Languages, and Programming

Back to top

About this book

This two-volume set of LNCS 7391 and LNCS 7392 constitutes the refereed proceedings of the 39th International Colloquium on Automata, Languages and Programming, ICALP 2012, held in Warwick, UK, in July 2012. The total of 123 revised full papers presented in this volume were carefully reviewed and selected from 432 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.
Back to top

Keywords

Back to top

Editors and Affiliations

  • Department of Computer Science and Centre for Discrete Mathematics and its Applications, University of Warwick, Warwick, UK

    Artur Czumaj

  • Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Kurt Mehlhorn

  • Computer Laboratory, University of Cambridge, UK

    Andrew Pitts

  • ETH Zurich, Switzerland

    Roger Wattenhofer

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation