Published in: LIPIcs, Volume 398, 21st International Symposium on Parameterized and Exact Computation (IPEC 2026)
Radu Curticapean and Mingjun Liu. Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties. In 21st International Symposium on Parameterized and Exact Computation (IPEC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 398, pp. 31:1-31:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{curticapean_et_al:LIPIcs.IPEC.2026.31,
author = {Curticapean, Radu and Liu, Mingjun},
title = {{Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {31:1--31:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.31},
URN = {urn:nbn:de:0030-drops-282045},
doi = {10.4230/LIPIcs.IPEC.2026.31},
annote = {Keywords: induced subgraphs, counting complexity, parameterized complexity, dichotomy, automorphism group}
}
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Yijia Chen, Jörg Flum, Mingjun Liu, and Zhiyang Xun. On Algorithms Based on Finitely Many Homomorphism Counts. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chen_et_al:LIPIcs.MFCS.2022.32,
author = {Chen, Yijia and Flum, J\"{o}rg and Liu, Mingjun and Xun, Zhiyang},
title = {{On Algorithms Based on Finitely Many Homomorphism Counts}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {32:1--32:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.32},
URN = {urn:nbn:de:0030-drops-168301},
doi = {10.4230/LIPIcs.MFCS.2022.32},
annote = {Keywords: homomorphism numbers, hom algorithms, adaptive hom algorithms}
}