Coverart for item
The Resource Algorithms and complexity : 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, Paul G. Spirakis, Maria Serna (eds.), (electronic book)

Algorithms and complexity : 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, Paul G. Spirakis, Maria Serna (eds.), (electronic book)

Label
Algorithms and complexity : 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings
Title
Algorithms and complexity
Title remainder
8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings
Statement of responsibility
Paul G. Spirakis, Maria Serna (eds.)
Title variation
CIAC 2013
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
005.1
Index
no index present
LC call number
QA76.9.A43
LC item number
.I58 2013
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2013
http://bibfra.me/vocab/lite/meetingName
International Conference on Algorithms and Complexity
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorDate
  • 1955-
  • 1959-
http://library.link/vocab/relatedWorkOrContributorName
  • Spirakis, P. G.
  • Serna, Maria
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
7878
http://library.link/vocab/subjectName
  • Computer algorithms
  • Computational complexity
Label
Algorithms and complexity : 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, Paul G. Spirakis, Maria Serna (eds.), (electronic book)
Instantiates
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
unknown
Color
multicolored
Contents
  • Parameterized Complexity of DAG Partitioning
  • René van Bevern ... [et al.]
  • Four Measures of Nonlinearity
  • Joan Boyar, Magnus Find, René Peralta
  • On the Characterization of Plane Bus Graphs
  • Till Bruckdorfer, Stefan Felsner, Michael Kaufmann
  • Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items
  • Mihai Burcea, Prudence W. H. Wong, Fencol C. C. Yung
  • A Greedy Approximation Algorithm for Minimum-Gap Scheduling
  • Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi
  • Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
  • Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas
  • Evgeny Dantsin, Alexander Wolpert --
  • Hasna Mohsen Alqahtani, Thomas Erlebach
  • Parameterized Complexity and Kernel Bounds for Hard Planning Problems
  • Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
  • Selfish Resource Allocation in Optical Networks
  • Evangelos Bampas, Aris Pagourtzis, George Pierrakos
  • Average Optimal String Matching in Packed Strings
  • Djamal Belazzougui, Mathieu Raffinot
  • Complexity of Barrier Coverage with Relocatable Sensors in the Plane
  • Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari
  • Succinct Permanent Is NEXP-Hard with Many Hard Instances
  • Shlomi Dolev, Nova Fandina, Dan Gutfreund
  • Money-Based Coordination of Network Packets
  • Pavlos S. Efraimidis, Remous-Aris Koutsiamanis
  • Truthful Many-to-Many Assignment with Private Weights
  • Bruno Escoffier, Jérôme Monnot, Fanny Pascual
  • Competitive Online Clique Clustering
  • Aleksander Fabijan, Bengt J. Nilsson, Mia Persson
  • Linear Time Distributed Swap Edge Algorithms
  • Optimal Network Decontamination with Threshold Immunity
  • Paola Flocchini ... [et al.] --
  • Ajoy K. Datta, Lawrence L. Larmore, Linda Pagli
  • Decentralized Throughput Scheduling
  • Jasper de Jong, Marc Uetz, Andreas Wombacher
  • New Results on Stabbing Segments with a Polygon
  • José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero
  • Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games
  • Yann Disser ... [et al.]
  • Query Complexity of Matroids
  • Raghav Kulkarni, Miklos Santha
  • A New Dynamic Graph Structure for Large-Scale Transportation Networks
  • Georgia Mali, Panagiotis Michail, Andreas Paraskevopoulos
  • Capacitated Rank-Maximal Matchings
  • Katarzyna Paluch
  • A Faster CREW PRAM Algorithm for Computing Cartesian Trees
  • Chung Keung Poon, Hao Yuan
  • Advice Complexity of the Online Coloring Problem
  • Sebastian Seibert, Andreas Sprock, Walter Unger
  • Finding All Convex Cuts of a Plane Graph in Cubic Time
  • Sparse Linear Complementarity Problems
  • Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
  • LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem
  • Li Yan, Marek Chrobak
  • Roland Glantz, Henning Meyerhenke
  • Shortest Paths with Bundles and Non-additive Weights Is Hard
  • Paul W. Goldberg, Antony McCabe
  • Cliques and Clubs
  • Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
  • List Coloring in the Absence of Two Subgraphs
  • Petr A. Golovach, Daniël Paulusma
