LIPIcs, Volume 103
SEA 2018, June 27-29, 2018, L'Aquila, Italy
Editors: Gianlorenzo D'Angelo
OASIcs, Volume 59
ATMOS 2017, September 7-8, 2017, Vienna, Austria
Editors: Gianlorenzo D'Angelo and Twan Dollevoet
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Gianlorenzo D'Angelo, Esmaeil Delfaraz, and Hugo Gilbert. Budgeted Out-Tree Maximization with Submodular Prizes. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 9:1-9:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{dangelo_et_al:LIPIcs.ISAAC.2022.9, author = {D'Angelo, Gianlorenzo and Delfaraz, Esmaeil and Gilbert, Hugo}, title = {{Budgeted Out-Tree Maximization with Submodular Prizes}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {9:1--9:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.9}, URN = {urn:nbn:de:0030-drops-172945}, doi = {10.4230/LIPIcs.ISAAC.2022.9}, annote = {Keywords: Prize Collecting Steiner Tree, Directed graphs, Approximation Algorithms, Budgeted Problem} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, and Mirko Rossi. Sparse Temporal Spanners with Low Stretch. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 19:1-19:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bilo_et_al:LIPIcs.ESA.2022.19, author = {Bil\`{o}, Davide and D'Angelo, Gianlorenzo and Gual\`{a}, Luciano and Leucci, Stefano and Rossi, Mirko}, title = {{Sparse Temporal Spanners with Low Stretch}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {19:1--19: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.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.19}, URN = {urn:nbn:de:0030-drops-169575}, doi = {10.4230/LIPIcs.ESA.2022.19}, annote = {Keywords: temporal spanners, temporal graphs, graph sparsification, approximate distances} }
Published in: LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Guido Proietti, and Mirko Rossi. Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 219, pp. 12:1-12:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bilo_et_al:LIPIcs.STACS.2022.12, author = {Bil\`{o}, Davide and D'Angelo, Gianlorenzo and Gual\`{a}, Luciano and Leucci, Stefano and Proietti, Guido and Rossi, Mirko}, title = {{Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers}}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)}, pages = {12:1--12:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-222-8}, ISSN = {1868-8969}, year = {2022}, volume = {219}, editor = {Berenbrink, Petra and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.12}, URN = {urn:nbn:de:0030-drops-158221}, doi = {10.4230/LIPIcs.STACS.2022.12}, annote = {Keywords: multipath spanners, graph sparsification, edge-disjoint paths, min-cost flow} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Gianlorenzo D'Angelo, Debashmita Poddar, and Cosimo Vinci. Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 59:1-59:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{dangelo_et_al:LIPIcs.ICALP.2021.59, author = {D'Angelo, Gianlorenzo and Poddar, Debashmita and Vinci, Cosimo}, title = {{Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {59:1--59:19}, 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.59}, URN = {urn:nbn:de:0030-drops-141282}, doi = {10.4230/LIPIcs.ICALP.2021.59}, annote = {Keywords: Adaptive Optimization, Influence Maximization, Submodular Optimization, Stochastic Optimization} }
Published in: LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019)
Pierluigi Crescenzi, Pierre Fraigniaud, and Ami Paz. Trade-Offs in Distributed Interactive Proofs. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 13:1-13:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{crescenzi_et_al:LIPIcs.DISC.2019.13, author = {Crescenzi, Pierluigi and Fraigniaud, Pierre and Paz, Ami}, title = {{Trade-Offs in Distributed Interactive Proofs}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {13:1--13:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.13}, URN = {urn:nbn:de:0030-drops-113202}, doi = {10.4230/LIPIcs.DISC.2019.13}, annote = {Keywords: Distributed interactive proofs, Distributed verification} }
Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Francesco Cellinese, Gianlorenzo D'Angelo, Gianpiero Monaco, and Yllka Velaj. Generalized Budgeted Submodular Set Function Maximization. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 31:1-31:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{cellinese_et_al:LIPIcs.MFCS.2018.31, author = {Cellinese, Francesco and D'Angelo, Gianlorenzo and Monaco, Gianpiero and Velaj, Yllka}, title = {{Generalized Budgeted Submodular Set Function Maximization}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {31:1--31:14}, 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.31}, URN = {urn:nbn:de:0030-drops-96138}, doi = {10.4230/LIPIcs.MFCS.2018.31}, annote = {Keywords: Submodular set function, Approximation algorithms, Budgeted Maximum Coverage} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Gianlorenzo D'Angelo. LIPIcs, Volume 103, SEA'18, Complete Volume. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@Proceedings{dangelo:LIPIcs.SEA.2018, title = {{LIPIcs, Volume 103, SEA'18, Complete Volume}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018}, URN = {urn:nbn:de:0030-drops-92438}, doi = {10.4230/LIPIcs.SEA.2018}, annote = {Keywords: Theory of computation, Design and analysis of algorithms} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Gianlorenzo D'Angelo. Front Matter, Table of Contents, Preface, Conference Organization. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 0:i-0:xi, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{dangelo:LIPIcs.SEA.2018.0, author = {D'Angelo, Gianlorenzo}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {0:i--0:xi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.0}, URN = {urn:nbn:de:0030-drops-89357}, doi = {10.4230/LIPIcs.SEA.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Tobias Heuer, Peter Sanders, and Sebastian Schlag. Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 1:1-1:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{heuer_et_al:LIPIcs.SEA.2018.1, author = {Heuer, Tobias and Sanders, Peter and Schlag, Sebastian}, title = {{Network Flow-Based Refinement for Multilevel Hypergraph Partitioning}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {1:1--1:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.1}, URN = {urn:nbn:de:0030-drops-89368}, doi = {10.4230/LIPIcs.SEA.2018.1}, annote = {Keywords: Multilevel Hypergraph Partitioning, Network Flows, Refinement} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Ruslan Shaydulin and Ilya Safro. Aggregative Coarsening for Multilevel Hypergraph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 2:1-2:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{shaydulin_et_al:LIPIcs.SEA.2018.2, author = {Shaydulin, Ruslan and Safro, Ilya}, title = {{Aggregative Coarsening for Multilevel Hypergraph Partitioning}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {2:1--2:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.2}, URN = {urn:nbn:de:0030-drops-89371}, doi = {10.4230/LIPIcs.SEA.2018.2}, annote = {Keywords: hypergraph partitioning, multilevel algorithms, coarsening, matching, combinatorial scientific computing} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Sonja Biedermann, Monika Henzinger, Christian Schulz, and Bernhard Schuster. Memetic Graph Clustering. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 3:1-3:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{biedermann_et_al:LIPIcs.SEA.2018.3, author = {Biedermann, Sonja and Henzinger, Monika and Schulz, Christian and Schuster, Bernhard}, title = {{Memetic Graph Clustering}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.3}, URN = {urn:nbn:de:0030-drops-89389}, doi = {10.4230/LIPIcs.SEA.2018.3}, annote = {Keywords: Graph Clustering, Evolutionary Algorithms} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Alexandra Henzinger, Alexander Noe, and Christian Schulz. ILP-based Local Search for Graph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 4:1-4:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{henzinger_et_al:LIPIcs.SEA.2018.4, author = {Henzinger, Alexandra and Noe, Alexander and Schulz, Christian}, title = {{ILP-based Local Search for Graph Partitioning}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {4:1--4:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.4}, URN = {urn:nbn:de:0030-drops-89399}, doi = {10.4230/LIPIcs.SEA.2018.4}, annote = {Keywords: Graph Partitioning, Integer Linear Programming} }
Published in: LIPIcs, Volume 103, 17th International Symposium on Experimental Algorithms (SEA 2018)
Kosuke Matsumoto, Kohei Hatano, and Eiji Takimoto. Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 5:1-5:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{matsumoto_et_al:LIPIcs.SEA.2018.5, author = {Matsumoto, Kosuke and Hatano, Kohei and Takimoto, Eiji}, title = {{Decision Diagrams for Solving a Job Scheduling Problem Under Precedence Constraints}}, booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)}, pages = {5:1--5:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-070-5}, ISSN = {1868-8969}, year = {2018}, volume = {103}, editor = {D'Angelo, Gianlorenzo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2018.5}, URN = {urn:nbn:de:0030-drops-89402}, doi = {10.4230/LIPIcs.SEA.2018.5}, annote = {Keywords: decision diagram, permutation, scheduling, NP-hardness, precedence constraints, MDD} }
Feedback for Dagstuhl Publishing