Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Nadja Betzler
◽
Michael R. Fellows
◽
Christian Komusiewicz
◽
Rolf Niedermeier
2016 ◽
Vol 213
◽
pp. 162-178
◽
Ron Y. Pinter
◽
Hadas Shachnai
◽
Meirav Zehavi
Ron Y. Pinter
◽
Hadas Shachnai
◽
Meirav Zehavi
2014 ◽
Vol 36
(9)
◽
pp. 1868-1879
Wei-Zhong LUO
◽
Qi-Long FENG
◽
Jian-Xin WANG
◽
Jian-Er CHEN
2020 ◽
Vol 16
(3)
◽
pp. 1-31
Daniel Lokshtanov
◽
Fahad Panolan
◽
Saket Saurabh
◽
Roohani Sharma
◽
Meirav Zehavi
Alexander Göke
◽
Dániel Marx
◽
Matthias Mnich
2014 ◽
Vol 11
(2)
◽
pp. 1-31
◽
Daniel Lokshtanov
◽
N. S. Narayanaswamy
◽
Venkatesh Raman
◽
M. S. Ramanujan
◽
Saket Saurabh
2006 ◽
Vol 3
(4)
◽
pp. 423-432
◽
Yinglei Song
◽
Chunmei Liu
◽
Xiuzhen Huang
◽
Russell Malmberg
◽
Ying Xu
◽
...
Romeo Rizzi
◽
Florian Sikora
Vahan Mkrtchyan
◽
Garik Petrosyan
◽
K. Subramani
◽
Piotr Wojciechowski
2020 ◽
Vol 24
(3)
◽
pp. 371-396
Guillaume Fertin
◽
Christian Komusiewicz