000			03430nam a22003495i 4500
001			320719
003			MX-SnUAN
005			20160429161432.0
007			cr nn 008mamaa
008			160111s2015 gw | s |||| 0|eng d
020			_a9783319156125 _9978-3-319-15612-5
035			_avtls000420105
039		9	_y201601110924 _zstaff
050		4	_aQA76.9.A43
245	1	0	_aWalcom: algorithms and computation : _b9th international workshop, walcom 2015, dhaka, bangladesh, february 26-28, 2015. Proceedings / _cedited by M. Sohel Rahman, Etsuji Tomita.
264		1	_aCham : _bSpringer International Publishing : _bSpringer, _c2015.
300			_axxiv, 336 páginas : _b110 ilustraciones
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v8973
500			_aSpringer eBooks
505	0		_aEncoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS’s for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aRahman, M. Sohel, _eeditor. _9365502
700	1		_aTomita, Etsuji, _eeditor. _9329671
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783319156118
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-319-15612-5 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c320719 _d320719