On the Parallel Parameterized Complexity of the Graph Isomorphism Problem (English)
- New search for: Das, Bireswar
- New search for: Enduri, Murali Krishna
- New search for: Reddy, I. Vinod
- New search for: Rahman, M. Sohel
- Further information on Rahman, M. Sohel:
- https://orcid.org/http://orcid.org/0000-0001-9419-6478
- New search for: Sung, Wing-Kin
- New search for: Uehara, Ryuhei
- Further information on Uehara, Ryuhei:
- https://orcid.org/http://orcid.org/0000-0003-0895-3765
- New search for: Das, Bireswar
- New search for: Enduri, Murali Krishna
- New search for: Reddy, I. Vinod
In:
WALCOM: Algorithms and Computation
: 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings
;
Chapter: 22
;
252-264
;
2018
- Article/Chapter (Book) / Electronic Resource
-
Title:On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
-
Additional title:Lect.Notes Computer
-
Contributors:Rahman, M. Sohel ( editor ) / Sung, Wing-Kin ( editor ) / Uehara, Ryuhei ( editor ) / Das, Bireswar ( author ) / Enduri, Murali Krishna ( author ) / Reddy, I. Vinod ( author )
-
Conference:International Workshop on Algorithms and Computation ; 2018 ; Dhaka, Bangladesh
-
Published in:WALCOM: Algorithms and Computation : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings ; Chapter: 22 ; 252-264Lecture Notes in Computer Science ; 10755 ; 252-264
-
Publisher:
- New search for: Springer International Publishing
-
Place of publication:Cham
-
Publication date:2018-01-31
-
Size:13 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
A Simple Algorithm for r-gatherings on the LineNakano, Shin-ichi et al. | 2018
- 2
-
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation GraphsYamazaki, Kazuaki / Saitoh, Toshiki / Kiyomi, Masashi / Uehara, Ryuhei et al. | 2018
- 3
-
Secret Key Amplification from Uniformly Leaked Key Exchange Complete GraphSasaki, Tatsuya / Agbor, Bateh Mathias / Masuda, Shingo / Hayashi, Yu-ichi / Mizuki, Takaaki / Sone, Hideaki et al. | 2018
- 4
-
Approximating Partially Bounded Degree Deletion on Directed GraphsFujito, Toshihiro / Kimura, Kei / Mizuno, Yuki et al. | 2018
- 5
-
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular CasesAhn, Hee-Kap / Ahn, Taehoon / Bae, Sang Won / Choi, Jongmin / Kim, Mincheol / Oh, Eunjin / Shin, Chan-Su / Yoon, Sang Duk et al. | 2018
- 6
-
Minimum-Width Square Annulus Intersecting PolygonsAhn, Hee-Kap / Ahn, Taehoon / Choi, Jongmin / Kim, Mincheol / Oh, Eunjin et al. | 2018
- 7
-
Two New Schemes in the Bitprobe ModelBaig, Mirza Galib Anwarul Husain / Kesh, Deepanjan et al. | 2018
- 8
-
Faster Network Algorithms Based on Graph DecompositionKashyop, Manas Jyoti / Nagayama, Tsunehiko / Sadakane, Kunihiko et al. | 2018
- 9
-
An Improvement of the Algorithm of Hertli for the Unique 3SAT ProblemQin, Tong / Watanabe, Osamu et al. | 2018
- 10
-
Random Popular Matchings with Incomplete Preference ListsRuangwises, Suthee / Itoh, Toshiya et al. | 2018
- 11
-
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation ApproachGu, Hanyu / Memar, Julia / Zinder, Yakov et al. | 2018
- 12
-
Computing Periods\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\ldots $$ \end{document}Cho, Junhee / Park, Sewon / Ziegler, Martin et al. | 2018
- 13
-
A Note on Online Colouring Problems in Overlap Graphs and Their ComplementsDemange, Marc / Olsen, Martin et al. | 2018
- 14
-
Online Facility AssignmentAhmed, Abu Reyan / Rahman, Md. Saidur / Kobourov, Stephen et al. | 2018
- 15
-
Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis AgreementAljohani, Aisha / Poudel, Pavan / Sharma, Gokarna et al. | 2018
- 16
-
A Simple, Fast, Filter-Based Algorithm for Circular Sequence ComparisonAzim, Md. Aashikur Rahman / Kabir, Mohimenul / Rahman, M. Sohel et al. | 2018
- 17
-
Boosting over Non-deterministic ZDDsFujita, Takahiro / Hatano, Kohei / Takimoto, Eiji et al. | 2018
- 18
-
On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract)Sayeed, Suri Dipannita / Rahman, M. Sohel / Rahman, Atif et al. | 2018
- 19
-
FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type ModelsShiroshita, Shinya / Ogasawara, Tomoaki / Hiraishi, Hidefumi / Imai, Hiroshi et al. | 2018
- 20
-
On Structural Parameterizations of Happy Coloring, Empire Coloring and BoxicityChoudhari, Jayesh / Reddy, I. Vinod et al. | 2018
- 21
-
Complexity of the Maximum k-Path Vertex Cover ProblemMiyano, Eiji / Saitoh, Toshiki / Uehara, Ryuhei / Yagita, Tsuyoshi / van der Zanden, Tom C. et al. | 2018
- 22
-
On the Parallel Parameterized Complexity of the Graph Isomorphism ProblemDas, Bireswar / Enduri, Murali Krishna / Reddy, I. Vinod et al. | 2018