Control code
SPR844949200
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642382338
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote
Label
Algorithms and complexity : 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, Paul G. Spirakis, Maria Serna (eds.), (electronic book)
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
unknown
Color
multicolored
Contents
  • Parameterized Complexity of DAG Partitioning
  • René van Bevern ... [et al.]
  • Four Measures of Nonlinearity
  • Joan Boyar, Magnus Find, René Peralta
  • On the Characterization of Plane Bus Graphs
  • Till Bruckdorfer, Stefan Felsner, Michael Kaufmann
  • Online Multi-dimensional Dynamic Bin Packing of Unit-Fraction Items
  • Mihai Burcea, Prudence W. H. Wong, Fencol C. C. Yung
  • A Greedy Approximation Algorithm for Minimum-Gap Scheduling
  • Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi
  • Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
  • Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas
  • Evgeny Dantsin, Alexander Wolpert --
  • Hasna Mohsen Alqahtani, Thomas Erlebach
  • Parameterized Complexity and Kernel Bounds for Hard Planning Problems
  • Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
  • Selfish Resource Allocation in Optical Networks
  • Evangelos Bampas, Aris Pagourtzis, George Pierrakos
  • Average Optimal String Matching in Packed Strings
  • Djamal Belazzougui, Mathieu Raffinot
  • Complexity of Barrier Coverage with Relocatable Sensors in the Plane
  • Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari
  • Succinct Permanent Is NEXP-Hard with Many Hard Instances
  • Shlomi Dolev, Nova Fandina, Dan Gutfreund
  • Money-Based Coordination of Network Packets
  • Pavlos S. Efraimidis, Remous-Aris Koutsiamanis
  • Truthful Many-to-Many Assignment with Private Weights
  • Bruno Escoffier, Jérôme Monnot, Fanny Pascual
  • Competitive Online Clique Clustering
  • Aleksander Fabijan, Bengt J. Nilsson, Mia Persson
  • Linear Time Distributed Swap Edge Algorithms
  • Optimal Network Decontamination with Threshold Immunity
  • Paola Flocchini ... [et al.] --
  • Ajoy K. Datta, Lawrence L. Larmore, Linda Pagli
  • Decentralized Throughput Scheduling
  • Jasper de Jong, Marc Uetz, Andreas Wombacher
  • New Results on Stabbing Segments with a Polygon
  • José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero
  • Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games
  • Yann Disser ... [et al.]
  • Query Complexity of Matroids
  • Raghav Kulkarni, Miklos Santha
  • A New Dynamic Graph Structure for Large-Scale Transportation Networks
  • Georgia Mali, Panagiotis Michail, Andreas Paraskevopoulos
  • Capacitated Rank-Maximal Matchings
  • Katarzyna Paluch
  • A Faster CREW PRAM Algorithm for Computing Cartesian Trees
  • Chung Keung Poon, Hao Yuan
  • Advice Complexity of the Online Coloring Problem
  • Sebastian Seibert, Andreas Sprock, Walter Unger
  • Finding All Convex Cuts of a Plane Graph in Cubic Time
  • Sparse Linear Complementarity Problems
  • Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
  • LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem
  • Li Yan, Marek Chrobak
  • Roland Glantz, Henning Meyerhenke
  • Shortest Paths with Bundles and Non-additive Weights Is Hard
  • Paul W. Goldberg, Antony McCabe
  • Cliques and Clubs
  • Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
  • List Coloring in the Absence of Two Subgraphs
  • Petr A. Golovach, Daniël Paulusma
Control code
SPR844949200
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642382338
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote

Library Locations

Processing Feedback ...