Published in: LIPIcs, Volume 320, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Carlos Alegría, Susanna Caroppo, Giordano Da Lozzo, Marco D'Elia, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, and Maurizio Patrignani. Upward Pointset Embeddings of Planar st-Graphs. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 24:1-24:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{alegria_et_al:LIPIcs.GD.2024.24, author = {Alegr{\'\i}a, Carlos and Caroppo, Susanna and Da Lozzo, Giordano and D'Elia, Marco and Di Battista, Giuseppe and Frati, Fabrizio and Grosso, Fabrizio and Patrignani, Maurizio}, title = {{Upward Pointset Embeddings of Planar st-Graphs}}, booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)}, pages = {24:1--24:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-343-0}, ISSN = {1868-8969}, year = {2024}, volume = {320}, editor = {Felsner, Stefan and Klein, Karsten}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.24}, URN = {urn:nbn:de:0030-drops-213082}, doi = {10.4230/LIPIcs.GD.2024.24}, annote = {Keywords: Upward pointset embeddings, planar st-graphs, st-cutset, non-crossing monotone Hamiltonian cycles, graph drawing enumeration} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Jean-Daniel Boissonnat and Kunal Dutta. A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 29:1-29:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{boissonnat_et_al:LIPIcs.ESA.2024.29, author = {Boissonnat, Jean-Daniel and Dutta, Kunal}, title = {{A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {29:1--29:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.29}, URN = {urn:nbn:de:0030-drops-211009}, doi = {10.4230/LIPIcs.ESA.2024.29}, annote = {Keywords: Persistent homology, Gaussian kernels, Random Fourier Features, Euclidean embedding} }
Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)
Tamal K. Dey and Tao Hou. Computing Zigzag Vineyard Efficiently Including Expansions and Contractions. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 49:1-49:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dey_et_al:LIPIcs.SoCG.2024.49, author = {Dey, Tamal K. and Hou, Tao}, title = {{Computing Zigzag Vineyard Efficiently Including Expansions and Contractions}}, booktitle = {40th International Symposium on Computational Geometry (SoCG 2024)}, pages = {49:1--49:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-316-4}, ISSN = {1868-8969}, year = {2024}, volume = {293}, editor = {Mulzer, Wolfgang and Phillips, Jeff M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.49}, URN = {urn:nbn:de:0030-drops-199942}, doi = {10.4230/LIPIcs.SoCG.2024.49}, annote = {Keywords: zigzag persistence, vines and vineyard, update operations} }
Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)
Tamal K. Dey and Abhishek Rathod. Cup Product Persistence and Its Efficient Computation. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 50:1-50:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dey_et_al:LIPIcs.SoCG.2024.50, author = {Dey, Tamal K. and Rathod, Abhishek}, title = {{Cup Product Persistence and Its Efficient Computation}}, booktitle = {40th International Symposium on Computational Geometry (SoCG 2024)}, pages = {50:1--50:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-316-4}, ISSN = {1868-8969}, year = {2024}, volume = {293}, editor = {Mulzer, Wolfgang and Phillips, Jeff M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.50}, URN = {urn:nbn:de:0030-drops-199958}, doi = {10.4230/LIPIcs.SoCG.2024.50}, annote = {Keywords: Persistent cohomology, cup product, image persistence, persistent cup module} }
Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)
Tamal K. Dey, Florian Russold, and Shreyas N. Samaga. Efficient Algorithms for Complexes of Persistence Modules with Applications. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 51:1-51:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dey_et_al:LIPIcs.SoCG.2024.51, author = {Dey, Tamal K. and Russold, Florian and Samaga, Shreyas N.}, title = {{Efficient Algorithms for Complexes of Persistence Modules with Applications}}, booktitle = {40th International Symposium on Computational Geometry (SoCG 2024)}, pages = {51:1--51:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-316-4}, ISSN = {1868-8969}, year = {2024}, volume = {293}, editor = {Mulzer, Wolfgang and Phillips, Jeff M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.51}, URN = {urn:nbn:de:0030-drops-199969}, doi = {10.4230/LIPIcs.SoCG.2024.51}, annote = {Keywords: Persistent (co)homology, Persistence modules, Sheaves, Presentations} }
Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Nate Clause, Tamal K. Dey, Facundo Mémoli, and Bei Wang. Meta-Diagrams for 2-Parameter Persistence. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 25:1-25:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{clause_et_al:LIPIcs.SoCG.2023.25, author = {Clause, Nate and Dey, Tamal K. and M\'{e}moli, Facundo and Wang, Bei}, title = {{Meta-Diagrams for 2-Parameter Persistence}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {25:1--25:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.25}, URN = {urn:nbn:de:0030-drops-178754}, doi = {10.4230/LIPIcs.SoCG.2023.25}, annote = {Keywords: Multiparameter persistence modules, persistent homology, M\"{o}bius inversion, barcodes, computational topology, topological data analysis} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Tamal K. Dey and Tao Hou. Fast Computation of Zigzag Persistence. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 43:1-43:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dey_et_al:LIPIcs.ESA.2022.43, author = {Dey, Tamal K. and Hou, Tao}, title = {{Fast Computation of Zigzag Persistence}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {43:1--43:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.43}, URN = {urn:nbn:de:0030-drops-169813}, doi = {10.4230/LIPIcs.ESA.2022.43}, annote = {Keywords: zigzag persistence, persistent homology, fast computation} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Tamal K. Dey, Woojin Kim, and Facundo Mémoli. Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dey_et_al:LIPIcs.SoCG.2022.34, author = {Dey, Tamal K. and Kim, Woojin and M\'{e}moli, Facundo}, title = {{Computing Generalized Rank Invariant for 2-Parameter Persistence Modules via Zigzag Persistence and Its Applications}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {34:1--34:17}, 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.34}, URN = {urn:nbn:de:0030-drops-160420}, doi = {10.4230/LIPIcs.SoCG.2022.34}, annote = {Keywords: Multiparameter persistent homology, Zigzag persistent homology, Generalized Persistence Diagrams, M\"{o}bius inversion} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Tamal K. Dey, Michał Lipiński, Marian Mrozek, and Ryan Slechta. Tracking Dynamical Features via Continuation and Persistence. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 35:1-35:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dey_et_al:LIPIcs.SoCG.2022.35, author = {Dey, Tamal K. and Lipi\'{n}ski, Micha{\l} and Mrozek, Marian and Slechta, Ryan}, title = {{Tracking Dynamical Features via Continuation and Persistence}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {35:1--35:17}, 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.35}, URN = {urn:nbn:de:0030-drops-160439}, doi = {10.4230/LIPIcs.SoCG.2022.35}, annote = {Keywords: combinatorial dynamical systems, continuation, index pair, Conley index, persistent homology} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Tamal K. Dey and Tao Hou. Computing Zigzag Persistence on Graphs in Near-Linear Time. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 30:1-30:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dey_et_al:LIPIcs.SoCG.2021.30, author = {Dey, Tamal K. and Hou, Tao}, title = {{Computing Zigzag Persistence on Graphs in Near-Linear Time}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {30:1--30:15}, 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.30}, URN = {urn:nbn:de:0030-drops-138292}, doi = {10.4230/LIPIcs.SoCG.2021.30}, annote = {Keywords: persistent homology, zigzag persistence, graph filtration, dynamic networks} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Tamal K. Dey, Tianqi Li, and Yusu Wang. An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 36:1-36:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dey_et_al:LIPIcs.SoCG.2020.36, author = {Dey, Tamal K. and Li, Tianqi and Wang, Yusu}, title = {{An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {36:1--36: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.36}, URN = {urn:nbn:de:0030-drops-121944}, doi = {10.4230/LIPIcs.SoCG.2020.36}, annote = {Keywords: computational topology, directed graph, path homology, persistent path homology} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Tamal K. Dey, Marian Mrozek, and Ryan Slechta. Persistence of the Conley Index in Combinatorial Dynamical Systems. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 37:1-37:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dey_et_al:LIPIcs.SoCG.2020.37, author = {Dey, Tamal K. and Mrozek, Marian and Slechta, Ryan}, title = {{Persistence of the Conley Index in Combinatorial Dynamical Systems}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {37:1--37:17}, 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.37}, URN = {urn:nbn:de:0030-drops-121958}, doi = {10.4230/LIPIcs.SoCG.2020.37}, annote = {Keywords: Dynamical systems, combinatorial vector field, multivector, Conley index, persistence} }
Published in: LIPIcs, Volume 113, 18th International Workshop on Algorithms in Bioinformatics (WABI 2018)
Tamal K. Dey and Sayan Mandal. Protein Classification with Improved Topological Data Analysis. In 18th International Workshop on Algorithms in Bioinformatics (WABI 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 113, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dey_et_al:LIPIcs.WABI.2018.6, author = {Dey, Tamal K. and Mandal, Sayan}, title = {{Protein Classification with Improved Topological Data Analysis}}, booktitle = {18th International Workshop on Algorithms in Bioinformatics (WABI 2018)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-082-8}, ISSN = {1868-8969}, year = {2018}, volume = {113}, editor = {Parida, Laxmi and Ukkonen, Esko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.6}, URN = {urn:nbn:de:0030-drops-93082}, doi = {10.4230/LIPIcs.WABI.2018.6}, annote = {Keywords: topological data analysis, persistent homology, simplicial collapse, supervised learning, topology based protein feature vector, protein classification} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Tamal K. Dey, Jiayuan Wang, and Yusu Wang. Graph Reconstruction by Discrete Morse Theory. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 31:1-31:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dey_et_al:LIPIcs.SoCG.2018.31, author = {Dey, Tamal K. and Wang, Jiayuan and Wang, Yusu}, title = {{Graph Reconstruction by Discrete Morse Theory}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {31:1--31:15}, 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.31}, URN = {urn:nbn:de:0030-drops-87443}, doi = {10.4230/LIPIcs.SoCG.2018.31}, annote = {Keywords: graph reconstruction, discrete Morse theory, persistence} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Tamal K. Dey and Cheng Xin. Computing Bottleneck Distance for 2-D Interval Decomposable Modules. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dey_et_al:LIPIcs.SoCG.2018.32, author = {Dey, Tamal K. and Xin, Cheng}, title = {{Computing Bottleneck Distance for 2-D Interval Decomposable Modules}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {32:1--32:15}, 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.32}, URN = {urn:nbn:de:0030-drops-87453}, doi = {10.4230/LIPIcs.SoCG.2018.32}, annote = {Keywords: Persistence modules, bottleneck distance, interleaving distance} }
Feedback for Dagstuhl Publishing