LEADER 04600nam 22007095 450 001 9910483445903321 005 20230222171630.0 010 $a3-319-18173-4 024 7 $a10.1007/978-3-319-18173-8 035 $a(CKB)3710000000416819 035 $a(SSID)ssj0001501322 035 $a(PQKBManifestationID)11848382 035 $a(PQKBTitleCode)TC0001501322 035 $a(PQKBWorkID)11536283 035 $a(PQKB)10168763 035 $a(DE-He213)978-3-319-18173-8 035 $a(MiAaPQ)EBC6295170 035 $a(MiAaPQ)EBC5587798 035 $a(Au-PeEL)EBL5587798 035 $a(OCoLC)909876379 035 $a(PPN)186029578 035 $a(EXLCZ)993710000000416819 100 $a20150515d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Complexity$b[electronic resource] $e9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings /$fedited by Vangelis Th. Paschos, Peter Widmayer 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XV, 430 p. 81 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9079 300 $aIncludes index. 311 $a3-319-18172-6 327 $aCommunication, Dynamics and Renormalization -- Fast and Powerful Hashing using Tabulation -- Green Barrier Coverage with Mobile Sensors -- A Re?ned Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths -- Orthogonal Graph Drawing with In?exible Edges -- Linear time Constructions of some d-Restriction Problems -- E?ciently 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 De?ned 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. O?ine -- 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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9079 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence?Data processing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence?Data processing. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a005.1 702 $aPaschos$b Vangelis Th$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWidmayer$b Peter$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483445903321 996 $aAlgorithms and complexity$955800 997 $aUNINA