000 04051nam a22005175i 4500
001 978-3-319-18173-8
003 DE-He213
005 20200421111205.0
007 cr nn 008mamaa
008 150515s2015 gw | s |||| 0|eng d
020 _a9783319181738
_9978-3-319-18173-8
024 7 _a10.1007/978-3-319-18173-8
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aAlgorithms and Complexity
_h[electronic resource] :
_b9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings /
_cedited by Vangelis Th. Paschos, Peter Widmayer.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXV, 430 p. 81 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9079
505 0 _aCommunication, Dynamics and Renormalization -- Fast and Powerful Hashing using Tabulation -- Green Barrier Coverage with Mobile Sensors -- A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths -- Orthogonal Graph Drawing with Inflexible Edges -- Linear time Constructions of some d-Restriction Problems -- Efficiently Testing T-Interval Connectivity in Dynamic Graphs -- Competitive Strategies for Online Clique Clustering -- Scheduling with Gaps: New Models and Algorithms -- MinMax-Distance Gathering on given Meeting Points -- Evacuating Robots from a Disk Using Face-to-Face Communication -- Planarity of Streamed Graphs -- Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs -- Randomized Adaptive Test Cover -- Contraction Blockers for Graphs with Forbidden Induced Paths -- Label Placement in Road Maps -- Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Offline -- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints -- Simple strategies versus optimal schedules in multi-agent patrolling -- Sharing Non-Anonymous Costs of Multiple Resources Optimally -- Algorithms solving the Matching Cut problem -- End-Vertices of Graph Search Algorithms -- Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete -- A Lex-BFS-based recognition algorithm for Robinsonian matrices -- Mixed Map Labeling -- Optimal Online Edge Coloring of Planar Graphs with Advice -- Approximability of Two Variants of Multiple Knapsack -- Block Sorting is Hard -- An opportunistic text indexing structure based on run length encoding -- PSPACE-completeness of Bloxorz and of Games with 2-Buttons -- Advice Complexity of Fine-Grained Job Shop Scheduling.
520 _aThis book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015. The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Structures.
700 1 _aPaschos, Vangelis Th.
_eeditor.
700 1 _aWidmayer, Peter.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319181721
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v9079
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-18173-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c54077
_d54077