Coverart for item
The Resource Algorithms - ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013 : proceedings, Hans L. Bodlaender, Giuseppe F. Italiano (eds.)

Algorithms - ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013 : proceedings, Hans L. Bodlaender, Giuseppe F. Italiano (eds.)

Label
Algorithms - ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013 : proceedings
Title
Algorithms - ESA 2013
Title remainder
21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013 : proceedings
Statement of responsibility
Hans L. Bodlaender, Giuseppe F. Italiano (eds.)
Creator
Contributor
Editor of compilation
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms
Member of
Cataloging source
GW5XE
Illustrations
illustrations
Index
index present
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2013
http://bibfra.me/vocab/lite/meetingName
ESA (Symposium)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Bodlaender, H. L.
  • Italiano, Giuseppe F.
Series statement
Lecture notes in computer science,
Series volume
8125
http://library.link/vocab/subjectName
  • Algorithms
  • Mathematics
  • Computer Communication Networks
  • Computer algorithms
  • Computer science
  • Data structures (Computer science)
  • Computer Science
  • Algorithm Analysis and Problem Complexity
  • Computer Communication Networks
  • Discrete Mathematics in Computer Science
  • Computer Graphics
  • Numeric Computing
  • Data Structures
Label
Algorithms - ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013 : proceedings, Hans L. Bodlaender, Giuseppe F. Italiano (eds.)
Link
http://dx.doi.org/10.1007/978-3-642-40450-4
Instantiates
Publication
Copyright
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • Friendship and Stable Matching
  • Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer
  • An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters
  • Lars Arge, Gerth Stølting Brodal, Jakob Truelsen
  • Logit Dynamics with Concurrent Updates for Local Interaction Games
  • Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale
  • On Resilient Graph Spanners
  • Giorgio Ausiello, Paolo Giulio Franciosa
  • Maximizing Barrier Coverage Lifetime with Mobile Sensors
  • Amotz Bar-Noy, Dror Rawitz, Peter Terlecky
  • The Online Replacement Path Problem
  • Theory and Implementation of Online Multiselection Algorithms
  • Jérémy Barbay ... [et al.] --
  • David Adjiashvili, Gianpaolo Oriolo, Marco Senatore
  • Flip Distance between Triangulations of a Simple Polygon is NP-Complete
  • Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz
  • Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures
  • Deepak Ajwani, Nodari Sitchinava
  • Computing the Greedy Spanner in Linear Space
  • Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink
  • Parallel String Sample Sort
  • Timo Bingmann, Peter Sanders
  • Exclusive Graph Searching
  • Lélia Blin, Janna Burman, Nicolas Nisse
  • Largest Chordal and Interval Subgraphs Faster Than 2 n
  • Ivan Bliznets ... [et al.]
  • Revisiting the Problem of Searching on a Line
  • Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher
  • On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity
  • Jop Briët, Daniel Dadush, Sebastian Pokutta --
  • An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering
  • Andreas Beckmann, Ulrich Meyer, David Veith
  • Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
  • Djamal Belazzougui ... [et al.]
  • Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
  • Christoph Berkholz, Paul Bonsma, Martin Grohe
  • A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
  • Davide Bilò, Luciano Gualà, Guido Proietti
  • Limitations of Deterministic Auction Design for Correlated Bidders
  • Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
  • Connectivity Inference in Mass Spectrometry Based Structure Determination
  • Deepesh Agarwal, Julio-Cesar Silva Araujo, Christelle Caillouet
  • Secluded Connectivity Problems
  • Shiri Chechik ... [et al.]
  • List H-Coloring a Graph by Removing Few Vertices
  • Rajesh Chitnis, László Egri, Dániel Marx
  • Rumor Spreading in Random Evolving Graphs
  • Andrea Clementi, Pierluigi Crescenzi, Carola Doerr
  • The Encoding Complexity of Two Dimensional Range Minimum Data Structures
  • Dynamic Graphs in the Sliding-Window Model
  • Michael S. Crouch, Andrew McGregor, Daniel Stubbs --
  • Gerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi
  • Computing the Fréchet Distance with a Retractable Leash
  • Kevin Buchin ... [et al.]
  • Vertex Deletion for 3D Delaunay Triangulations
  • Kevin Buchin ... [et al.]
  • Economic 3-Colored Subdivision of Triangulations
  • Lucas Moutinho Bueno, Jorge Stolfi
  • FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations
  • Hu Ding, Jinhui Xu
  • Maximizing a Submodular Function with Viability Constraints
  • Wolfgang Dvořák, Monika Henzinger, David P. Williamson
  • Table Cartograms
  • William Evans, Stefan Felsner, Michael Kaufmann
  • Network Bargaining with General Capacities
  • Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
  • Nearly Optimal Private Convolution
  • Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov
  • A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
  • Tractable Parameterizations for the Minimum Linear Arrangement Problem
  • Michael R. Fellows, Danny Hermelin, Frances A. Rosamond --
  • Radu Curticapean, Marvin Künnemann
  • Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
  • Marek Cygan, Fabrizio Grandoni, Danny Hermelin
  • Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap
  • Mark de Berg, Dirk H. P. Gerrits
  • Inefficiency of Standard Multi-unit Auctions
  • Bart de Keijzer, Evangelos Markakis, Guido Schäfer
  • Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
  • Travis Gagie ... [et al.]
  • Kernelization Using Structural Parameters on Sparse Graph Classes
  • Jakub Gajarský ... [et al.]
  • On the Computational Complexity of Erdős-Szekeres and Related Problems in R3
  • Panos Giannopoulos, Christian Knauer, Daniel Werner
  • Encodings for Range Selection and Top-k Queries
  • Roberto Grossi ... [et al.]
  • Fréchet Queries in Geometric Trees
  • Joachim Gudmundsson, Michiel Smid
  • Compressed Cache-Oblivious String B-tree
  • A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
  • Nir Halman, Giacomo Nannicini, James Orlin --
  • Paolo Ferragina, Rossano Venturini
  • BICO: BIRCH Meets Coresets for k-Means Clustering
  • Hendrik Fichtenberger, Marc Gillé, Melanie Schmidt
  • Long Circuits and Large Euler Subgraphs
  • Fedor V. Fomin, Petr A. Golovach
  • Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph
  • Fedor V. Fomin, Michał Pilipczuk
  • Better Approximation Algorithms for Technology Diffusion
  • Jochen Könemann, Sina Sadeghian, Laura Sanità
  • On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
  • Stefan Kratsch
  • Balanced Neighbor Selection for BitTorrent-Like Networks
  • Sándor Laki, Tamás Lukovszki
  • Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
  • Mark Jones ... [et al.]
  • Improved Approximation Algorithms for Projection Games
  • Pasin Manurangsi, Dana Moshkovitz
  • An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
  • The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
  • Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria --
  • Thomas Kesselheim ... [et al.]
  • Balls into Bins Made Faster
  • Megha Khosla
  • An Alternative Approach to Alternative Routes: HiDAR
  • Moritz Kobitzsch
  • Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
  • Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
  • Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling
  • Kim Thang Nguyen
  • Euclidean Greedy Drawings of Trees
  • Martin Nöllenburg, Roman Prutkin
  • Sparse Fault-Tolerant BFS Trees
  • Merav Parter, David Peleg
  • On the Most Likely Convex Hull of Uncertain Points
  • Subhash Suri, Kevin Verbeek, Hakan Yıldız
  • Top-k Document Retrieval in External Memory
  • Rahul Shah, Cheng Sheng, Sharma V. Thankachan
  • Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
  • Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-Core Architectures
  • Kai Xiao ... [et al.]
  • Jannik Matuschke, Andreas Bley, Benjamin Müller
  • The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial
  • George B. Mertzios
  • Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets
  • Shin-Ichi Minato
  • Optimal Color Range Reporting in One Dimension
  • Yakov Nekrich, Jeffrey Scott Vitter
