Published in: LIPIcs, Volume 332, 41st International Symposium on Computational Geometry (SoCG 2025)
Marzieh Eidi and Sayan Mukherjee. Higher Order Bipartiteness vs Bi-Partitioning in Simplicial Complexes. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 45:1-45:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{eidi_et_al:LIPIcs.SoCG.2025.45, author = {Eidi, Marzieh and Mukherjee, Sayan}, title = {{Higher Order Bipartiteness vs Bi-Partitioning in Simplicial Complexes}}, booktitle = {41st International Symposium on Computational Geometry (SoCG 2025)}, pages = {45:1--45:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-370-6}, ISSN = {1868-8969}, year = {2025}, volume = {332}, editor = {Aichholzer, Oswin and Wang, Haitao}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.45}, URN = {urn:nbn:de:0030-drops-231972}, doi = {10.4230/LIPIcs.SoCG.2025.45}, annote = {Keywords: Bipartite graphs, Simplicial complex, Disorientability, Hodge Laplacian, odd cycles, Twisted cycles, down-dual graph} }
Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)
Paul Gastin, Sayan Mukherjee, and B Srivathsan. Reachability for Updatable Timed Automata Made Faster and More Effective. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 47:1-47:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gastin_et_al:LIPIcs.FSTTCS.2020.47, author = {Gastin, Paul and Mukherjee, Sayan and Srivathsan, B}, title = {{Reachability for Updatable Timed Automata Made Faster and More Effective}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {47:1--47:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-174-0}, ISSN = {1868-8969}, year = {2020}, volume = {182}, editor = {Saxena, Nitin and Simon, Sunil}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.47}, URN = {urn:nbn:de:0030-drops-132881}, doi = {10.4230/LIPIcs.FSTTCS.2020.47}, annote = {Keywords: Updatable timed automata, Reachability, Zones, Simulations, Static analysis} }
Published in: LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018)
Paul Gastin, Sayan Mukherjee, and B. Srivathsan. Reachability in Timed Automata with Diagonal Constraints. In 29th International Conference on Concurrency Theory (CONCUR 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 118, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{gastin_et_al:LIPIcs.CONCUR.2018.28, author = {Gastin, Paul and Mukherjee, Sayan and Srivathsan, B.}, title = {{Reachability in Timed Automata with Diagonal Constraints}}, booktitle = {29th International Conference on Concurrency Theory (CONCUR 2018)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-087-3}, ISSN = {1868-8969}, year = {2018}, volume = {118}, editor = {Schewe, Sven and Zhang, Lijun}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.28}, URN = {urn:nbn:de:0030-drops-95660}, doi = {10.4230/LIPIcs.CONCUR.2018.28}, annote = {Keywords: Timed Automata, Reachability, Zones, Diagonal constraints} }