Published in: LIPIcs, Volume 301, 22nd International Symposium on Experimental Algorithms (SEA 2024)
Christoph Staudt, Mark Blacher, Julien Klaus, Farin Lippmann, and Joachim Giesen. Improved Cut Strategy for Tensor Network Contraction Orders. In 22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 27:1-27:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{staudt_et_al:LIPIcs.SEA.2024.27, author = {Staudt, Christoph and Blacher, Mark and Klaus, Julien and Lippmann, Farin and Giesen, Joachim}, title = {{Improved Cut Strategy for Tensor Network Contraction Orders}}, booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)}, pages = {27:1--27:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-325-6}, ISSN = {1868-8969}, year = {2024}, volume = {301}, editor = {Liberti, Leo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.27}, URN = {urn:nbn:de:0030-drops-203924}, doi = {10.4230/LIPIcs.SEA.2024.27}, annote = {Keywords: tensor network, contraction order, graph partitioniong, quantum simulation} }
Published in: LIPIcs, Volume 298, 36th Euromicro Conference on Real-Time Systems (ECRTS 2024)
Daniele Ottaviano, Francesco Ciraolo, Renato Mancuso, and Marcello Cinque. The Omnivisor: A Real-Time Static Partitioning Hypervisor Extension for Heterogeneous Core Virtualization over MPSoCs. In 36th Euromicro Conference on Real-Time Systems (ECRTS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 298, pp. 7:1-7:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{ottaviano_et_al:LIPIcs.ECRTS.2024.7, author = {Ottaviano, Daniele and Ciraolo, Francesco and Mancuso, Renato and Cinque, Marcello}, title = {{The Omnivisor: A Real-Time Static Partitioning Hypervisor Extension for Heterogeneous Core Virtualization over MPSoCs}}, booktitle = {36th Euromicro Conference on Real-Time Systems (ECRTS 2024)}, pages = {7:1--7:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-324-9}, ISSN = {1868-8969}, year = {2024}, volume = {298}, editor = {Pellizzoni, Rodolfo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2024.7}, URN = {urn:nbn:de:0030-drops-203107}, doi = {10.4230/LIPIcs.ECRTS.2024.7}, annote = {Keywords: Mixed-Criticality, Embedded Virtualization, Real-Time Systems, MPSoCs} }
Published in: TGDK, Volume 2, Issue 1 (2024): Special Issue on Trends in Graph Data and Knowledge - Part 2. Transactions on Graph Data and Knowledge, Volume 2, Issue 1
Ansgar Scherp, Gerd Groener, Petr Škoda, Katja Hose, and Maria-Esther Vidal. Semantic Web: Past, Present, and Future. In Special Issue on Trends in Graph Data and Knowledge - Part 2. Transactions on Graph Data and Knowledge (TGDK), Volume 2, Issue 1, pp. 3:1-3:37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{scherp_et_al:TGDK.2.1.3, author = {Scherp, Ansgar and Groener, Gerd and \v{S}koda, Petr and Hose, Katja and Vidal, Maria-Esther}, title = {{Semantic Web: Past, Present, and Future}}, journal = {Transactions on Graph Data and Knowledge}, pages = {3:1--3:37}, ISSN = {2942-7517}, year = {2024}, volume = {2}, number = {1}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/TGDK.2.1.3}, URN = {urn:nbn:de:0030-drops-198607}, doi = {10.4230/TGDK.2.1.3}, annote = {Keywords: Linked Open Data, Semantic Web Graphs, Knowledge Graphs} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Marcin Bienkowski, Artur Kraska, and Hsiang-Hsuan Liu. Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 28:1-28:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bienkowski_et_al:LIPIcs.ICALP.2021.28, author = {Bienkowski, Marcin and Kraska, Artur and Liu, Hsiang-Hsuan}, title = {{Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {28:1--28:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela 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.ICALP.2021.28}, URN = {urn:nbn:de:0030-drops-140977}, doi = {10.4230/LIPIcs.ICALP.2021.28}, annote = {Keywords: traveling repairperson problem, dial-a-ride, machine scheduling, unrelated machines, minimizing completion time, competitive analysis, factor-revealing LP} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Marcin Bienkowski and Hsiang-Hsuan Liu. An Improved Online Algorithm for the Traveling Repairperson Problem on a Line. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 6:1-6:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bienkowski_et_al:LIPIcs.MFCS.2019.6, author = {Bienkowski, Marcin and Liu, Hsiang-Hsuan}, title = {{An Improved Online Algorithm for the Traveling Repairperson Problem on a Line}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {6:1--6:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.6}, URN = {urn:nbn:de:0030-drops-109503}, doi = {10.4230/LIPIcs.MFCS.2019.6}, annote = {Keywords: traveling repairperson problem, competitive analysis, minimizing completion time, factor-revealing LP} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Fu-Hong Liu, Hsiang-Hsuan Liu, and Prudence W. H. Wong. Optimal Nonpreemptive Scheduling in a Smart Grid Model. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 53:1-53:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{liu_et_al:LIPIcs.ISAAC.2016.53, author = {Liu, Fu-Hong and Liu, Hsiang-Hsuan and Wong, Prudence W. H.}, title = {{Optimal Nonpreemptive Scheduling in a Smart Grid Model}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {53:1--53:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.53}, URN = {urn:nbn:de:0030-drops-68252}, doi = {10.4230/LIPIcs.ISAAC.2016.53}, annote = {Keywords: Scheduling, Smart Grid, Convex function cost, Fixed parameter tractable, Online algorithms, Non-preemptive} }