Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Enze Sun, Zonghan Yang, and Yuhao Zhang. Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 97:1-97:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{sun_et_al:LIPIcs.ESA.2023.97, author = {Sun, Enze and Yang, Zonghan and Zhang, Yuhao}, title = {{Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {97:1--97:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.97}, URN = {urn:nbn:de:0030-drops-187500}, doi = {10.4230/LIPIcs.ESA.2023.97}, annote = {Keywords: Online Algorithm, Scheduling, Machine Minimization, Rent Minimization} }
Published in: LIPIcs, Volume 222, 36th European Conference on Object-Oriented Programming (ECOOP 2022)
Jinxu Zhao and Bruno C. d. S. Oliveira. Elementary Type Inference. In 36th European Conference on Object-Oriented Programming (ECOOP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 222, pp. 2:1-2:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{zhao_et_al:LIPIcs.ECOOP.2022.2, author = {Zhao, Jinxu and Oliveira, Bruno C. d. S.}, title = {{Elementary Type Inference}}, booktitle = {36th European Conference on Object-Oriented Programming (ECOOP 2022)}, pages = {2:1--2:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-225-9}, ISSN = {1868-8969}, year = {2022}, volume = {222}, editor = {Ali, Karim and Vitek, Jan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2022.2}, URN = {urn:nbn:de:0030-drops-162303}, doi = {10.4230/LIPIcs.ECOOP.2022.2}, annote = {Keywords: Type Inference} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin, and Man Ting Wong. A Generalization of Self-Improving Algorithms. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 29:1-29:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cheng_et_al:LIPIcs.SoCG.2020.29, author = {Cheng, Siu-Wing and Chiu, Man-Kwun and Jin, Kai and Wong, Man Ting}, title = {{A Generalization of Self-Improving Algorithms}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {29:1--29: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.29}, URN = {urn:nbn:de:0030-drops-121873}, doi = {10.4230/LIPIcs.SoCG.2020.29}, annote = {Keywords: expected running time, entropy, sorting, Delaunay triangulation} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Siu-Wing Cheng and Man-Kit Lau. Dynamic Distribution-Sensitive Point Location. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 30:1-30:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cheng_et_al:LIPIcs.SoCG.2020.30, author = {Cheng, Siu-Wing and Lau, Man-Kit}, title = {{Dynamic Distribution-Sensitive Point Location}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {30:1--30: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.30}, URN = {urn:nbn:de:0030-drops-121882}, doi = {10.4230/LIPIcs.SoCG.2020.30}, annote = {Keywords: dynamic planar point location, convex subdivision, linear decision tree} }
Published in: LIPIcs, Volume 155, 23rd International Conference on Database Theory (ICDT 2020)
Yu Chen and Ke Yi. Random Sampling and Size Estimation Over Cyclic Joins. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chen_et_al:LIPIcs.ICDT.2020.7, author = {Chen, Yu and Yi, Ke}, title = {{Random Sampling and Size Estimation Over Cyclic Joins}}, booktitle = {23rd International Conference on Database Theory (ICDT 2020)}, pages = {7:1--7:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-139-9}, ISSN = {1868-8969}, year = {2020}, volume = {155}, editor = {Lutz, Carsten and Jung, Jean Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2020.7}, URN = {urn:nbn:de:0030-drops-119315}, doi = {10.4230/LIPIcs.ICDT.2020.7}, annote = {Keywords: Random sampling, joins, join size estimation} }
Published in: LIPIcs, Volume 143, 19th International Workshop on Algorithms in Bioinformatics (WABI 2019)
Kohei Yamada, Zhi-Zhong Chen, and Lusheng Wang. Better Practical Algorithms for rSPR Distance and Hybridization Number. In 19th International Workshop on Algorithms in Bioinformatics (WABI 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 143, pp. 5:1-5:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{yamada_et_al:LIPIcs.WABI.2019.5, author = {Yamada, Kohei and Chen, Zhi-Zhong and Wang, Lusheng}, title = {{Better Practical Algorithms for rSPR Distance and Hybridization Number}}, booktitle = {19th International Workshop on Algorithms in Bioinformatics (WABI 2019)}, pages = {5:1--5:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-123-8}, ISSN = {1868-8969}, year = {2019}, volume = {143}, editor = {Huber, Katharina T. and Gusfield, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2019.5}, URN = {urn:nbn:de:0030-drops-110355}, doi = {10.4230/LIPIcs.WABI.2019.5}, annote = {Keywords: phylogenetic tree, fixed-parameter algorithms, approximation algorithms, Monte Carlo tree search} }
Published in: LIPIcs, Volume 133, 31st Euromicro Conference on Real-Time Systems (ECRTS 2019)
Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, and Georg von der Brüggen. Scheduling Self-Suspending Tasks: New and Old Results. In 31st Euromicro Conference on Real-Time Systems (ECRTS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 133, pp. 16:1-16:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.ECRTS.2019.16, author = {Chen, Jian-Jia and Hahn, Tobias and Hoeksma, Ruben and Megow, Nicole and von der Br\"{u}ggen, Georg}, title = {{Scheduling Self-Suspending Tasks: New and Old Results}}, booktitle = {31st Euromicro Conference on Real-Time Systems (ECRTS 2019)}, pages = {16:1--16:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-110-8}, ISSN = {1868-8969}, year = {2019}, volume = {133}, editor = {Quinton, Sophie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2019.16}, URN = {urn:nbn:de:0030-drops-107532}, doi = {10.4230/LIPIcs.ECRTS.2019.16}, annote = {Keywords: Self-suspension, master-slave problem, computational complexity, speedup factors} }
Published in: LIPIcs, Volume 116, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang. Online Makespan Minimization: The Power of Restart. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 14:1-14:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{huang_et_al:LIPIcs.APPROX-RANDOM.2018.14, author = {Huang, Zhiyi and Kang, Ning and Tang, Zhihao Gavin and Wu, Xiaowei and Zhang, Yuhao}, title = {{Online Makespan Minimization: The Power of Restart}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {14:1--14:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-085-9}, ISSN = {1868-8969}, year = {2018}, volume = {116}, editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.14}, URN = {urn:nbn:de:0030-drops-94182}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.14}, annote = {Keywords: Online Scheduling, Makespan Minimization, Identical Machines} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Di Chen and Mordecai Golin. Sink Evacuation on Trees with Dynamic Confluent Flows. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 25:1-25:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2016.25, author = {Chen, Di and Golin, Mordecai}, title = {{Sink Evacuation on Trees with Dynamic Confluent Flows}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {25:1--25: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.25}, URN = {urn:nbn:de:0030-drops-67951}, doi = {10.4230/LIPIcs.ISAAC.2016.25}, annote = {Keywords: Sink Evacuation, Dynamic Flow, Facility Location, Parametric Search} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Lijie Chen. Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 26:1-26:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{chen:LIPIcs.ISAAC.2016.26, author = {Chen, Lijie}, title = {{Adaptivity vs. Postselection, and Hardness Amplification for Polynomial Approximation}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {26:1--26:12}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.26}, URN = {urn:nbn:de:0030-drops-67960}, doi = {10.4230/LIPIcs.ISAAC.2016.26}, annote = {Keywords: approximate degree, postselection, hardness amplification, adaptivity} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Te-Li Wang, Chih-Kuan Yeh, and Ho-Lin Chen. An Improved Tax Scheme for Selfish Routing. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 61:1-61:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{wang_et_al:LIPIcs.ISAAC.2016.61, author = {Wang, Te-Li and Yeh, Chih-Kuan and Chen, Ho-Lin}, title = {{An Improved Tax Scheme for Selfish Routing}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {61:1--61:12}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.61}, URN = {urn:nbn:de:0030-drops-68308}, doi = {10.4230/LIPIcs.ISAAC.2016.61}, annote = {Keywords: selfish routing, price of anarchy, tax} }
Published in: Dagstuhl Seminar Proceedings, Volume 9181, Sampling-based Optimization in the Presence of Uncertainty (2009)
Chun-Hung Chen, Liu Hong, Paul B. Kantor, David P. Morton, Juta Pichitlamken, and Matthias Seeger. 09181 Working Group on Hybridization between R&S, DoE and Optimization. In Sampling-based Optimization in the Presence of Uncertainty. Dagstuhl Seminar Proceedings, Volume 9181, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{chen_et_al:DagSemProc.09181.3, author = {Chen, Chun-Hung and Hong, Liu and Kantor, Paul B. and Morton, David P. and Pichitlamken, Juta and Seeger, Matthias}, title = {{09181 Working Group on Hybridization between R\&S, DoE and Optimization}}, booktitle = {Sampling-based Optimization in the Presence of Uncertainty}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9181}, editor = {J\"{u}rgen Branke and Barry L. Nelson and Warren Buckler Powell and Thomas J. Santner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09181.3}, URN = {urn:nbn:de:0030-drops-21172}, doi = {10.4230/DagSemProc.09181.3}, annote = {Keywords: } }
Published in: Dagstuhl Seminar Proceedings, Volume 8043, Perspectives Workshop: Telecommunication Economics (2008)
Heikki Hammainen, Hong Chen, Aiko Pras, George Huitema, Martin Waldburger, David Hausheer, Panayotis Antoniadis, Peter Reichl, Jerzy Kubasik, and Burkhard Stiller. 08043 Summary – Perspectives Workshop: Telecommunication Economics. In Perspectives Workshop: Telecommunication Economics. Dagstuhl Seminar Proceedings, Volume 8043, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{hammainen_et_al:DagSemProc.08043.1, author = {Hammainen, Heikki and Chen, Hong and Pras, Aiko and Huitema, George and Waldburger, Martin and Hausheer, David and Antoniadis, Panayotis and Reichl, Peter and Kubasik, Jerzy and Stiller, Burkhard}, title = {{08043 Summary – Perspectives Workshop: Telecommunication Economics}}, booktitle = {Perspectives Workshop: Telecommunication Economics}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8043}, editor = {Burkhard Stiller}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08043.1}, URN = {urn:nbn:de:0030-drops-14900}, doi = {10.4230/DagSemProc.08043.1}, annote = {Keywords: Telecommunication and Internet Services, Tariffing and Pricing, Personalization, Incentives, Value Chain, Accounting, Contracts and Legal Domains, Quality-of-Experience, Dynamic Business, and Competition} }
Feedback for Dagstuhl Publishing