Gaur / Mathew | Algorithms and Discrete Applied Mathematics | E-Book | sack.de
E-Book

E-Book, Englisch, 370 Seiten

Reihe: Lecture Notes in Computer Science

Gaur / Mathew Algorithms and Discrete Applied Mathematics

11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings
Erscheinungsjahr 2025
ISBN: 978-3-031-83438-7
Verlag: Springer International Publishing
Format: PDF
 Kopierschutz: 1 - PDF Watermark

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

E-Book, Englisch, 370 Seiten

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-031-83438-7
Verlag: Springer International Publishing
Format: PDF
 Kopierschutz: 1 - PDF Watermark

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.

Gaur / Mathew Algorithms and Discrete Applied Mathematics jetzt bestellen!

Zielgruppe

Research

Autoren/Hrsg.

Gaur, Daya
Mathew, Rogers

Weitere Infos & Material

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

Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.