Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jongmin Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin and Sang Duk Yoon. Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases
Hee-Kap Ahn, Taehoon Ahn, Jongmin Choi, Mincheol Kim and Eunjin Oh. Minimum-Width Square Annulus Intersecting Polygons
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita and Tom C. van der Zanden. Complexity of the Maximum k-Path Vertex Cover Problem
Toshihiro Fujito, Kei Kimura and Yuki Mizuno. Approximating Partially Bounded Degree Deletion on Directed Graphs
Hanyu Gu, Julia Memar and Yakov Zinder. Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach
Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi and Hiroshi Imai. FPT algorithms exploiting carving decomposition for Eulerian orientations and ice-type models
Suri Dipannita Sayeed, M. Sohel Rahman and Atif Hasan Rahman. On Multiple Longest Common Subsequence and Common Motifs with Gaps
Md. Aashikur Rahman Azim, Mohimenul Mahi and M. Sohel Rahman. A simple, fast, filter-based algorithm for circular sequence comparison
Aisha Aljohani, Pavan Poudel and Gokarna Sharma. Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights under One-Axis Agreement
Abu Reyan Ahmed, Md. Saidur Rahman and Stephen Kobourov. Online Facility Assignment
Junhee Cho, Sewon Park and Martin Ziegler. Computing Periods…
Jayesh Choudhari and I. Vinod Reddy. On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity
Takahiro Fujita, Kohei Hatano and Eiji Takimoto. Boosting over non-deterministic ZDDs
Manas Jyoti Kashyop, Tsunehiko Nagayama and Kunihiko Sadakane. Faster Network Algorithms based on Graph Decomposition
Bireswar Das, Murali Krishna Enduri and I. Vinod Reddy. On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
