Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Deniz Ağaoğlu Çağırıcı, Onur Çağırıcı, Jan Derbisz, Tim A. Hartmann, Petr Hliněný, Jan Kratochvíl, Tomasz Krawczyk, and Peter Zeman. Recognizing H-Graphs - Beyond Circular-Arc Graphs. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{agaoglucagirici_et_al:LIPIcs.MFCS.2023.8, author = {A\u{g}ao\u{g}lu \c{C}a\u{g}{\i}r{\i}c{\i}, Deniz and \c{C}a\u{g}{\i}r{\i}c{\i}, Onur and Derbisz, Jan and Hartmann, Tim A. and Hlin\v{e}n\'{y}, Petr and Kratochv{\'\i}l, Jan and Krawczyk, Tomasz and Zeman, Peter}, title = {{Recognizing H-Graphs - Beyond Circular-Arc Graphs}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {8:1--8:14}, 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.8}, URN = {urn:nbn:de:0030-drops-185420}, doi = {10.4230/LIPIcs.MFCS.2023.8}, annote = {Keywords: H-graphs, Intersection Graphs, Helly Property} }
Published in: Dagstuhl Reports, Volume 11, Issue 6 (2021)
Haris Aziz, Péter Biró, Tamás Fleiner, and Bettina Klaus. Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301). In Dagstuhl Reports, Volume 11, Issue 6, pp. 124-146, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{aziz_et_al:DagRep.11.6.124, author = {Aziz, Haris and Bir\'{o}, P\'{e}ter and Fleiner, Tam\'{a}s and Klaus, Bettina}, title = {{Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301)}}, pages = {124--146}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2021}, volume = {11}, number = {6}, editor = {Aziz, Haris and Bir\'{o}, P\'{e}ter and Fleiner, Tam\'{a}s and Klaus, Bettina}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.6.124}, URN = {urn:nbn:de:0030-drops-155826}, doi = {10.4230/DagRep.11.6.124}, annote = {Keywords: market design, matching under preferences, matching with distributional constraints, organ exchange, stable matching} }
Published in: LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, and Dušan Knop. Recognizing Proper Tree-Graphs. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 8:1-8:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chaplick_et_al:LIPIcs.IPEC.2020.8, author = {Chaplick, Steven and Golovach, Petr A. and Hartmann, Tim A. and Knop, Du\v{s}an}, title = {{Recognizing Proper Tree-Graphs}}, booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)}, pages = {8:1--8:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-172-6}, ISSN = {1868-8969}, year = {2020}, volume = {180}, editor = {Cao, Yixin and Pilipczuk, Marcin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.8}, URN = {urn:nbn:de:0030-drops-133118}, doi = {10.4230/LIPIcs.IPEC.2020.8}, annote = {Keywords: intersection graphs, H-graphs, recognition, fixed-parameter tractability} }
Feedback for Dagstuhl Publishing