Algorithms and Discrete Applied Mathematics

¿Algorithms and Complexity.- Consecutive Occurrences with Distance Constraints.- Parameterized Aspects of Distinct Kemeny Rank Aggregation.- Monitoring Edge-geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity.- Distance-2-Dispersion with Termination by a Strong Team.- On Query Complexity Measures and their Relations for Symmetric Functions.- Computational Geometry.- Growth Rate of the Number of Empty Triangles in the Plane.- Geometric Covering Number: Covering Points with Curves.- Improved Algorithms for Minimum-Membership Geometric Set Cover.- Semi-total Domination in Unit Disk Graphs.- Discrete Applied Mathematics.- An Efficient Interior Point Method for Linear Optimization using Modified Newton Method.- Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs.- The Frobenius Problem for the Proth Numbers.- Graph Algorithms.- Eternal Connected VertexCover Problem in Graphs: Complexity and Algorithms.- Impact of Diameter and Convex Ordering for Hamiltonicity and Domination.- On Star Partition of Split Graphs.- Star Covers and Star Partitions of Cographs and Butterfly-free Graphs.- Open Packing in H-free Graphs and Subclasses of Split Graphs.- Graph Theory.- Location-domination Type Problems Under the Mycielski Construction.- On Total Chromatic Number of Complete Multipartite Graphs.- The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability.- Total Coloring of Some Graph Operations.- Star Colouring of Regular Graphs Meets Weaving and Line Graphs.