Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Sariel Har-Peled and Mitchell Jones. Stabbing Convex Bodies with Lines and Flats. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 42:1-42:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{harpeled_et_al:LIPIcs.SoCG.2021.42, author = {Har-Peled, Sariel and Jones, Mitchell}, title = {{Stabbing Convex Bodies with Lines and Flats}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {42:1--42:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.42}, URN = {urn:nbn:de:0030-drops-138412}, doi = {10.4230/LIPIcs.SoCG.2021.42}, annote = {Keywords: Discrete geometry, combinatorics, weak \epsilon-nets, k-flats} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Sariel Har-Peled, Mitchell Jones, and Saladi Rahul. Active Learning a Convex Body in Low Dimensions. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 64:1-64:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{harpeled_et_al:LIPIcs.ICALP.2020.64, author = {Har-Peled, Sariel and Jones, Mitchell and Rahul, Saladi}, title = {{Active Learning a Convex Body in Low Dimensions}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {64:1--64:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.64}, URN = {urn:nbn:de:0030-drops-124711}, doi = {10.4230/LIPIcs.ICALP.2020.64}, annote = {Keywords: Approximation algorithms, computational geometry, separation oracles, active learning} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Sariel Har-Peled and Mitchell Jones. Fast Algorithms for Geometric Consensuses. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 50:1-50:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{harpeled_et_al:LIPIcs.SoCG.2020.50, author = {Har-Peled, Sariel and Jones, Mitchell}, title = {{Fast Algorithms for Geometric Consensuses}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {50:1--50:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.50}, URN = {urn:nbn:de:0030-drops-122088}, doi = {10.4230/LIPIcs.SoCG.2020.50}, annote = {Keywords: Geometric optimization, centerpoint, voting games} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Timothy M. Chan. Dynamic Geometric Data Structures via Shallow Cuttings. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 24:1-24:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chan:LIPIcs.SoCG.2019.24, author = {Chan, Timothy M.}, title = {{Dynamic Geometric Data Structures via Shallow Cuttings}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {24:1--24:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.24}, URN = {urn:nbn:de:0030-drops-104288}, doi = {10.4230/LIPIcs.SoCG.2019.24}, annote = {Keywords: dynamic data structures, convex hulls, nearest neighbor search, closest pair, shallow cuttings} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Sariel Har-Peled and Mitchell Jones. Journey to the Center of the Point Set. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 41:1-41:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{harpeled_et_al:LIPIcs.SoCG.2019.41, author = {Har-Peled, Sariel and Jones, Mitchell}, title = {{Journey to the Center of the Point Set}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {41:1--41:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.41}, URN = {urn:nbn:de:0030-drops-104454}, doi = {10.4230/LIPIcs.SoCG.2019.41}, annote = {Keywords: Computational geometry, Centerpoints, Random walks} }
Published in: LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)
Timothy M. Chan, Sariel Har-Peled, and Mitchell Jones. On Locality-Sensitive Orderings and Their Applications. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 21:1-21:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chan_et_al:LIPIcs.ITCS.2019.21, author = {Chan, Timothy M. and Har-Peled, Sariel and Jones, Mitchell}, title = {{On Locality-Sensitive Orderings and Their Applications}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {21:1--21:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.21}, URN = {urn:nbn:de:0030-drops-101140}, doi = {10.4230/LIPIcs.ITCS.2019.21}, annote = {Keywords: Approximation algorithms, Data structures, Computational geometry} }
Published in: LIPIcs, Volume 63, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, and Stefan Rümmele. Turbocharging Treewidth Heuristics. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 63, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{gaspers_et_al:LIPIcs.IPEC.2016.13, author = {Gaspers, Serge and Gudmundsson, Joachim and Jones, Mitchell and Mestre, Juli\'{a}n and R\"{u}mmele, Stefan}, title = {{Turbocharging Treewidth Heuristics}}, booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-023-1}, ISSN = {1868-8969}, year = {2017}, volume = {63}, editor = {Guo, Jiong and Hermelin, Danny}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.13}, URN = {urn:nbn:de:0030-drops-69322}, doi = {10.4230/LIPIcs.IPEC.2016.13}, annote = {Keywords: tree decomposition, heuristic, fixed-parameter tractability, local search} }
Feedback for Dagstuhl Publishing