Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Jiehua Chen and Sanjukta Roy. Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chen_et_al:LIPIcs.ESA.2022.36, author = {Chen, Jiehua and Roy, Sanjukta}, title = {{Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.36}, URN = {urn:nbn:de:0030-drops-169741}, doi = {10.4230/LIPIcs.ESA.2022.36}, annote = {Keywords: stable matchings, multidimensional stable roommates, Euclidean preferences, coalition formation games, stable cores, NP-hardness} }
Published in: LIPIcs, Volume 160, 18th International Symposium on Experimental Algorithms (SEA 2020)
James Trimble. An Algorithm for the Exact Treedepth Problem. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{trimble:LIPIcs.SEA.2020.19, author = {Trimble, James}, title = {{An Algorithm for the Exact Treedepth Problem}}, booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-148-1}, ISSN = {1868-8969}, year = {2020}, volume = {160}, editor = {Faro, Simone and Cantone, Domenico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.19}, URN = {urn:nbn:de:0030-drops-120938}, doi = {10.4230/LIPIcs.SEA.2020.19}, annote = {Keywords: Treedepth, Elimination Tree, Graph Algorithms} }
Published in: LIPIcs, Volume 160, 18th International Symposium on Experimental Algorithms (SEA 2020)
Frances Cooper and David Manlove. Algorithms for New Types of Fair Stable Matchings. In 18th International Symposium on Experimental Algorithms (SEA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 160, pp. 20:1-20:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cooper_et_al:LIPIcs.SEA.2020.20, author = {Cooper, Frances and Manlove, David}, title = {{Algorithms for New Types of Fair Stable Matchings}}, booktitle = {18th International Symposium on Experimental Algorithms (SEA 2020)}, pages = {20:1--20:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-148-1}, ISSN = {1868-8969}, year = {2020}, volume = {160}, editor = {Faro, Simone and Cantone, Domenico}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2020.20}, URN = {urn:nbn:de:0030-drops-120945}, doi = {10.4230/LIPIcs.SEA.2020.20}, annote = {Keywords: Stable marriage, Algorithms, Optimality, Fair stable matchings, Regret-equality, Min-regret sum} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Ágnes Cseh and Attila Juhos. Pairwise Preferences in the Stable Marriage Problem. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{cseh_et_al:LIPIcs.STACS.2019.21, author = {Cseh, \'{A}gnes and Juhos, Attila}, title = {{Pairwise Preferences in the Stable Marriage Problem}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.21}, URN = {urn:nbn:de:0030-drops-102603}, doi = {10.4230/LIPIcs.STACS.2019.21}, annote = {Keywords: stable marriage, intransitivity, acyclic preferences, poset, weakly stable matching, strongly stable matching, super stable matching} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Frances Cooper and David Manlove. A 3/2-Approximation Algorithm for the Student-Project Allocation Problem. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 8:1-8:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cooper_et_al:LIPIcs.SEA.2018.8, author = {Cooper, Frances and Manlove, David}, title = {{A 3/2-Approximation Algorithm for the Student-Project Allocation Problem}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.8}, URN = {urn:nbn:de:0030-drops-89439}, doi = {10.4230/LIPIcs.SEA.2018.8}, annote = {Keywords: Matching problems, Approximation, Algorithms, Stability} }
Feedback for Dagstuhl Publishing