000			03708nam a22004215i 4500
999			_c368201 _d368201 _x1
001			368201
003			ES-MaUEC
005			20230102121716.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220116s2022 sz | s |||| 0|eng d
020			_a9783030950187
024	7		_a10.1007/978-3-030-95018-7 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9 .M35 _b2022 EB
245	0	0	_aAlgorithms and Discrete Applied Mathematics : _b8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings _cedited by Niranjan Balachandran, R. Inkulu
250			_aFirst edition 2022
264		1	_aCham _bSpringer International Publising _c2022
300			_a1 recurso en línea (XIX, 317 páginas) _b55 ilustraciones
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aTheoretical Computer Science and General Issues _x2512-2029 _v13179
505	0		_aA proof of the Multiplicative 1-2-3 Conjecture -- The geodesic transversal problem on some networks -- Chromatic Bounds for Some Subclasses of $(P_3\cup P_2)$-free Graphs -- List homomorphisms to separable signed graphs -- Some position problems for graphs -- Comparability graphs among Cover-Incomparability graphs -- Complexity of Paired Domination in AT-free and Planar Graphs -- The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs -- On Conflict-Free Spanning Tree: Algorithms and Complexity -- B0-VPG Representation of AT-free Outerplanar Graphs -- P versus NPC : Steiner tree in convex split graphs -- On cd-coloring of {P_5,K_4}-free chordal graphs -- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs -- Covering a Graph with Densest Subgraphs -- Coresets for $(k, \ell)$-Median Clustering under the Fréchet Distance -- Bounds and Algorithms for Geodetic Hulls -- Voronoi Games using Geodesics -- Approximation and parameterized algorithms for balanced connected partition problems -- Algorithms for Online Car-sharing Problem -- Algebraic algorithms for variants of Subset Sum -- Hardness and Approximation Results for Some Variants of Stable Marriage Problem -- On Fair Division with Binary Valuations Respecting Social Networks -- Parameterized Intractability of Defensive Alliance Problem -- On the approximability of path and cycle problems in arc-dependent networks} -- Approximation Algorithms in Graphs with Known Broadcast time of the Base Graph.
520			_aThis book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022. The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.
988			_aSpringer_Computer_2022
650		7	_2embne _9160233 _aMatemáticas discretas _vCongresos
650		7	_2embne _9151819 _aAlgoritmos computacionales _vCongresos
700	1		_aBalachandran, Niranjan _eeditor literario
700	1		_aInkulu, R. _eeditor literario
773	0		_tSpringer Nature eBook
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-95018-7 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE _n0
998			_b03/2022 _dz _eu _zSI