Skip to main content
SpringerLink
Log in
Book cover

Experimental Algorithms

12th International Symposium, SEA 2013, Rome, Italy, June 5-7, 2013, Proceedings

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Vincenzo Bonifaci

    1. Institute for Systems Analysis and Computer Science (IASI), National Research Council (CNR), Rome, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Camil Demetrescu

    1. Department of Computer and Systems Science, Sapienza University of Rome, Rome, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Alberto Marchetti-Spaccamela

    1. Department of Computer and Systems Science, Sapienza University of Rome, Rome, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast track conference proceedings
  • Unique visibility
  • State of the art research

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

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

Included in the following conference series:

Conference proceedings info: SEA 2013.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (35 papers)

  1. Front Matter

    Download chapter PDF

  3. Transportation Networks and Graph Algorithms I

    1. Hub Label Compression

      • Daniel Delling, Andrew V. Goldberg, Renato F. Werneck
      Pages 18-29

    2. Faster Customization of Road Networks

      • Daniel Delling, Renato F. Werneck
      Pages 30-42

    3. Intriguingly Simple and Fast Transit Routing

      • Julian Dibbelt, Thomas Pajor, Ben Strasser, Dorothea Wagner
      Pages 43-54

    4. Transit Node Routing Reconsidered

      • Julian Arz, Dennis Luxen, Peter Sanders
      Pages 55-66

  4. Combinatorics and Enumeration

    1. A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions

      • Lasse Kliemann, Ole Kliemann, C. Patvardhan, Volkmar Sauerland, Anand Srivastav
      Pages 67-78

    2. Computational Aspects of Ordered Integer Partition with Upper Bounds

      • Roland Glück, Dominik Köppl, Günther Wirsching
      Pages 79-90

    3. Hypergraph Transversal Computation with Binary Decision Diagrams

      • Takahisa Toda
      Pages 91-102

    4. Efficient Counting of Maximal Independent Sets in Sparse Graphs

      • Fredrik Manne, Sadia Sharmin
      Pages 103-114

  5. Data Structures and Compression

    1. An Edge Quadtree for External Memory

      • Herman Haverkort, Mark McGranaghan, Laura Toma
      Pages 115-126

    2. Branchless Search Programs

      • Amr Elmasry, Jyrki Katajainen
      Pages 127-138

    3. Lightweight Lempel-Ziv Parsing

      • Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
      Pages 139-150

    4. Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences

      • Dong Zhou, David G. Andersen, Michael Kaminsky
      Pages 151-163

  6. Network Partitioning and Bioinformatics

    1. Think Locally, Act Globally: Highly Balanced Graph Partitioning

      • Peter Sanders, Christian Schulz
      Pages 164-175

    2. Evaluation of ILP-Based Approaches for Partitioning into Colorful Components

      • Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier
      Pages 176-187

    3. Finding Modules in Networks with Non-modular Regions

      • Sharon Bruckner, Bastian Kayser, Tim O. F. Conrad
      Pages 188-199

    4. Telling Stories Fast

      • Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, Paulo Vieira Milreu
      Pages 200-211
Back to top

Other volumes

  1. Experimental Algorithms

Keywords

About this book

This book constitutes the refereed proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013, held in Rome, Italy, in June 2013.
The 32 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on transportation networks and graph algorithms, combinatorics and enumeration, data structures and compression, network partitioning and bioinformatics, mathematical programming, geometry and optimization, and scheduling and local search.

Editors and Affiliations

  • Institute for Systems Analysis and Computer Science (IASI), National Research Council (CNR), Rome, Italy

    Vincenzo Bonifaci

  • Department of Computer and Systems Science, Sapienza University of Rome, Rome, Italy

    Camil Demetrescu, Alberto Marchetti-Spaccamela

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation