@InProceedings{schmitz_et_al_LIPIcs.ICALP.2024.153,
    author = {Schmitz, Sylvain and Sch\"{u}tze, Lia},
    title = {{On the Length of Strongly Monotone Descending Chains over $\mathbb{N}^d$}},
    booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
    pages = {153:1--153:19},
    series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    isbn = {978-3-95977-322-5},
    issn = {1868-8969},
    year = {2024},
    volume = {297},
    editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
    publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
    address = {Dagstuhl, Germany},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.153},
    urn = {urn:nbn:de:0030-drops-202964},
    doi = {10.4230/LIPIcs.ICALP.2024.153},
    annote = {Keywords: Vector addition system, coverability, well-quasi-order, order ideal, affine net},
    date-added = {2024-7-5 7:25:18 +0100}
}

@InProceedings{schmitz_et_al_LIPIcs.ICALP.2024.153, author = {Schmitz, Sylvain and Sch\"{u}tze, Lia}, title = {{On the Length of Strongly Monotone Descending Chains over $\mathbb{N}^d$}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {153:1--153:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, isbn = {978-3-95977-322-5}, issn = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.153}, urn = {urn:nbn:de:0030-drops-202964}, doi = {10.4230/LIPIcs.ICALP.2024.153}, annote = {Keywords: Vector addition system, coverability, well-quasi-order, order ideal, affine net}, date-added = {2024-7-5 7:25:18 +0100} }