Write in a clean editor, then format for ACM Journal of Experimental Algorithmics in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
ACM Journal of Experimental Algorithmics is a peer-reviewed journal published by ACM, covering Algorithms and Data Compression, Complexity and Algorithms in Graphs, Data Management and Algorithms.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM Journal of Experimental Algorithmics 12, 3, Article 45 (2023).
Formats any DOI in ACM Journal of Experimental Algorithmics style. No sign-up. |
| Publishes research in | Algorithms and Data Compression Complexity and Algorithms in Graphs Data Management and Algorithms Computational Geometry and Mesh Generation Advanced Graph Theory Research |
| ISSN | 1084-6654 |
| h-index | 52 |
| i10-index | 201 |
| Total citations | 9,851 |
| Top institutions publishing here | Karlsruhe Institute of Technology |
| Journal website | dl.acm.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
We develop a new <it>k</it>-means clustering algorithm for data streams of points from a Euclidean space. We call this algorithm StreamKM++. Our algorithm computes a small weighted sample of the data stream and solves the problem on the sample using the <it>k</it>-means++ algorithm of Arthur and Vassilvitskii (SODA '07). To compute the small sample, we…
research-article Share on Listing All Maximal Cliques in Large Sparse Real-World Graphs Authors: David Eppstein University of California, Irvine University of California, IrvineView Profile , Maarten Löffler Utrecht University Utrecht UniversityView Profile , Darren Strash University of California, Irvine University of California, IrvineView Profile Authors Info & Claims ACM Journal of Experimental AlgorithmicsVolume 182013 Article…
We consider two approaches that model timetable information in public transportation systems as shortest-path problems in weighted graphs. In the time-expanded approach, every event at a station, e.g., the departure of a train, is modeled as a node in the graph, while in the time-dependent approach the graph contains only one node per station. Both…
In recent years, highly effective hierarchical and goal-directed speed-up techniques for routing in large road networks have been developed. This article makes a systematic study of combinations of such techniques. These combinations turn out to give the best results in many scenarios, including graphs for unit disk graphs, grid networks, and time-expanded timetables. Besides these…
Traffic information systems are among the most prominent real-world applications of Dijkstra's algorithm for shortest paths. We consider the scenario of a central information server in the realm of public railroad transport on wide-area networks. Such a system has to process a large number of on-line queries for optimal travel connections in real time. In…
ACM Journal of Data Science
ACM Journal on Autonomous Transportation Systems
ACM Journal on Computing and Sustainable Societies
ACM Journal on Emerging Technologies in Computing Systems
ACM Journal on Responsible Computing
ACM Transactions on Accessible Computing
ACM Transactions on AI for Science
ACM Transactions on AI Security and Privacy
