@InProceedings{bose_et_al:LIPIcs.SWAT.2020.16,
  author =	{Bose, Prosenjit and Mehrabi, Saeed and Mondal, Debajyoti},
  title =	{{Parameterized Complexity of Two-Interval Pattern Problem}},
  booktitle =	{17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)},
  pages =	{16:1--16:10},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-150-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{162},
  editor =	{Albers, Susanne},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.16},
  URN =		{urn:nbn:de:0030-drops-122630},
  doi =		{10.4230/LIPIcs.SWAT.2020.16},
  annote =	{Keywords: Interval graphs, Two-interval pattern problem, Comparability, Multicoloured clique problem, Parameterized complexity, W\lbrack1\rbrack-hardness}
}