000727253 000__ 04328cam\a2200505Ii\4500
000727253 001__ 727253
000727253 005__ 20230306140808.0
000727253 006__ m\\\\\o\\d\\\\\\\\
000727253 007__ cr\cn\nnnunnun
000727253 008__ 150522s2015\\\\sz\a\\\\ob\\\\101\0\eng\d
000727253 020__ $$a9783319181738$$qelectronic book
000727253 020__ $$a3319181734$$qelectronic book
000727253 020__ $$z9783319181721
000727253 0247_ $$a10.1007/978-3-319-18173-8$$2doi
000727253 035__ $$aSP(OCoLC)ocn909876379
000727253 035__ $$aSP(OCoLC)909876379
000727253 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dOCLCO$$dYDXCP$$dNUI$$dS4S$$dVLB
000727253 049__ $$aISEA
000727253 050_4 $$aQA76.9.A43$$bI58 2015eb
000727253 08204 $$a005.1$$223
000727253 1112_ $$aInternational Conference on Algorithms and Complexity$$n(9th :$$d2015 :$$cParis, France)
000727253 24510 $$aAlgorithms and complexity$$h[electronic resource] :$$b9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings /$$cVangelis Th. Paschos, Peter Widmayer (eds.).
000727253 264_1 $$aCham :$$bSpringer,$$c2015.
000727253 300__ $$a1 online resource (xvi, 430 pages) :$$billustrations.
000727253 336__ $$atext$$btxt$$2rdacontent
000727253 337__ $$acomputer$$bc$$2rdamedia
000727253 338__ $$aonline resource$$bcr$$2rdacarrier
000727253 4901_ $$aLecture notes in computer science,$$x0302-9743 ;$$v9079
000727253 4901_ $$aLNCS sublibrary. SL 1, Theoretical computer science and general issues
000727253 500__ $$aInternational conference proceedings.
000727253 504__ $$aIncludes bibliographical references and author index.
000727253 5050_ $$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.
000727253 506__ $$aAccess limited to authorized users.
000727253 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.
000727253 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed May 22, 2015).
000727253 650_0 $$aComputer algorithms$$vCongresses.
000727253 650_0 $$aComputational complexity$$vCongresses.
000727253 7001_ $$aPaschos, Vangelis Th.,$$eeditor.
000727253 7001_ $$aWidmayer, Peter,$$eeditor.
000727253 830_0 $$aLecture notes in computer science ;$$v9079.
000727253 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000727253 852__ $$bebk
000727253 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-18173-8$$zOnline Access$$91397441.1
000727253 909CO $$ooai:library.usi.edu:727253$$pGLOBAL_SET
000727253 980__ $$aEBOOK
000727253 980__ $$aBIB
000727253 982__ $$aEbook
000727253 983__ $$aOnline
000727253 994__ $$a92$$bISE