Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/alenex/alenex2018.bht:"
download as .bib file
@inproceedings{DBLP:conf/alenex/0001KL18,
author = {Johannes Fischer and
Florian Kurpicz and
Marvin L{\"{o}}bel},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Simple, Fast and Lightweight Parallel Wavelet Tree Construction},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {9--20},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.2},
doi = {10.1137/1.9781611975055.2},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/0001KL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/AndersenM18,
author = {Jakob L. Andersen and
Daniel Merkle},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {A Generic Framework for Engineering Graph Canonization Algorithms},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {139--153},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.13},
doi = {10.1137/1.9781611975055.13},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/AndersenM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/ArgeST18,
author = {Lars Arge and
Yujin Shin and
Constantinos Tsirogiannis},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Computing Floods Caused by Non-Uniform Sea-Level Rise},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {97--108},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.9},
doi = {10.1137/1.9781611975055.9},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/ArgeST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BergaminiGM18,
author = {Elisabetta Bergamini and
Tanya Gonser and
Henning Meyerhenke},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Scaling up Group Closeness Maximization},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {209--222},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.18},
doi = {10.1137/1.9781611975055.18},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/BergaminiGM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BiseniusBAM18,
author = {Patrick Bisenius and
Elisabetta Bergamini and
Eugenio Angriman and
Henning Meyerhenke},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Computing Top-\emph{k} Closeness Centrality in Fully-dynamic Graphs},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {21--35},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.3},
doi = {10.1137/1.9781611975055.3},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/BiseniusBAM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Blasius0KK18,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Maximilian Katzmann and
Anton Krohmer},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Hyperbolic Embeddings for Near-Optimal Greedy Routing},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {199--208},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.17},
doi = {10.1137/1.9781611975055.17},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Blasius0KK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/EppsteinHN18,
author = {David Eppstein and
Sariel Har{-}Peled and
Gabriel Nivasch},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Grid peeling and the affine curve-shortening flow},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {109--116},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.10},
doi = {10.1137/1.9781611975055.10},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/EppsteinHN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/FerradaKP18,
author = {H{\'{e}}ctor Ferrada and
Dominik Kempa and
Simon J. Puglisi},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Hybrid Indexing Revisited},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {1--8},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.1},
doi = {10.1137/1.9781611975055.1},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/FerradaKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GeorgiadisIKPP18,
author = {Loukas Georgiadis and
Giuseppe F. Italiano and
Aikaterini Karanasiou and
Nikos Parotsidis and
Nilakantha Paudel},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Computing 2-Connected Components and Maximal 2-Connected Subgraphs
in Directed Graphs: An Experimental Study},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {169--183},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.15},
doi = {10.1137/1.9781611975055.15},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GeorgiadisIKPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HellmuthKKMN18,
author = {Marc Hellmuth and
Anders S. Knudsen and
Michal Kotrbc{\'{\i}}k and
Daniel Merkle and
Nikolai N{\o}jgaard},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face
Embeddings},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {154--168},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.14},
doi = {10.1137/1.9781611975055.14},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/HellmuthKKMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HenzingerN0S18,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz and
Darren Strash},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Practical Minimum Cut Algorithms},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {48--61},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.5},
doi = {10.1137/1.9781611975055.5},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/HenzingerN0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Hespe0S18,
author = {Demian Hespe and
Christian Schulz and
Darren Strash},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Scalable Kernelization for Maximum Independent Sets},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {223--237},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.19},
doi = {10.1137/1.9781611975055.19},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/Hespe0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Kaski18,
author = {Petteri Kaski},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Engineering a Delegatable and Error-Tolerant Algorithm for Counting
Small Subgraphs},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {184--198},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.16},
doi = {10.1137/1.9781611975055.16},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Kaski18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/KlosterKORVSP18,
author = {Kyle Kloster and
Philipp Kuinke and
Michael P. O'Brien and
Felix Reidl and
Fernando S{\'{a}}nchez Villaamil and
Blair D. Sullivan and
Andrew van der Poel},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {A practical fpt algorithm for Flow Decomposition and transcript assembly},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {75--86},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.7},
doi = {10.1137/1.9781611975055.7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/KlosterKORVSP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/KumarS18,
author = {Nirman Kumar and
Stavros Sintos},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Faster Approximation Algorithm for the \emph{k}-Regret Minimizing
Set and Related Problems},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {62--74},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.6},
doi = {10.1137/1.9781611975055.6},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/KumarS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Mendel18,
author = {Thomas Mendel},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Area-Preserving Subdivision Simplification with Topology Constraints:
Exactly and in Practice},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {117--128},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.11},
doi = {10.1137/1.9781611975055.11},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Mendel18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/MitzenmacherPR18,
author = {Michael Mitzenmacher and
Salvatore Pontarelli and
Pedro Reviriego},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Adaptive Cuckoo Filters},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {36--47},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.4},
doi = {10.1137/1.9781611975055.4},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/MitzenmacherPR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/RadermacherRRW18,
author = {Marcel Radermacher and
Klara Reichard and
Ignaz Rutter and
Dorothea Wagner},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {A Geometric Heuristic for Rectilinear Crossing Minimization},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {129--138},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.12},
doi = {10.1137/1.9781611975055.12},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/RadermacherRRW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/VialDEGJ18,
author = {Juan Jos{\'{e}} Besa Vial and
William E. Devanny and
David Eppstein and
Michael T. Goodrich and
Timothy Johnson},
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving
Data},
booktitle = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
pages = {87--96},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055.8},
doi = {10.1137/1.9781611975055.8},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/VialDEGJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2018,
editor = {Rasmus Pagh and
Suresh Venkatasubramanian},
title = {Proceedings of the Twentieth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2018, New Orleans, LA, USA, January 7-8, 2018},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975055},
doi = {10.1137/1.9781611975055},
isbn = {978-1-61197-505-5},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-12 21:40 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
