WALCOM B

23 papers

YearTitle / Authors
2018A Note on Online Colouring Problems in Overlap Graphs and Their Complements.
Marc Demange, Martin Olsen
2018A Simple Algorithm for r-gatherings on the Line.
Shin-Ichi Nakano
2018A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison.
Md. Aashikur Rahman Azim, Mohimenul Kabir, M. Sohel Rahman
2018An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem.
Tong Qin, Osamu Watanabe
2018Approximating Partially Bounded Degree Deletion on Directed Graphs.
Toshihiro Fujito, Kei Kimura, Yuki Mizuno
2018Boosting over Non-deterministic ZDDs.
Takahiro Fujita, Kohei Hatano, Eiji Takimoto
2018Complexity of the Maximum k-Path Vertex Cover Problem.
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
2018Computing Periods ... .
Junhee Cho, Sewon Park, Martin Ziegler
2018Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs.
Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara
2018FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models.
Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai
2018Faster Network Algorithms Based on Graph Decomposition.
Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane
2018Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement.
Aisha Aljohani, Pavan Poudel, Gokarna Sharma
2018Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases.
Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon
2018Minimum-Width Square Annulus Intersecting Polygons.
Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh
2018On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract).
Suri Dipannita Sayeed, M. Sohel Rahman, Atif Rahman
2018On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity.
Jayesh Choudhari, I. Vinod Reddy
2018On the Parallel Parameterized Complexity of the Graph Isomorphism Problem.
Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
2018Online Facility Assignment.
Abu Reyan Ahmed, Md. Saidur Rahman, Stephen G. Kobourov
2018Random Popular Matchings with Incomplete Preference Lists.
Suthee Ruangwises, Toshiya Itoh
2018Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach.
Hanyu Gu, Julia Memar, Yakov Zinder
2018Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph.
Tatsuya Sasaki, Bateh Mathias Agbor, Shingo Masuda, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone
2018Two New Schemes in the Bitprobe Model.
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh
2018WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings
M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara