Algorithms and discrete applied mathematics : 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, proceedings / Amitabha Bagchi, Rahul Muthu (eds.).

This book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held in Gandhinagar, India, during February 9-11, 2023. The 32 papers presented in this volume were carefully reviewed and selected from 67 submissions. Th...

Full description

Saved in:
Bibliographic Details
Corporate Author: CALDAM (Conference) Gāndhīnagar, India)
Other Authors: Bagchi, Amitabha (Editor), Muthu, Rahul (Editor)
Format: eBook
Language:English
Published: Cham : Springer, 2023.
Series:Lecture notes in computer science ; 13947.
Subjects:
Online Access:Click for online access

MARC

LEADER 00000cam a2200000 i 4500
001 on1367844684
003 OCoLC
005 20241006213017.0
006 m o d
007 cr cnu---unuuu
008 230201s2023 sz o 101 0 eng d
040 |a GW5XE  |b eng  |e rda  |e pn  |c GW5XE  |d YDX  |d EBLCP  |d UKAHL  |d OCLCQ  |d OCLCF  |d N$T  |d OCLCO  |d WSU  |d OCLCO 
019 |a 1366653099 
020 |a 9783031252112  |q (electronic bk.) 
020 |a 303125211X  |q (electronic bk.) 
020 |z 9783031252105 
020 |z 3031252101 
024 7 |a 10.1007/978-3-031-25211-2  |2 doi 
035 |a (OCoLC)1367844684  |z (OCoLC)1366653099 
050 4 |a QA76.9.A43 
072 7 |a UYAM  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a UYAM  |2 thema 
049 |a HCDD 
111 2 |a CALDAM (Conference)  |n (9th :  |d 2023 :  |c Gāndhīnagar, India) 
245 1 0 |a Algorithms and discrete applied mathematics :  |b 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, proceedings /  |c Amitabha Bagchi, Rahul Muthu (eds.). 
246 3 |a CALDAM 2023 
264 1 |a Cham :  |b Springer,  |c 2023. 
300 |a 1 online resource (460 pages). 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Lecture notes in computer science ;  |v 13947 
505 0 |a Stable Approximation Schemes -- A whirlwind tour of intersection graph enumeration -- Graph modification problems with forbidden minors -- Algorithms & Optimization Efficient reductions and algorithms for Subset Product -- Optimal length cutting plane refutations of integer programs -- Fault-Tolerant Dispersion Resource management in device-to-device communications -- Computational Geometry Algorithms for k-Dispersion for Points in Convex Position in the Plane -- Arbitrary oriented color spanning region for line segments -- Games with a Simple Rectilinear Obstacle in Plane -- Diverse Fair Allocations: Complexity and Algorithms -- Graph Coloring New bounds and constructions for neighbor-locating colorings of graphs -- D K 5-list coloring toroidal 6-regular triangulations in linear time -- On Locally Identifying Coloring of Graphs -- On Structural Parameterizations of Star Coloring -- Reddy Perfectness of G-generalized join of graphs -- Coloring of a superclass of 2K2-free graphs -- The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures -- Graph Connectivity Short cycles dictate dichotomy status of the Steiner tree problem on Bisplit graphs -- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs -- Monitoring edge-geodetic sets in graphs -- Cyclability, Connectivity and Circumference -- Graph Domination On three domination-based identification problems in block graphs -- Graph modification problems with forbidden minors -- Computational Aspects of Double Dominating Sequences in Graph -- Relation between broadcast domination and multipacking numbers on chordal graphs -- Pushing Cops and Robber on Oriented Graphs -- Mind the Gap: Edge Facility Location Problems in Theory and Practice -- Complexity Results on Cosecure Domination in Graphs -- Kusum and Arti Pandey Graph Matching Latin Hexahedra and Related Combinatorial Structures -- Minimum Maximal Acyclic Matching in Proper Interval Graphs -- Graph Partition & Graph Covering Transitivity on subclasses of chordal graphs -- Maximum subgraph problem for 3-regular Knodel graphs and its wirelength -- Covering using Bounded Size Subgraphs -- Axiomatic characterization of the the toll walk function of some graph classes -- Structural Parameterization of Alliance Problems. 
520 |a This book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held in Gandhinagar, India, during February 9-11, 2023. The 32 papers presented in this volume were carefully reviewed and selected from 67 submissions. The papers were organized in topical sections named: algorithms and optimization; computational geometry; game theory; graph coloring; graph connectivity; graph domination; graph matching; graph partition and graph covering. 
500 |a Includes index. 
588 0 |a Print version record. 
650 0 |a Computer algorithms  |v Congresses. 
650 0 |a Computer science  |x Mathematics  |v Congresses. 
650 7 |a Computer algorithms  |2 fast 
650 7 |a Computer science  |x Mathematics  |2 fast 
655 0 |a Electronic books. 
655 7 |a proceedings (reports)  |2 aat 
655 7 |a Conference papers and proceedings  |2 fast 
655 7 |a Conference papers and proceedings.  |2 lcgft 
655 7 |a Actes de congrès.  |2 rvmgf 
700 1 |a Bagchi, Amitabha,  |e editor.  |1 https://isni.org/isni/0000000035860757 
700 1 |a Muthu, Rahul,  |e editor. 
776 0 8 |i Print version:  |a CALDAM (Conference) (9th : 2023 : Gāndhīnagar, India), creator.  |t Algorithms and discrete applied mathematics.  |d Cham : Springer, 2023  |z 9783031252105  |w (OCoLC)1363814027 
830 0 |a Lecture notes in computer science ;  |v 13947. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://link.springer.com/10.1007/978-3-031-25211-2  |y Click for online access 
903 |a SPRING-ALL2023 
994 |a 92  |b HCD