1. Takeshi Tokuyama, Naoki Fujihara.
   Optimal Recipe of Witch's Potion: Sorting Columns of a Matrix to Optimize Nondecreasing Subsequences of Rows
2. Tatsuya Gima, Tesshu Hanaka, Kohei Noro, Hirotaka Ono, Yota Otachi.
   On a spectral lower bound of treewidth
3. Ryota Murai, Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Hirotaka Ono, Yota Otachi.
   Structural Parameterizations of Vertex Integrity
4. Nicolás Honorato Droguett, Kazuhiro Kurita, Tesshu Hanaka, Yota Otachi, Hirotaka Ono.
   Collecting Balls on a Line by Robots with Limited Energy
5. Yuki Tokuni, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama.
   Faster Algorithms for Evacuation Problems in Networks with the Single Sink of Small Degree and Uniformly Capacitated Edges
6. Robert Benkoczi, Yuya Higashikawa, Risa Ishikawa, Naoki Katoh.
   Mixed Evacuation Problem on Path Networks
7. Hiroki Arimura, Tatsuya Gima, Yasuaki Kobayashi, Hiroomi Nochide, Yota Otachi.
   Minimum Consistent Subset for Trees Revisited
8. Ryu Suzuki, Yasuaki Kobayashi, Kazuhisa Seto, Takashi Horiyama.
   NP-completeness of Computing Pre-assignments to Uniquify Vertex Cover for Bipartite Graphs
9. Yuya Higashikawa, Junichi Teruyama, Yuki Tokuni, Azusa Yamamoto.
   Efficient Algorithms for Quickest Transshipment Problems in Grid Networks Motivated by Tsunami Evacuation
10. Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni.
    Sink Location Problems in Dynamic Flow Grid Networks
11. Chuzo Iwamoto, Ryo Takaishi.
    Yajisan-Kazusan and Stained Glass are NP-complete
12. Hitomi Hayashi, Yuya Higashikawa, Naoki Katoh.
    Properties of Euclidean Minimum Weight (k,l)-Tight Graphs
13. Chaeyoon Chung, Taehoon Ahn, Sang Won Bae, Hee-Kap Ahn.
    Parallel Line Centers with Guaranteed Separation
14. Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn.
    Inscribing or Circumscribing a Histogon to a Convex Polygon
15. Mook Kwon Jung, Sang Duk Yoon, Hee-Kap Ahn, Takeshi Tokuyama.
    Universal convex covering problems under affine dihedral group actions
16. Taekang Eom, Hee-Kap Ahn.
    A linear-time algorithm for the center problem in weighted cycle graphs
17. Jongmin Choi, Jaegun Lee, Hee-Kap Ahn.
    Efficient k-center algorithms for planar points in convex position
18. Hwi Kim, Jaegun Lee, Hee-Kap Ahn.
    Uniformly Monotone Partitioning of Polygons
19. Seungbum Jo, Geunho Kim.
    Space-efficient data structure for next/previous larger/smaller value queries
20. Hiroshi Hirai, Ryosuke Sato.
    Polyhedral Clinching Auctions for Indivisible Goods
21. Tetsuya Araki, Shin-Ichi Nakano.
    Locate hunters far away
22. Fugen Hagihara, Akitoshi Kawamura.
    The ultimate signs of second-order holonomic sequences
23. Byeonguk Kang, Jongmin Choi, Hee-Kap Ahn.
    Intersecting Disks using Two Congruent Disks
24. Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti.
    Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs
25. Michal Konecny, Sewon Park, Holger Thies.
    Extracting sound computation over hyperspaces
26. Seonho Lee, Kunsoo Park.
    An efficient algorithm for diversified top-k subgraph querying
27. Yeunjun Lee, Kunsoo Park.
    Computation of Minimum Image Based Support via Graph Automorphism
28. Geonmo Gu, Yehyun Nam, Kunsoo Park, Zvi Galil, Giuseppe Italiano, Wook-Shin Han.
    Fast Algorithm for Finding Isomorphic Graphs
29. Soh Kumabe, Yuichi Yoshida.
    Lipschitz Continuous Graph Algorithms
30. Donghoon Shin, Sunghee Choi.
    Improved algorithms for the Steiner tree problem with the minimum number of Steiner points and bounded edge length
31. Da-Jung Cho, Hwee Kim.
    Side-Aware DNA Origami Words
32. Chanyang Seo, Taehoon Ahn, Hee-Kap Ahn.
    Shortest Paths connecting Line Segments in the Presence of Rectangular Obstacles
33. Akimasa Kawasaka, Hiroshi Fujiwara, Ayana Sasada, Hiroaki Yamamoto.
    Online Removable Knapsack Problems with Generalized Item Removal Rules