---
title: "APPROX/RANDOM (A): papers and universities"
description: "APPROX/RANDOM (International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and International Conference on Randomization and Computation) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 188 of its papers from 2024–2026 (51 in 2024, 76 in 2025, 61 in 2026). By the countries of the authors' institutions, the most papers come from the United States (107), Israel (33) and India (21)."
url: https://scholar4ai.com/proceedings/approx-random
markdown_url: https://scholar4ai.com/proceedings/approx-random.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "APPROX/RANDOM (International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and International Conference on Randomization and Computation) is rated A by the CORE Conference Rankings… (as of 2026-11-02)"
data_url: https://scholar4ai.com/data/rankings.json
updated: 2026-11-02T12:20:52+09:00
window: 2026-10-04 to 2026-11-02
source: OpenAlex (CC0)
---

# APPROX/RANDOM: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and International Conference on Randomization and Computation — papers and institutions, 2024–2026

Papers of APPROX/RANDOM, International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and International Conference on Randomization and Computation (CORE rank A; field: Theory of computation), 2024–2026: per year, the institutions, countries and topics, and the most-cited papers. Ranks are those of the CORE Conference Rankings, edition ICORE2026 (portal.core.edu.au), applied to every year shown. Papers are the works OpenAlex lists for the conference's proceedings, or for the issues of a conference-linked journal that publishes its papers (such as PACMPL, PVLDB or ACM TOG), by publication year; workshops, companion volumes, posters and Findings are left out. A paper counts once for each institution and country among its authors' affiliations as OpenAlex assigns them; papers without affiliations in OpenAlex count for none. For conferences published in book series that OpenAlex files as one source (LNCS, LIPIcs, SIAM and IOS Press proceedings), the papers are found by DOI: those of the volumes with the conference's title in Crossref, or LIPIcs DOIs, which name the conference. Conferences without DOIs (PMLR, USENIX, OpenReview) are listed without counts. A dash (–) for a year means OpenAlex has no papers of the conference for it yet: the proceedings are not published or indexed yet, or the conference did not meet that year (some meet every other year). 2026 counts what OpenAlex had indexed by 2026-11-02.

All conferences: https://scholar4ai.com/proceedings.md

## Key findings

- APPROX/RANDOM (International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and International Conference on Randomization and Computation) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 188 of its papers from 2024–2026 (51 in 2024, 76 in 2025, 61 in 2026).
- By the countries of the authors' institutions, the most papers come from the United States (107), Israel (33) and India (21).
- The institutions with the most papers are Tel Aviv University (13), Massachusetts Institute of Technology (13) and University of Waterloo (12).
- Its most-cited paper of these years is “Ultra-Sparse Expanders and the Free Method” (2026), with 3 citations.

## Papers per year

*APPROX/RANDOM papers per publication year in OpenAlex (–: not in OpenAlex yet)*

| Year | Papers | With affiliations |
|---|---:|---:|
| 2024 | 51 | 51 |
| 2025 | 76 | 76 |
| 2026 | 61 | 59 |

## Sources

*Where OpenAlex lists the papers*

