Algorithms and Discrete Applied Mathematics

Algorithms for Problems on Maximum Density Segment.- Distance spectral radius of k-partitioned transmission regular graphs.- Color Spanning Objects: Algorithms and Hardness Results.- On Hamiltonian colorings of trees.- On the Complexity Landscape of the Domination Chain.- On the probability of being synchronizable.- Linear-Time Fitting of a k-Step Function.- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications.- Axiomatic Characterization of Claw and Paw-free Graphs Using Graph Transit Functions.- Linear time algorithms for Euclidean 1-center in higher dimensions with non-linear convex constraints.- Lower Bounds on the Dilation of Plane Spanners.- Lattice Spanners of Low Degree.- AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables.- Approximation Algorithms for Cumulative VRP with Stochastic Demands.- Some Distance Antimagic Labelled Graphs.- A New Construction of Broadcast Graphs.- Improved Algorithm for Maximum Independent Set on Unit Disk Graph.- Independent Sets in Classes Related to Chair-free Graphs.- Cyclic Codes over Galois Rings.- On The Center Sets of Some Graph Classes.- On Irreducible No-hole L(2,1)-labelings of Hypercubes and Triangular Lattices.- Medians of permutations : building constraints.- b-Disjunctive total domination in graphs: Algorithm and hardness results.- m-Gracefulness of Graphs.- Domination Parameters in Hypertree.- Complexity of Steiner Tree in Split Graphs - Dichotomy Results.- Relative clique number of planar signed graphs.- The cd-coloring of graphs.- Characterization of H-graphs.- On the Power Domination Number of Graph Products.