Published in: Dagstuhl Reports, Volume 12, Issue 1 (2022)
Karsten Klein, Juan F. Sequeda, Hsiang-Yun Wu, and Da Yan. Bringing Graph Databases and Network Visualization Together (Dagstuhl Seminar 22031). In Dagstuhl Reports, Volume 12, Issue 1, pp. 67-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{klein_et_al:DagRep.12.1.67, author = {Klein, Karsten and Sequeda, Juan F. and Wu, Hsiang-Yun and Yan, Da}, title = {{Bringing Graph Databases and Network Visualization Together (Dagstuhl Seminar 22031)}}, pages = {67--82}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {12}, number = {1}, editor = {Klein, Karsten and Sequeda, Juan F. and Wu, Hsiang-Yun and Yan, Da}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.1.67}, URN = {urn:nbn:de:0030-drops-169218}, doi = {10.4230/DagRep.12.1.67}, annote = {Keywords: graph databases, network visualization, visual analytics} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard, and Aldo Gonzalez-Lorenzo. Shadoks Approach to Minimum Partition into Plane Subgraphs (CG Challenge). In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 71:1-71:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{crombez_et_al:LIPIcs.SoCG.2022.71, author = {Crombez, Lo\"{i}c and da Fonseca, Guilherme D. and Gerard, Yan and Gonzalez-Lorenzo, Aldo}, title = {{Shadoks Approach to Minimum Partition into Plane Subgraphs}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {71:1--71:8}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.71}, URN = {urn:nbn:de:0030-drops-160794}, doi = {10.4230/LIPIcs.SoCG.2022.71}, annote = {Keywords: Plane graphs, graph coloring, intersection graph, conflict optimizer, line segments, computational geometry} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Loïc Crombez, Guilherme D. da Fonseca, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, and Luc Libralesso. Shadoks Approach to Low-Makespan Coordinated Motion Planning (CG Challenge). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 63:1-63:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{crombez_et_al:LIPIcs.SoCG.2021.63, author = {Crombez, Lo\"{i}c and da Fonseca, Guilherme D. and Gerard, Yan and Gonzalez-Lorenzo, Aldo and Lafourcade, Pascal and Libralesso, Luc}, title = {{Shadoks Approach to Low-Makespan Coordinated Motion Planning}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {63:1--63:9}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.63}, URN = {urn:nbn:de:0030-drops-138622}, doi = {10.4230/LIPIcs.SoCG.2021.63}, annote = {Keywords: heuristics, motion planning, digital geometry, shortest path} }
Published in: LIPIcs, Volume 157, 10th International Conference on Fun with Algorithms (FUN 2021) (2020)
Loïc Crombez, Guilherme D. da Fonseca, and Yan Gerard. Efficient Algorithms for Battleship. In 10th International Conference on Fun with Algorithms (FUN 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 157, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{crombez_et_al:LIPIcs.FUN.2021.11, author = {Crombez, Lo\"{i}c and da Fonseca, Guilherme D. and Gerard, Yan}, title = {{Efficient Algorithms for Battleship}}, booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-145-0}, ISSN = {1868-8969}, year = {2020}, volume = {157}, editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.11}, URN = {urn:nbn:de:0030-drops-127728}, doi = {10.4230/LIPIcs.FUN.2021.11}, annote = {Keywords: Polyomino, digital geometry, decision tree, lattice, HV-convexity, convexity} }
Published in: DARTS, Volume 2, Issue 1, Special Issue of the 30th European Conference on Object-Oriented Programming (ECOOP 2016)
Johannes Späth, Lisa Nguyen Quang Do, Karim Ali, and Eric Bodden. Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java (Artifact). In Special Issue of the 30th European Conference on Object-Oriented Programming (ECOOP 2016). Dagstuhl Artifacts Series (DARTS), Volume 2, Issue 1, pp. 12:1-12:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{spath_et_al:DARTS.2.1.12, author = {Sp\"{a}th, Johannes and Nguyen Quang Do, Lisa and Ali, Karim and Bodden, Eric}, title = {{Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java (Artifact)}}, pages = {12:1--12:2}, journal = {Dagstuhl Artifacts Series}, ISSN = {2509-8195}, year = {2016}, volume = {2}, number = {1}, editor = {Sp\"{a}th, Johannes and Nguyen Quang Do, Lisa and Ali, Karim and Bodden, Eric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DARTS.2.1.12}, URN = {urn:nbn:de:0030-drops-61334}, doi = {10.4230/DARTS.2.1.12}, annote = {Keywords: Demand-Driven; Static Analysis; IFDS; Aliasing; Points-to Analysis} }
Feedback for Dagstuhl Publishing