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 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, and Gerhard J. Woeginger. An Investigation of the Recoverable Robust Assignment Problem. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{fischer_et_al:LIPIcs.IPEC.2021.19, author = {Fischer, Dennis and Hartmann, Tim A. and Lendl, Stefan and Woeginger, Gerhard J.}, title = {{An Investigation of the Recoverable Robust Assignment Problem}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.19}, URN = {urn:nbn:de:0030-drops-154025}, doi = {10.4230/LIPIcs.IPEC.2021.19}, annote = {Keywords: assignment problem, matchings, exact matching, robust optimization, fixed paramter tractablity, RNC} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Alexander Grigoriev, Tim A. Hartmann, Stefan Lendl, and Gerhard J. Woeginger. Dispersing Obnoxious Facilities on a Graph. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 33:1-33:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{grigoriev_et_al:LIPIcs.STACS.2019.33, author = {Grigoriev, Alexander and Hartmann, Tim A. and Lendl, Stefan and Woeginger, Gerhard J.}, title = {{Dispersing Obnoxious Facilities on a Graph}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {33:1--33:11}, 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.33}, URN = {urn:nbn:de:0030-drops-102729}, doi = {10.4230/LIPIcs.STACS.2019.33}, annote = {Keywords: algorithms, complexity, optimization, graph theory, facility location} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Martin Grohe, Gaurav Rattan, and Gerhard J. Woeginger. Graph Similarity and Approximate Isomorphism. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 20:1-20:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{grohe_et_al:LIPIcs.MFCS.2018.20, author = {Grohe, Martin and Rattan, Gaurav and Woeginger, Gerhard J.}, title = {{Graph Similarity and Approximate Isomorphism}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {20:1--20:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-086-6}, ISSN = {1868-8969}, year = {2018}, volume = {117}, editor = {Potapov, Igor and Spirakis, Paul and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.20}, URN = {urn:nbn:de:0030-drops-96021}, doi = {10.4230/LIPIcs.MFCS.2018.20}, annote = {Keywords: Graph Similarity, Quadratic Assignment Problem, Approximate Graph Isomorphism} }
Published in: LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
Gerhard J. Woeginger. The Open Shop Scheduling Problem. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 96, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{woeginger:LIPIcs.STACS.2018.4, author = {Woeginger, Gerhard J.}, title = {{The Open Shop Scheduling Problem}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {4:1--4:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-062-0}, ISSN = {1868-8969}, year = {2018}, volume = {96}, editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.4}, URN = {urn:nbn:de:0030-drops-85375}, doi = {10.4230/LIPIcs.STACS.2018.4}, annote = {Keywords: Algorithms, Complexity, Scheduling, Approximation} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Christian E.J. Eggermont and Gerhard J. Woeginger. Motion planning with pulley, rope, and baskets. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 374-383, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{eggermont_et_al:LIPIcs.STACS.2012.374, author = {Eggermont, Christian E.J. and Woeginger, Gerhard J.}, title = {{Motion planning with pulley, rope, and baskets}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {374--383}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.374}, URN = {urn:nbn:de:0030-drops-33900}, doi = {10.4230/LIPIcs.STACS.2012.374}, annote = {Keywords: planning and scheduling; computational complexity} }
Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Christian E.J. Eggermont, Alexander Schrijver, and Gerhard J. Woeginger. Analysis of multi-stage open shop processing systems. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 484-494, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{eggermont_et_al:LIPIcs.STACS.2011.484, author = {Eggermont, Christian E.J. and Schrijver, Alexander and Woeginger, Gerhard J.}, title = {{Analysis of multi-stage open shop processing systems}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {484--494}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.484}, URN = {urn:nbn:de:0030-drops-30373}, doi = {10.4230/LIPIcs.STACS.2011.484}, annote = {Keywords: scheduling, resource allocation, deadlock, computational complexity} }
Published in: Dagstuhl Seminar Proceedings, Volume 10071, Scheduling (2010)
Jim Anderson, Björn Andersson, Yossi Azar, Nikhil Bansal, Enrico Bini, Marek Chrobak, José Correa, Liliana Cucu-Grosjean, Rob Davis, Arvind Easwaran, Jeff Edmonds, Shelby Funk, Sathish Gopalakrishnan, Han Hoogeveen, Claire Mathieu, Nicole Megow, Seffi Naor, Kirk Pruhs, Maurice Queyranne, Adi Rosén, Nicolas Schabanel, Jiří Sgall, René Sitters, Sebastian Stiller, Marc Uetz, Tjark Vredeveld, and Gerhard J. Woeginger. 10071 Open Problems – Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 10071, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{anderson_et_al:DagSemProc.10071.3, author = {Anderson, Jim and Andersson, Bj\"{o}rn and Azar, Yossi and Bansal, Nikhil and Bini, Enrico and Chrobak, Marek and Correa, Jos\'{e} and Cucu-Grosjean, Liliana and Davis, Rob and Easwaran, Arvind and Edmonds, Jeff and Funk, Shelby and Gopalakrishnan, Sathish and Hoogeveen, Han and Mathieu, Claire and Megow, Nicole and Naor, Seffi and Pruhs, Kirk and Queyranne, Maurice and Ros\'{e}n, Adi and Schabanel, Nicolas and Sgall, Ji\v{r}{\'\i} and Sitters, Ren\'{e} and Stiller, Sebastian and Uetz, Marc and Vredeveld, Tjark and Woeginger, Gerhard J.}, title = {{10071 Open Problems – Scheduling}}, booktitle = {Scheduling}, pages = {1--24}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10071}, editor = {Susanne Albers and Sanjoy K. Baruah and Rolf H. M\"{o}hring and Kirk Pruhs}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.3}, URN = {urn:nbn:de:0030-drops-25367}, doi = {10.4230/DagSemProc.10071.3}, annote = {Keywords: Open problems, scheduling} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, and Mark de Berg. The Traveling Salesman Problem under Squared Euclidean Distances. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 239-250, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{vannijnatten_et_al:LIPIcs.STACS.2010.2458, author = {van Nijnatten, Fred and Sitters, Ren\'{e} and Woeginger, Gerhard J. and Wolff, Alexander and de Berg, Mark}, title = {{The Traveling Salesman Problem under Squared Euclidean Distances}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {239--250}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2458}, URN = {urn:nbn:de:0030-drops-24580}, doi = {10.4230/LIPIcs.STACS.2010.2458}, annote = {Keywords: Geometric traveling salesman problem, power-assignment in wireless networks, distance-power gradient, NP-hard, APX-hard} }
Published in: Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007)
Steven J. Brams and Kirk Pruhs. 07261 Abstracts Collection – Fair Division. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{brams_et_al:DagSemProc.07261.1, author = {Brams, Steven J. and Pruhs, Kirk}, title = {{07261 Abstracts Collection – Fair Division}}, booktitle = {Fair Division}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.1}, URN = {urn:nbn:de:0030-drops-12444}, doi = {10.4230/DagSemProc.07261.1}, annote = {Keywords: Economics, Fairness, Allocation, Political Science} }
Published in: Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007)
Steven J. Brams and Kirk Pruhs. 07261 Summary – Fair Division. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{brams_et_al:DagSemProc.07261.2, author = {Brams, Steven J. and Pruhs, Kirk}, title = {{07261 Summary – Fair Division}}, booktitle = {Fair Division}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.2}, URN = {urn:nbn:de:0030-drops-12434}, doi = {10.4230/DagSemProc.07261.2}, annote = {Keywords: Economics, Fairness, Allocation, Political Science} }
Published in: Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007)
Steven J. Brams, Michael A. Jones, and Christian Klamler. Better Ways to Cut a Cake - Revisited. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{brams_et_al:DagSemProc.07261.5, author = {Brams, Steven J. and Jones, Michael A. and Klamler, Christian}, title = {{Better Ways to Cut a Cake - Revisited}}, booktitle = {Fair Division}, pages = {1--24}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.5}, URN = {urn:nbn:de:0030-drops-12278}, doi = {10.4230/DagSemProc.07261.5}, annote = {Keywords: Fair division, cake-cutting, envy-freeness, strategy-proofness} }
Published in: Dagstuhl Seminar Proceedings, Volume 7261, Fair Division (2007)
Steven J. Brams, Michael A. Jones, and Christian Klamler. Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure. In Fair Division. Dagstuhl Seminar Proceedings, Volume 7261, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{brams_et_al:DagSemProc.07261.6, author = {Brams, Steven J. and Jones, Michael A. and Klamler, Christian}, title = {{Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Procedure}}, booktitle = {Fair Division}, pages = {1--31}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7261}, editor = {Steven Brams and Kirk Pruhs and Gerhard Woeginger}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07261.6}, URN = {urn:nbn:de:0030-drops-12211}, doi = {10.4230/DagSemProc.07261.6}, annote = {Keywords: Cake-cutting, proportionality, envy-freeness, efficiency, strategy-proofness} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
David S. Johnson, Jan Karel Lenstra, and Gerhard J. Woeginger. The Travelling Salesman Problem (Dagstuhl Seminar 02261). Dagstuhl Seminar Report 346, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2004)
@TechReport{johnson_et_al:DagSemRep.346, author = {Johnson, David S. and Lenstra, Jan Karel and Woeginger, Gerhard J.}, title = {{The Travelling Salesman Problem (Dagstuhl Seminar 02261)}}, pages = {1--17}, ISSN = {1619-0203}, year = {2004}, type = {Dagstuhl Seminar Report}, number = {346}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.346}, URN = {urn:nbn:de:0030-drops-152271}, doi = {10.4230/DagSemRep.346}, }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Jaroslav Nesetril and Gerhard J. Woeginger. Graph Colorings (Dagstuhl Seminar 03391). Dagstuhl Seminar Report 395, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)
@TechReport{nesetril_et_al:DagSemRep.395, author = {Nesetril, Jaroslav and Woeginger, Gerhard J.}, title = {{Graph Colorings (Dagstuhl Seminar 03391)}}, pages = {1--6}, ISSN = {1619-0203}, year = {2003}, type = {Dagstuhl Seminar Report}, number = {395}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.395}, URN = {urn:nbn:de:0030-drops-152757}, doi = {10.4230/DagSemRep.395}, }
Feedback for Dagstuhl Publishing