> Top >> Program (this page)
WAAC 2018
August 26–27, 2018
August 26–27, 2018
Program
Sunday, August 26
| 9:15 | Registraion opens |
| Session 1 | |
| 9:40-10:00 |
A representation of all maximal common subsequences
Yoshifumi Sakai |
| 10:00-10:20 |
δ-approximate Periods and γ-approximate Periods of Strings
Youngho Kim and Jeong Seop Sim |
| 10:20-10:40 |
Relative Edit-Distance Problem of Input-Driven Pushdown Languages
Hyunjoon Cheon, Yo-Sub Han and Sang-Ki Ko |
| 10:40-10:55 | Break |
| Session 2 | |
| 10:55-11:15 |
On Computational Complexity of Pipe Puzzles
Takumu Shriayama, Yota Otachi and Ryuhei Uehara |
| 11:15-11:35 |
A Framework for In-place Graph Algorithms
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman and Srinivasa Rao Satti |
| 11:35-11:55 |
Computability of Haar Averages
Dongseong Seon and Martin Ziegler |
| 11:55-13:40 | Lunch (on your own) |
| Invited Talk | |
| 13:40-14:40 |
Algorithmic Foundation of Numerics
Martin Ziegler |
| 14:40-14:55 | Break |
| Session 3 | |
| 14:55-15:15 |
On the gap between the rank and the nonnegative rank of a nonnegative matrix
Naoki Kato and Shuji Kijima |
| 15:15-15:35 |
Towards Tensor Calculus in Exact Real Computation
Joonhyung Shin, Namjo Ahn, Seungwoo Lee, Chansu Park and Martin Ziegler |
| 15:35-15:55 |
Generalizing the Signed-Digit Representation
Donghyun Lim, Svetlana Selivanova and Martin Ziegler |
| 15:55-16:10 | Break |
| Session 4 | |
| 16:10-16:30 |
Algorithms for Separable Convex Resource Allocation Problem with L1-distance Constraint
Norito Minamikawa and Akiyoshi Shioura |
| 16:30-16:50 |
A BDD Approach to Counting Problems in Graphic Arrangements
Farley Soares Oliveira, Hidefumi Hiraishi and Hiroshi Imai |
| 16:50-17:10 |
On the Unfoldings of Hypecubes
Takashi Horiyama |
| 18:00-20:30 | Banquet (Hotel Centraza Hakata, second floor) |
Monday, August 27
| Session 5 | |
| 9:20-9:40 |
Fast and Exact Computing of Network Reliability and Influence Spread in Graphs with Bounded Treewidth
Kohei Morita and Takuto Shigemura |
| 9:40-10:00 |
Parameterized Algorithm to Compute the Partition Function of Potts Model with Branch Decomposition
Naosuke Shindo, Hidefumi Hiraishi and Imai Hiroshi |
| 10:00-10:20 |
Shortest Reconfiguration Sequence for Sliding Tokens on Spiders
Duc A. Hoang, Amanj Khorramian and Ryuhei Uehara |
| 10:20-10:35 | Break |
| Session 6 | |
| 10:35-10:55 |
Acute Constraints in Straight-Line Drawings of Planar Graphs
Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi and Peter Eades |
| 10:55-11:15 |
Minimum-Width Square Annulus Intersecting Polygons
Hee-Kap Ahn, Taehoon Ahn, Jongmin Choi, Mincheol Kim and Eunjin Oh |
| 11:15-11:35 |
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases
Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jongmin Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin and Sang Duk Yoon |
| 11:35-11:55 |
Polygon Queries for Convex Hulls of Points
Eunjin Oh and Hee-Kap Ahn |
| 11:55-13:40 | Lunch (on your own) |
| Session 7 | |
| 13:40-14:00 |
λ Group Strategy Proof Mechanisms for the Obnoxious Facility Game in Star Networks
Yuhei Fukui, Aleksandar Shurbevski and Hiroshi Nagamochi |
| 14:00-14:20 |
Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games
Yuto Ushioda and Tomomi Matsui |
| 14:20-14:40 |
Swap Games by Pessimistic Players with Local Knowledge
Shotaro Yoshimura and Yukiko Yamauchi |
| 14:40-14:55 | Break |
| Session 8 | |
| 14:55-15:15 |
Approximate Query Processing over Static Sets and Sliding Windows
Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti and Shubham Ugare |
| 15:15-15:35 |
A Simpler FM-index for Parameterized String Matching
Sung-Hwan Kim and Hwan-Gue Cho |
| 15:35-15:55 |
Improved Pattern-Scan-Order Algorithms for String Matching
Cheol Ryu and Kunsoo Park |
| 15:55-16:15 |
A Space-Efficient Hashing-Based Order-Preserving Multiple Pattern Matching Algorithm
Jeonghoon Park, Youngho Kim and Jeong Seop Sim |