default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. WALCOM 2018: Dhaka, Bangladesh
- M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara:
WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings. Lecture Notes in Computer Science 10755, Springer 2018, ISBN 978-3-319-75171-9 - Shin-Ichi Nakano:
A Simple Algorithm for r-gatherings on the Line. 1-7 - Kazuaki Yamazaki, Toshiki Saitoh
, Masashi Kiyomi, Ryuhei Uehara:
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs. 8-19 - Tatsuya Sasaki, Bateh Mathias Agbor, Shingo Masuda, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone:
Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph. 20-31 - Toshihiro Fujito, Kei Kimura, Yuki Mizuno:
Approximating Partially Bounded Degree Deletion on Directed Graphs. 32-43 - Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon:
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. 44-55 - Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh:
Minimum-Width Square Annulus Intersecting Polygons. 56-67 - Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Two New Schemes in the Bitprobe Model. 68-79 - Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane:
Faster Network Algorithms Based on Graph Decomposition. 80-92 - Tong Qin, Osamu Watanabe:
An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem. 93-105 - Suthee Ruangwises, Toshiya Itoh:
Random Popular Matchings with Incomplete Preference Lists. 106-118 - Hanyu Gu, Julia Memar, Yakov Zinder:
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach. 119-131 - Junhee Cho, Sewon Park, Martin Ziegler:
Computing Periods ... . 132-143 - Marc Demange, Martin Olsen:
A Note on Online Colouring Problems in Overlap Graphs and Their Complements. 144-155 - Abu Reyan Ahmed, Md. Saidur Rahman, Stephen G. Kobourov:
Online Facility Assignment. 156-168 - Aisha Aljohani, Pavan Poudel, Gokarna Sharma:
Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement. 169-182 - Md. Aashikur Rahman Azim, Mohimenul Kabir, M. Sohel Rahman:
A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison. 183-194 - Takahiro Fujita, Kohei Hatano, Eiji Takimoto:
Boosting over Non-deterministic ZDDs. 195-206 - Suri Dipannita Sayeed, M. Sohel Rahman, Atif Rahman:
On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract). 207-215 - Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai:
FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models. 216-227 - Jayesh Choudhari, I. Vinod Reddy:
On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity. 228-239 - Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden:
Complexity of the Maximum k-Path Vertex Cover Problem. 240-251 - Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy:
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. 252-264
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-28 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
