ACM J. Exp. Algorithmics

Keyphrases

Publications

volume 28, 2023

Frederick Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, David Wisnosky
Bounded-Degree Plane Geometric Spanners in Practice. ACM J. Exp. Algorithmics 28 (2023)
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
Experimental Comparison of PC-Trees and PQ-Trees. ACM J. Exp. Algorithmics 28 (2023)
Renee Mirka, David P. Williamson
An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut. ACM J. Exp. Algorithmics 28 (2023)
Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos
A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing. ACM J. Exp. Algorithmics 28 (2023)
Hu Ding, Wenjie Liu, Mingquan Ye
A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment. ACM J. Exp. Algorithmics 28 (2023)
Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. ACM J. Exp. Algorithmics 28 (2023)
Rachel G. de Jong, Mark P. J. van der Loo, Frank W. Takes
Algorithms for Efficiently Computing Structural Anonymity in Complex Networks. ACM J. Exp. Algorithmics 28 (2023)
Loïc Crombez, Guilherme Dias da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng
Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring. ACM J. Exp. Algorithmics 28 (2023)
Ali Al Zoobi, David Coudert, Nicolas Nisse
Shortest Simple Paths: Time and Space Trade-offs. ACM J. Exp. Algorithmics 28 (2023)
Darko Drakulic, Christelle Loiodice, Vassilissa Lehoux
Routing in Multimodal Transportation Networks with Non-scheduled Lines. ACM J. Exp. Algorithmics 28 (2023)
Leo Liberti, Benedetto Manca, Pierre-Louis Poirion
Random Projections for Linear Programming: An Improved Retrieval Phase. ACM J. Exp. Algorithmics 28 (2023)
Piotr Beling
Fingerprinting-based Minimal Perfect Hashing Revisited. ACM J. Exp. Algorithmics 28 (2023)
André Schidler, Stefan Szeider
SAT-boosted Tabu Search for Coloring Massive Graphs. ACM J. Exp. Algorithmics 28 (2023)
José Alejandro Cornejo-Acosta, Jesus Garcia-Diaz, Julio César Pérez Sansalvador, Roger Z. Ríos-Mercado, Saúl Eduardo Pomares Hernández
-center Problem. ACM J. Exp. Algorithmics 28 (2023)

volume 27, 2022

volume 26, 2021