Algorithms and Discrete Applied Mathematics 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings /
This book constitutes the proceedings of the 7th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2021, which was held in Rupnagar, India, during February 11-13, 2021. The 39 papers presented in this volume were carefully reviewed and selected from 82 submissions. The...
| Corporate Author: | |
|---|---|
| Other Authors: | , |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2021.
|
| Edition: | 1st ed. 2021. |
| Series: | Theoretical Computer Science and General Issues ;
12601 |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-3-030-67899-9 |
Table of Contents:
- Approximation Algorithms
- Online bin packing with overload cost
- Scheduling Trains with Small Stretch on a Unidirectional Line
- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs
- Approximation Algorithms for Orthogonal Line Centers
- Semitotal Domination on AT-free Graphs and Circle Graphs
- Burning Grids and Intervals
- Parameterized Algorithms
- On Parameterized Complexity of Liquid Democracy
- Acyclic coloring parameterized by directed clique-width. - On Structural Parameterizations of Load Coloring
- One-Sided Discrete Terrain Guarding and Chordal Graphs
- Parameterized Complexity of Locally Minimal Defensive Alliances
- Computational Geometry
- New variants of Perfect Non-crossing Matchings
- Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data
- A Worst-case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes
- On the Intersections of Non-homotopic Loops
- Graph Theory
- On cd-coloring of trees and co-bipartite graphs
- Cut Vertex Transit Functions of Hypergraphs
- Lexicographic Product of Digraphs and Related Boundary-Type Sets
- The Connected Domination Number of Grids
- On degree sequences and eccentricities in pseudoline arrangement graphs. - Cops and Robber on Butterflies and Solid Grids
- b-Coloring of Some Powers of Hypercubes
- Chromatic Bounds for the Subclasses of $pK_2$ -Free Graphs
- Axiomatic characterization of the median function of a block graph
- On Coupon Coloring of Cartesian Product of Some Graphs
- On the Connectivity and the Diameter of Betweenness-Uniform Graphs. -Combinatorics and Algorithms
- On algorithms to find p-ordering
- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem
- Algorithmic analysis of priority-based bin packing
- Recursive methods for some problems in coding and random permutations
- Achieving positive rates with predetermined dictionaries
- Characterization of Dense Patterns Having Distinct Squares
- Graph Algorithms
- Failure and communication in a synchronized multi-drone system
- Memory Optimal Dispersion by Anonymous Mobile Robots
- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. -Template-driven Rainbow Coloring of Proper Interval Graphs
- Minimum Consistent Subset of Simple Graph Classes. - Computational Complexity
- Balanced Connected Graph Partition
- Hardness Results of Global Roman Domination in Graphs. .