Algorithms and Discrete Applied Mathematics

11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings

AvDaya Gaur,Rogers Mathew

Häftad, Engelska, 2025

Del 15536 i serien Lecture Notes in Computer Science

818 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2025-02-05
Mått:155 x 235 x 22 mm
Vikt:593 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:370
Förlag:Springer International Publishing AG
ISBN:9783031834370

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

.- 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.