@InProceedings{ducoffe:LIPIcs.IPEC.2021.16,
  author =	{Ducoffe, Guillaume},
  title =	{{Optimal Centrality Computations Within Bounded Clique-Width Graphs}},
  booktitle =	{16th International Symposium on Parameterized and Exact Computation (IPEC 2021)},
  pages =	{16:1--16:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-216-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{214},
  editor =	{Golovach, Petr A. and Zehavi, Meirav},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.16},
  URN =		{urn:nbn:de:0030-drops-153995},
  doi =		{10.4230/LIPIcs.IPEC.2021.16},
  annote =	{Keywords: Clique-width, Centralities computation, Facility Location problems, Distance-labeling scheme, Fine-grained complexity in P, Graph theory}
}