Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Rajmohan Rajaraman, David Stalfa, and Sheng Yang. Scheduling Under Non-Uniform Job and Machine Delays. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 98:1-98:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{rajaraman_et_al:LIPIcs.ICALP.2023.98, author = {Rajaraman, Rajmohan and Stalfa, David and Yang, Sheng}, title = {{Scheduling Under Non-Uniform Job and Machine Delays}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {98:1--98:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel 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.2023.98}, URN = {urn:nbn:de:0030-drops-181502}, doi = {10.4230/LIPIcs.ICALP.2023.98}, annote = {Keywords: Scheduling, Approximation Algorithms, Precedence Constraints, Communication Delay, Non-Uniform Delays} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Erik D. Demaine, Adam C. Hesterberg, and Jason S. Ku. Finding Closed Quasigeodesics on Convex Polyhedra. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 33:1-33:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{demaine_et_al:LIPIcs.SoCG.2020.33, author = {Demaine, Erik D. and Hesterberg, Adam C. and Ku, Jason S.}, title = {{Finding Closed Quasigeodesics on Convex Polyhedra}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {33:1--33:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.33}, URN = {urn:nbn:de:0030-drops-121912}, doi = {10.4230/LIPIcs.SoCG.2020.33}, annote = {Keywords: polyhedra, geodesic, pseudopolynomial, geometric precision} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Hugo A. Akitaya, Matthew D. Jones, David Stalfa, and Csaba D. Tóth. Maximum Area Axis-Aligned Square Packings. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 77:1-77:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{akitaya_et_al:LIPIcs.MFCS.2018.77, author = {Akitaya, Hugo A. and Jones, Matthew D. and Stalfa, David and T\'{o}th, Csaba D.}, title = {{Maximum Area Axis-Aligned Square Packings}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {77:1--77:15}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.77}, URN = {urn:nbn:de:0030-drops-96594}, doi = {10.4230/LIPIcs.MFCS.2018.77}, annote = {Keywords: square packing, geometric optimization} }
Feedback for Dagstuhl Publishing