| OpenAlex source | Which papers |
|---|---|
| [S4377196569](https://openalex.org/S4377196569) | LIPIcs papers with the DOIs 10.4230/LIPIcs.APPROX/RANDOM.<year>.<n> |

## Who publishes there

*Institutions with the most APPROX/RANDOM papers, 2024–2026*

| # | Institution | Papers |
|---:|---|---:|
| 1 | [Tel Aviv University](https://scholar4ai.com/institutions/tel-aviv-university.md) | 13 |
| 2 | Massachusetts Institute of Technology | 13 |
| 3 | University of Waterloo | 12 |
| 4 | University of California, Berkeley | 12 |
| 5 | University of Illinois Urbana-Champaign | 11 |
| 6 | Harvard University | 9 |
| 7 | [Nanjing University](https://scholar4ai.com/institutions/nanjing-university.md) | 8 |
| 8 | [Centre National de la Recherche Scientifique](https://scholar4ai.com/institutions/centre-national-de-la-recherche-scientifique.md) | 7 |
| 9 | [The University of Melbourne](https://scholar4ai.com/institutions/the-university-of-melbourne.md) | 7 |
| 10 | Technion – Israel Institute of Technology | 7 |

*Countries with the most APPROX/RANDOM papers, 2024–2026*

| # | Country | Papers |
|---:|---|---:|
| 1 | United States | 107 |
| 2 | Israel | 33 |
| 3 | India | 21 |
| 4 | Canada | 18 |
| 5 | China | 16 |
| 6 | Germany | 15 |
| 7 | United Kingdom | 11 |
| 8 | Australia | 9 |
| 9 | Denmark | 9 |
| 10 | France | 8 |

*Keywords with the most APPROX/RANDOM papers, 2024–2026*

| # | Keyword | Papers |
|---:|---|---:|
| 1 | approximation algorithms | 47 |
| 2 | lower bounds | 29 |
| 3 | query complexity | 14 |
| 4 | hardness of approximation | 13 |
| 5 | property testing | 13 |
| 6 | online algorithms | 11 |
| 7 | NP-hardness | 10 |
| 8 | competitive ratio | 9 |
| 9 | mixing time | 9 |
| 10 | derandomization | 8 |

## Most-cited papers

*Most-cited APPROX/RANDOM papers of 2024–2026 (citations counted by OpenAlex)*

| # | Citations | Title | Published | Authors |
|---:|---:|---|---|---|
| 1 | 3 | [Ultra-Sparse Expanders and the Free Method](https://doi.org/10.4230/lipics.approx/random.2026.49) | 2026-01-01 | Cohen, Gil, Maor, Gal |
| 2 | 3 | [Trace Reconstruction from Local Statistical Queries](https://doi.org/10.4230/lipics.approx/random.2024.52) | 2024-01-01 | Chen, Xi, De, Anindya, Lee, Chin Ho et al. |
| 3 | 2 | [New Constructions of Pseudorandom Codes](https://doi.org/10.4230/lipics.approx/random.2025.54) | 2025-01-01 | Ghentiyala, Surendra, Venkatesan Guruswami |
| 4 | 2 | [Asynchronous Majority Dynamics on Binomial Random Graphs](https://doi.org/10.1145/3771091) | 2025-10-08 | Divyarthi Mohan, Paweł Prałat |
| 5 | 2 | [Improved Online Load Balancing with Known Makespan](https://doi.org/10.4230/lipics.approx/random.2024.10) | 2024-01-01 | Martin Böhm, Matej Lieskovský, Sören Schmitt et al. |
| 6 | 2 | [On Sampling from Ising Models with Spectral Constraints](https://doi.org/10.4230/lipics.approx/random.2024.70) | 2024-01-01 | Andreas Galanis, Alkis Kalavasis, Vardis Kandiros |
| 7 | 2 | [Matrix Multiplication Reductions](https://doi.org/10.4230/lipics.approx/random.2024.34) | 2024-01-01 | Ashish Gola, Igor Shinkar, Harsimran Singh |
| 8 | 2 | [Distributional Online Weighted Paging with Limited Horizon](https://doi.org/10.4230/lipics.approx/random.2024.15) | 2024-01-01 | Fairstein, Yaron, Joseph Seffi Naor, Tomer Tsachor |
| 9 | 1 | [Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries](https://doi.org/10.4230/lipics.approx/random.2024.48) | 2024-01-01 | Tomer Adar, Eldar Fischer, Amit Levi |
| 10 | 1 | [Shared Randomness in Locally Checkable Problems: The Role of Computational Assumptions](https://doi.org/10.4230/lipics.approx/random.2025.50) | 2025-01-01 | Hadad, Adar, Naor, Moni |

## Cite this page

Scholar4AI. (2026). APPROX/RANDOM: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and International Conference on Randomization and Computation — papers and institutions, 2024–2026. Journal and Conference Research Rankings. Retrieved November 2, 2026, from https://scholar4ai.com/proceedings/approx-random

```bibtex
@misc{scholar4ai-proceedings-approx-random,
  author = {{Scholar4AI}},
  title = {APPROX/RANDOM: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and International Conference on Randomization and Computation — papers and institutions, 2024–2026},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/proceedings/approx-random}},
  urldate = {2026-11-02},
  note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0}
}
```

License: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/).