Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:journals/jea:"
download as .bib file
@article{DBLP:journals/jea/AndersonGGMW23,
author = {Frederick Anderson and
Anirban Ghosh and
Matthew Graham and
Lucas Mougeot and
David Wisnosky},
title = {Bounded-Degree Plane Geometric Spanners in Practice},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1:1--1:36},
year = {2023},
url = {https://doi.org/10.1145/3582497},
doi = {10.1145/3582497},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AndersonGGMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Beling23,
author = {Piotr Beling},
title = {Fingerprinting-based Minimal Perfect Hashing Revisited},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.4:1--1.4:16},
year = {2023},
url = {https://doi.org/10.1145/3596453},
doi = {10.1145/3596453},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/Beling23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChalkisEF23,
author = {Apostolos Chalkis and
Ioannis Z. Emiris and
Vissarion Fisikopoulos},
title = {A Practical Algorithm for Volume Estimation based on Billiard Trajectories
and Simulated Annealing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.3:1--1.3:34},
year = {2023},
url = {https://doi.org/10.1145/3584182},
doi = {10.1145/3584182},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ChalkisEF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CornejoAcostaGSRH23,
author = {Jos{\'{e}} Alejandro Cornejo{-}Acosta and
Jesus Garcia{-}Diaz and
Julio C{\'{e}}sar P{\'{e}}rez Sansalvador and
Roger Z. R{\'{\i}}os{-}Mercado and
Sa{\'{u}}l Eduardo Pomares Hern{\'{a}}ndez},
title = {A Constructive Heuristic for the Uniform Capacitated Vertex \emph{k}-center
Problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.6:1--1.6:26},
year = {2023},
url = {https://doi.org/10.1145/3604911},
doi = {10.1145/3604911},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/CornejoAcostaGSRH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CrombezFFGGLLMSZZ23,
author = {Lo{\"{\i}}c Crombez and
Guilherme Dias da Fonseca and
Florian Fontan and
Yan Gerard and
Aldo Gonzalez{-}Lorenzo and
Pascal Lafourcade and
Luc Libralesso and
Benjamin Mom{\`{e}}ge and
Jack Spalding{-}Jamieson and
Brandon Zhang and
Da Wei Zheng},
title = {Conflict Optimization for Binary {CSP} Applied to Minimum Partition
into Plane Subgraphs and Graph Coloring},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.2:1--1.2:13},
year = {2023},
url = {https://doi.org/10.1145/3588869},
doi = {10.1145/3588869},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/CrombezFFGGLLMSZZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DingLY23,
author = {Hu Ding and
Wenjie Liu and
Mingquan Ye},
title = {A Data-dependent Approach for High-dimensional (Robust) Wasserstein
Alignment},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.8:1--1.8:32},
year = {2023},
url = {https://doi.org/10.1145/3604910},
doi = {10.1145/3604910},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/DingLY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DrakulicLL23,
author = {Darko Drakulic and
Christelle Loiodice and
Vassilissa Lehoux},
title = {Routing in Multimodal Transportation Networks with Non-scheduled Lines},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {2.3:1--2.3:16},
year = {2023},
url = {https://doi.org/10.1145/3632969},
doi = {10.1145/3632969},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/DrakulicLL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FeketeKKS23,
author = {S{\'{a}}ndor P. Fekete and
Phillip Keldenich and
Dominik Krupke and
Stefan Schirra},
title = {Minimum Partition into Plane Subgraphs: The {CG:SHOP} Challenge 2022},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.9:1--1.9:13},
year = {2023},
url = {https://doi.org/10.1145/3604907},
doi = {10.1145/3604907},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FeketeKKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FinkPR23,
author = {Simon D. Fink and
Matthias Pfretzschner and
Ignaz Rutter},
title = {Experimental Comparison of PC-Trees and PQ-Trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.10:1--1.10:24},
year = {2023},
url = {https://doi.org/10.1145/3611653},
doi = {10.1145/3611653},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FinkPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/JongLT23,
author = {Rachel G. de Jong and
Mark P. J. van der Loo and
Frank W. Takes},
title = {Algorithms for Efficiently Computing Structural Anonymity in Complex
Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.7:1--1.7:22},
year = {2023},
url = {https://doi.org/10.1145/3604908},
doi = {10.1145/3604908},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/JongLT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LibertiMP23,
author = {Leo Liberti and
Benedetto Manca and
Pierre{-}Louis Poirion},
title = {Random Projections for Linear Programming: An Improved Retrieval Phase},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {2.2:1--2.2:33},
year = {2023},
url = {https://doi.org/10.1145/3617506},
doi = {10.1145/3617506},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/LibertiMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MirkaW23,
author = {Renee Mirka and
David P. Williamson},
title = {An Experimental Evaluation of Semidefinite Programming and Spectral
Algorithms for Max Cut},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {2.1:1--2.1:18},
year = {2023},
url = {https://doi.org/10.1145/3609426},
doi = {10.1145/3609426},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/MirkaW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SchidlerS23,
author = {Andr{\'{e}} Schidler and
Stefan Szeider},
title = {SAT-boosted Tabu Search for Coloring Massive Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.5:1--1.5:19},
year = {2023},
url = {https://doi.org/10.1145/3603112},
doi = {10.1145/3603112},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/SchidlerS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ZoobiCN23,
author = {Ali Al Zoobi and
David Coudert and
Nicolas Nisse},
title = {Finding the \emph{k} Shortest Simple Paths: Time and Space Trade-offs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {28},
pages = {1.11:1--1.11:23},
year = {2023},
url = {https://doi.org/10.1145/3626567},
doi = {10.1145/3626567},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ZoobiCN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AngrimanBM22,
author = {Eugenio Angriman and
Michal Boron and
Henning Meyerhenke},
title = {A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted
Matching},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.6:1--1.6:41},
year = {2022},
url = {https://doi.org/10.1145/3529228},
doi = {10.1145/3529228},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AngrimanBM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BertrandDSU22,
author = {Jules Bertrand and
Fanny Dufoss{\'{e}} and
Somesh Singh and
Bora U{\c{c}}ar},
title = {Algorithms and Data Structures for Hyperedge Queries},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.13:1--1.13:23},
year = {2022},
url = {https://doi.org/10.1145/3568421},
doi = {10.1145/3568421},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BertrandDSU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BhoreLN22,
author = {Sujoy Bhore and
Guangping Li and
Martin N{\"{o}}llenburg},
title = {An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.8:1--1.8:36},
year = {2022},
url = {https://doi.org/10.1145/3514240},
doi = {10.1145/3514240},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BhoreLN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BuchinHFKKKLS22,
author = {Kevin Buchin and
Alexander Hill and
S{\'{a}}ndor P. Fekete and
Linda Kleist and
Irina Kostitsyna and
Dominik Krupke and
Roel Lambers and
Martijn Struijs},
title = {Minimum Scan Cover and Variants: Theory and Experiments},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {4.5:1--4.5:28},
year = {2022},
url = {https://doi.org/10.1145/3567674},
doi = {10.1145/3567674},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BuchinHFKKKLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CalamaiCM22,
author = {Marco Calamai and
Pierluigi Crescenzi and
Andrea Marino},
title = {On Computing the Diameter of (Weighted) Link Streams},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {4.3:1--4.3:28},
year = {2022},
url = {https://doi.org/10.1145/3569168},
doi = {10.1145/3569168},
timestamp = {Sun, 18 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CalamaiCM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CoudertNV22,
author = {David Coudert and
Andr{\'{e}} Nusser and
Laurent Viennot},
title = {Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity
Computation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.15:1--1.15:29},
year = {2022},
url = {https://doi.org/10.1145/3569169},
doi = {10.1145/3569169},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/CoudertNV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CrombezFG22,
author = {Lo{\"{\i}}c Crombez and
Guilherme Dias da Fonseca and
Yan Gerard},
title = {Greedy and Local Search Heuristics to Build Area-Optimal Polygons},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {2.2:1--2.2:11},
year = {2022},
url = {https://doi.org/10.1145/3503999},
doi = {10.1145/3503999},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CrombezFG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CrombezFGGLL22,
author = {Lo{\"{\i}}c Crombez and
Guilherme Dias da Fonseca and
Yan Gerard and
Aldo Gonzalez{-}Lorenzo and
Pascal Lafourcade and
Luc Libralesso},
title = {Shadoks Approach to Low-Makespan Coordinated Motion Planning},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {3.2:1--3.2:17},
year = {2022},
url = {https://doi.org/10.1145/3524133},
doi = {10.1145/3524133},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CrombezFGGLL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DemaineFKKM22,
author = {Erik D. Demaine and
S{\'{a}}ndor P. Fekete and
Phillip Keldenich and
Dominik Krupke and
Joseph S. B. Mitchell},
title = {Area-Optimal Simple Polygonalizations: The {CG} Challenge 2019},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {2.4:1--2.4:12},
year = {2022},
url = {https://doi.org/10.1145/3504000},
doi = {10.1145/3504000},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DemaineFKKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EderHJMP22,
author = {G{\"{u}}nther Eder and
Martin Held and
Stein{\th}{\'{o}}r Jasonarson and
Philipp Mayer and
Peter Palfrader},
title = {2-Opt Moves and Flips for Area-optimal Polygonizations},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {2.7:1--2.7:12},
year = {2022},
url = {https://doi.org/10.1145/3500913},
doi = {10.1145/3500913},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/EderHJMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FarajS22,
author = {Marcelo Fonseca Faraj and
Christian Schulz},
title = {Buffered Streaming Graph Partitioning},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.10:1--1.10:26},
year = {2022},
url = {https://doi.org/10.1145/3546911},
doi = {10.1145/3546911},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FarajS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FeketeHKPS22,
author = {S{\'{a}}ndor P. Fekete and
Andreas Haas and
Phillip Keldenich and
Michael Perk and
Arne Schmidt},
title = {Computing Area-Optimal Simple Polygonizations},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {2.6:1--2.6:23},
year = {2022},
url = {https://doi.org/10.1145/3503607},
doi = {10.1145/3503607},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FeketeHKPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FeketeKKM22,
author = {S{\'{a}}ndor P. Fekete and
Phillip Keldenich and
Dominik Krupke and
Joseph S. B. Mitchell},
title = {Computing Coordinated Motion Plans for Robot Swarms: The {CG:} {SHOP}
Challenge 2021},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {3.1:1--3.1:12},
year = {2022},
url = {https://doi.org/10.1145/3532773},
doi = {10.1145/3532773},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FeketeKKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FranckY22,
author = {Max Franck and
Sorrachai Yingchareonthawornchai},
title = {Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {4.4:1--4.4:29},
year = {2022},
url = {https://doi.org/10.1145/3564822},
doi = {10.1145/3564822},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FranckY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GorenFH22,
author = {Nir Goren and
Efi Fogel and
Dan Halperin},
title = {Area Optimal Polygonization Using Simulated Annealing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {2.3:1--2.3:17},
year = {2022},
url = {https://doi.org/10.1145/3500911},
doi = {10.1145/3500911},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GorenFH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GottlobLLO22,
author = {Georg Gottlob and
Matthias Lanzinger and
Davide Mario Longo and
Cem Okulmus},
title = {Incremental Updates of Generalized Hypertree Decompositions},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.16:1--1.16:28},
year = {2022},
url = {https://doi.org/10.1145/3578266},
doi = {10.1145/3578266},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GottlobLLO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GrafL22,
author = {Thomas Mueller Graf and
Daniel Lemire},
title = {Binary Fuse Filters: Fast and Smaller Than Xor Filters},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.5:1--1.5:15},
year = {2022},
url = {https://doi.org/10.1145/3510449},
doi = {10.1145/3510449},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GrafL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GrintenBGBM22,
author = {Alexander van der Grinten and
Elisabetta Bergamini and
Oded Green and
David A. Bader and
Henning Meyerhenke},
title = {Scalable Katz Ranking Computation in Large Static and Dynamic Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.7:1--1.7:16},
year = {2022},
url = {https://doi.org/10.1145/3524615},
doi = {10.1145/3524615},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GrintenBGBM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GrotschelJR22,
author = {Martin Gr{\"{o}}tschel and
Michael J{\"{u}}nger and
Gerhard Reinelt},
title = {Comments on "An Exact Method for the Minimum Feedback Arc Set Problem"},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.3:1--1.3:4},
year = {2022},
url = {https://doi.org/10.1145/3545001},
doi = {10.1145/3545001},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GrotschelJR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HanauerHS22,
author = {Kathrin Hanauer and
Monika Henzinger and
Christian Schulz},
title = {Recent Advances in Fully Dynamic Graph Algorithms - {A} Quick Reference
Guide},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.11:1--1.11:45},
year = {2022},
url = {https://doi.org/10.1145/3555806},
doi = {10.1145/3555806},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/HanauerHS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HanauerST22,
author = {Kathrin Hanauer and
Christian Schulz and
Jonathan Trummer},
title = {O'Reach: Even Faster Reachability in Large Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {4.2:1--4.2:27},
year = {2022},
url = {https://doi.org/10.1145/3556540},
doi = {10.1145/3556540},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/HanauerST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LepagnotMS22,
author = {Julien Lepagnot and
Laurent Moalic and
Dominique Schmitt},
title = {Optimal Area Polygonization by Triangulation and Visibility Search},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1--23},
year = {2022},
url = {https://doi.org/10.1145/3503953},
doi = {10.1145/3503953},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/LepagnotMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LiuLHBG22,
author = {Xu T. Liu and
Andrew Lumsdaine and
Mahantesh Halappanavar and
Kevin J. Barker and
Assefaw Hadish Gebremedhin},
title = {Direction-optimizing Label Propagation Framework for Structure Detection
in Graphs: Design, Implementation, and Experimental Analysis},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.12:1--1.12:31},
year = {2022},
url = {https://doi.org/10.1145/3564593},
doi = {10.1145/3564593},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/LiuLHBG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LiuSZZ22,
author = {Paul Liu and
Jack Spalding{-}Jamieson and
Brandon Zhang and
Da Wei Zheng},
title = {Coordinated Motion Planning Through Randomized \emph{k}-Opt},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {3.4:1--3.4:9},
year = {2022},
url = {https://doi.org/10.1145/3524134},
doi = {10.1145/3524134},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/LiuSZZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LorenzW22,
author = {Jan{-}Hendrik Lorenz and
Florian W{\"{o}}rz},
title = {Toward an Understanding of Long-tailed Runtimes of {SLS} Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.14:1--1.14:38},
year = {2022},
url = {https://doi.org/10.1145/3569170},
doi = {10.1145/3569170},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/LorenzW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NettoG22,
author = {Marcelo Vaz Netto and
Sahudy Montenegro Gonz{\'{a}}lez},
title = {{SSLC:} {A} Search Algorithm Based on Linear Collisions and Poisson
Probability Distribution},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.4:1--1.4:15},
year = {2022},
url = {https://doi.org/10.1145/3497876},
doi = {10.1145/3497876},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NettoG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NunesLGAN22,
author = {Daniel Saad Nogueira Nunes and
Felipe A. Louza and
Simon Gog and
Mauricio Ayala{-}Rinc{\'{o}}n and
Gonzalo Navarro},
title = {Grammar Compression by Induced Suffix Sorting},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.1:1--1.1:33},
year = {2022},
url = {https://doi.org/10.1145/3549992},
doi = {10.1145/3549992},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/NunesLGAN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/RamosJRSU22,
author = {Natanael Ramos and
Ra{\'{\i}} C. de Jesus and
Pedro J. de Rezende and
Cid C. de Souza and
F{\'{a}}bio Luiz Usberti},
title = {Triangle-Based Heuristics for Area Optimal Polygonizations},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {2.1:1--2.1:25},
year = {2022},
url = {https://doi.org/10.1145/3504001},
doi = {10.1145/3504001},
timestamp = {Fri, 16 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/RamosJRSU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SchlagHGASS22,
author = {Sebastian Schlag and
Tobias Heuer and
Lars Gottesb{\"{u}}ren and
Yaroslav Akhremtsev and
Christian Schulz and
Peter Sanders},
title = {High-Quality Hypergraph Partitioning},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.9:1--1.9:39},
year = {2022},
url = {https://doi.org/10.1145/3529090},
doi = {10.1145/3529090},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/SchlagHGASS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ShiHS22,
author = {Jessica Shi and
Louisa Ruixue Huang and
Julian Shun},
title = {Parallel Five-cycle Counting Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {4.1:1--4.1:23},
year = {2022},
url = {https://doi.org/10.1145/3556541},
doi = {10.1145/3556541},
timestamp = {Mon, 06 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ShiHS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/StrasserZ22,
author = {Ben Strasser and
Tim Zeitz},
title = {Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic
for A* in Road Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1--28},
year = {2022},
url = {https://doi.org/10.1145/3571282},
doi = {10.1145/3571282},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/StrasserZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/YangV22,
author = {Hyeyun Yang and
Antoine Vigneron},
title = {Coordinated Path Planning through Local Search and Simulated Annealing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {3.3:1--3.3:14},
year = {2022},
url = {https://doi.org/10.1145/3531224},
doi = {10.1145/3531224},
timestamp = {Thu, 25 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/YangV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/YasarBASC22,
author = {Abdurrahman Yasar and
Muhammed Fatih Balin and
Xiaojing An and
Kaan Sancak and
{\"{U}}mit V. {\c{C}}ataly{\"{u}}rek},
title = {On Symmetric Rectilinear Partitioning},
journal = {{ACM} J. Exp. Algorithmics},
volume = {27},
pages = {1.2:1--1.2:26},
year = {2022},
url = {https://doi.org/10.1145/3523750},
doi = {10.1145/3523750},
timestamp = {Thu, 27 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/YasarBASC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ArroyueloCFKLNR21,
author = {Diego Arroyuelo and
Rodrigo C{\'{a}}novas and
Johannes Fischer and
Dominik K{\"{o}}ppl and
Marvin L{\"{o}}bel and
Gonzalo Navarro and
Rajeev Raman},
title = {Engineering Practical Lempel-Ziv Tries},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {14:1--14:47},
year = {2021},
url = {https://doi.org/10.1145/3481638},
doi = {10.1145/3481638},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ArroyueloCFKLNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BaharevSNA21,
author = {Ali Baharev and
Hermann Schichl and
Arnold Neumaier and
Tobias Achterberg},
title = {An Exact Method for the Minimum Feedback Arc Set Problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.4:1--1.4:28},
year = {2021},
url = {https://doi.org/10.1145/3446429},
doi = {10.1145/3446429},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BaharevSNA21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BernardiniCFLP21,
author = {Giulia Bernardini and
Huiping Chen and
Gabriele Fici and
Grigorios Loukides and
Solon P. Pissis},
title = {Reverse-Safe Text Indexing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.10:1--1.10:26},
year = {2021},
url = {https://doi.org/10.1145/3461698},
doi = {10.1145/3461698},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BernardiniCFLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BrodalM21,
author = {Gerth St{\o}lting Brodal and
Konstantinos Mampentzidis},
title = {Cache Oblivious Algorithms for Computing the Triplet Distance between
Trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.2:1--1.2:44},
year = {2021},
url = {https://doi.org/10.1145/3433651},
doi = {10.1145/3433651},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BrodalM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DinklageEFKL21,
author = {Patrick Dinklage and
Jonas Ellert and
Johannes Fischer and
Florian Kurpicz and
Marvin L{\"{o}}bel},
title = {Practical Wavelet Tree Construction},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.8:1--1.8:67},
year = {2021},
url = {https://doi.org/10.1145/3457197},
doi = {10.1145/3457197},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DinklageEFKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Farach-ColtonLM21,
author = {Martin Farach{-}Colton and
Katia Leal and
Miguel A. Mosteiro and
Christopher Thraves Caro},
title = {Dynamic Windows Scheduling with Reallocation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.11:1--1.11:19},
year = {2021},
url = {https://doi.org/10.1145/3462208},
doi = {10.1145/3462208},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Farach-ColtonLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FichteHH21,
author = {Johannes Klaus Fichte and
Markus Hecher and
Florim Hamiti},
title = {The Model Counting Competition 2020},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {13:1--13:26},
year = {2021},
url = {https://doi.org/10.1145/3459080},
doi = {10.1145/3459080},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FichteHH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FischlGLP21,
author = {Wolfgang Fischl and
Georg Gottlob and
Davide Mario Longo and
Reinhard Pichler},
title = {HyperBench: {A} Benchmark and Tool for Hypergraphs and Empirical Findings},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.6:1--1.6:40},
year = {2021},
url = {https://doi.org/10.1145/3440015},
doi = {10.1145/3440015},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FischlGLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GoodrichHS21,
author = {Timothy D. Goodrich and
Eric Horton and
Blair D. Sullivan},
title = {An Updated Experimental Evaluation of Graph Bipartization Methods},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {12:1--12:24},
year = {2021},
url = {https://doi.org/10.1145/3467968},
doi = {10.1145/3467968},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GoodrichHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HechtGH21,
author = {Michael Hecht and
Krzysztof Gonciarz and
Szabolcs Horv{\'{a}}t},
title = {Tight Localizations of Feedback Sets},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.5:1--1.5:19},
year = {2021},
url = {https://doi.org/10.1145/3447652},
doi = {10.1145/3447652},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HechtGH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/JungerLMRRRS21,
author = {Michael J{\"{u}}nger and
Elisabeth Lobe and
Petra Mutzel and
Gerhard Reinelt and
Franz Rendl and
Giovanni Rinaldi and
Tobias Stollenwerk},
title = {Quantum Annealing versus Digital Computing: An Experimental Comparison},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.9:1--1.9:30},
year = {2021},
url = {https://doi.org/10.1145/3459606},
doi = {10.1145/3459606},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/JungerLMRRRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KoanaKNNZ21,
author = {Tomohiro Koana and
Viatcheslav Korenwein and
Andr{\'{e}} Nichterlein and
Rolf Niedermeier and
Philipp Zschoche},
title = {Data Reduction for Maximum Matching on Real-World Graphs: Theory and
Experiments},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.3:1--1.3:30},
year = {2021},
url = {https://doi.org/10.1145/3439801},
doi = {10.1145/3439801},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KoanaKNNZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LiptakPR21,
author = {Zsuzsanna Lipt{\'{a}}k and
Simon J. Puglisi and
Massimiliano Rossi},
title = {Pattern Discovery in Colored Strings},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.1:1--1.1:26},
year = {2021},
url = {https://doi.org/10.1145/3429280},
doi = {10.1145/3429280},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LiptakPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/QiuSLAHS21,
author = {Zirou Qiu and
Ruslan Shaydulin and
Xiaoyuan Liu and
Yuri Alexeev and
Christopher S. Henry and
Ilya Safro},
title = {{ELRUNA:} Elimination Rule-based Network Alignment},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {1.7:1--1.7:32},
year = {2021},
url = {https://doi.org/10.1145/3450703},
doi = {10.1145/3450703},
timestamp = {Sat, 17 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/QiuSLAHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SchlagSS21,
author = {Sebastian Schlag and
Matthias Schmitt and
Christian Schulz},
title = {Faster Support Vector Machines},
journal = {{ACM} J. Exp. Algorithmics},
volume = {26},
pages = {15:1--15:21},
year = {2021},
url = {https://doi.org/10.1145/3484730},
doi = {10.1145/3484730},
timestamp = {Tue, 28 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SchlagSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AndersenM20,
author = {Jakob L. Andersen and
Daniel Merkle},
title = {A Generic Framework for Engineering Graph Canonization Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--26},
year = {2020},
url = {https://doi.org/10.1145/3356020},
doi = {10.1145/3356020},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AndersenM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Blasius0KK20,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Maximilian Katzmann and
Anton Krohmer},
title = {Hyperbolic Embeddings for Near-Optimal Greedy Routing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--18},
year = {2020},
url = {https://doi.org/10.1145/3381751},
doi = {10.1145/3381751},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Blasius0KK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BorodinKP20,
author = {Allan Borodin and
Christodoulos Karavasilis and
Denis Pankratov},
title = {An Experimental Study of Algorithms for Online Bipartite Matching},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--37},
year = {2020},
url = {https://doi.org/10.1145/3379552},
doi = {10.1145/3379552},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BorodinKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Charalampopoulos20,
author = {Panagiotis Charalampopoulos and
Costas S. Iliopoulos and
Chang Liu and
Solon P. Pissis},
title = {Property Suffix Array with Applications in Indexing Weighted Sequences},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--16},
year = {2020},
url = {https://doi.org/10.1145/3385898},
doi = {10.1145/3385898},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/Charalampopoulos20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EscamocherOP20,
author = {Guillaume Escamocher and
Barry O'Sullivan and
Steven David Prestwich},
title = {Generating Difficult {CNF} Instances in Unexplored Constrainedness
Regions},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--12},
year = {2020},
url = {https://doi.org/10.1145/3385651},
doi = {10.1145/3385651},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/EscamocherOP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FockeMM20,
author = {Jacob Focke and
Nicole Megow and
Julie Mei{\ss}ner},
title = {Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--20},
year = {2020},
url = {https://doi.org/10.1145/3422371},
doi = {10.1145/3422371},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FockeMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GonzalezC20,
author = {Miguel Coviello Gonzalez and
Marek Chrobak},
title = {A Waste-Efficient Algorithm for Single-Droplet Sample Preparation
on Microfluidic Chips},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--22},
year = {2020},
url = {https://doi.org/10.1145/3408297},
doi = {10.1145/3408297},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/GonzalezC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GrafL20,
author = {Thomas Mueller Graf and
Daniel Lemire},
title = {Xor Filters},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--16},
year = {2020},
url = {https://doi.org/10.1145/3376122},
doi = {10.1145/3376122},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GrafL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HenzingerN020,
author = {Alexandra Henzinger and
Alexander Noe and
Christian Schulz},
title = {ILP-Based Local Search for Graph Partitioning},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--26},
year = {2020},
url = {https://doi.org/10.1145/3398634},
doi = {10.1145/3398634},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/HenzingerN020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/JensenB20,
author = {Alathea Jensen and
Isabel Beichl},
title = {A Sequential Importance Sampling Algorithm for Counting Linear Extensions},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--14},
year = {2020},
url = {https://doi.org/10.1145/3385650},
doi = {10.1145/3385650},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/JensenB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KandaKTMF20,
author = {Shunsuke Kanda and
Dominik K{\"{o}}ppl and
Yasuo Tabei and
Kazuhiro Morita and
Masao Fuketa},
title = {Dynamic Path-decomposed Tries},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--28},
year = {2020},
url = {https://doi.org/10.1145/3418033},
doi = {10.1145/3418033},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/KandaKTMF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Kirchbach0T20,
author = {Konrad von Kirchbach and
Christian Schulz and
Jesper Larsson Tr{\"{a}}ff},
title = {Better Process Mapping and Sparse Quadratic Assignment},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--19},
year = {2020},
url = {https://doi.org/10.1145/3409667},
doi = {10.1145/3409667},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/Kirchbach0T20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MitzenmacherPR20,
author = {Michael Mitzenmacher and
Salvatore Pontarelli and
Pedro Reviriego},
title = {Adaptive Cuckoo Filters},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--20},
year = {2020},
url = {https://doi.org/10.1145/3339504},
doi = {10.1145/3339504},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MitzenmacherPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/StonesFKM20,
author = {Rebecca J. Stones and
Ra{\'{u}}l M. Falc{\'{o}}n and
Daniel Kotlar and
Trent G. Marbach},
title = {Computing Autotopism Groups of Partial Latin Rectangles},
journal = {{ACM} J. Exp. Algorithmics},
volume = {25},
pages = {1--39},
year = {2020},
url = {https://doi.org/10.1145/3412324},
doi = {10.1145/3412324},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/StonesFKM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AhmedASEGGHKSW019,
author = {Abu Reyan Ahmed and
Patrizio Angelini and
Faryad Darabi Sahneh and
Alon Efrat and
David Glickenstein and
Martin Gronemann and
Niklas Heinsohn and
Stephen G. Kobourov and
Richard Spence and
Joseph Watkins and
Alexander Wolff},
title = {Multi-level Steiner Trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.5:1--2.5:22},
year = {2019},
url = {https://doi.org/10.1145/3368621},
doi = {10.1145/3368621},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AhmedASEGGHKSW019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AltmanovaKK19,
author = {Katerina Altmanov{\'{a}} and
Dusan Knop and
Martin Kouteck{\'{y}}},
title = {Evaluating and Tuning \emph{n}-fold Integer Programming},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.2:1--2.2:22},
year = {2019},
url = {https://doi.org/10.1145/3330137},
doi = {10.1145/3330137},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/AltmanovaKK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BarenboimM19,
author = {Leonid Barenboim and
Tzalik Maimon},
title = {Fully Dynamic Graph Algorithms Inspired by Distributed Computing:
Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.14:1--1.14:24},
year = {2019},
url = {https://doi.org/10.1145/3338529},
doi = {10.1145/3338529},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BarenboimM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BaumBDW19,
author = {Moritz Baum and
Valentin Buchhold and
Julian Dibbelt and
Dorothea Wagner},
title = {Fast Exact Computation of Isocontours in Road Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.18:1--1.18:26},
year = {2019},
url = {https://doi.org/10.1145/3355514},
doi = {10.1145/3355514},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BaumBDW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BentertHMMNS19,
author = {Matthias Bentert and
Anne{-}Sophie Himmel and
Hendrik Molter and
Marco Morik and
Rolf Niedermeier and
Ren{\'{e}} Saitenmacher},
title = {Listing All Maximal \emph{k}-Plexes in Temporal Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.13:1--1.13:27},
year = {2019},
url = {https://doi.org/10.1145/3325859},
doi = {10.1145/3325859},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BentertHMMNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BeyerC19,
author = {Stephan Beyer and
Markus Chimani},
title = {Strong Steiner Tree Approximations in Practice},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.7:1--1.7:33},
year = {2019},
url = {https://doi.org/10.1145/3299903},
doi = {10.1145/3299903},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BeyerC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BjorklundGQ19,
author = {Andreas Bj{\"{o}}rklund and
Brajesh Gupt and
Nicol{\'{a}}s Quesada},
title = {A Faster Hafnian Formula for Complex Matrices and Its Benchmarking
on a Supercomputer},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.11:1--1.11:17},
year = {2019},
url = {https://doi.org/10.1145/3325111},
doi = {10.1145/3325111},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BjorklundGQ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BorassiN19,
author = {Michele Borassi and
Emanuele Natale},
title = {{KADABRA} is an ADaptive Algorithm for Betweenness via Random Approximation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.2:1--1.2:35},
year = {2019},
url = {https://doi.org/10.1145/3284359},
doi = {10.1145/3284359},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BorassiN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Buchhold0W19,
author = {Valentin Buchhold and
Peter Sanders and
Dorothea Wagner},
title = {Real-time Traffic Assignment Using Engineered Customizable Contraction
Hierarchies},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.4:1--2.4:28},
year = {2019},
url = {https://doi.org/10.1145/3362693},
doi = {10.1145/3362693},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Buchhold0W19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CantoneFP19,
author = {Domenico Cantone and
Simone Faro and
Arianna Pavone},
title = {Linear and Efficient String Matching Algorithms Based on Weak Factor
Recognition},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.8:1--1.8:20},
year = {2019},
url = {https://doi.org/10.1145/3301295},
doi = {10.1145/3301295},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/CantoneFP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CazalsMTW19,
author = {Fr{\'{e}}d{\'{e}}ric Cazals and
Dorian Mazauric and
Romain Tetley and
R{\'{e}}mi Watrigant},
title = {Comparing Two Clusterings Using Matchings between Clusters of Clusters},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.17:1--1.17:41},
year = {2019},
url = {https://doi.org/10.1145/3345951},
doi = {10.1145/3345951},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/CazalsMTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChimaniHW19,
author = {Markus Chimani and
Ivo Hedtke and
Tilo Wiedera},
title = {Exact Algorithms for the Maximum Planar Subgraph Problem: New Models
and Experiments},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.1:1--2.1:21},
year = {2019},
url = {https://doi.org/10.1145/3320344},
doi = {10.1145/3320344},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ChimaniHW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DAngelo19,
author = {Gianlorenzo D'Angelo},
title = {Introduction to the Special Issue {SEA} 2018},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.1e:1--2.1e:2},
year = {2019},
url = {https://doi.org/10.1145/3365652},
doi = {10.1145/3365652},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/DAngelo19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DAngeloDF19,
author = {Gianlorenzo D'Angelo and
Mattia D'Emidio and
Daniele Frigioni},
title = {Fully Dynamic 2-Hop Cover Labeling},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.6:1--1.6:36},
year = {2019},
url = {https://doi.org/10.1145/3299901},
doi = {10.1145/3299901},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/DAngeloDF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DeySW19,
author = {Tamal K. Dey and
Dayu Shi and
Yusu Wang},
title = {SimBa: An Efficient Tool for Approximating Rips-filtration Persistence
via Simplicial Batch Collapse},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.5:1--1.5:16},
year = {2019},
url = {https://doi.org/10.1145/3284360},
doi = {10.1145/3284360},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/DeySW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EdelkampW19,
author = {Stefan Edelkamp and
Armin Wei{\ss}},
title = {BlockQuicksort: Avoiding Branch Mispredictions in Quicksort},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.4:1--1.4:22},
year = {2019},
url = {https://doi.org/10.1145/3274660},
doi = {10.1145/3274660},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/EdelkampW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Hespe0S19,
author = {Demian Hespe and
Christian Schulz and
Darren Strash},
title = {Scalable Kernelization for Maximum Independent Sets},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.16:1--1.16:22},
year = {2019},
url = {https://doi.org/10.1145/3355502},
doi = {10.1145/3355502},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Hespe0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Heuer0S19,
author = {Tobias Heuer and
Peter Sanders and
Sebastian Schlag},
title = {Network Flow-Based Refinement for Multilevel Hypergraph Partitioning},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.3:1--2.3:36},
year = {2019},
url = {https://doi.org/10.1145/3329872},
doi = {10.1145/3329872},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Heuer0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KarkkainenK19,
author = {Juha K{\"{a}}rkk{\"{a}}inen and
Dominik Kempa},
title = {Better External Memory {LCP} Array Construction},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.3:1--1.3:27},
year = {2019},
url = {https://doi.org/10.1145/3297723},
doi = {10.1145/3297723},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KarkkainenK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KorhonenBJ19,
author = {Tuukka Korhonen and
Jeremias Berg and
Matti J{\"{a}}rvisalo},
title = {Solving Graph Problems via Potential Maximal Cliques: An Experimental
Evaluation of the Bouchitt{\'{e}}-Todinca Algorithm},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.9:1--1.9:19},
year = {2019},
url = {https://doi.org/10.1145/3301297},
doi = {10.1145/3301297},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/KorhonenBJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LevinF19,
author = {Harry A. Levin and
Sorelle A. Friedler},
title = {Automated Congressional Redistricting},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.10:1--1.10:24},
year = {2019},
url = {https://doi.org/10.1145/3316513},
doi = {10.1145/3316513},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/LevinF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NadaraPRRS19,
author = {Wojciech Nadara and
Marcin Pilipczuk and
Roman Rabinovich and
Felix Reidl and
Sebastian Siebertz},
title = {Empirical Evaluation of Approximation Algorithms for Generalized Graph
Coloring and Uniform Quasi-wideness},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.6:1--2.6:34},
year = {2019},
url = {https://doi.org/10.1145/3368630},
doi = {10.1145/3368630},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NadaraPRRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/RadermacherRRW19,
author = {Marcel Radermacher and
Klara Reichard and
Ignaz Rutter and
Dorothea Wagner},
title = {Geometric Heuristics for Rectilinear Crossing Minimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.12:1--1.12:21},
year = {2019},
url = {https://doi.org/10.1145/3325861},
doi = {10.1145/3325861},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/RadermacherRRW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Stoichev19,
author = {Stoicho D. Stoichev},
title = {New Exact and Heuristic Algorithms for Graph Automorphism Group and
Graph Isomorphism},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.15:1--1.15:27},
year = {2019},
url = {https://doi.org/10.1145/3333250},
doi = {10.1145/3333250},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Stoichev19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Zaroliagis19,
author = {Christos D. Zaroliagis},
title = {Editorial - {ESA} 2016 Special Issue},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {1.1:1--1.1:2},
year = {2019},
url = {https://doi.org/10.1145/3298788},
doi = {10.1145/3298788},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Zaroliagis19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ZiobroP19,
author = {Michal Ziobro and
Marcin Pilipczuk},
title = {Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental
Evaluation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {24},
number = {1},
pages = {2.7:1--2.7:18},
year = {2019},
url = {https://doi.org/10.1145/3368631},
doi = {10.1145/3368631},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ZiobroP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AfshaniBCKLST18,
author = {Peyman Afshani and
Mark de Berg and
Henri Casanova and
Ben Karsin and
Colin Lambrechts and
Nodari Sitchinava and
Constantinos Tsirogiannis},
title = {An Efficient Algorithm for the 1D Total Visibility-Index Problem and
Its Parallelization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3209685},
doi = {10.1145/3209685},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/AfshaniBCKLST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BergaminiCDMSV18,
author = {Elisabetta Bergamini and
Pierluigi Crescenzi and
Gianlorenzo D'Angelo and
Henning Meyerhenke and
Lorenzo Severini and
Yllka Velaj},
title = {Improving the Betweenness Centrality of a Node by Adding Links},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3166071},
doi = {10.1145/3166071},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BergaminiCDMSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DibbeltPSW18,
author = {Julian Dibbelt and
Thomas Pajor and
Ben Strasser and
Dorothea Wagner},
title = {Connection Scan Algorithm},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3274661},
doi = {10.1145/3274661},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DibbeltPSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HamannMPTW18,
author = {Michael Hamann and
Ulrich Meyer and
Manuel Penschuck and
Hung Tran and
Dorothea Wagner},
title = {I/O-Efficient Generation of Massive Graphs Following the \emph{LFR}
Benchmark},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3230743},
doi = {10.1145/3230743},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HamannMPTW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HamannS18,
author = {Michael Hamann and
Ben Strasser},
title = {Graph Bisection with Pareto Optimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3173045},
doi = {10.1145/3173045},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HamannS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HenzingerNSS18,
author = {Monika Henzinger and
Alexander Noe and
Christian Schulz and
Darren Strash},
title = {Practical Minimum Cut Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3274662},
doi = {10.1145/3274662},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/HenzingerNSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LoozM18,
author = {Moritz von Looz and
Henning Meyerhenke},
title = {Updating Dynamic Random Hyperbolic Graphs in Sublinear Time},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3195635},
doi = {10.1145/3195635},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/LoozM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Mann18,
author = {Zolt{\'{a}}n {\'{A}}d{\'{a}}m Mann},
title = {Complexity of Coloring Random Graphs: An Experimental Study of the
Hardest Region},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3183350},
doi = {10.1145/3183350},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/Mann18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PaudelGI18,
author = {Nilakantha Paudel and
Loukas Georgiadis and
Giuseppe F. Italiano},
title = {Computing Critical Nodes in Directed Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3228332},
doi = {10.1145/3228332},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PaudelGI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PolischchukRC18,
author = {Valentin Polishchuk and
Vijaya Ramachandran and
Rezaul Alam Chowdhury},
title = {Editorial: {ALENEX} 2017 Special Issue},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3239166},
doi = {10.1145/3239166},
timestamp = {Wed, 17 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/PolischchukRC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/RobinsonVHE18,
author = {Jeffrey A. Robinson and
Susan V. Vrbsky and
Xiaoyan Hong and
Brian P. Eddy},
title = {Analysis of a High-Performance {TSP} Solver on the {GPU}},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3154835},
doi = {10.1145/3154835},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/RobinsonVHE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SieranojaF18,
author = {Sami Sieranoja and
Pasi Fr{\"{a}}nti},
title = {Constructing a High-Dimensional \emph{k}NN-Graph Using a Z-Order Curve},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3274656},
doi = {10.1145/3274656},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SieranojaF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/TsirogiannisSP18,
author = {Constantinos Tsirogiannis and
Frank Staals and
Vincent Pellissier},
title = {Computing the Expected Value and Variance of Geometric Measures},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3228331},
doi = {10.1145/3228331},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/TsirogiannisSP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/VellaBC18,
author = {Flavio Vella and
Massimo Bernaschi and
Giancarlo Carbone},
title = {Dynamic Merging of Frontiers for Accelerating the Evaluation of Betweenness
Centrality},
journal = {{ACM} J. Exp. Algorithmics},
volume = {23},
year = {2018},
url = {https://doi.org/10.1145/3182656},
doi = {10.1145/3182656},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/VellaBC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BaierBO17,
author = {Uwe Baier and
Timo Beller and
Enno Ohlebusch},
title = {Space-Efficient Parallel Construction of Succinct Representations
of Suffix Tree Topologies},
journal = {{ACM} J. Exp. Algorithmics},
volume = {22},
year = {2017},
url = {https://doi.org/10.1145/3035540},
doi = {10.1145/3035540},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BaierBO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BuchinBGHS17,
author = {Kevin Buchin and
Maike Buchin and
Joachim Gudmundsson and
Michael Horton and
Stef Sijben},
title = {Compact Flow Diagrams for State Sequences},
journal = {{ACM} J. Exp. Algorithmics},
volume = {22},
year = {2017},
url = {https://doi.org/10.1145/3150525},
doi = {10.1145/3150525},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BuchinBGHS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GogKN17,
author = {Simon Gog and
Roberto Konow and
Gonzalo Navarro},
title = {Practical Compact Indexes for Top-\emph{k} Document Retrieval},
journal = {{ACM} J. Exp. Algorithmics},
volume = {22},
year = {2017},
url = {https://doi.org/10.1145/3043958},
doi = {10.1145/3043958},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/GogKN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HirvolaT17,
author = {Tommi Hirvola and
Jorma Tarhio},
title = {Bit-Parallel Approximate Matching of Circular Strings with \emph{k}
Mismatches},
journal = {{ACM} J. Exp. Algorithmics},
volume = {22},
year = {2017},
url = {https://doi.org/10.1145/3129536},
doi = {10.1145/3129536},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HirvolaT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KerberMN17,
author = {Michael Kerber and
Dmitriy Morozov and
Arnur Nigmetov},
title = {Geometry Helps to Compare Persistence Diagrams},
journal = {{ACM} J. Exp. Algorithmics},
volume = {22},
year = {2017},
url = {https://doi.org/10.1145/3064175},
doi = {10.1145/3064175},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KerberMN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KhuongM17,
author = {Paul{-}Virak Khuong and
Pat Morin},
title = {Array Layouts for Comparison-Based Searching},
journal = {{ACM} J. Exp. Algorithmics},
volume = {22},
year = {2017},
url = {https://doi.org/10.1145/3053370},
doi = {10.1145/3053370},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KhuongM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PoloczekW17,
author = {Matthias Poloczek and
David P. Williamson},
title = {An Experimental Evaluation of Fast Approximation Algorithms for the
Maximum Satisfiability Problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {22},
year = {2017},
url = {https://doi.org/10.1145/3064174},
doi = {10.1145/3064174},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/PoloczekW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/0001Z16,
author = {Peter Sanders and
Norbert Zeh},
title = {Introduction to Special Issue {ALENEX} 2013},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {2.1:1--2.1:2},
year = {2016},
url = {https://doi.org/10.1145/2966922},
doi = {10.1145/2966922},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/0001Z16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BergnerLW16,
author = {Martin Bergner and
Marco E. L{\"{u}}bbecke and
Jonas T. Witt},
title = {A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.2:1--1.2:16},
year = {2016},
url = {https://doi.org/10.1145/2851492},
doi = {10.1145/2851492},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BergnerLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Bingmann0O16,
author = {Timo Bingmann and
Johannes Fischer and
Vitaly Osipov},
title = {Inducing Suffix and {LCP} Arrays in External Memory},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {2.3:1--2.3:27},
year = {2016},
url = {https://doi.org/10.1145/2975593},
doi = {10.1145/2975593},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Bingmann0O16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CoudertMN16,
author = {David Coudert and
Dorian Mazauric and
Nicolas Nisse},
title = {Experimental Evaluation of a Branch-and-Bound Algorithm for Computing
Pathwidth and Directed Pathwidth},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.3:1--1.3:23},
year = {2016},
url = {https://doi.org/10.1145/2851494},
doi = {10.1145/2851494},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CoudertMN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DibbeltSW16,
author = {Julian Dibbelt and
Ben Strasser and
Dorothea Wagner},
title = {Customizable Contraction Hierarchies},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.5:1--1.5:49},
year = {2016},
url = {https://doi.org/10.1145/2886843},
doi = {10.1145/2886843},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DibbeltSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EfentakisP16,
author = {Alexandros Efentakis and
Dieter Pfoser},
title = {ReHub: Extending Hub Labels for Reverse \emph{k}-Nearest Neighbor
Queries on Large-Scale Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.13:1--1.13:35},
year = {2016},
url = {https://doi.org/10.1145/2990192},
doi = {10.1145/2990192},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/EfentakisP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Fox-EpsteinMP016,
author = {Eli Fox{-}Epstein and
Shay Mozes and
Phitchaya Mangpo Phothilimthana and
Christian Sommer},
title = {Short and Simple Cycle Separators in Planar Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {2.2:1--2.2:24},
year = {2016},
url = {https://doi.org/10.1145/2957318},
doi = {10.1145/2957318},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Fox-EpsteinMP016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GemsaNR16,
author = {Andreas Gemsa and
Martin N{\"{o}}llenburg and
Ignaz Rutter},
title = {Evaluation of Labeling Strategies for Rotating Maps},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.4:1--1.4:21},
year = {2016},
url = {https://doi.org/10.1145/2851493},
doi = {10.1145/2851493},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GemsaNR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GlantzMS16,
author = {Roland Glantz and
Henning Meyerhenke and
Christian Schulz},
title = {Tree-Based Coarsening and Partitioning of Complex Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.6:1--1.6:20},
year = {2016},
url = {https://doi.org/10.1145/2851496},
doi = {10.1145/2851496},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GlantzMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GudmundssonK16,
author = {Joachim Gudmundsson and
Jyrki Katajainen},
title = {Editorial, {SEA} 2014 Special Issue},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.1:1},
year = {2016},
url = {https://doi.org/10.1145/2854021},
doi = {10.1145/2854021},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GudmundssonK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KarkkainenK16,
author = {Juha K{\"{a}}rkk{\"{a}}inen and
Dominik Kempa},
title = {{LCP} Array Construction in External Memory},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.7:1--1.7:22},
year = {2016},
url = {https://doi.org/10.1145/2851491},
doi = {10.1145/2851491},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KarkkainenK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KarkkainenKP16,
author = {Juha K{\"{a}}rkk{\"{a}}inen and
Dominik Kempa and
Simon J. Puglisi},
title = {Lazy Lempel-Ziv Factorization Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {2.4:1--2.4:19},
year = {2016},
url = {https://doi.org/10.1145/2699876},
doi = {10.1145/2699876},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KarkkainenKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MarinovNG16,
author = {Martin Marinov and
Nicholas Nash and
David Gregg},
title = {Practical Algorithms for Finding Extremal Sets},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.9:1--1.9:21},
year = {2016},
url = {https://doi.org/10.1145/2893184},
doi = {10.1145/2893184},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MarinovNG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/McGeoch16,
author = {Catherine C. McGeoch},
title = {In Memoriam: David S. Johnson},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.1e:1},
year = {2016},
url = {https://doi.org/10.1145/2907073},
doi = {10.1145/2907073},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/McGeoch16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NavarroP16,
author = {Gonzalo Navarro and
Alberto Ord{\'{o}}{\~{n}}ez Pereira},
title = {Faster Compressed Suffix Trees for Repetitive Collections},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.8:1--1.8:38},
year = {2016},
url = {https://doi.org/10.1145/2851495},
doi = {10.1145/2851495},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/NavarroP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PeethambaranPM16,
author = {Jiju Peethambaran and
Amal Dev Parakkat and
Ramanathan Muthuganapathy},
title = {An Empirical Study on Randomized Optimal Area Polygonization of Planar
Point Sets},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.10:1--1.10:24},
year = {2016},
url = {https://doi.org/10.1145/2896849},
doi = {10.1145/2896849},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PeethambaranPM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/RosenbrockMHCF16,
author = {Conrad W. Rosenbrock and
Wiley S. Morgan and
Gus L. W. Hart and
Stefano Curtarolo and
Rodney W. Forcade},
title = {Numerical Algorithm for P{\'{o}}lya Enumeration Theorem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.11:1--1.11:17},
year = {2016},
url = {https://doi.org/10.1145/2955094},
doi = {10.1145/2955094},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/RosenbrockMHCF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/TodaS16,
author = {Takahisa Toda and
Takehide Soh},
title = {Implementing Efficient All Solutions {SAT} Solvers},
journal = {{ACM} J. Exp. Algorithmics},
volume = {21},
number = {1},
pages = {1.12:1--1.12:44},
year = {2016},
url = {https://doi.org/10.1145/2975585},
doi = {10.1145/2975585},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/TodaS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChimaniZ15,
author = {Markus Chimani and
Robert Zeranski},
title = {Upward Planarity Testing in Practice: {SAT} Formulations and Comparative
Study},
journal = {{ACM} J. Exp. Algorithmics},
volume = {20},
pages = {1.2:1.1--1.2:1.27},
year = {2015},
url = {https://doi.org/10.1145/2699875},
doi = {10.1145/2699875},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ChimaniZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CohenCL15,
author = {Nathann Cohen and
David Coudert and
Aur{\'{e}}lien Lancin},
title = {On Computing the Gromov Hyperbolicity},
journal = {{ACM} J. Exp. Algorithmics},
volume = {20},
pages = {1.6:1--1.6:18},
year = {2015},
url = {https://doi.org/10.1145/2780652},
doi = {10.1145/2780652},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CohenCL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DAndreaDF0P15,
author = {Annalisa D'Andrea and
Mattia D'Emidio and
Daniele Frigioni and
Stefano Leucci and
Guido Proietti},
title = {Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches
of Updates: New Algorithms and Experiments},
journal = {{ACM} J. Exp. Algorithmics},
volume = {20},
pages = {1.5:1.1--1.5:1.33},
year = {2015},
url = {https://doi.org/10.1145/2786022},
doi = {10.1145/2786022},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DAndreaDF0P15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FinocchiFF15,
author = {Irene Finocchi and
Marco Finocchi and
Emanuele G. Fusco},
title = {Clique Counting in MapReduce: Algorithms and Experiments},
journal = {{ACM} J. Exp. Algorithmics},
volume = {20},
pages = {1.7:1--1.7:20},
year = {2015},
url = {https://doi.org/10.1145/2794080},
doi = {10.1145/2794080},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FinocchiFF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Hedtke15,
author = {Ivo Hedtke},
title = {Upgrading Subgroup Triple-Product-Property Triples},
journal = {{ACM} J. Exp. Algorithmics},
volume = {20},
pages = {1.1:1.1--1.1:1.17},
year = {2015},
url = {https://doi.org/10.1145/2699877},
doi = {10.1145/2699877},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Hedtke15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Spence15,
author = {Ivor T. A. Spence},
title = {Weakening Cardinality Constraints Creates Harder Satisfiability Benchmarks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {20},
pages = {1.4:1--1.4:14},
year = {2015},
url = {https://doi.org/10.1145/2746239},
doi = {10.1145/2746239},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Spence15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Ullmann15,
author = {Julian R. Ullmann},
title = {Degree Reduction in Labeled Graph Retrieval},
journal = {{ACM} J. Exp. Algorithmics},
volume = {20},
pages = {1.3:1.1--1.3:1.54},
year = {2015},
url = {https://doi.org/10.1145/2699878},
doi = {10.1145/2699878},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Ullmann15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AngioneON14,
author = {Claudio Angione and
Annalisa Occhipinti and
Giuseppe Nicosia},
title = {Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical
Distributions},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2629498},
doi = {10.1145/2629498},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AngioneON14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AuerB14,
author = {B. O. Fagginger Auer and
Rob H. Bisseling},
title = {Efficient Matching for Column Intersection Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2616587},
doi = {10.1145/2616587},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AuerB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BaderM14,
author = {David A. Bader and
Petra Mutzel},
title = {Introduction to Special Issue ALENEX'12},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2721893},
doi = {10.1145/2721893},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BaderM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DibbeltPW14,
author = {Julian Dibbelt and
Thomas Pajor and
Dorothea Wagner},
title = {User-Constrained Multimodal Route Planning},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2699886},
doi = {10.1145/2699886},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DibbeltPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DoerrW14,
author = {Benjamin Doerr and
Magnus Wahlstr{\"{o}}m},
title = {Randomized Rounding in the Presence of a Cardinality Constraint},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2594409},
doi = {10.1145/2594409},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DoerrW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FriederR14,
author = {Asaf Frieder and
Liam Roditty},
title = {An Experimental Study on Approximating \emph{k} Shortest Simple Paths},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2630068},
doi = {10.1145/2630068},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FriederR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GalvaoD14,
author = {Gustavo Rodrigues Galv{\~{a}}o and
Zanoni Dias},
title = {An Audit Tool for Genome Rearrangement Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2661633},
doi = {10.1145/2661633},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GalvaoD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GonzalezNF14,
author = {Rodrigo Gonz{\'{a}}lez and
Gonzalo Navarro and
H{\'{e}}ctor Ferrada},
title = {Locally Compressed Suffix Arrays},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2594408},
doi = {10.1145/2594408},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/GonzalezNF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GorkeKW14,
author = {Robert G{\"{o}}rke and
Andrea Kappes and
Dorothea Wagner},
title = {Experiments on Density-Constrained Graph Clustering},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2638551},
doi = {10.1145/2638551},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GorkeKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GrossiO14,
author = {Roberto Grossi and
Giuseppe Ottaviano},
title = {Fast Compressed Tries through Path Decompositions},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2656332},
doi = {10.1145/2656332},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GrossiO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/JurkiewiczM14,
author = {Tomasz Jurkiewicz and
Kurt Mehlhorn},
title = {On a Model of Virtual Address Translation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2656337},
doi = {10.1145/2656337},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/JurkiewiczM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KirchlerLC14,
author = {Dominik Kirchler and
Leo Liberti and
Roberto Wolfler Calvo},
title = {Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal
Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2670126},
doi = {10.1145/2670126},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KirchlerLC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Klasing14,
author = {Ralf Klasing},
title = {Editorial},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2677196},
doi = {10.1145/2677196},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Klasing14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LuxenS14,
author = {Dennis Luxen and
Dennis Schieferdecker},
title = {Candidate Sets for Alternative Routes in Road Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2674395},
doi = {10.1145/2674395},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LuxenS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ManloveO14,
author = {David F. Manlove and
Gregg O'Malley},
title = {Paired and Altruistic Kidney Donation in the {UK:} Algorithms and
Experimentation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2670129},
doi = {10.1145/2670129},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ManloveO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MoruzNNW14,
author = {Gabriel Moruz and
Andrei Negoescu and
Christian Neumann and
Volker Weichert},
title = {Engineering Efficient Paging Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2670127},
doi = {10.1145/2670127},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MoruzNNW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NavarroPV14,
author = {Gonzalo Navarro and
Simon J. Puglisi and
Daniel Valenzuela},
title = {General Document Retrieval in Compact Space},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2670128},
doi = {10.1145/2670128},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/NavarroPV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SafroS014,
author = {Ilya Safro and
Peter Sanders and
Christian Schulz},
title = {Advanced Coarsening Schemes for Graph Partitioning},
journal = {{ACM} J. Exp. Algorithmics},
volume = {19},
number = {1},
year = {2014},
url = {https://doi.org/10.1145/2670338},
doi = {10.1145/2670338},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SafroS014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AbrahamDGW13,
author = {Ittai Abraham and
Daniel Delling and
Andrew V. Goldberg and
Renato F. Werneck},
title = {Alternative routes in road networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2444016.2444019},
doi = {10.1145/2444016.2444019},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AbrahamDGW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BatzGSV13,
author = {Gernot Veit Batz and
Robert Geisberger and
Peter Sanders and
Christian Vetter},
title = {Minimum time-dependent travel times with contraction hierarchies},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2444016.2444020},
doi = {10.1145/2444016.2444020},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BatzGSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BonamiLLW13,
author = {Pierre Bonami and
Jon Lee and
Sven Leyffer and
Andreas W{\"{a}}chter},
title = {On branching rules for convex mixed-integer nonlinear optimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2532568},
doi = {10.1145/2532568},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BonamiLLW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CanzarEM13,
author = {Stefan Canzar and
Khaled M. Elbassioni and
Juli{\'{a}}n Mestre},
title = {A polynomial-delay algorithm for enumerating approximate solutions
to the interval constrained coloring problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2444016.2493372},
doi = {10.1145/2444016.2493372},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CanzarEM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DelortS13,
author = {Charles Delort and
Olivier Spanjaard},
title = {A hybrid dynamic programming approach to the biobjective binary knapsack
problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2444016.2444018},
doi = {10.1145/2444016.2444018},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DelortS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EppsteinLS13,
author = {David Eppstein and
Maarten L{\"{o}}ffler and
Darren Strash},
title = {Listing All Maximal Cliques in Large Sparse Real-World Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2543629},
doi = {10.1145/2543629},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/EppsteinLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Festa13,
author = {Paola Festa},
title = {Foreword to the special issue {SEA} 2010},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2444016.2444017},
doi = {10.1145/2444016.2444017},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Festa13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GogO13,
author = {Simon Gog and
Enno Ohlebusch},
title = {Compressed suffix trees: Efficient computation and storage of LCP-values},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2444016.2461327},
doi = {10.1145/2444016.2461327},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GogO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GorkeMSSW13,
author = {Robert G{\"{o}}rke and
Pascal Maillard and
Andrea Schumm and
Christian Staudt and
Dorothea Wagner},
title = {Dynamic graph clustering combining modularity and smoothness},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2444016.2444021},
doi = {10.1145/2444016.2444021},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GorkeMSSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Hofri13,
author = {Micha Hofri},
title = {Optimal selection and sorting via dynamic programming},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2444016.2493373},
doi = {10.1145/2444016.2493373},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Hofri13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KouriM13,
author = {Tina M. Kouri and
Dinesh P. Mehta},
title = {Faster reaction mapping through improved naming techniques},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2532569},
doi = {10.1145/2532569},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/KouriM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KouzinopoulosM13,
author = {Charalampos S. Kouzinopoulos and
Konstantinos G. Margaritis},
title = {Exact online two-dimensional pattern matching using multiple pattern
matching algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2513148},
doi = {10.1145/2513148},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KouzinopoulosM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NagarajanW13,
author = {Chandrashekhar Nagarajan and
David P. Williamson},
title = {An Experimental Evaluation of Incremental and Hierarchical \emph{k}-Median
Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2543628},
doi = {10.1145/2543628},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NagarajanW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PetrilloGI13,
author = {Umberto Ferraro Petrillo and
Fabrizio Grandoni and
Giuseppe F. Italiano},
title = {Data structures resilient to memory faults: An experimental study
of dictionaries},
journal = {{ACM} J. Exp. Algorithmics},
volume = {18},
year = {2013},
url = {https://doi.org/10.1145/2444016.2444022},
doi = {10.1145/2444016.2444022},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/PetrilloGI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AckermannMRSLS12,
author = {Marcel R. Ackermann and
Marcus M{\"{a}}rtens and
Christoph Raupach and
Kamil Swierkot and
Christiane Lammersen and
Christian Sohler},
title = {StreamKM++: {A} clustering algorithm for data streams},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2184450},
doi = {10.1145/2133803.2184450},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AckermannMRSLS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AlabiBGS12,
author = {Tolu Alabi and
Jeffrey D. Blanchard and
Bradley Gordon and
Russel Steinbach},
title = {Fast \emph{k}-selection algorithms for graphics processing units},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2345676},
doi = {10.1145/2133803.2345676},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AlabiBGS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BachmaierBG12,
author = {Christian Bachmaier and
Wolfgang Brunner and
Andreas Glei{\ss}ner},
title = {Grid sifting: Leveling and crossing reduction},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2345682},
doi = {10.1145/2133803.2345682},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BachmaierBG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BaderAG12,
author = {Kai Christian Bader and
Mikhail J. Atallah and
Christian Grothoff},
title = {Efficient relaxed search in hierarchically clustered sequence datasets},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2212315},
doi = {10.1145/2133803.2212315},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BaderAG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BaderT12,
author = {David A. Bader and
Philippas Tsigas},
title = {{ACM} journal on experimental algorithmics special issue on multicore
algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2345675},
doi = {10.1145/2133803.2345675},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BaderT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BlellochH12,
author = {Guy E. Blelloch and
Dan Halperin},
title = {Introduction to special issue ALENEX'10},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2184447},
doi = {10.1145/2133803.2184447},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BlellochH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DellingKP12,
author = {Daniel Delling and
Bastian Katz and
Thomas Pajor},
title = {Parallel computation of best connections in public transportation
networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2345678},
doi = {10.1145/2133803.2345678},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DellingKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DellingerLR12,
author = {Matthew Dellinger and
Aaron Lindsay and
Binoy Ravindran},
title = {An experimental evaluation of the scalability of real-time scheduling
algorithms on large-scale multicore platforms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2345677},
doi = {10.1145/2133803.2345677},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/DellingerLR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EnnisFE12,
author = {John M. Ennis and
Charles M. Fayle and
Daniel M. Ennis},
title = {Assignment-minimum clique coverings},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2275596},
doi = {10.1145/2133803.2275596},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/EnnisFE12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GeisbergerRST12,
author = {Robert Geisberger and
Michael N. Rice and
Peter Sanders and
Vassilis J. Tsotras},
title = {Route planning with flexible edge restrictions},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2133805},
doi = {10.1145/2133803.2133805},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GeisbergerRST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KrollerBFS12,
author = {Alexander Kr{\"{o}}ller and
Tobias Baumgartner and
S{\'{a}}ndor P. Fekete and
Christiane Schmidt},
title = {Exact solutions and bounds for general art gallery problems},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2184449},
doi = {10.1145/2133803.2184449},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/KrollerBFS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Reams12,
author = {Charles Reams},
title = {Anatree: {A} Fast Data Structure for Anagrams},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2133804},
doi = {10.1145/2133803.2133804},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Reams12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SandersS12,
author = {Peter Sanders and
Dominik Schultes},
title = {Engineering highway hierarchies},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2330080},
doi = {10.1145/2133803.2330080},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SandersS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SomanKN12,
author = {Jyothish Soman and
Kishore Kothapalli and
P. J. Narayanan},
title = {Discrete range searching primitive for the {GPU} and its applications},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2345679},
doi = {10.1145/2133803.2345679},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SomanKN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Stallmann12,
author = {Matthias F. Stallmann},
title = {A heuristic for bottleneck crossing minimization and its performance
on general crossing minimization: Hypothesis and experimental study},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2212314},
doi = {10.1145/2133803.2212314},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Stallmann12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/UchoaW12,
author = {Eduardo Uchoa and
Renato Fonseca F. Werneck},
title = {Fast local search for the steiner problem in graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2012},
url = {https://doi.org/10.1145/2133803.2184448},
doi = {10.1145/2133803.2184448},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/UchoaW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AjwaniCZ11,
author = {Deepak Ajwani and
Adan Cosgaya{-}Lozano and
Norbert Zeh},
title = {A topological sorting algorithm for large graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2011},
url = {https://doi.org/10.1145/2133803.2330083},
doi = {10.1145/2133803.2330083},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AjwaniCZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BelazzouguiBPV11,
author = {Djamal Belazzougui and
Paolo Boldi and
Rasmus Pagh and
Sebastiano Vigna},
title = {Theory and practice of monotone minimal perfect hashing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2025378},
doi = {10.1145/1963190.2025378},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BelazzouguiBPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BertasiBP11,
author = {Paolo Bertasi and
Marco Bressan and
Enoch Peserico},
title = {\emph{psort}, yet another fast stable sorting software},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.1970377},
doi = {10.1145/1963190.1970377},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BertasiBP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BiroIS11,
author = {P{\'{e}}ter Bir{\'{o}} and
Robert W. Irving and
Ildik{\'{o}} Schlotter},
title = {Stable matching with couples: An empirical study},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.1970372},
doi = {10.1145/1963190.1970372},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BiroIS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Boytsov11,
author = {Leonid Boytsov},
title = {Indexing methods for approximate dictionary searching: Comparative
analysis},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
number = {1},
year = {2011},
url = {https://doi.org/10.1145/1963190.1963191},
doi = {10.1145/1963190.1963191},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Boytsov11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChimaniHJM11,
author = {Markus Chimani and
Philipp Hungerl{\"{a}}nder and
Michael J{\"{u}}nger and
Petra Mutzel},
title = {An {SDP} approach to multi-level crossing minimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2011},
url = {https://doi.org/10.1145/2133803.2330084},
doi = {10.1145/2133803.2330084},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ChimaniHJM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DoerrFKS11,
author = {Benjamin Doerr and
Tobias Friedrich and
Marvin K{\"{u}}nnemann and
Thomas Sauerwald},
title = {Quasirandom rumor spreading: An experimental analysis},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2025379},
doi = {10.1145/1963190.2025379},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DoerrFKS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FinocchiH11,
author = {Irene Finocchi and
John Hershberger},
title = {Guest editors' foreword},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2025377},
doi = {10.1145/1963190.2025377},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FinocchiH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HaverkortW11,
author = {Herman J. Haverkort and
Freek van Walderveen},
title = {Four-dimensional hilbert curves for R-trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2025380},
doi = {10.1145/1963190.2025380},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HaverkortW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HuberH11,
author = {Stefan Huber and
Martin Held},
title = {Motorcycle graphs: Stochastic properties motivate an efficient yet
simple implementation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2019578},
doi = {10.1145/1963190.2019578},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HuberH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KotCC11,
author = {Andriy Kot and
Andrey N. Chernikov and
Nikos Chrisochoides},
title = {Effective out-of-core parallel delaunay mesh refinement using off-the-shelf
software},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2019580},
doi = {10.1145/1963190.2019580},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KotCC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Michail11,
author = {Dimitrios Michail},
title = {An experimental comparison of single-sided preference matching algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2019579},
doi = {10.1145/1963190.2019579},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Michail11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MoraruA11,
author = {Iulian Moraru and
David G. Andersen},
title = {Exact pattern matching with feed-forward bloom filters},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2011},
url = {https://doi.org/10.1145/2133803.2330085},
doi = {10.1145/2133803.2330085},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MoraruA11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Muller-HannemannW11,
author = {Matthias M{\"{u}}ller{-}Hannemann and
Renato Fonseca F. Werneck},
title = {Introduction to special issue ALENEX'11},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2011},
url = {https://doi.org/10.1145/2133803.2330082},
doi = {10.1145/2133803.2330082},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Muller-HannemannW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NegruseriPSSS11,
author = {Cosmin Silvestru Negruseri and
Mircea Bogdan Pasoi and
Barbara Stanley and
Clifford Stein and
Cristian George Strat},
title = {Solving maximum flow problems on real-world bipartite graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2025381},
doi = {10.1145/1963190.2025381},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NegruseriPSSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ProsserU11,
author = {Patrick Prosser and
Chris Unsworth},
title = {Limited discrepancy search revisited},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2019581},
doi = {10.1145/1963190.2019581},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ProsserU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/RottaN11,
author = {Randolf Rotta and
Andreas Noack},
title = {Multilevel local search algorithms for modularity clustering},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.1970376},
doi = {10.1145/1963190.1970376},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/RottaN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/StantonP11,
author = {Isabelle Stanton and
Ali Pinar},
title = {Constructing and sampling graphs with a prescribed joint degree distribution},
journal = {{ACM} J. Exp. Algorithmics},
volume = {17},
number = {1},
year = {2011},
url = {https://doi.org/10.1145/2133803.2330086},
doi = {10.1145/2133803.2330086},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/StantonP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/TabourierRC11,
author = {Lionel Tabourier and
Camille Roth and
Jean{-}Philippe Cointet},
title = {Generating constrained random graphs using multiple edge switches},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2063515},
doi = {10.1145/1963190.2063515},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/TabourierRC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/TazariM11,
author = {Siamak Tazari and
Matthias M{\"{u}}ller{-}Hannemann},
title = {Dealing with large hidden constants: engineering a planar steiner
tree {PTAS}},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2025382},
doi = {10.1145/1963190.2025382},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/TazariM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/TsourakakisPTMS11,
author = {Charalampos E. Tsourakakis and
Richard Peng and
Maria A. Tsiarli and
Gary L. Miller and
Russell Schwartz},
title = {Approximation algorithms for speeding up dynamic programming and denoising
aCGH data},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.2063517},
doi = {10.1145/1963190.2063517},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/TsourakakisPTMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Vahrenhold11,
author = {Jan Vahrenhold},
title = {Preface},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.1970374},
doi = {10.1145/1963190.1970374},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Vahrenhold11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/WangEM11,
author = {Bei Wang and
Herbert Edelsbrunner and
Dmitriy Morozov},
title = {Computing elevation maxima by searching the gauss sphere},
journal = {{ACM} J. Exp. Algorithmics},
volume = {16},
year = {2011},
url = {https://doi.org/10.1145/1963190.1970375},
doi = {10.1145/1963190.1970375},
timestamp = {Fri, 19 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/WangEM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ArroyueloN10,
author = {Diego Arroyuelo and
Gonzalo Navarro},
title = {Practical approaches to reduce the space requirement of lempel-ziv-based
compressed text indices},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1883684},
doi = {10.1145/1671970.1883684},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ArroyueloN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AskitisZ10,
author = {Nikolas Askitis and
Justin Zobel},
title = {Redesigning the string hash table, burst trie, and {BST} to exploit
cache},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1921704},
doi = {10.1145/1671970.1921704},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AskitisZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BauerDSSSW10,
author = {Reinhard Bauer and
Daniel Delling and
Peter Sanders and
Dennis Schieferdecker and
Dominik Schultes and
Dorothea Wagner},
title = {Combining hierarchical and goal-directed speed-up techniques for dijkstra's
algorithm},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1671976},
doi = {10.1145/1671970.1671976},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BauerDSSSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChimaniGMW10,
author = {Markus Chimani and
Carsten Gutwenger and
Petra Mutzel and
Hoi{-}Ming Wong},
title = {Layer-free upward crossing minimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1671975},
doi = {10.1145/1671970.1671975},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ChimaniGMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DelbotL10,
author = {Fran{\c{c}}ois Delbot and
Christian Laforest},
title = {Analytical and experimental comparison of six algorithms for the vertex
cover problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1865971},
doi = {10.1145/1671970.1865971},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DelbotL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Jacobs10,
author = {Tobias Jacobs},
title = {An experimental study of recent hotlink assignment algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1671971},
doi = {10.1145/1671970.1671971},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Jacobs10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LangguthMS10,
author = {Johannes Langguth and
Fredrik Manne and
Peter Sanders},
title = {Heuristic initialization for bipartite matching problems},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1712656},
doi = {10.1145/1671970.1712656},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LangguthMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/McGeoch10,
author = {Catherine C. McGeoch},
title = {Preface},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1671974},
doi = {10.1145/1671970.1671974},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/McGeoch10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NashG10,
author = {Nicholas Nash and
David Gregg},
title = {Comparing integer data structures for 32- and 64-bit keys},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1671977},
doi = {10.1145/1671970.1671977},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NashG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SinhaW10,
author = {Ranjan Sinha and
Anthony Wirth},
title = {Engineering burstsort: Toward fast in-place string sorting},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1671978},
doi = {10.1145/1671970.1671978},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SinhaW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Spence10,
author = {Ivor T. A. Spence},
title = {sgen1: {A} generator of small but difficult satisfiability benchmarks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1671972},
doi = {10.1145/1671970.1671972},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Spence10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Ullmann10,
author = {Julian R. Ullmann},
title = {Bit-vector algorithms for binary constraint satisfaction and subgraph
isomorphism},
journal = {{ACM} J. Exp. Algorithmics},
volume = {15},
year = {2010},
url = {https://doi.org/10.1145/1671970.1921702},
doi = {10.1145/1671970.1921702},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Ullmann10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AvdilW09,
author = {Alaubek Avdil and
Karsten Weihe},
title = {Local search starting from an {LP} solution: Fast and quite good},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1594877},
doi = {10.1145/1498698.1594877},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AvdilW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BarbayLLS09,
author = {J{\'{e}}r{\'{e}}my Barbay and
Alejandro L{\'{o}}pez{-}Ortiz and
Tyler Lu and
Alejandro Salinger},
title = {An experimental investigation of set intersection algorithms for text
searching},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1564507},
doi = {10.1145/1498698.1564507},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BarbayLLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BasuMS09,
author = {Amitabh Basu and
Joseph S. B. Mitchell and
Girishkumar Sabhnani},
title = {Geometric algorithms for optimal airspace design and air traffic controller
workload balancing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537598},
doi = {10.1145/1498698.1537598},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BasuMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BauerD09,
author = {Reinhard Bauer and
Daniel Delling},
title = {{SHARC:} Fast and robust unidirectional routing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537599},
doi = {10.1145/1498698.1537599},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BauerD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CedermanT09,
author = {Daniel Cederman and
Philippas Tsigas},
title = {GPU-Quicksort: {A} practical Quicksort algorithm for graphics processors},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1564500},
doi = {10.1145/1498698.1564500},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CedermanT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CherkasskyGGTW09,
author = {Boris V. Cherkassky and
Loukas Georgiadis and
Andrew V. Goldberg and
Robert Endre Tarjan and
Renato Fonseca F. Werneck},
title = {Shortest-path feasibility algorithms: An experimental evaluation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537602},
doi = {10.1145/1498698.1537602},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CherkasskyGGTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChimaniGM09,
author = {Markus Chimani and
Carsten Gutwenger and
Petra Mutzel},
title = {Experiments on exact crossing minimization using column generation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1564504},
doi = {10.1145/1498698.1564504},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ChimaniGM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChimaniKLM09,
author = {Markus Chimani and
Maria Kandyba and
Ivana Ljubic and
Petra Mutzel},
title = {Obtaining optimal \emph{k}-cardinality trees fast},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537600},
doi = {10.1145/1498698.1537600},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ChimaniKLM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ColemanW09,
author = {Tom Coleman and
Anthony Wirth},
title = {Ranking tournaments: Local search and a new algorithm},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537601},
doi = {10.1145/1498698.1537601},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ColemanW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DeinekoT09,
author = {Vladimir G. Deineko and
Alexander Tiskin},
title = {Fast minimum-weight double-tree shortcutting for metric {TSP:} Is
the best one good enough?},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1594232},
doi = {10.1145/1498698.1594232},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DeinekoT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Demetrescu09,
author = {Camil Demetrescu},
title = {Preface},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1594227},
doi = {10.1145/1498698.1594227},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Demetrescu09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DumitriuFKM09,
author = {Daniel Dumitriu and
Stefan Funke and
Martin Kutz and
Nikola Milosavljevic},
title = {How much geometry it takes to reconstruct a 2-manifold in R\({}^{\mbox{3}}\)},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537597},
doi = {10.1145/1498698.1537597},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DumitriuFKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EisenbrandKX09,
author = {Friedrich Eisenbrand and
Andreas Karrenbauer and
Chihao Xu},
title = {Algorithms for longer {OLED} lifetime},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1594229},
doi = {10.1145/1498698.1594229},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/EisenbrandKX09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EnglertRW09,
author = {Matthias Englert and
Heiko R{\"{o}}glin and
Matthias Westermann},
title = {Evaluation of online strategies for reordering buffers},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1564503},
doi = {10.1145/1498698.1564503},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/EnglertRW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Estivill-CastroHS09,
author = {Vladimir Estivill{-}Castro and
Apichat Heednacram and
Francis Suraweera},
title = {Reduction rules deliver efficient FPT-algorithms for covering points
with lines},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1626535},
doi = {10.1145/1498698.1626535},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Estivill-CastroHS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FarshiG09,
author = {Mohammad Farshi and
Joachim Gudmundsson},
title = {Experimental study of geometric \emph{t}-spanners},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1564499},
doi = {10.1145/1498698.1564499},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FarshiG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FigueroaCNP09,
author = {Karina Figueroa and
Edgar Ch{\'{a}}vez and
Gonzalo Navarro and
Rodrigo Paredes},
title = {Speeding up spatial approximation search in metric spaces},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1564506},
doi = {10.1145/1498698.1564506},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FigueroaCNP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FriasPR09,
author = {Leonor Frias and
Jordi Petit and
Salvador Roura},
title = {Lists revisited: Cache-conscious {STL} lists},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1564505},
doi = {10.1145/1498698.1564505},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FriasPR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HolzerSWPZ09,
author = {Martin Holzer and
Frank Schulz and
Dorothea Wagner and
Grigorios Prasinos and
Christos D. Zaroliagis},
title = {Engineering planar separator algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1571635},
doi = {10.1145/1498698.1571635},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HolzerSWPZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/IrvingM09,
author = {Robert W. Irving and
David F. Manlove},
title = {Finding large stable matchings},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537595},
doi = {10.1145/1498698.1537595},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/IrvingM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Julstrom09,
author = {Bryant A. Julstrom},
title = {Greedy heuristics for the bounded diameter minimum spanning tree problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1498699},
doi = {10.1145/1498698.1498699},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Julstrom09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LoeraHLO09,
author = {Jes{\'{u}}s A. De Loera and
David C. Haws and
Jon Lee and
Allison O'Hair},
title = {Computation in multicriteria matroid optimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1658383},
doi = {10.1145/1498698.1658383},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LoeraHLO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MaueSM09,
author = {Jens Maue and
Peter Sanders and
Domagoj Matijevic},
title = {Goal-directed shortest-path queries using precomputed cluster distances},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1564502},
doi = {10.1145/1498698.1564502},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MaueSM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MunroW09,
author = {J. Ian Munro and
Dorothea Wagner},
title = {Preface},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1537596},
doi = {10.1145/1498698.1537596},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MunroW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PutzeSS09,
author = {Felix Putze and
Peter Sanders and
Johannes Singler},
title = {Cache-, hash-, and space-efficient bloom filters},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1594230},
doi = {10.1145/1498698.1594230},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PutzeSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SernaA09,
author = {Maria J. Serna and
Carme {\`{A}}lvarez},
title = {Preface to special section of selected papers from {WEA} 2006},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1564501},
doi = {10.1145/1498698.1564501},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SernaA09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/TarjanW09,
author = {Robert Endre Tarjan and
Renato Fonseca F. Werneck},
title = {Dynamic trees in practice},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1594231},
doi = {10.1145/1498698.1594231},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/TarjanW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ValimakiMGD09,
author = {Niko V{\"{a}}lim{\"{a}}ki and
Veli M{\"{a}}kinen and
Wolfgang Gerlach and
Kashyap Dixit},
title = {Engineering a compressed suffix tree implementation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {14},
year = {2009},
url = {https://doi.org/10.1145/1498698.1594228},
doi = {10.1145/1498698.1594228},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ValimakiMGD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Bar-NoyLCT08,
author = {Amotz Bar{-}Noy and
Richard E. Ladner and
Jacob Christensen and
Tami Tamir},
title = {A general buffer scheme for the windows scheduling problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412234},
doi = {10.1145/1412228.1412234},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/Bar-NoyLCT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BarskySTU08,
author = {Marina Barsky and
Ulrike Stege and
Alex Thomo and
Chris Upton},
title = {A graph approach to the threshold all-against-all substring matching
problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.10:1--1.10:26},
year = {2008},
url = {https://doi.org/10.1145/1227161.1370601},
doi = {10.1145/1227161.1370601},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BarskySTU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BiggarNWG08,
author = {Paul Biggar and
Nicholas Nash and
Kevin Williams and
David Gregg},
title = {An experimental study of sorting and branch prediction},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.8:1--1.8:39},
year = {2008},
url = {https://doi.org/10.1145/1227161.1370599},
doi = {10.1145/1227161.1370599},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BiggarNWG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BrodalFM08,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Gabriel Moruz},
title = {On the adaptiveness of Quicksort},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {3.2:1--3.2:20},
year = {2008},
url = {https://doi.org/10.1145/1227161.1402294},
doi = {10.1145/1227161.1402294},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BrodalFM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CodenottiMPRV08,
author = {Bruno Codenotti and
Benton McCune and
Sriram V. Pemmaraju and
Rajiv Raman and
Kasturi R. Varadarajan},
title = {An experimental study of different approaches to solve the market
equilibrium problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {3.3:1--3.3:21},
year = {2008},
url = {https://doi.org/10.1145/1227161.1402295},
doi = {10.1145/1227161.1402295},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CodenottiMPRV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CrabtreeM08,
author = {John D. Crabtree and
Dinesh P. Mehta},
title = {Automated reaction mapping},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1498697},
doi = {10.1145/1412228.1498697},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/CrabtreeM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DementievKMS08,
author = {Roman Dementiev and
Juha K{\"{a}}rkk{\"{a}}inen and
Jens Mehnert and
Peter Sanders},
title = {Better external memory suffix array construction},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {3.4:1--3.4:24},
year = {2008},
url = {https://doi.org/10.1145/1227161.1402296},
doi = {10.1145/1227161.1402296},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/DementievKMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DemetrescuT08,
author = {Camil Demetrescu and
Roberto Tamassia},
title = {Papers from {ALENEX} 2005},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {3.1:1},
year = {2008},
url = {https://doi.org/10.1145/1227161.1402293},
doi = {10.1145/1227161.1402293},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DemetrescuT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DietzfelbingerHW08,
author = {Martin Dietzfelbinger and
Martin H{\"{u}}hne and
Christoph Weidling},
title = {A dictionary implementation based on dynamic perfect hashing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.11:1--1.11:25},
year = {2008},
url = {https://doi.org/10.1145/1227161.1370602},
doi = {10.1145/1227161.1370602},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DietzfelbingerHW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ElmasryH08,
author = {Amr Elmasry and
Abdelrahman Hammad},
title = {Inversion-sensitive sorting algorithms in practice},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1455267},
doi = {10.1145/1412228.1455267},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ElmasryH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FerraginaGNV08,
author = {Paolo Ferragina and
Rodrigo Gonz{\'{a}}lez and
Gonzalo Navarro and
Rossano Venturini},
title = {Compressed text indexes: From theory to practice},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1455268},
doi = {10.1145/1412228.1455268},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FerraginaGNV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Fredriksson08,
author = {Kimmo Fredriksson},
title = {Succinct backward-DAWG-matching},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1455263},
doi = {10.1145/1412228.1455263},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Fredriksson08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GottlobS08,
author = {Georg Gottlob and
Marko Samer},
title = {A backtracking-based algorithm for hypertree decomposition},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412229},
doi = {10.1145/1412228.1412229},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GottlobS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GrammGHN08,
author = {Jens Gramm and
Jiong Guo and
Falk H{\"{u}}ffner and
Rolf Niedermeier},
title = {Data reduction and exact algorithms for clique cover},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412236},
doi = {10.1145/1412228.1412236},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/GrammGHN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HaranH08,
author = {Idit Haran and
Dan Halperin},
title = {An experimental study of point location in planar arrangements in
{CGAL}},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412237},
doi = {10.1145/1412228.1412237},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HaranH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HaverkortTZ08,
author = {Herman J. Haverkort and
Laura Toma and
Yi Zhuang},
title = {Computing visibility on terrains in external memory},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412233},
doi = {10.1145/1412228.1412233},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HaverkortTZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HazelTVW08,
author = {Thomas Hazel and
Laura Toma and
Jan Vahrenhold and
Rajiv Wickremesinghe},
title = {Terracost: Computing least-cost-path surfaces for massive grid terrains},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.9:1--1.9:31},
year = {2008},
url = {https://doi.org/10.1145/1227161.1370600},
doi = {10.1145/1227161.1370600},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HazelTVW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HershbergerSS08,
author = {John Hershberger and
Nisheeth Shrivastava and
Subhash Suri},
title = {Summarizing spatial data streams using ClusterHulls},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412238},
doi = {10.1145/1412228.1412238},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HershbergerSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HolzerSW08,
author = {Martin Holzer and
Frank Schulz and
Dorothea Wagner},
title = {Engineering multilevel overlay graphs for shortest-path queries},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412239},
doi = {10.1145/1412228.1412239},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HolzerSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KavithaK08,
author = {Telikepalli Kavitha and
Katakam Vamsi Krishna},
title = {An improved heuristic for computing short integral cycle bases},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1498696},
doi = {10.1145/1412228.1498696},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KavithaK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KrommidasZ08,
author = {Ioannis Krommidas and
Christos D. Zaroliagis},
title = {An experimental study of algorithms for fully dynamic transitive closure},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.6:1--1.6:22},
year = {2008},
url = {https://doi.org/10.1145/1227161.1370597},
doi = {10.1145/1227161.1370597},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KrommidasZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LanthierNW08,
author = {Mark Lanthier and
Doron Nussbaum and
Tsuo{-}Jung Wang},
title = {Computing an approximation of the 1-center problem on weighted terrain
surfaces},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412231},
doi = {10.1145/1412228.1412231},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LanthierNW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LarssonGHPT08,
author = {Andreas Larsson and
Anders Gidenstam and
Phuong Hoai Ha and
Marina Papatriantafilou and
Philippas Tsigas},
title = {Multiword atomic read/write registers on multiprocessor systems},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1455262},
doi = {10.1145/1412228.1455262},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LarssonGHPT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Li08,
author = {Keqin Li},
title = {Experimental average-case performance evaluation of online algorithms
for routing and wavelength assignment and throughput maximization
in {WDM} optical networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.7:1--1.7:24},
year = {2008},
url = {https://doi.org/10.1145/1227161.1370598},
doi = {10.1145/1227161.1370598},
timestamp = {Wed, 15 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Li08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MagnienLH08,
author = {Cl{\'{e}}mence Magnien and
Matthieu Latapy and
Michel Habib},
title = {Fast computation of empirically tight bounds for the diameter of massive
graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1455266},
doi = {10.1145/1412228.1455266},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MagnienLH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Naanaa08,
author = {Wady Naanaa},
title = {A domain decomposition algorithm for constraint satisfaction},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1455269},
doi = {10.1145/1412228.1455269},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Naanaa08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NashLG08,
author = {Nicholas Nash and
Sylvain Lelait and
David Gregg},
title = {Efficiently implementing maximum independent set algorithms on circle
graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1455265},
doi = {10.1145/1412228.1455265},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NashLG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Navarro08,
author = {Gonzalo Navarro},
title = {Implementing the LZ-index: Theory versus practice},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412230},
doi = {10.1145/1412228.1412230},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/Navarro08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NavarroR08,
author = {Gonzalo Navarro and
Nora Reyes},
title = {Dynamic spatial approximation trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.5:1--1.5:68},
year = {2008},
url = {https://doi.org/10.1145/1227161.1322337},
doi = {10.1145/1227161.1322337},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/NavarroR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/RamanS08,
author = {Rajeev Raman and
Matthias F. Stallmann},
title = {Preface},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412235},
doi = {10.1145/1412228.1412235},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/RamanS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SafroRB08,
author = {Ilya Safro and
Dorit Ron and
Achi Brandt},
title = {Multilevel algorithms for linear ordering problems},
journal = {{ACM} J. Exp. Algorithmics},
volume = {13},
year = {2008},
url = {https://doi.org/10.1145/1412228.1412232},
doi = {10.1145/1412228.1412232},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SafroRB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SwensonMEM08,
author = {Krister M. Swenson and
Mark Marron and
Joel V. Earnest{-}DeYoung and
Bernard M. E. Moret},
title = {Approximating the true evolutionary distance between two genomes},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {3.5:1--3.5:17},
year = {2008},
url = {https://doi.org/10.1145/1227161.1402297},
doi = {10.1145/1227161.1402297},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SwensonMEM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AloulRMS07,
author = {Fadi A. Aloul and
Arathi Ramani and
Igor L. Markov and
Karem A. Sakallah},
title = {Symmetry breaking for pseudo-Boolean formulas},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.3:1--1.3:14},
year = {2007},
url = {https://doi.org/10.1145/1227161.1278375},
doi = {10.1145/1227161.1278375},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AloulRMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ArgeI07,
author = {Lars Arge and
Giuseppe F. Italiano},
title = {Preface},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {2.1:1},
year = {2007},
url = {https://doi.org/10.1145/1227161.1227163},
doi = {10.1145/1227161.1227163},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ArgeI07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BenderBJP07,
author = {Michael A. Bender and
Bryan Bradley and
Geetha Jagannathan and
Krishnan Pillaipakkamnatt},
title = {Sum-of-squares heuristics for bin packing and memory allocation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {2.3:1--2.3:19},
year = {2007},
url = {https://doi.org/10.1145/1227161.1227165},
doi = {10.1145/1227161.1227165},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BenderBJP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BrandesGW07,
author = {Ulrik Brandes and
Marco Gaertler and
Dorothea Wagner},
title = {Engineering graph clustering: Models and experimental evaluation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.1:1--1.1:26},
year = {2007},
url = {https://doi.org/10.1145/1227161.1227162},
doi = {10.1145/1227161.1227162},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BrandesGW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BrodalFV07,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Kristoffer Vinther},
title = {Engineering a cache-oblivious sorting algorithm},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {2.2:1--2.2:23},
year = {2007},
url = {https://doi.org/10.1145/1227161.1227164},
doi = {10.1145/1227161.1227164},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BrodalFV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Leaver-FayLSW07,
author = {Andrew Leaver{-}Fay and
Yuanxin Liu and
Jack Snoeyink and
Xueyi Wang},
title = {Faster placement of hydrogens in protein structures by dynamic programming},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {2.5:1--2.5:16},
year = {2007},
url = {https://doi.org/10.1145/1227161.1227167},
doi = {10.1145/1227161.1227167},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Leaver-FayLSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ManiscalcoP07,
author = {Michael A. Maniscalco and
Simon J. Puglisi},
title = {An efficient, versatile approach to suffix sorting},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.2:1--1.2:23},
year = {2007},
url = {https://doi.org/10.1145/1227161.1278374},
doi = {10.1145/1227161.1278374},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ManiscalcoP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PellegriniF07,
author = {Marco Pellegrini and
Giordano Fusco},
title = {Efficient {IP} table lookup via adaptive stratified trees with selective
reconstructions},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {1.4:1--1.4:28},
year = {2007},
url = {https://doi.org/10.1145/1227161.1278376},
doi = {10.1145/1227161.1278376},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PellegriniF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PyrgaSWZ07,
author = {Evangelia Pyrga and
Frank Schulz and
Dorothea Wagner and
Christos D. Zaroliagis},
title = {Efficient models for timetable information in public transportation
systems},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {2.4:1--2.4:39},
year = {2007},
url = {https://doi.org/10.1145/1227161.1227166},
doi = {10.1145/1227161.1227166},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PyrgaSWZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AleksandrovDGM06,
author = {Lyudmil Aleksandrov and
Hristo N. Djidjev and
Hua Guo and
Anil Maheshwari},
title = {Partitioning planar graphs with costs and weights},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1210588},
doi = {10.1145/1187436.1210588},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AleksandrovDGM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BoukercheM06,
author = {Azzedine Boukerche and
Alba Cristina Magalhaes Alves de Melo},
title = {Integrating coordinated checkpointing and recovery mechanisms into
{DSM} synchronization barriers},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216586},
doi = {10.1145/1187436.1216586},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BoukercheM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FahleT06,
author = {Torsten Fahle and
Karsten Tiemann},
title = {A faster branch-and-bound algorithm for the test-cover problem based
on set-covering techniques},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216579},
doi = {10.1145/1187436.1216579},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FahleT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FestaPPR06,
author = {Paola Festa and
Panos M. Pardalos and
Leonidas S. Pitsoulis and
Mauricio G. C. Resende},
title = {{GRASP} with path relinking for the weighted {MAXSAT} problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216581},
doi = {10.1145/1187436.1216581},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FestaPPR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FlamminiNP06,
author = {Michele Flammini and
Alfredo Navarra and
Stephane Perennes},
title = {The "real" approximation factor of the {MST} heuristic for the minimum
energy broadcasting},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216587},
doi = {10.1145/1187436.1216587},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FlamminiNP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GoshiL06,
author = {Justin Goshi and
Richard E. Ladner},
title = {Algorithms for dynamic multicast key distribution},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1210587},
doi = {10.1145/1187436.1210587},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/GoshiL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Heinrich-LitanL06,
author = {Laura Heinrich{-}Litan and
Marco E. L{\"{u}}bbecke},
title = {Rectangle covers revisited computationally},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216583},
doi = {10.1145/1187436.1216583},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Heinrich-LitanL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/IlinkinJSJCS06,
author = {Ivaylo Ilinkin and
Ravi Janardan and
Michiel H. M. Smid and
Eric Johnson and
Paul Castillo and
J{\"{o}}rg Schwerdt},
title = {Heuristics for estimating contact area of supports in layered manufacturing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1210589},
doi = {10.1145/1187436.1210589},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/IlinkinJSJCS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LeoneRAM06,
author = {Pierre Leone and
Jos{\'{e}} D. P. Rolim and
Paul Albuquerque and
Christian Mazza},
title = {A framework for probabilistic numerical evaluation of sensor networks:
{A} case study of a localization protocol},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216580},
doi = {10.1145/1187436.1216580},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LeoneRAM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MehlhornM06,
author = {Kurt Mehlhorn and
Dimitrios Michail},
title = {Implementing minimum cycle basis algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216582},
doi = {10.1145/1187436.1216582},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MehlhornM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MohringSSWW06,
author = {Rolf H. M{\"{o}}hring and
Heiko Schilling and
Birk Sch{\"{u}}tz and
Dorothea Wagner and
Thomas Willhalm},
title = {Partitioning graphs to speedup Dijkstra's algorithm},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216585},
doi = {10.1145/1187436.1216585},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MohringSSWW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Nikoletseas06,
author = {Sotiris E. Nikoletseas},
title = {{JEA} Special Section},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216578},
doi = {10.1145/1187436.1216578},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Nikoletseas06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PanagopoulouS06,
author = {Panagiota N. Panagopoulou and
Paul G. Spirakis},
title = {Algorithms for pure Nash equilibria in weighted congestion games},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1216584},
doi = {10.1145/1187436.1216584},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PanagopoulouS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PearceK06,
author = {David J. Pearce and
Paul H. J. Kelly},
title = {A dynamic topological sort algorithm for directed acyclic graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1210590},
doi = {10.1145/1187436.1210590},
timestamp = {Wed, 26 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PearceK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PennerP06,
author = {Michael Penner and
Viktor K. Prasanna},
title = {Cache-Friendly implementations of transitive closure},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1210586},
doi = {10.1145/1187436.1210586},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PennerP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SalmelaTK06,
author = {Leena Salmela and
Jorma Tarhio and
Jari Kyt{\"{o}}joki},
title = {Multipattern string matching with \emph{q}-grams},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1187438},
doi = {10.1145/1187436.1187438},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SalmelaTK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SinhaZR06,
author = {Ranjan Sinha and
Justin Zobel and
David Ring},
title = {Cache-efficient string sorting using copying},
journal = {{ACM} J. Exp. Algorithmics},
volume = {11},
year = {2006},
url = {https://doi.org/10.1145/1187436.1187439},
doi = {10.1145/1187436.1187439},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SinhaZR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BrachtMM05,
author = {Evandro C. Bracht and
Luis A. A. Meira and
Fl{\'{a}}vio Keidi Miyazawa},
title = {A greedy approximation algorithm for the uniform metric labeling problem
analyzed by a primal-dual technique},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180623},
doi = {10.1145/1064546.1180623},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BrachtMM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DuK05,
author = {Jingde Du and
Stavros G. Kolliopoulos},
title = {Implementing approximation algorithms for the single-source unsplittable
flow problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180614},
doi = {10.1145/1064546.1180614},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DuK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DuchM05,
author = {Amalia Duch and
Conrado Mart{\'{\i}}nez},
title = {Improving the performance of multidimensional search using fingers},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180615},
doi = {10.1145/1064546.1180615},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DuchM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HolzerSWW05,
author = {Martin Holzer and
Frank Schulz and
Dorothea Wagner and
Thomas Willhalm},
title = {Combining speed-up techniques for shortest-path computations},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180616},
doi = {10.1145/1064546.1180616},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HolzerSWW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HyyroFN05,
author = {Heikki Hyyr{\"{o}} and
Kimmo Fredriksson and
Gonzalo Navarro},
title = {Increased bit-parallelism for approximate and multiple string matching},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180617},
doi = {10.1145/1064546.1180617},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/HyyroFN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/IoannidisGA05,
author = {Ioannis Ioannidis and
Ananth Grama and
Mikhail J. Atallah},
title = {Adaptive data structures for {IP} lookups},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1064548},
doi = {10.1145/1064546.1064548},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/IoannidisGA05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LeshMMM05,
author = {Neal Lesh and
Joe Marks and
A. McMahon and
Michael Mitzenmacher},
title = {New heuristic and interactive approaches to 2D rectangular strip packing},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1083322},
doi = {10.1145/1064546.1083322},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LeshMMM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Lopez-OrtizMSS05,
author = {Alejandro L{\'{o}}pez{-}Ortiz and
Mehdi Mirzazadeh and
Mohammad Ali Safari and
M. Hossein Sheikh Attar},
title = {Fast string sorting using order-preserving compression},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180611},
doi = {10.1145/1064546.1180611},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Lopez-OrtizMSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NikolovTB05,
author = {Nikola S. Nikolov and
Alexandre Tarassov and
J{\"{u}}rgen Branke},
title = {In search for efficient heuristics for minimum-width graph layering
with consideration of dummy nodes},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180618},
doi = {10.1145/1064546.1180618},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NikolovTB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PemmarajuPR05,
author = {Sriram V. Pemmaraju and
Sriram Penumatcha and
Rajiv Raman},
title = {Approximating interval coloring and max-coloring in chordal graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180619},
doi = {10.1145/1064546.1180619},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/PemmarajuPR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/RibeiroM05,
author = {Celso C. Ribeiro and
Simone L. Martins},
title = {Preface},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180620},
doi = {10.1145/1064546.1180620},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/RibeiroM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SantosOS05,
author = {Haroldo G. Santos and
Luiz Satoru Ochi and
Marcone J. F. Souza},
title = {A Tabu search heuristic with efficient diversification strategies
for the class/teacher timetabling problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180621},
doi = {10.1145/1064546.1180621},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/SantosOS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SinhaZ05,
author = {Ranjan Sinha and
Justin Zobel},
title = {Using random sampling to build approximate tries for efficient string
sorting},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180622},
doi = {10.1145/1064546.1180622},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SinhaZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SouzaLAM05,
author = {Cid C. de Souza and
Andr{\'{e}} M. Lima and
Guido Araujo and
Nahri Moreano},
title = {The datapath merging problem in reconfigurable systems: Complexity,
dual bounds and heuristic evaluation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1180613},
doi = {10.1145/1064546.1180613},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SouzaLAM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/WagnerWZ05,
author = {Dorothea Wagner and
Thomas Willhalm and
Christos D. Zaroliagis},
title = {Geometric containers for efficient shortest-path computation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {10},
year = {2005},
url = {https://doi.org/10.1145/1064546.1103378},
doi = {10.1145/1064546.1103378},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/WagnerWZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BrandesSWW04,
author = {Ulrik Brandes and
Frank Schulz and
Dorothea Wagner and
Thomas Willhalm},
title = {Generating node coordinates for shortest-path computations in transportation
networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {9},
year = {2004},
url = {https://doi.org/10.1145/1005813.1005815},
doi = {10.1145/1005813.1005815},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BrandesSWW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FredrikssonN04,
author = {Kimmo Fredriksson and
Gonzalo Navarro},
title = {Average-optimal single and multiple approximate string matching},
journal = {{ACM} J. Exp. Algorithmics},
volume = {9},
year = {2004},
url = {https://doi.org/10.1145/1005813.1041513},
doi = {10.1145/1005813.1041513},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/FredrikssonN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GohT04,
author = {Rick Siow Mong Goh and
Ian Li{-}Jin Thng},
title = {Twol-amalgamated priority queues},
journal = {{ACM} J. Exp. Algorithmics},
volume = {9},
year = {2004},
url = {https://doi.org/10.1145/1005813.1057625},
doi = {10.1145/1005813.1057625},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GohT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MarathePR04,
author = {Madhav V. Marathe and
Alessandro Panconesi and
Larry D. Risinger Jr.},
title = {An experimental study of a simple, distributed edge-coloring algorithm},
journal = {{ACM} J. Exp. Algorithmics},
volume = {9},
year = {2004},
url = {https://doi.org/10.1145/1005813.1041515},
doi = {10.1145/1005813.1041515},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MarathePR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NiewiadomskiAH04,
author = {Robert Niewiadomski and
Jos{\'{e}} Nelson Amaral and
Robert C. Holte},
title = {A performance study of data layout techniques for improving data locality
in refinement-based pathfinding},
journal = {{ACM} J. Exp. Algorithmics},
volume = {9},
year = {2004},
url = {https://doi.org/10.1145/1005813.1041511},
doi = {10.1145/1005813.1041511},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/NiewiadomskiAH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SinhaZ04,
author = {Ranjan Sinha and
Justin Zobel},
title = {Cache-conscious sorting of large sets of strings with dynamic tries},
journal = {{ACM} J. Exp. Algorithmics},
volume = {9},
year = {2004},
url = {https://doi.org/10.1145/1005813.1041517},
doi = {10.1145/1005813.1041517},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SinhaZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ArgeDT03,
author = {Lars Arge and
Andrew Danner and
Sha{-}Mayn Teh},
title = {I/O-efficient point location using persistent B-trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {8},
year = {2003},
url = {https://doi.org/10.1145/996546.996549},
doi = {10.1145/996546.996549},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ArgeDT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BreimerGL03,
author = {Eric Breimer and
Mark K. Goldberg and
Darren T. Lim},
title = {A learning algorithm for the longest common subsequence problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {8},
year = {2003},
url = {https://doi.org/10.1145/996546.996552},
doi = {10.1145/996546.996552},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BreimerGL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BuchsbaumFKVW03,
author = {Adam L. Buchsbaum and
Glenn S. Fowler and
Balachander Krishnamurthy and
Kiem{-}Phong Vo and
Jia Wang},
title = {Fast prefix matching of bounded strings},
journal = {{ACM} J. Exp. Algorithmics},
volume = {8},
year = {2003},
url = {https://doi.org/10.1145/996546.996550},
doi = {10.1145/996546.996550},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BuchsbaumFKVW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/KumarMY03,
author = {Piyush Kumar and
Joseph S. B. Mitchell and
E. Alper Yildirim},
title = {Approximate minimum enclosing balls in high dimensions using core-sets},
journal = {{ACM} J. Exp. Algorithmics},
volume = {8},
year = {2003},
url = {https://doi.org/10.1145/996546.996548},
doi = {10.1145/996546.996548},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/KumarMY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Petit03,
author = {Jordi Petit},
title = {Experiments on the minimum linear arrangement problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {8},
year = {2003},
url = {https://doi.org/10.1145/996546.996554},
doi = {10.1145/996546.996554},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Petit03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/VenkataramanSM03,
author = {Gayathri Venkataraman and
Sartaj Sahni and
Srabani Mukhopadhyaya},
title = {A blocked all-pairs shortest-paths algorithm},
journal = {{ACM} J. Exp. Algorithmics},
volume = {8},
year = {2003},
url = {https://doi.org/10.1145/996546.996553},
doi = {10.1145/996546.996553},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/VenkataramanSM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AlbersS02,
author = {Susanne Albers and
Bianca Schr{\"{o}}der},
title = {An Experimental Study of Online Scheduling Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {3},
year = {2002},
url = {https://doi.org/10.1145/944618.944621},
doi = {10.1145/944618.944621},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AlbersS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BackesW02,
author = {Werner Backes and
Susanne Wetzel},
title = {Heuristics on Lattice Basis Reduction in Practice},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {1},
year = {2002},
url = {https://doi.org/10.1145/944618.944619},
doi = {10.1145/944618.944619},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BackesW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EdelkampS02,
author = {Stefan Edelkamp and
Patrick Stiegeler},
title = {Implementing {HEAPSORT} with (n logn - 0.9n) and {QUICKSORT} with
(n logn + 0.2n) Comparisons},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {5},
year = {2002},
url = {https://doi.org/10.1145/944618.944623},
doi = {10.1145/944618.944623},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/EdelkampS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ErlebachJ02,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Implementation of Approximation Algorithms for Weighted and Unweighted
Edge-Disjoint Paths in Bidirected Trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {6},
year = {2002},
url = {https://doi.org/10.1145/944618.944624},
doi = {10.1145/944618.944624},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ErlebachJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FeketeMRT02,
author = {S{\'{a}}ndor P. Fekete and
Henk Meijer and
Andr{\'{e}} Rohe and
Walter Tietze},
title = {Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics
for Maximum Matchings and Maximum Traveling Salesman Problems},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {11},
year = {2002},
url = {https://doi.org/10.1145/944618.944629},
doi = {10.1145/944618.944629},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FeketeMRT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HerrmannH02,
author = {Francine Herrmann and
Alain Hertz},
title = {Finding the Chromatic Number by Means of Critical Graphs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {10},
year = {2002},
url = {https://doi.org/10.1145/944618.944628},
doi = {10.1145/944618.944628},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HerrmannH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/IwamaKMOU02,
author = {Kazuo Iwama and
Daisuke Kawai and
Shuichi Miyazaki and
Yasuo Okabe and
Jun Umemoto},
title = {Parallelizing Local Search for {CNF} Satisfiability Using Vectorization
and {PVM}},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {2},
year = {2002},
url = {https://doi.org/10.1145/944618.944620},
doi = {10.1145/944618.944620},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/IwamaKMOU02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LassousG02,
author = {Isabelle Gu{\'{e}}rin Lassous and
Jens Gustedt},
title = {Portable List Ranking: An Experimental Study},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {7},
year = {2002},
url = {https://doi.org/10.1145/944618.944625},
doi = {10.1145/944618.944625},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/LassousG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MehlhornS02,
author = {Kurt Mehlhorn and
Guido Sch{\"{a}}fer},
title = {Implementation of O(n m log n) Weighted Matchings in General Graphs:
The Power of Data Structures},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {4},
year = {2002},
url = {https://doi.org/10.1145/944618.944622},
doi = {10.1145/944618.944622},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MehlhornS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Neri02,
author = {Filippo Neri},
title = {Relational Concept Learning by Cooperative Evolution},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {12},
year = {2002},
url = {https://doi.org/10.1145/944618.944630},
doi = {10.1145/944618.944630},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Neri02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/VahrenholdH02,
author = {Jan Vahrenhold and
Klaus H. Hinrichs},
title = {Planar Point Location For Large Data Sets: To Seek Or Not To Seek},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {8},
year = {2002},
url = {https://doi.org/10.1145/944618.944626},
doi = {10.1145/944618.944626},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/VahrenholdH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/WickremesingheACV02,
author = {Rajiv Wickremesinghe and
Lars Arge and
Jeffrey S. Chase and
Jeffrey Scott Vitter},
title = {Efficient Sorting Using Registers and Caches},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {9},
year = {2002},
url = {https://doi.org/10.1145/944618.944627},
doi = {10.1145/944618.944627},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/WickremesingheACV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ArgeTV01,
author = {Lars Arge and
Laura Toma and
Jeffrey Scott Vitter},
title = {I/O-Efficient Algorithms for Problems on Grid-Based Terrains},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {1},
year = {2001},
url = {https://doi.org/10.1145/945394.945395},
doi = {10.1145/945394.945395},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/ArgeTV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DemestrescuF01,
author = {Camil Demetrescu and
Irene Finocchi},
title = {Removing Cycles for Minimizing Crossings},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {2},
year = {2001},
url = {https://doi.org/10.1145/945394.945396},
doi = {10.1145/945394.945396},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/DemestrescuF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FrigioniMNZ01,
author = {Daniele Frigioni and
Tobias Miller and
Umberto Nanni and
Christos D. Zaroliagis},
title = {An Experimental Study of Dynamic Algorithms for Transitive Closure},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {9},
year = {2001},
url = {https://doi.org/10.1145/945394.945403},
doi = {10.1145/945394.945403},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FrigioniMNZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/GabowK01,
author = {Harold N. Gabow and
Tadayoshi Kohno},
title = {A Network-Flow-Based Scheduler: Design, Performance History, and Experimental
Analysis},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {3},
year = {2001},
url = {https://doi.org/10.1145/945394.945397},
doi = {10.1145/945394.945397},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/GabowK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/IyerKRT01,
author = {Raj Iyer and
David R. Karger and
Hariharan Rahul and
Mikkel Thorup},
title = {An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity
Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {4},
year = {2001},
url = {https://doi.org/10.1145/945394.945398},
doi = {10.1145/945394.945398},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/IyerKRT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Liberatore01,
author = {Vincenzo Liberatore},
title = {Caching and Scheduling for Broadcast Disk Systems},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {5},
year = {2001},
url = {https://doi.org/10.1145/945394.945399},
doi = {10.1145/945394.945399},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Liberatore01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/MatiasRS01,
author = {Yossi Matias and
Nasir M. Rajpoot and
S{\"{u}}leyman Cenk Sahinalp},
title = {The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {10},
year = {2001},
url = {https://doi.org/10.1145/945394.945404},
doi = {10.1145/945394.945404},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/MatiasRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NarasimhanZ01,
author = {Giri Narasimhan and
Martin Zachariasen},
title = {Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {6},
year = {2001},
url = {https://doi.org/10.1145/945394.945400},
doi = {10.1145/945394.945400},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/NarasimhanZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/RahmanR01,
author = {Naila Rahman and
Rajeev Raman},
title = {Adapting Radix Sort to the Memory Hierarchy},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {7},
year = {2001},
url = {https://doi.org/10.1145/945394.945401},
doi = {10.1145/945394.945401},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/RahmanR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/StallmannBG01,
author = {Matthias F. M. Stallmann and
Franc Brglez and
Debabrata Ghosh},
title = {Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph
Crossing Minimization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {6},
pages = {8},
year = {2001},
url = {https://doi.org/10.1145/945394.945402},
doi = {10.1145/945394.945402},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/StallmannBG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BoghossianKL00,
author = {Nicolas Boghossian and
Oliver Kohlbacher and
Hans{-}Peter Lenhof},
title = {Rapid Software Prototyping in Molecular Modeling Using the Biochemical
Algorithms Library {(BALL)}},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {16},
year = {2000},
url = {https://doi.org/10.1145/351827.384258},
doi = {10.1145/351827.384258},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BoghossianKL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BojesenKS00,
author = {Jesper Bojesen and
Jyrki Katajainen and
Maz Spork},
title = {Performance Engineering Case Study: Heap Construction},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {15},
year = {2000},
url = {https://doi.org/10.1145/351827.384257},
doi = {10.1145/351827.384257},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BojesenKS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BrengelCFM00,
author = {Klaus Brengel and
Andreas Crauser and
Paolo Ferragina and
Ulrich Meyer},
title = {An Experimental Study of Priority Queues in External Memory},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {17},
year = {2000},
url = {https://doi.org/10.1145/351827.384259},
doi = {10.1145/351827.384259},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/BrengelCFM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CaldwellKM00,
author = {Andrew E. Caldwell and
Andrew B. Kahng and
Igor L. Markov},
title = {Design and Implementation of Move-Based Heuristics for {VLSI} Hypergraph
Partitioning},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {5},
year = {2000},
url = {https://doi.org/10.1145/351827.384247},
doi = {10.1145/351827.384247},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CaldwellKM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChongS00,
author = {Kyunrak Chong and
Sartaj Sahni},
title = {Correspondence-Based Data Structures for Double-Ended Priority Queues},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {2},
year = {2000},
url = {https://doi.org/10.1145/351827.351828},
doi = {10.1145/351827.351828},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ChongS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/DascalV00,
author = {Shlomit Dascal and
Uzi Vishkin},
title = {Experiments With List Ranking for Explicit Multi-Threaded {(XMT)}
Instruction Parallelism},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {10},
year = {2000},
url = {https://doi.org/10.1145/351827.384252},
doi = {10.1145/351827.384252},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/DascalV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Eppstein00,
author = {David Eppstein},
title = {Fast Hierarchical Clustering and Other Applications of Dynamic Closest
Pairs},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {1},
year = {2000},
url = {https://doi.org/10.1145/351827.351829},
doi = {10.1145/351827.351829},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Eppstein00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FlatoHHNE00,
author = {Eyal Flato and
Dan Halperin and
Iddo Hanniel and
Oren Nechushtan and
Eti Ezra},
title = {The Design and Implementation of Planar Maps in {CGAL}},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {13},
year = {2000},
url = {https://doi.org/10.1145/351827.384255},
doi = {10.1145/351827.384255},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FlatoHHNE00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Levine00,
author = {Matthew S. Levine},
title = {Finding the Right Cutting Planes for the {TSP}},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {6},
year = {2000},
url = {https://doi.org/10.1145/351827.384248},
doi = {10.1145/351827.384248},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Levine00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Muller-HannemannS00,
author = {Matthias M{\"{u}}ller{-}Hannemann and
Alexander Schwartz},
title = {Implementing Weighted b-Matching Algorithms: Insights from a Computational
Study},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {8},
year = {2000},
url = {https://doi.org/10.1145/351827.384250},
doi = {10.1145/351827.384250},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Muller-HannemannS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/NavarroR00,
author = {Gonzalo Navarro and
Mathieu Raffinot},
title = {Fast and Flexible String Matching by Combining Bit-Parallelism and
Suffix Automata},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {4},
year = {2000},
url = {https://doi.org/10.1145/351827.384246},
doi = {10.1145/351827.384246},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/NavarroR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/RahmanR00,
author = {Naila Rahman and
Rajeev Raman},
title = {Analysing Cache Effects in Distribution Sorting},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {14},
year = {2000},
url = {https://doi.org/10.1145/351827.384256},
doi = {10.1145/351827.384256},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/RahmanR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Sanders00,
author = {Peter Sanders},
title = {Fast Priority Queues for Cached Memory},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {7},
year = {2000},
url = {https://doi.org/10.1145/351827.384249},
doi = {10.1145/351827.384249},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Sanders00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SchulzWW00,
author = {Frank Schulz and
Dorothea Wagner and
Karsten Weihe},
title = {Dijkstra's Algorithm On-Line: An Empirical Case Study from Public
Railroad Transport},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {12},
year = {2000},
url = {https://doi.org/10.1145/351827.384254},
doi = {10.1145/351827.384254},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SchulzWW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Shibuya00,
author = {Tetsuo Shibuya},
title = {Computing the nxm Shortest Paths Efficiently},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {9},
year = {2000},
url = {https://doi.org/10.1145/351827.384251},
doi = {10.1145/351827.384251},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Shibuya00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/WerneckS00,
author = {Renato Fonseca F. Werneck and
Jo{\~{a}}o C. Setubal},
title = {Finding Minimum Congestion Spanning Trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {11},
year = {2000},
url = {https://doi.org/10.1145/351827.384253},
doi = {10.1145/351827.384253},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/WerneckS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/XiaoZK00,
author = {Li Xiao and
Xiaodong Zhang and
Stefan A. Kubricht},
title = {Improving Memory Performance of Sorting Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {5},
pages = {3},
year = {2000},
url = {https://doi.org/10.1145/351827.384245},
doi = {10.1145/351827.384245},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/XiaoZK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BurkeS99,
author = {Edmund K. Burke and
James Smith},
title = {A Memetic Algorithm to Schedule Planned Maintenance for the National
Grid},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {1},
year = {1999},
url = {https://doi.org/10.1145/347792.347801},
doi = {10.1145/347792.347801},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BurkeS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/EironRS99,
author = {Nadav Eiron and
Michael Rodeh and
Iris Steinwarts},
title = {Matrix Multiplication: {A} Case Study of Enhanced Data Cache Utilization},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {3},
year = {1999},
url = {https://doi.org/10.1145/347792.347806},
doi = {10.1145/347792.347806},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/EironRS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ErlebachJ99,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Efficient Implementation of an Optimal Greedy Algorithm for Wavelength
Assignment in Directed Tree Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {4},
year = {1999},
url = {https://doi.org/10.1145/347792.347808},
doi = {10.1145/347792.347808},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ErlebachJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HusonNRWY99,
author = {Daniel H. Huson and
Scott Nettles and
Kenneth Rice and
Tandy J. Warnow and
Shibu Yooseph},
title = {Hybrid Tree Reconstruction Methods},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {5},
year = {1999},
url = {https://doi.org/10.1145/347792.347812},
doi = {10.1145/347792.347812},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HusonNRWY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/JacobMN99,
author = {Riko Jacob and
Madhav V. Marathe and
Kai Nagel},
title = {A Computational Study of Routing Algorithms for Realistic Transportation
Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {6},
year = {1999},
url = {https://doi.org/10.1145/347792.347814},
doi = {10.1145/347792.347814},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/JacobMN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Kim99,
author = {Sun Kim},
title = {A New String-Pattern Matching Algorithm Using Partitioning and Hashing
Efficiently},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {2},
year = {1999},
url = {https://doi.org/10.1145/347792.347803},
doi = {10.1145/347792.347803},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Kim99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Muller-HannemannS99,
author = {Matthias M{\"{u}}ller{-}Hannemann and
Alexander Schwartz},
title = {Implementing Weighted b-Matching Algorithms: Towards a Flexible Software
Design},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {7},
year = {1999},
url = {https://doi.org/10.1145/347792.347815},
doi = {10.1145/347792.347815},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Muller-HannemannS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SchwerdtSMJ99,
author = {J{\"{o}}rg Schwerdt and
Michiel H. M. Smid and
Jayanth Majhi and
Ravi Janardan},
title = {Computing the Width of a Three-Dimensional Point Set: An Experimental
Study},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {8},
year = {1999},
url = {https://doi.org/10.1145/347792.347816},
doi = {10.1145/347792.347816},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SchwerdtSMJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AnderssonN98,
author = {Arne Andersson and
Stefan Nilsson},
title = {Implementing Radixsort},
journal = {{ACM} J. Exp. Algorithmics},
volume = {3},
pages = {7},
year = {1998},
url = {https://doi.org/10.1145/297096.297136},
doi = {10.1145/297096.297136},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AnderssonN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/CherkasskyGM98,
author = {Boris V. Cherkassky and
Andrew V. Goldberg and
Paul Martin},
title = {Augment or Push: {A} Computational Study of Bipartite Matching and
Unit-Capacity Flow Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {3},
pages = {8},
year = {1998},
url = {https://doi.org/10.1145/297096.297140},
doi = {10.1145/297096.297140},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/CherkasskyGM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ChoS98,
author = {Seonghun Cho and
Sartaj Sahni},
title = {Weight-Biased Leftist Trees and Modified Skip Lists},
journal = {{ACM} J. Exp. Algorithmics},
volume = {3},
pages = {2},
year = {1998},
url = {https://doi.org/10.1145/297096.297111},
doi = {10.1145/297096.297111},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ChoS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/FrigioniINP98,
author = {Daniele Frigioni and
Mario Ioffreda and
Umberto Nanni and
Giulio Pasqualone},
title = {Experimental Analysis of Dynamic Algorithms for the Single-Source
Shortest-Path Problem},
journal = {{ACM} J. Exp. Algorithmics},
volume = {3},
pages = {5},
year = {1998},
url = {https://doi.org/10.1145/297096.297147},
doi = {10.1145/297096.297147},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/FrigioniINP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HelmanJB98,
author = {David R. Helman and
Joseph F. J{\'{a}}J{\'{a}} and
David A. Bader},
title = {A New Deterministic Parallel Sorting Algorithm with an Experimental
Evaluation},
journal = {{ACM} J. Exp. Algorithmics},
volume = {3},
pages = {4},
year = {1998},
url = {https://doi.org/10.1145/297096.297128},
doi = {10.1145/297096.297128},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HelmanJB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/HemaspaandraRSZ98,
author = {Lane A. Hemaspaandra and
Kulathur S. Rajasethupathy and
Prasanna Sethupathy and
Marius Zimand},
title = {Power Balance and Apportionment Algorithms for the United States Congress},
journal = {{ACM} J. Exp. Algorithmics},
volume = {3},
pages = {1},
year = {1998},
url = {https://doi.org/10.1145/297096.297106},
doi = {10.1145/297096.297106},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/HemaspaandraRSZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Magun98,
author = {Jakob Magun},
title = {Greedy Matching Algorithms: An Experimental Study},
journal = {{ACM} J. Exp. Algorithmics},
volume = {3},
pages = {6},
year = {1998},
url = {https://doi.org/10.1145/297096.297131},
doi = {10.1145/297096.297131},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Magun98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Radzik98,
author = {Tomasz Radzik},
title = {Implementation of Dynamic Trees with In-Subtree Operations},
journal = {{ACM} J. Exp. Algorithmics},
volume = {3},
pages = {9},
year = {1998},
url = {https://doi.org/10.1145/297096.297144},
doi = {10.1145/297096.297144},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Radzik98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/YanZ98,
author = {Yong Yan and
Xiaodong Zhang},
title = {Lock Bypassing: An Efficient Algorithm for Concurrently Accessing
Priority Heaps},
journal = {{ACM} J. Exp. Algorithmics},
volume = {3},
pages = {3},
year = {1998},
url = {https://doi.org/10.1145/297096.297116},
doi = {10.1145/297096.297116},
timestamp = {Wed, 25 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/YanZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AlbertsCI97,
author = {David Alberts and
Giuseppe Cattaneo and
Giuseppe F. Italiano},
title = {An Empirical Study of Dynamic Graph Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {2},
pages = {5},
year = {1997},
url = {https://doi.org/10.1145/264216.264223},
doi = {10.1145/264216.264223},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/AlbertsCI97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BattitiP97,
author = {Roberto Battiti and
Marco Protasi},
title = {Reactive Search, a History-Sensitive Heuristic for {MAX-SAT}},
journal = {{ACM} J. Exp. Algorithmics},
volume = {2},
pages = {2},
year = {1997},
url = {https://doi.org/10.1145/264216.264220},
doi = {10.1145/264216.264220},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BattitiP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BuchsbaumG97,
author = {Adam L. Buchsbaum and
Raffaele Giancarlo},
title = {Algorithmic Aspects in Speech Recognition: An Introduction},
journal = {{ACM} J. Exp. Algorithmics},
volume = {2},
pages = {1},
year = {1997},
url = {https://doi.org/10.1145/264216.264219},
doi = {10.1145/264216.264219},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BuchsbaumG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/PurchaseCJ97,
author = {Helen C. Purchase and
Robert F. Cohen and
Murray I. James},
title = {An Experimental Study of the Basis for Graph Drawing Algorithms},
journal = {{ACM} J. Exp. Algorithmics},
volume = {2},
pages = {4},
year = {1997},
url = {https://doi.org/10.1145/264216.264222},
doi = {10.1145/264216.264222},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/PurchaseCJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/SmithHA97,
author = {Bradley J. Smith and
Gregory L. Heileman and
Chaouki T. Abdallah},
title = {The Exponential Hash Function},
journal = {{ACM} J. Exp. Algorithmics},
volume = {2},
pages = {3},
year = {1997},
url = {https://doi.org/10.1145/264216.264221},
doi = {10.1145/264216.264221},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/SmithHA97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/BaderHJ96,
author = {David A. Bader and
David R. Helman and
Joseph F. J{\'{a}}J{\'{a}}},
title = {Practical Parallel Algorithms for Personalized Communication and Integer
Sorting},
journal = {{ACM} J. Exp. Algorithmics},
volume = {1},
pages = {3},
year = {1996},
url = {https://doi.org/10.1145/235141.235148},
doi = {10.1145/235141.235148},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/BaderHJ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Gittelman96,
author = {Arthur Gittelman},
title = {Predicting String Search Speed},
journal = {{ACM} J. Exp. Algorithmics},
volume = {1},
pages = {2},
year = {1996},
url = {https://doi.org/10.1145/235141.235147},
doi = {10.1145/235141.235147},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Gittelman96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/Knuth96,
author = {Donald E. Knuth},
title = {Irredundant Intervals},
journal = {{ACM} J. Exp. Algorithmics},
volume = {1},
pages = {1},
year = {1996},
url = {https://doi.org/10.1145/235141.235146},
doi = {10.1145/235141.235146},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/Knuth96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/LaMarcaL96,
author = {Anthony LaMarca and
Richard E. Ladner},
title = {The Influence of Caches on the Performance of Heaps},
journal = {{ACM} J. Exp. Algorithmics},
volume = {1},
pages = {4},
year = {1996},
url = {https://doi.org/10.1145/235141.235145},
doi = {10.1145/235141.235145},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jea/LaMarcaL96.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-31 09:41 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:
