The International Joint Conference on Theoretical Computer Science – Frontier of Algorithmic Wisdom (IJTCS-FAW 2025) will be held on Monday June 30 to Wednesday July 2, 2025, hosted by Sorbonne University, Paris,
France. We aim to provide a platform for advancing theoretical computer science and promoting the exchange of knowledge and ideas. It is the 6th IJTCS and 19th FAW.
IJTCS-FAW 2024 is calling for papers concerning any branch of theoretical computer science, together with focus tracks in Algorithm and Complexity, Algorithmic Game Theory, Automata Theory and Formal Languages, Blockchain, Computational Biology and Bioinformatics, Computational Geometry, Formal Methods and Verification, Graph Theory and Algorithms, Multi-agent Reinforcement Learning, Network Economics, Parallel and Distributed Algorithms, Quantum Computation, Theoretical Aspects of Artificial Intelligence, Theory of Machine Learning.
Conference website: https://ijtcs-faw.github.io/2025/
# Important dates
- Submission deadline: 29 January 2025 (anywhere on earth)
- Notification: 20 March 2025
- Full version: 20 April 2025
- Conference dates: Monday June 30 to Wednesday July 2 (noon)
# Submission
Authors are invited to submit an extended abstract of no more than 12 pages, excluding references and the front page(s) (authors, affiliation, keywords, abstract, ...), presenting original research on the theory of
computer science. Technical details necessary for a proper scientific evaluation of a submission must be included in the 12-page submission or in a clearly labelled appendix, to be consulted at the discretion of program committee members. Authors are encouraged to also make full versions of their submissions freely accessible in an online repository such as ArXiv.
Submissions must be formatted in the [LNCS style](https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines). All submission must be submitted via EasyChair using the following link:
https://easychair.org/conferences/?conf=ijtcsfaw2025
The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series, and will be available for distribution at the conference. The use of pdflatex and
the LNCS style is mandatory: papers that deviate significantly from the required format may be rejected without consideration of merit. No prior publication and no simultaneous submission to other conferences are allowed.
Papers will be reviewed according to the following tracks that includes
# Track A: the 19th Conference on Frontiers of Algorithmic Wisdom
This track focuses on current trends of research on algorithms, discrete
structures, and their applications. Typical but not exclusive topics of
interest are:
- Algorithms and data structures
- Approximation algorithms and online algorithms
- Bioinformatics
- Combinatorial optimization
- Combinatorics and discrete structures related to algorithms and complexity
- Complexity theory
- Computational Geometry
- Graph algorithms and theory
- Internet algorithms and protocols
- Large graph algorithms and social network analysis
- Learning based algorithms
- Optimization algorithms in economic and operations research
- Parameterized algorithms
# Track B: Block-chain, distributed computing
This track focuses on original studies on blockchains, cryptocurrencies
and distributed financial markets. Papers may report the most recent
developments on the theory, design, implementation, and analysis of
blockchain infrastructure, economics, security, performance,
interoperability, and other topics related to blockchains and
distributed ledgers at large. Typical but not exclusive topics of
interest are:
- Consensus protocols and scalability
- Smart contracts: design, analysis, security, attacks
- Distributed storage
- Automated market makers and exchanges
- Mechanism design for blockchains
- Equilibrium and game theoretic analysis for blockchains
- Transaction fees and tokenomics
- Network formation games, network structure and performance studies
- Mean field games, stochastic games, evolutionary games in blockchains
- Financial markets
- Information elicitation and oracles
- Token bridges and cross-chain solutions
- Security on blockchains: threat models, attacks, and solutions
- Privacy and anonymity, privacy-oriented computation
- Quantum-resilient cryptography and its applications in blockchains and
financial markets
# Track C: Game theory, algorithmic game theory, machine learning,
electronic commerce
Typical but not exclusive topics of interest are:
- Algorithmic Mechanism Design
- Auction Design and Analysis
- Complexity Classes in Game Theory
- Computational Aspects of Equilibria
- Computational Aspects of Fixed-Point Theorems
- Computational Social Choice
- Computing with Incentives
- Cost-Sharing Algorithms and Analysis
- Decision Theory, and Pricing
- Economic Aspects of Distributed Computing
- Efficiency of Equilibria and Price of Anarchy
- Graph-Theoretic Aspects of Social Networks
- Internet Economics and Computational Advertising
- Repeated Games and Convergence of Dynamics
- Reputation, Recommendation, and Trust Systems
- Solution Concepts in Game Theory
# Committees
- Conference Chair
- John E. Hopcroft, Cornell University
- General Chair
- Li Hao, LISN University Paris Saclay
- Program Committee Chairs
- Christoph Dürr, LIP6 Sorbonne Univeristy
- Minming Li, City University of Hong Kong
- Xiaoming Sun, Chinese Academy of Sciences
- Track A chair: the 19th Conference on Frontiers of Algorithmic Wisdom
- Thomas Erlebach, Durham University
- Track B chairs: block-chain, distributed computing
- Vianney Perchet, ENSAE Paris
- Johanne Cohen, LISN University Paris Saclay
- Yukun Cheng, Jiangnan University
- Track C chair: game theory, algorithmic game theory, machine learning, electronic commerce
- Maria Potob-Butucaru, Sorbonne Univeristy
- Local Organization
- Evripidis Bampis
- Vincent Chau
- Christoph Dürr
# Special Issue
After the conference, selected papers will be invited to special issues in: Theoretical Computer Science, Journal of Combinatorial Optimization, and Theory of Computing Systems.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
