@InProceedings{ziobro_et_al:LIPIcs.SEA.2018.29,
  author =	{Ziobro, Michal and Pilipczuk, Marcin},
  title =	{{Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation}},
  booktitle =	{17th International Symposium on Experimental Algorithms (SEA 2018)},
  pages =	{29:1--29:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-070-5},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{103},
  editor =	{D'Angelo, Gianlorenzo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.29},
  URN =		{urn:nbn:de:0030-drops-89648},
  doi =		{10.4230/LIPIcs.SEA.2018.29},
  annote =	{Keywords: Empirical Evaluation of Algorithms, Treewidth, Hamiltonian Cycle}
}