Control code
ocn859159798
Dimensions
unknown
Extent
1 online resource (xviii, 829 pages)
File format
unknown
Form of item
online
Isbn
9783642404504
Isbn Type
(electronic bk.)
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-642-40450-4
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)859159798
Label
Algorithms - ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013 : proceedings, Hans L. Bodlaender, Giuseppe F. Italiano (eds.)
Link
http://dx.doi.org/10.1007/978-3-642-40450-4
Publication
Copyright
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
  • Friendship and Stable Matching
  • Elliot Anshelevich, Onkar Bhardwaj, Martin Hoefer
  • An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters
  • Lars Arge, Gerth Stølting Brodal, Jakob Truelsen
  • Logit Dynamics with Concurrent Updates for Local Interaction Games
  • Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale
  • On Resilient Graph Spanners
  • Giorgio Ausiello, Paolo Giulio Franciosa
  • Maximizing Barrier Coverage Lifetime with Mobile Sensors
  • Amotz Bar-Noy, Dror Rawitz, Peter Terlecky
  • The Online Replacement Path Problem
  • Theory and Implementation of Online Multiselection Algorithms
  • Jérémy Barbay ... [et al.] --
  • David Adjiashvili, Gianpaolo Oriolo, Marco Senatore
  • Flip Distance between Triangulations of a Simple Polygon is NP-Complete
  • Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz
  • Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures
  • Deepak Ajwani, Nodari Sitchinava
  • Computing the Greedy Spanner in Linear Space
  • Sander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink
  • Parallel String Sample Sort
  • Timo Bingmann, Peter Sanders
  • Exclusive Graph Searching
  • Lélia Blin, Janna Burman, Nicolas Nisse
  • Largest Chordal and Interval Subgraphs Faster Than 2 n
  • Ivan Bliznets ... [et al.]
  • Revisiting the Problem of Searching on a Line
  • Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher
  • On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity
  • Jop Briët, Daniel Dadush, Sebastian Pokutta --
  • An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering
  • Andreas Beckmann, Ulrich Meyer, David Veith
  • Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
  • Djamal Belazzougui ... [et al.]
  • Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
  • Christoph Berkholz, Paul Bonsma, Martin Grohe
  • A Faster Computation of All the Best Swap Edges of a Shortest Paths Tree
  • Davide Bilò, Luciano Gualà, Guido Proietti
  • Limitations of Deterministic Auction Design for Correlated Bidders
  • Ioannis Caragiannis, Christos Kaklamanis, Maria Kyropoulou
  • Connectivity Inference in Mass Spectrometry Based Structure Determination
  • Deepesh Agarwal, Julio-Cesar Silva Araujo, Christelle Caillouet
  • Secluded Connectivity Problems
  • Shiri Chechik ... [et al.]
  • List H-Coloring a Graph by Removing Few Vertices
  • Rajesh Chitnis, László Egri, Dániel Marx
  • Rumor Spreading in Random Evolving Graphs
  • Andrea Clementi, Pierluigi Crescenzi, Carola Doerr
  • The Encoding Complexity of Two Dimensional Range Minimum Data Structures
  • Dynamic Graphs in the Sliding-Window Model
  • Michael S. Crouch, Andrew McGregor, Daniel Stubbs --
  • Gerth Stølting Brodal, Andrej Brodnik, Pooya Davoodi
  • Computing the Fréchet Distance with a Retractable Leash
  • Kevin Buchin ... [et al.]
  • Vertex Deletion for 3D Delaunay Triangulations
  • Kevin Buchin ... [et al.]
  • Economic 3-Colored Subdivision of Triangulations
  • Lucas Moutinho Bueno, Jorge Stolfi
  • FPTAS for Minimizing Earth Mover's Distance under Rigid Transformations
  • Hu Ding, Jinhui Xu
  • Maximizing a Submodular Function with Viability Constraints
  • Wolfgang Dvořák, Monika Henzinger, David P. Williamson
  • Table Cartograms
  • William Evans, Stefan Felsner, Michael Kaufmann
  • Network Bargaining with General Capacities
  • Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
  • Nearly Optimal Private Convolution
  • Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov
  • A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
  • Tractable Parameterizations for the Minimum Linear Arrangement Problem
  • Michael R. Fellows, Danny Hermelin, Frances A. Rosamond --
  • Radu Curticapean, Marvin Künnemann
  • Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
  • Marek Cygan, Fabrizio Grandoni, Danny Hermelin
  • Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap
  • Mark de Berg, Dirk H. P. Gerrits
  • Inefficiency of Standard Multi-unit Auctions
  • Bart de Keijzer, Evangelos Markakis, Guido Schäfer
  • Binary Jumbled Pattern Matching on Trees and Tree-Like Structures
  • Travis Gagie ... [et al.]
  • Kernelization Using Structural Parameters on Sparse Graph Classes
  • Jakub Gajarský ... [et al.]
  • On the Computational Complexity of Erdős-Szekeres and Related Problems in R3
  • Panos Giannopoulos, Christian Knauer, Daniel Werner
  • Encodings for Range Selection and Top-k Queries
  • Roberto Grossi ... [et al.]
  • Fréchet Queries in Geometric Trees
  • Joachim Gudmundsson, Michiel Smid
  • Compressed Cache-Oblivious String B-tree
  • A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
  • Nir Halman, Giacomo Nannicini, James Orlin --
  • Paolo Ferragina, Rossano Venturini
  • BICO: BIRCH Meets Coresets for k-Means Clustering
  • Hendrik Fichtenberger, Marc Gillé, Melanie Schmidt
  • Long Circuits and Large Euler Subgraphs
  • Fedor V. Fomin, Petr A. Golovach
  • Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph
  • Fedor V. Fomin, Michał Pilipczuk
  • Better Approximation Algorithms for Technology Diffusion
  • Jochen Könemann, Sina Sadeghian, Laura Sanità
  • On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
  • Stefan Kratsch
  • Balanced Neighbor Selection for BitTorrent-Like Networks
  • Sándor Laki, Tamás Lukovszki
  • Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
  • Mark Jones ... [et al.]
  • Improved Approximation Algorithms for Projection Games
  • Pasin Manurangsi, Dana Moshkovitz
  • An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
  • The Compressed Annotation Matrix: An Efficient Data Structure for Computing Persistent Cohomology
  • Jean-Daniel Boissonnat, Tamal K. Dey, Clément Maria --
  • Thomas Kesselheim ... [et al.]
  • Balls into Bins Made Faster
  • Megha Khosla
  • An Alternative Approach to Alternative Routes: HiDAR
  • Moritz Kobitzsch
  • Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet
  • Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
  • Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling
  • Kim Thang Nguyen
  • Euclidean Greedy Drawings of Trees
  • Martin Nöllenburg, Roman Prutkin
  • Sparse Fault-Tolerant BFS Trees
  • Merav Parter, David Peleg
  • On the Most Likely Convex Hull of Uncertain Points
  • Subhash Suri, Kevin Verbeek, Hakan Yıldız
  • Top-k Document Retrieval in External Memory
  • Rahul Shah, Cheng Sheng, Sharma V. Thankachan
  • Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
  • Shell: A Spatial Decomposition Data Structure for 3D Curve Traversal on Many-Core Architectures
  • Kai Xiao ... [et al.]
  • Jannik Matuschke, Andreas Bley, Benjamin Müller
  • The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial
  • George B. Mertzios
  • Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets
  • Shin-Ichi Minato
  • Optimal Color Range Reporting in One Dimension
  • Yakov Nekrich, Jeffrey Scott Vitter
Control code
ocn859159798
Dimensions
unknown
Extent
1 online resource (xviii, 829 pages)
File format
unknown
Form of item
online
Isbn
9783642404504
Isbn Type
(electronic bk.)
Level of compression
unknown
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-642-40450-4
Other physical details
illustrations.
Quality assurance targets
not applicable
Reformatting quality
unknown
Sound
unknown sound
Specific material designation
remote
System control number
(OCoLC)859159798

Library Locations

    • ERDC - Hanover (US Army Engineer Research and Development Center) Borrow it
      72 Lyme Road, Hanover, NH, 03755-1290, US
      43.7279642 -72.2684934
Processing Feedback ...