Muutke küpsiste eelistusi

Algorithms and Discrete Applied Mathematics: 11th International Conference, CALDAM 2025, Coimbatore, India, February 1315, 2025, Proceedings [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 370 pages, kõrgus x laius: 235x155 mm, 16 Illustrations, color; 54 Illustrations, black and white; XXI, 370 p. 70 illus., 16 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15536
  • Ilmumisaeg: 05-Feb-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031834372
  • ISBN-13: 9783031834370
Teised raamatud teemal:
  • Pehme köide
  • Hind: 63,52 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 74,73 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Algorithms and Discrete Applied Mathematics: 11th International Conference, CALDAM 2025, Coimbatore, India, February 1315, 2025, ProceedingsSuurem pilt
  • Formaat: Paperback / softback, 370 pages, kõrgus x laius: 235x155 mm, 16 Illustrations, color; 54 Illustrations, black and white; XXI, 370 p. 70 illus., 16 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15536
  • Ilmumisaeg: 05-Feb-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031834372
  • ISBN-13: 9783031834370
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031834370.html
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 1315, 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.
.- 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.