Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/alenex/alenex2021.bht:"
@inproceedings{DBLP:conf/alenex/AndersS21, author = {Markus Anders and Pascal Schweitzer}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Engineering a Fast Probabilistic Isomorphism Test}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {73--84}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.6}, doi = {10.1137/1.9781611976472.6}, timestamp = {Wed, 17 Mar 2021 12:44:04 +0100}, biburl = {https://dblp.org/rec/conf/alenex/AndersS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/AngrimanBDGGM21, author = {Eugenio Angriman and Ruben Becker and Gianlorenzo D'Angelo and Hugo Gilbert and Alexander van der Grinten and Henning Meyerhenke}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {154--168}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.12}, doi = {10.1137/1.9781611976472.12}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/AngrimanBDGGM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/BarlowKN21, author = {Michael Barlow and Christian Konrad and Charana Nandasena}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Streaming Set Cover in Practice}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {181--192}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.14}, doi = {10.1137/1.9781611976472.14}, timestamp = {Tue, 28 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/BarlowKN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/BoffaFV21, author = {Antonio Boffa and Paolo Ferragina and Giorgio Vinciguerra}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {A "Learned" Approach to Quicken and Compress Rank/Select Dictionaries}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {46--59}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.4}, doi = {10.1137/1.9781611976472.4}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/BoffaFV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/BoucherCGHMNR21, author = {Christina Boucher and Ondrej Cvacho and Travis Gagie and Jan Holub and Giovanni Manzini and Gonzalo Navarro and Massimiliano Rossi}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {{PFP} Compressed Suffix Trees}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {60--72}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.5}, doi = {10.1137/1.9781611976472.5}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/BoucherCGHMNR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/BuchholdSW21, author = {Valentin Buchhold and Peter Sanders and Dorothea Wagner}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Fast, Exact and Scalable Dynamic Ridesharing}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {98--112}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.8}, doi = {10.1137/1.9781611976472.8}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/BuchholdSW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/GellnerLSSZ21, author = {Alexander Gellner and Sebastian Lamm and Christian Schulz and Darren Strash and Bogd{\'{a}}n Zav{\'{a}}lnij}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {128--142}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.10}, doi = {10.1137/1.9781611976472.10}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/GellnerLSSZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/GeorgiadisKLP21, author = {Loukas Georgiadis and Dionysios Kefallinos and Luigi Laura and Nikos Parotsidis}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {85--97}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.7}, doi = {10.1137/1.9781611976472.7}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/GeorgiadisKLP21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/GoranciHLSS21, author = {Gramoz Goranci and Monika Henzinger and Dariusz Leniowski and Christian Schulz and Alexander Svozil}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Fully Dynamic \emph{k}-Center Clustering in Low Dimensional Metrics}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {143--153}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.11}, doi = {10.1137/1.9781611976472.11}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/GoranciHLSS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/GottesburenHSS21, author = {Lars Gottesb{\"{u}}ren and Tobias Heuer and Peter Sanders and Sebastian Schlag}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Scalable Shared-Memory Hypergraph Partitioning}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {16--30}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.2}, doi = {10.1137/1.9781611976472.2}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/GottesburenHSS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/KerberR21, author = {Michael Kerber and Alexander Rolle}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Fast Minimal Presentations of Bi-graded Persistence Modules}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {207--220}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.16}, doi = {10.1137/1.9781611976472.16}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/KerberR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/MariaR21, author = {Cl{\'{e}}ment Maria and Owen Rouill{\'{e}}}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Computation of Large Asymptotics of 3-Manifold Quantum Invariants}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {193--206}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.15}, doi = {10.1137/1.9781611976472.15}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/MariaR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/OstSS21, author = {Wolfgang Ost and Christian Schulz and Darren Strash}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Engineering Data Reduction for Nested Dissection}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {113--127}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.9}, doi = {10.1137/1.9781611976472.9}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/OstSS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/PlachettaG21, author = {Rick Plachetta and Alexander van der Grinten}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by {SAT} Solving}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {169--180}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.13}, doi = {10.1137/1.9781611976472.13}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/PlachettaG21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/PoppSSS21, author = {Merten Popp and Sebastian Schlag and Christian Schulz and Daniel Seemaier}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Multilevel Acyclic Hypergraph Partitioning}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {1--15}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.1}, doi = {10.1137/1.9781611976472.1}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/PoppSSS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/alenex/WheatmanX21, author = {Brian Wheatman and Helen Xu}, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {A Parallel Packed Memory Array to Store Dynamic Graphs}, booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, pages = {31--45}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472.3}, doi = {10.1137/1.9781611976472.3}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/alenex/WheatmanX21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/alenex/2021, editor = {Martin Farach{-}Colton and Sabine Storandt}, title = {Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2021, Virtual Conference, January 10-11, 2021}, publisher = {{SIAM}}, year = {2021}, url = {https://doi.org/10.1137/1.9781611976472}, doi = {10.1137/1.9781611976472}, isbn = {978-1-61197-647-2}, timestamp = {Wed, 17 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/alenex/2021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.