Intro
Preface
Organization
Abstracts of Invited Talks
Coupon Allocation in Social Market: Robust and Machine Learning
Discrepancy Theory in Combinatorics, Geometry and Computation
Learning Graphs with Topology Properties
Bamboo Garden Trimming Problem
Contents
Algorithms
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs
1 Introduction
1.1 Pseudorandom Generators for Space-Bounded Computation
1.2 Permutation Branching Programs
1.3 Our Results
1.4 Techniques
References

All-to-All Broadcast in Dragonfly Networks
1 Introduction
2 Preliminaries
3 All-to-All Broadcast Using One-to-All Broadcast Schemes
4 The Proposed All-to-All Broadcast Algorithm A2A
5 Conclusions
References
An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences
1 Introduction
2 The Proposed Algorithm
2.1 Assumptions
2.2 Algorithm Overview
2.3 Detailed Description
2.4 Example
3 The Analysis
3.1 Correctness
3.2 Complexity
4 Conclusion and Discussion
References

On Singleton Congestion Games with Resilience Against Collusion
1 Introduction
2 The Model and the Preliminaries
3 The Main Result
References
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
1 Introduction
1.1 New Results
2 A Greedy Generation for Tn
3 An O(1)-Amortized Time Pivot Gray Code Generation for Tn
3.1 Ranking and Unranking
4 Conclusion
References
Approximation Algorithms
General Max-Min Fair Allocation
1 Introduction
2 Every Resource Has a Positive Utility for Every Player

3 Some Resources Have Zero Utility for Some Players
3.1 Resources and Over-Estimation
3.2 Fat Edges and Thin Edges
3.3 Overview of the Algorithm
3.4 Layers of Addable and Blocking Edges
3.5 The Local Search Step
3.6 Analysis
4 Conclusion
References
On the Approximation Hardness of Geodetic Set and Its Variants
1 Introduction
2 Notations
3 Hardness to Find a Geodesic Assignation
4 Approximation
5 Reduction from Set Cover
5.1 On General Case
5.2 On Subcubic Bipartite Graphs
6 Non-approximability

6.1 Strong Geodetic Set and Strong Edge Geodetic Set
6.2 Geodetic Set and Edge Geodetic Set
7 Strong Geodetic Number on Complete Multipartite Graphs
8 Conclusion
References
Approximate Distance Oracles with Improved Stretch for Sparse Graphs
1 Introduction
1.1 Related Work
1.2 Paper Organization
2 Preliminaries and Previous Work
2.1 The Distance Oracle of Thorup and Zwick
2.2 A Standard Variant of the Distance Oracle of Thorup and Zwick
3 Distance Oracles with Improved Stretch
4 A Refined Stretch Analysis of Thorup-Zwick Distance Oracle