default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Journal of Experimental Algorithmics, Volume 28
Volume 28, December 2023
- Frederick Anderson
, Anirban Ghosh, Matthew Graham, Lucas Mougeot, David Wisnosky:
Bounded-Degree Plane Geometric Spanners in Practice. 1:1-1:36 - 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. 1.2:1-1.2:13 - Apostolos Chalkis, Ioannis Z. Emiris, Vissarion Fisikopoulos:
A Practical Algorithm for Volume Estimation based on Billiard Trajectories and Simulated Annealing. 1.3:1-1.3:34 - Piotr Beling:
Fingerprinting-based Minimal Perfect Hashing Revisited. 1.4:1-1.4:16 - André Schidler, Stefan Szeider:
SAT-boosted Tabu Search for Coloring Massive Graphs. 1.5:1-1.5:19 - José Alejandro Cornejo-Acosta, Jesus Garcia-Diaz, Julio César Pérez Sansalvador, Roger Z. Ríos-Mercado, Saúl Eduardo Pomares Hernández:
A Constructive Heuristic for the Uniform Capacitated Vertex k-center Problem. 1.6:1-1.6:26 - Rachel G. de Jong, Mark P. J. van der Loo, Frank W. Takes:
Algorithms for Efficiently Computing Structural Anonymity in Complex Networks. 1.7:1-1.7:22 - Hu Ding, Wenjie Liu, Mingquan Ye:
A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment. 1.8:1-1.8:32 - Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. 1.9:1-1.9:13 - Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. 1.10:1-1.10:24 - Renee Mirka, David P. Williamson:
An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut. 2.1:1-2.1:18 - Leo Liberti, Benedetto Manca, Pierre-Louis Poirion:
Random Projections for Linear Programming: An Improved Retrieval Phase. 2.2:1-2.2:33 - Ali Al Zoobi, David Coudert, Nicolas Nisse:
Finding the k Shortest Simple Paths: Time and Space Trade-offs. 1.11:1-1.11:23 - Darko Drakulic, Christelle Loiodice, Vassilissa Lehoux:
Routing in Multimodal Transportation Networks with Non-scheduled Lines. 2.3:1-2.3:16
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.
last updated on 2026-08-14 21:55 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
