Frontiers of Algorithmics: 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings

Author:   Vincent Chau ,  Christoph Dürr ,  Minming Li ,  Pinyan Lu
Publisher:   Springer Nature Switzerland AG
Volume:   15828
ISBN:  

9789819683116


Pages:   416
Publication Date:   30 June 2025
Format:   Paperback
Availability:   Not yet available   Availability explained
This item is yet to be released. You can pre-order this item and we will dispatch it to you upon its release.

Our Price $197.97 Quantity:  
Add to Cart

Share |

Frontiers of Algorithmics: 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings


Add your own review!

Overview

This book LNCS15828 constitutes the refereed proceedings of the 19th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2025), consisting of the 19th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 6th International Joint Conference on Theoretical Computer Science (IJTCS), held in Paris, France, during June 30–July 2, 2025. The 28 full papers and 2 short papers were carefully reviewed and selected from 63 submissions. The proceedings focuses on Frontiers of Algorithmic Wisdom; Block-chain, Distributed Computing, Multi-Agents; Game Theory, Algorithmic Game Theory, Machine Learning, Electronic Commerce. 

Full Product Details

Author:   Vincent Chau ,  Christoph Dürr ,  Minming Li ,  Pinyan Lu
Publisher:   Springer Nature Switzerland AG
Imprint:   Springer Nature Switzerland AG
Volume:   15828
ISBN:  

9789819683116


ISBN 10:   9819683114
Pages:   416
Publication Date:   30 June 2025
Audience:   Professional and scholarly ,  College/higher education ,  Professional & Vocational ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   Not yet available   Availability explained
This item is yet to be released. You can pre-order this item and we will dispatch it to you upon its release.

Table of Contents

Domination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter.- $k$-Universality of Regular Languages Revisited.- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions.- Complexity Classes for Online Problems with and without Predictions.- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model.- Mixed Graph Covering with Target Constraints.- Multiplication of 0-1 matrices via clustering.- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances.- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem.- Approximation Algorithms for Individual Preference Facility Location.- The online power cover problem on a line.- The Subinterval Cover Problem.- Oblivious Robots Under Round Robin: Gathering on Rings.- Finding a Set of Long Common Substrings with Repeats from m Input Strings.- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties.- Less-excludable Mechanism for DAOs in Public Good Auctions.- TBDS: Transaction-Based Data Sharing.- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents.- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer.- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources.- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms.- Minimizing Blocking Agents for Stable Matching with Partial Approval Information.- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives.- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games.- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints.- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems.- Large-Scale Contextual Market Equilibrium Computation through Deep Learning.- Fair Value Distribution in Cooperative Committee Election.- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs.- Mechanism Design for Auctions with Externalities on Budgets.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

RGJUNE2025

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List