Muutke küpsiste eelistusi

Algorithms and Discrete Applied Mathematics: 9th International Conference, CALDAM 2023, Gandhinagar, India, February 911, 2023, Proceedings 1st ed. 2023 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 462 pages, kõrgus x laius: 235x155 mm, kaal: 730 g, 29 Illustrations, color; 62 Illustrations, black and white; XVII, 462 p. 91 illus., 29 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13947
  • Ilmumisaeg: 03-Feb-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031252101
  • ISBN-13: 9783031252105
Teised raamatud teemal:
  • Pehme köide
  • Hind: 81,12 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 95,44 €
  • 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: 9th International Conference, CALDAM 2023, Gandhinagar, India, February 911, 2023, Proceedings 1st ed. 2023Suurem pilt
  • Formaat: Paperback / softback, 462 pages, kõrgus x laius: 235x155 mm, kaal: 730 g, 29 Illustrations, color; 62 Illustrations, black and white; XVII, 462 p. 91 illus., 29 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13947
  • Ilmumisaeg: 03-Feb-2023
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031252101
  • ISBN-13: 9783031252105
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031252105.html
Märksõnad:
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.

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 Knödel 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.