Computing and Combinatorics

Constructing Independent Spanning Trees on Bubble-Sort Networks.- Exact Algorithms for Finding Partial Edge-Disjoint Paths.- A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications.- Contextual Dependent Click Bandit Algorithm for Web Recommendation.- LP-based pivoting algorithm for higher-order correlation clustering.- Approximation algorithms for a two-phase knapsack problem.- More Routes for Evacuation.- Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem.- Approximating Global Optimum for Probabilistic Truth Discovery.- Online interval scheduling to maximize total satisfaction.- Properties of Minimal-Perimeter Polyominoes.- Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons.- Polygon Queries for Convex Hulls of Points.- Synergistic Solutions for Merging and Computing Planar Convex Hulls.- Cophenetic Distances: A Near-Linear Time AlgorithmicFramework.- Computing Coverage Kernels Under Restricted Settings.- Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-table Autoreducible Sets.- Approximation algorithms for two-machine ow-shop scheduling with a conflict graph.- On Contact Representations of Directed Planar Graphs.- Computation and Growth of Road Network Dimensions.- Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings.- Directed path-width and directed tree-width of directed co-graphs.- Generalized Graph k-Coloring Games.- On Colorful Bin Packing Games.- Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality.- The Path Set Packing Problem.- Manipulation Strategies for the Rank-Maximal Matching Problem.- Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search.- An FPT Algorithm for Contraction to Cactus.- An approximation framework for bounded facility location problems.- Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to