Published in: LIPIcs, Volume 318, 31st International Symposium on Temporal Representation and Reasoning (TIME 2024)
Luke Hunsberger and Roberto Posenato. A Faster Algorithm for Finding Negative Cycles in Simple Temporal Networks with Uncertainty. In 31st International Symposium on Temporal Representation and Reasoning (TIME 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 318, pp. 9:1-9:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hunsberger_et_al:LIPIcs.TIME.2024.9, author = {Hunsberger, Luke and Posenato, Roberto}, title = {{A Faster Algorithm for Finding Negative Cycles in Simple Temporal Networks with Uncertainty}}, booktitle = {31st International Symposium on Temporal Representation and Reasoning (TIME 2024)}, pages = {9:1--9:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-349-2}, ISSN = {1868-8969}, year = {2024}, volume = {318}, editor = {Sala, Pietro and Sioutis, Michael and Wang, Fusheng}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2024.9}, URN = {urn:nbn:de:0030-drops-212160}, doi = {10.4230/LIPIcs.TIME.2024.9}, annote = {Keywords: Temporal constraint networks, overconstrained networks, negative cycles} }
Published in: LIPIcs, Volume 318, 31st International Symposium on Temporal Representation and Reasoning (TIME 2024)
Giorgio Lazzarinetti, Sara Manzoni, Italo Zoppis, and Riccardo Dondi. FastMinTC+: A Fast and Effective Heuristic for Minimum Timeline Cover on Temporal Networks. In 31st International Symposium on Temporal Representation and Reasoning (TIME 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 318, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{lazzarinetti_et_al:LIPIcs.TIME.2024.20, author = {Lazzarinetti, Giorgio and Manzoni, Sara and Zoppis, Italo and Dondi, Riccardo}, title = {{FastMinTC+: A Fast and Effective Heuristic for Minimum Timeline Cover on Temporal Networks}}, booktitle = {31st International Symposium on Temporal Representation and Reasoning (TIME 2024)}, pages = {20:1--20:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-349-2}, ISSN = {1868-8969}, year = {2024}, volume = {318}, editor = {Sala, Pietro and Sioutis, Michael and Wang, Fusheng}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2024.20}, URN = {urn:nbn:de:0030-drops-212275}, doi = {10.4230/LIPIcs.TIME.2024.20}, annote = {Keywords: Temporal Networks, Activity Timeline, Timeline Cover, Vertex Cover, Optimization, Heuristic} }
Published in: OASIcs, Volume 123, 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)
Felix Prause and Ralf Borndörfer. A Bayesian Rolling Horizon Approach for Rolling Stock Rotation Planning with Predictive Maintenance. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024). Open Access Series in Informatics (OASIcs), Volume 123, pp. 13:1-13:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{prause_et_al:OASIcs.ATMOS.2024.13, author = {Prause, Felix and Bornd\"{o}rfer, Ralf}, title = {{A Bayesian Rolling Horizon Approach for Rolling Stock Rotation Planning with Predictive Maintenance}}, booktitle = {24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024)}, pages = {13:1--13:19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-350-8}, ISSN = {2190-6807}, year = {2024}, volume = {123}, editor = {Bouman, Paul C. and Kontogiannis, Spyros C.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2024.13}, URN = {urn:nbn:de:0030-drops-212013}, doi = {10.4230/OASIcs.ATMOS.2024.13}, annote = {Keywords: Rolling stock rotation planning, Predictive maintenance, Rolling horizon approach, Bayesian inference, Local neighborhood search} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Sally Dong and Guanghao Ye. Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 49:1-49:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dong_et_al:LIPIcs.ESA.2024.49, author = {Dong, Sally and Ye, Guanghao}, title = {{Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {49:1--49:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.49}, URN = {urn:nbn:de:0030-drops-211207}, doi = {10.4230/LIPIcs.ESA.2024.49}, annote = {Keywords: Min-cost flow, tree decomposition, interior point method, bounded treewidth graphs} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Lars Gottesbüren, Nikos Parotsidis, and Maximilian Probst Gutenberg. Practical Expander Decomposition. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 61:1-61:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{gottesburen_et_al:LIPIcs.ESA.2024.61, author = {Gottesb\"{u}ren, Lars and Parotsidis, Nikos and Gutenberg, Maximilian Probst}, title = {{Practical Expander Decomposition}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {61:1--61:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.61}, URN = {urn:nbn:de:0030-drops-211323}, doi = {10.4230/LIPIcs.ESA.2024.61}, annote = {Keywords: Expander Decomposition, Clustering, Graph Algorithms} }
Published in: LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024)
Rajmohan Rajaraman and Omer Wasim. Competitive Capacitated Online Recoloring. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 95:1-95:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{rajaraman_et_al:LIPIcs.ESA.2024.95, author = {Rajaraman, Rajmohan and Wasim, Omer}, title = {{Competitive Capacitated Online Recoloring}}, booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)}, pages = {95:1--95:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-338-6}, ISSN = {1868-8969}, year = {2024}, volume = {308}, editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.95}, URN = {urn:nbn:de:0030-drops-211666}, doi = {10.4230/LIPIcs.ESA.2024.95}, annote = {Keywords: online algorithms, competitive ratio, recoloring, resource augmentation} }
Published in: LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)
Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, and Weihao Zhu. On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 9:1-9:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chandrasekaran_et_al:LIPIcs.APPROX/RANDOM.2024.9, author = {Chandrasekaran, Karthekeyan and Chekuri, Chandra and Torres, Manuel R. and Zhu, Weihao}, title = {{On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)}, pages = {9:1--9:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-348-5}, ISSN = {1868-8969}, year = {2024}, volume = {317}, editor = {Kumar, Amit and Ron-Zewi, Noga}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.9}, URN = {urn:nbn:de:0030-drops-210025}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.9}, annote = {Keywords: Densest subgraph problem, Hardness of approximation, Approximation algorithms} }
Published in: LIPIcs, Volume 317, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)
Diba Hashemi and Weronika Wrzos-Kaminska. Weighted Matching in the Random-Order Streaming and Robust Communication Models. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 317, pp. 16:1-16:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hashemi_et_al:LIPIcs.APPROX/RANDOM.2024.16, author = {Hashemi, Diba and Wrzos-Kaminska, Weronika}, title = {{Weighted Matching in the Random-Order Streaming and Robust Communication Models}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)}, pages = {16:1--16:26}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-348-5}, ISSN = {1868-8969}, year = {2024}, volume = {317}, editor = {Kumar, Amit and Ron-Zewi, Noga}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.16}, URN = {urn:nbn:de:0030-drops-210097}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.16}, annote = {Keywords: Maximum Weight Matching, Streaming, Random-Order Streaming, Robust Communication Complexity} }
Published in: LIPIcs, Volume 316, 6th Conference on Advances in Financial Technologies (AFT 2024)
Rundong Gan, Liyi Zhou, Le Wang, Kaihua Qin, and Xiaodong Lin. DeFiAligner: Leveraging Symbolic Analysis and Large Language Models for Inconsistency Detection in Decentralized Finance. In 6th Conference on Advances in Financial Technologies (AFT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 316, pp. 7:1-7:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{gan_et_al:LIPIcs.AFT.2024.7, author = {Gan, Rundong and Zhou, Liyi and Wang, Le and Qin, Kaihua and Lin, Xiaodong}, title = {{DeFiAligner: Leveraging Symbolic Analysis and Large Language Models for Inconsistency Detection in Decentralized Finance}}, booktitle = {6th Conference on Advances in Financial Technologies (AFT 2024)}, pages = {7:1--7:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-345-4}, ISSN = {1868-8969}, year = {2024}, volume = {316}, editor = {B\"{o}hme, Rainer and Kiffer, Lucianna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AFT.2024.7}, URN = {urn:nbn:de:0030-drops-209431}, doi = {10.4230/LIPIcs.AFT.2024.7}, annote = {Keywords: Decentralized Finance Security, Large Language Models, Project Review, Symbolic Analysis, Smart Contracts} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Steven Arzt, Marc Miltenberger, and Julius Näumann. Dynamically Generating Callback Summaries for Enhancing Static Analysis. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 4:1-4:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{arzt_et_al:LIPIcs.ECOOP.2024.4, author = {Arzt, Steven and Miltenberger, Marc and N\"{a}umann, Julius}, title = {{Dynamically Generating Callback Summaries for Enhancing Static Analysis}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {4:1--4:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.4}, URN = {urn:nbn:de:0030-drops-208533}, doi = {10.4230/LIPIcs.ECOOP.2024.4}, annote = {Keywords: dynamic analysis, callback detection, java, android} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Felix Berlakovich and Stefan Brunthaler. Cross Module Quickening - The Curious Case of C Extensions. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 6:1-6:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{berlakovich_et_al:LIPIcs.ECOOP.2024.6, author = {Berlakovich, Felix and Brunthaler, Stefan}, title = {{Cross Module Quickening - The Curious Case of C Extensions}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {6:1--6:29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.6}, URN = {urn:nbn:de:0030-drops-208557}, doi = {10.4230/LIPIcs.ECOOP.2024.6}, annote = {Keywords: interpreter, optimizations, C extensions, Python} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Matthias Bernad and Stefan Brunthaler. HOBBIT: Hashed OBject Based InTegrity. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 7:1-7:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bernad_et_al:LIPIcs.ECOOP.2024.7, author = {Bernad, Matthias and Brunthaler, Stefan}, title = {{HOBBIT: Hashed OBject Based InTegrity}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {7:1--7:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.7}, URN = {urn:nbn:de:0030-drops-208566}, doi = {10.4230/LIPIcs.ECOOP.2024.7}, annote = {Keywords: software security, code-reuse attacks, language-based security, counterfeit-object-oriented programming, object integrity, compiler security} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Mohammad Wahiduzzaman Khan, Sheng Chen, and Yi He. Learning Gradual Typing Performance. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 21:1-21:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{khan_et_al:LIPIcs.ECOOP.2024.21, author = {Khan, Mohammad Wahiduzzaman and Chen, Sheng and He, Yi}, title = {{Learning Gradual Typing Performance}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {21:1--21:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.21}, URN = {urn:nbn:de:0030-drops-208706}, doi = {10.4230/LIPIcs.ECOOP.2024.21}, annote = {Keywords: Gradual typing performance, type migration, performance prediction, machine learning} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Senxi Li, Tetsuro Yamazaki, and Shigeru Chiba. InferType: A Compiler Toolkit for Implementing Efficient Constraint-Based Type Inference. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 23:1-23:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{li_et_al:LIPIcs.ECOOP.2024.23, author = {Li, Senxi and Yamazaki, Tetsuro and Chiba, Shigeru}, title = {{InferType: A Compiler Toolkit for Implementing Efficient Constraint-Based Type Inference}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {23:1--23:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.23}, URN = {urn:nbn:de:0030-drops-208728}, doi = {10.4230/LIPIcs.ECOOP.2024.23}, annote = {Keywords: Domain Specific Languages, Compilation, Static Analysis, Type Inference, Constraint Solving, SMT Solver} }
Published in: LIPIcs, Volume 313, 38th European Conference on Object-Oriented Programming (ECOOP 2024)
Liyi Li, Mingwei Zhu, Rance Cleaveland, Alexander Nicolellis, Yi Lee, Le Chang, and Xiaodi Wu. Qafny: A Quantum-Program Verifier. In 38th European Conference on Object-Oriented Programming (ECOOP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 313, pp. 24:1-24:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{li_et_al:LIPIcs.ECOOP.2024.24, author = {Li, Liyi and Zhu, Mingwei and Cleaveland, Rance and Nicolellis, Alexander and Lee, Yi and Chang, Le and Wu, Xiaodi}, title = {{Qafny: A Quantum-Program Verifier}}, booktitle = {38th European Conference on Object-Oriented Programming (ECOOP 2024)}, pages = {24:1--24:31}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-341-6}, ISSN = {1868-8969}, year = {2024}, volume = {313}, editor = {Aldrich, Jonathan and Salvaneschi, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2024.24}, URN = {urn:nbn:de:0030-drops-208735}, doi = {10.4230/LIPIcs.ECOOP.2024.24}, annote = {Keywords: Quantum Computing, Automated Verification, Separation Logic} }
Feedback for Dagstuhl Publishing