On the Complexity of Minimizing the Total Calibration Cost.- On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. - The complexity of finding (approximate sized) distance d dominating sets in tournaments.- On Computational Aspects of Greedy Partitioning of Graphs.- Maximum Edge Bicliques in Tree Convex Bipartite Graphs.- Complete Submodularity Characterization in the Comparative Independent Cascade Model.- A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate.- Designing and Implementing Algorithms for the Closest String Problem.- The Broken-Triangle Property with Adjoint Values.- Online Knapsack Problem under Concave Functions.- Fluctuated Fitting under the L1-metric.- Optimal Partitioning Which Maximizes the Weighted Sum of Products.- Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity.- Online Strategies for Evacuating from a Convex Region in the Plane.- A further analysis of the dynamic dominant resource fairness mechanism.- A 42k Kernel for the Complementary Maximal Strip Recovery Problem.- On-line Scheduling with a Monotonous Subsequence Constraint.- A 1.4-Approximation Algorithm For Two-sided Scaffold Filling.- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters.- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order.- Geodectic Contraction Games on Trees.- On Approximation Algorithms for Two-Stage Scheduling Problems.- A New Lower Bound for Positive Zero Forcing.- Phase Transition for Maximum Not-All-Equal Satisfiability.