Algorithmic Foundations for Social Advancement

Shin-ichi Minato is a professor in the Graduate School of Informatics at Kyoto University, Kyoto, Japan. He is the leader of the research project, Algorithmic Foundations for Social Advancement.Takeaki Uno is a professor in the Principles of Informatics Research Division at National Institute of Informatics, Tokyo, Japan.Norihito Yasuda is a senior research engineer in the Innovative Communication Laboratory at NTT Communication Science Laboratories, Kyoto, Japan.Takashi Horiyama is a professor in the Graduate School of Information Science and Technology at Hokkaido University, Sapporo, Japan.Ken-ichi Kawarabayashi is a professor in the Principles of Informatics Research Division at National Institute of Informatics, Tokyo, Japan.Shigeru Yamashita is a professor in the Graduate School of Information Science and Engineering at Ritsumeikan University, Osaka, Japan.Hirotaka Ono is a professor in the Graduate School of Informatics at Nagoya University, Nagoya, Japan.

• Overview of Algorithmic Foundations for Social Advancement (AFSA) Project.- Motivating Problems and Algorithmic Solutions.- ZDDs and Frontier-Based Search for Solving Combinatorial Problems.- Graphillion: Combinatorial Solver for Graph Problems.- Interdisciplinary Discussions for Future Computer Science.- Methodologies for Fruitful Interdisciplinary Discussions.- Catalog of Problems for Future Computer Science.- Continuous Interval Hamming Distance-based Measures.- Optimization Problem Formulations for Overcoming Difficulties in Real-world Projects.- Analysis of 20th French Philosophers Network.- Social Media Analysis based on Humanities Reading Technique: Developing a Method for Measuring Slanderous Narratives Online.- Reframing Problems: Analyzing the Design of Mixed Reality Tools Through the Lens of Fictionality.- Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions.- Parallel Redundancy Removal in lrslib with Application to Projections.- Bridging Algorithmic Foundations with Information Security and Privacy: Set-k-Multicover Problem and Homomorphic Secret Sharing.- A Survey: SWAP Test and Its Applications to Quantum Complexity Theory.- Recent developments in quantum distributed algorithms.- On the simulation and verification of noisy quantum circuits.- Succinct Representations of Graphs.- A Satisfiability Algorithm for Depth Two Circuits with a Sub-Quadratic Number of Symmetric and Threshold Gates.- Soft margin boosting as Frank-Wolfe Algorithms.- Cost Graph Colorings.- Perpetual scheduling under frequency constraints.