Christine Awofeso, Patrick Greaves, Oded Lachish, Felix Reidl. chrisateen/admissibillity-rust (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@misc{dagstuhl-artifact-23612, title = {{chrisateen/admissibillity-rust}}, author = {Awofeso, Christine and Greaves, Patrick and Lachish, Oded and Reidl, Felix}, note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:71c063dd72478472ce6c4dbec0805028be8003dd;origin=https://github.com/chrisateen/admissibillity-rust;visit=swh:1:snp:855eb3980d829fc685bc267ba6b84761eed00388;anchor=swh:1:rev:73669f38ba4edcc4d6cde548504d34131004c93f}{\texttt{swh:1:dir:71c063dd72478472ce6c4dbec0805028be8003dd}} (visited on 2025-07-15)}, url = {https://github.com/chrisateen/admissibillity-rust}, doi = {10.4230/artifacts.23612}, }
Published in: LIPIcs, Volume 338, 23rd International Symposium on Experimental Algorithms (SEA 2025)
Christine Awofeso, Patrick Greaves, Oded Lachish, and Felix Reidl. A Practical Algorithm for 2-Admissibility. In 23rd International Symposium on Experimental Algorithms (SEA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 338, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{awofeso_et_al:LIPIcs.SEA.2025.3, author = {Awofeso, Christine and Greaves, Patrick and Lachish, Oded and Reidl, Felix}, title = {{A Practical Algorithm for 2-Admissibility}}, booktitle = {23rd International Symposium on Experimental Algorithms (SEA 2025)}, pages = {3:1--3:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-375-1}, ISSN = {1868-8969}, year = {2025}, volume = {338}, editor = {Mutzel, Petra and Prezza, Nicola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2025.3}, URN = {urn:nbn:de:0030-drops-232413}, doi = {10.4230/LIPIcs.SEA.2025.3}, annote = {Keywords: Sparse graphs, admissibility} }
Published in: LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)
Christine Awofeso, Patrick Greaves, Oded Lachish, Amit Levi, and Felix Reidl. Testing C_k-Freeness in Bounded Admissibility Graphs. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 15:1-15:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{awofeso_et_al:LIPIcs.ICALP.2025.15, author = {Awofeso, Christine and Greaves, Patrick and Lachish, Oded and Levi, Amit and Reidl, Felix}, title = {{Testing C\underlinek-Freeness in Bounded Admissibility Graphs}}, booktitle = {52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)}, pages = {15:1--15:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-372-0}, ISSN = {1868-8969}, year = {2025}, volume = {334}, editor = {Censor-Hillel, Keren and Grandoni, Fabrizio and Ouaknine, Jo\"{e}l 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.2025.15}, URN = {urn:nbn:de:0030-drops-233926}, doi = {10.4230/LIPIcs.ICALP.2025.15}, annote = {Keywords: Property Testing, Sparse Graphs, Cycle, Admissibility} }
Published in: LIPIcs, Volume 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)
Christine Awofeso, Patrick Greaves, Oded Lachish, and Felix Reidl. Results on H-Freeness Testing in Graphs of Bounded r-Admissibility. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{awofeso_et_al:LIPIcs.STACS.2025.12, author = {Awofeso, Christine and Greaves, Patrick and Lachish, Oded and Reidl, Felix}, title = {{Results on H-Freeness Testing in Graphs of Bounded r-Admissibility}}, booktitle = {42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)}, pages = {12:1--12:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-365-2}, ISSN = {1868-8969}, year = {2025}, volume = {327}, editor = {Beyersdorff, Olaf and Pilipczuk, Micha{\l} and Pimentel, Elaine and Thắng, Nguy\~{ê}n Kim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.12}, URN = {urn:nbn:de:0030-drops-228378}, doi = {10.4230/LIPIcs.STACS.2025.12}, annote = {Keywords: Property Testing, Sparse Graphs, Degeneracy, Admissibility} }
Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Pål Grønås Drange, Patrick Greaves, Irene Muzi, and Felix Reidl. Computing Complexity Measures of Degenerate Graphs. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 14:1-14:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{drange_et_al:LIPIcs.IPEC.2023.14, author = {Drange, P\r{a}l Gr{\o}n\r{a}s and Greaves, Patrick and Muzi, Irene and Reidl, Felix}, title = {{Computing Complexity Measures of Degenerate Graphs}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {14:1--14:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.14}, URN = {urn:nbn:de:0030-drops-194333}, doi = {10.4230/LIPIcs.IPEC.2023.14}, annote = {Keywords: vc-dimension, datastructure, degeneracy, enumerating} }
Feedback for Dagstuhl Publishing