@InProceedings{boyar_et_al:LIPIcs.SWAT.2024.16,
  author =	{Boyar, Joan and Kamali, Shahin and Larsen, Kim S. and Lavasani, Ali Mohammad and Li, Yaqiao and Pankratov, Denis},
  title =	{{On the Online Weighted Non-Crossing Matching Problem}},
  booktitle =	{19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024)},
  pages =	{16:1--16:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-318-8},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{294},
  editor =	{Bodlaender, Hans L.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.16},
  URN =		{urn:nbn:de:0030-drops-200567},
  doi =		{10.4230/LIPIcs.SWAT.2024.16},
  annote =	{Keywords: Online algorithms, weighted matching problem, Euclidean plane, non-crossing constraints, competitive analysis, randomized online algorithms, online algorithms with advice, online algorithms with revoking}
}