E-grāmata: Frontiers of Algorithmics: 17th International Joint Conference, IJTCS-FAW 2023 Macau, China, August 14-18, 2023 Proceedings

Understanding the Relationship Between Core Constraints
and Core-Selecting Payment Rules in Combinatorial Auctions.- An Improved
Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack
Maximization.- Generalized Sorting with Predictions Revisited.- Eliciting
Truthful Reports with Partial Signals in Repeated Games.- On the NP-hardness
of two scheduling problems under linear constraints.- On the Matching Number
of k-Uniform Connected Hypergraphs with Maximum Degree.- Max-Min Greedy
Matching Problem: Hardness for the Adversary and Fractional
Variant.- Approximate Core Allocations for Edge Cover Games.- Random
Approximation Algorithms for Monotone k-Submodular Function Maximization with
Size Constraints.- Additive Approximation Algorithms for Sliding
Puzzle.- Differential Game Analysis for Cooperation Models in
Automotive Supply Chain under Low-Carbon Emission Reduction
Policies.- Adaptivity Gap for Influence Maximization with Linear
Threshold Model on Trees.- Physically Verifying the First Nonzero Term in a
Sequence: Physical ZKPs for ABC End View and Goishi Hiroi.- Mechanism Design
in Fair Sequencing.- Red-Blue Rectangular Annulus Cover Problem.- Applying
Johnson's Rule in Scheduling Multiple Parallel Two-Stage Flowshops.- The Fair
k-Center with Outliers Problem: FPT and
Polynomial Approximations.- Constrained Graph Searching on Trees.- EFX
Allocations Exist for Binary Valuations.- Maximize Egalitarian Welfare for
Cake Cutting.- Stackelberg Strategies on Epidemic Containment Games.