Algorithmic Aspects in Information and Management

.- Graphs and Networks. .- Detection and Analysis of Cryptocurrency Scams on Twitter. .- Representation of Dominating Set Variants using Dataless Neural Networks. .- Algorithms for the Constrained Assignment Problems with Bounds and Maximum Penalty. .- Enabling Proactive Microservice Placement in Collaborative Edge Computing Network. .- Speeding Up Constrained $k$-Means Through 2-Means. .- Stable Matching with Approval Preferences under Partial Information. .- A polynomial time algorithm to find star chromatic index on bounded treewidth graphs with given maximum degree. .- On the Kalai-Smorodinsky solutions for Bi-objective Spanning Tree Problem. .- Improved approximation algorithms for Patrol-Scheduling with Min-Max Latency using Multiclass Minimum Spanning Forests. .- Time-Sensitive Target Coverage Under Visibility Constraints with UAVs. .- Online bottleneck matching on a star. .- Quantum Annealing and GNN for Solving TSP with QUBO. .- Task Planning for The Multi-center Heterogeneous Vehicle Pickup and Delivery Problem. .- Plane Segmentation for Proportional Division of Resources. .- Fair Division with Weighted and Prioritized Agents. .- The Characterizations and Complexity of Roman {2}-Domination and 2- Domination in Graphs. .- Quantum and Others. .- Quantum Lung Segmentation: QCU-Net Applied to Chest X-ray Images. .- On the Existence of Parameterized Algorithms for the Shortest Common Supersequence and Related Problems. .- Algorithmic Construction of Tessellation Cover to QUBO Formulations. .- Finding Fair and Efficient Allocations of Indivisible Chores. .- An Algebraic Perspective on Tree Imbalance Metrics. .- Towards understanding news plagiarism: theoretical and experimental analysis.