Algorithms and Discrete Applied Mathematics 11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings /

This book constitutes the refereed proceedings of the 11th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2025, held in Coimbatore, India, during February 13–15, 2025. The 30 full papers included in this book were carefully reviewed and selected from 89 submissions.T...

Ամբողջական նկարագրություն

Պահպանված է:
Մատենագիտական մանրամասներ
Համատեղ հեղինակ: SpringerLink (Online service)
Այլ հեղինակներ: Gaur, Daya (Խմբագիր), Mathew, Rogers (Խմբագիր)
Ձևաչափ: Էլեկտրոնային էլ․ գիրք
Լեզու:անգլերեն
Հրապարակվել է: Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Հրատարակություն:1st ed. 2025.
Շարք:Lecture Notes in Computer Science, 15536
Խորագրեր:
Առցանց հասանելիություն:https://doi.org/10.1007/978-3-031-83438-7
Ցուցիչներ: Ավելացրեք ցուցիչ
Չկան պիտակներ, Եղեք առաջինը, ով նշում է այս գրառումը!

MARC

LEADER 00000nam a22000005i 4500
001 978-3-031-83438-7
003 DE-He213
005 20260706115756.0
007 cr nn 008mamaa
008 250205s2025 sz | s |||| 0|eng d
020 |a 9783031834387  |9 978-3-031-83438-7 
024 7 |a 10.1007/978-3-031-83438-7  |2 doi 
050 4 |a QA76.9.M35 
072 7 |a UYAM  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYAM  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Algorithms and Discrete Applied Mathematics  |h [electronic resource] :  |b 11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings /  |c edited by Daya Gaur, Rogers Mathew. 
250 |a 1st ed. 2025. 
264 1 |a Cham :  |b Springer Nature Switzerland :  |b Imprint: Springer,  |c 2025. 
300 |a XXI, 370 p. 70 illus., 16 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
341 0 |b Table of contents navigation  |2 onix 
341 0 |b Single logical reading order  |2 onix 
341 0 |b Short alternative textual descriptions  |2 onix 
341 0 |b Use of color is not sole means of conveying information  |2 onix 
341 0 |b Use of high contrast between text and background color  |2 onix 
341 0 |b Next / Previous structural navigation  |2 onix 
341 0 |b All non-decorative content supports reading without sight  |2 onix 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 15536 
505 0 |a  -- Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set. -- Graceful coloring is computationally hard. -- Parameterized Complexity of Coupon Coloring of Graphs. -- Spectra of eccentricity matrices of product of graphs. -- Almost Empty Monochromatic Polygons in Planar Point Sets. -- On the parameterized Complexity of Odd Coloring. -- On full-separating sets in graphs. -- Polynomial time algorithms for Hop domination. -- Charging Station Placement for Limited Energy Robots. -- Multipacking in Euclidean Plane. -- Partial Domination in Some Geometric Intersection Graphs. -- Generalized Lettericity of Graphs. -- Polynomial-time algorithms for PATH COVER on trees and graphs of bounded treewidth. -- Fast FPT Algorithms for Grundy Number on Dense Graphs. -- On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis. -- Algorithms and hardness results for the (3,1)-cover problem. -- Extension Perfect Roman Domination. -- A sub-quadratic algorithm for the minsum one sink location problem on balanced binary tree networks. -- Two Step Graph Protection Game. -- Bipartite Domination in Graphs: Complexity and Algorithms. -- Packing sets of paths, stars and triangles: tractability and approximability. -- Structural Parameterization of Minus Domination. -- An algebraic characterization of strong graphs. -- There are finitely many uniformly most reliable graphs of corank 5. -- Helly Number, Radon Number and Rank in $\Delta$-Convexity on Graphs. -- Forbidden induced subgraphs in iterative higher order line graphs. -- Total Domination and Open Packing in Two Subclasses of Triangle-free Graphs. -- The MASEMPR problem and its applications in logistics. -- Broadcast Graph Is NP-complete. -- Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs. 
520 |a This book constitutes the refereed proceedings of the 11th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2025, held in Coimbatore, India, during February 13–15, 2025. The 30 full papers included in this book were carefully reviewed and selected from 89 submissions.The conference had papers in algorithms and complexity, discrete applied mathematics, computational geometry, graph theory, graph colouring, graph partition, and domination in graphs. 
532 8 |a Accessibility summary: This PDF does not fully comply with PDF/UA standards, but does feature limited screen reader support, described non-text content (images, graphs), bookmarks for easy navigation and searchable, selectable text. Users of assistive technologies may experience difficulty navigating or interpreting content in this document. We recognize the importance of accessibility, and we welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us at accessibilitysupport@springernature.com. 
532 8 |a No reading system accessibility options actively disabled 
532 8 |a Publisher contact for further accessibility information: accessibilitysupport@springernature.com 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Image processing  |x Digital techniques. 
650 0 |a Computer vision. 
650 1 4 |a Mathematics of Computing. 
650 2 4 |a Computer Imaging, Vision, Pattern Recognition and Graphics. 
700 1 |a Gaur, Daya.  |e editor.  |0 (orcid)0000-0001-6876-6000  |1 https://orcid.org/0000-0001-6876-6000  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Mathew, Rogers.  |e editor.  |0 (orcid)0000-0003-4536-1136  |1 https://orcid.org/0000-0003-4536-1136  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783031834370 
776 0 8 |i Printed edition:  |z 9783031834394 
830 0 |a Lecture Notes in Computer Science,  |x 1611-3349 ;  |v 15536 
856 4 0 |u https://doi.org/10.1007/978-3-031-83438-7 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-SXPS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-238 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710) 
950 |a Springer Nature Proceedings Computer Science (SpringerNature-85344) 
950 |a Focus Bundle Foundational Computer Science (SpringerNature-85408)