Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Tim Seppelt. Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 82:1-82:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{seppelt:LIPIcs.MFCS.2023.82, author = {Seppelt, Tim}, title = {{Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {82:1--82:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.82}, URN = {urn:nbn:de:0030-drops-186161}, doi = {10.4230/LIPIcs.MFCS.2023.82}, annote = {Keywords: homomorphism indistinguishability, graph minor, logic} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
David E. Roberson and Tim Seppelt. Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 101:1-101:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{roberson_et_al:LIPIcs.ICALP.2023.101, author = {Roberson, David E. and Seppelt, Tim}, title = {{Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {101:1--101:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.101}, URN = {urn:nbn:de:0030-drops-181531}, doi = {10.4230/LIPIcs.ICALP.2023.101}, annote = {Keywords: Lasserre hierarchy, homomorphism indistinguishability, Sherali-Adams hierarchy, treewidth, semidefinite programming, linear programming, graph isomorphism} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Laura Mancinska, David E. Roberson, Robert Samal, Simone Severini, and Antonios Varvitsiotis. Relaxations of Graph Isomorphism. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 76:1-76:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{mancinska_et_al:LIPIcs.ICALP.2017.76, author = {Mancinska, Laura and Roberson, David E. and Samal, Robert and Severini, Simone and Varvitsiotis, Antonios}, title = {{Relaxations of Graph Isomorphism}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {76:1--76:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.76}, URN = {urn:nbn:de:0030-drops-74697}, doi = {10.4230/LIPIcs.ICALP.2017.76}, annote = {Keywords: graph isomorphism, quantum information, semidefinite programming} }
Feedback for Dagstuhl Publishing