Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
James Davies, Chaya Keller, Linda Kleist, Shakhar Smorodinsky, and Bartosz Walczak. A Solution to Ringel’s Circle Problem. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 33:1-33:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{davies_et_al:LIPIcs.SoCG.2022.33, author = {Davies, James and Keller, Chaya and Kleist, Linda and Smorodinsky, Shakhar and Walczak, Bartosz}, title = {{A Solution to Ringel’s Circle Problem}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.33}, URN = {urn:nbn:de:0030-drops-160413}, doi = {10.4230/LIPIcs.SoCG.2022.33}, annote = {Keywords: circle arrangement, chromatic number, Gallai’s theorem, polynomial method} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Zdeněk Dvořák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, and Torsten Ueckerdt. On Comparable Box Dimension. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 38:1-38:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{dvorak_et_al:LIPIcs.SoCG.2022.38, author = {Dvo\v{r}\'{a}k, Zden\v{e}k and Gon\c{c}alves, Daniel and Lahiri, Abhiruk and Tan, Jane and Ueckerdt, Torsten}, title = {{On Comparable Box Dimension}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {38:1--38:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.38}, URN = {urn:nbn:de:0030-drops-160461}, doi = {10.4230/LIPIcs.SoCG.2022.38}, annote = {Keywords: geometric graphs, minor-closed graph classes, treewidth fragility} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Zdeněk Dvořák, Jakub Pekárek, Torsten Ueckerdt, and Yelena Yuditsky. Weak Coloring Numbers of Intersection Graphs. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 39:1-39:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{dvorak_et_al:LIPIcs.SoCG.2022.39, author = {Dvo\v{r}\'{a}k, Zden\v{e}k and Pek\'{a}rek, Jakub and Ueckerdt, Torsten and Yuditsky, Yelena}, title = {{Weak Coloring Numbers of Intersection Graphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {39:1--39:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.39}, URN = {urn:nbn:de:0030-drops-160477}, doi = {10.4230/LIPIcs.SoCG.2022.39}, annote = {Keywords: geometric intersection graphs, weak and strong coloring numbers} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, and Yelena Yuditsky. The ε-t-Net Problem. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 5:1-5:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{alon_et_al:LIPIcs.SoCG.2020.5, author = {Alon, Noga and Jartoux, Bruno and Keller, Chaya and Smorodinsky, Shakhar and Yuditsky, Yelena}, title = {{The \epsilon-t-Net Problem}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {5:1--5:15}, 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.5}, URN = {urn:nbn:de:0030-drops-121639}, doi = {10.4230/LIPIcs.SoCG.2020.5}, annote = {Keywords: epsilon-nets, geometric hypergraphs, VC-dimension, linear union complexity} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
János Pach, Bruce Reed, and Yelena Yuditsky. Almost All String Graphs are Intersection Graphs of Plane Convex Sets. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 68:1-68:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{pach_et_al:LIPIcs.SoCG.2018.68, author = {Pach, J\'{a}nos and Reed, Bruce and Yuditsky, Yelena}, title = {{Almost All String Graphs are Intersection Graphs of Plane Convex Sets}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {68:1--68:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.68}, URN = {urn:nbn:de:0030-drops-87818}, doi = {10.4230/LIPIcs.SoCG.2018.68}, annote = {Keywords: String graph, intersection graph, plane convex set} }
Feedback for Dagstuhl Publishing