Scholar4AI Updated 2026-11-02 12:20 UTC+09:00

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. Also as Markdown.

Share: X LinkedIn Bluesky Threads Facebook Reddit Hacker News Hatena LINE Email
Copy:

← All conferences

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)
YearPapersWith affiliations
20245151
20257676
20266159

Sources#

Where OpenAlex lists the papers
OpenAlex sourceWhich papers
S4377196569LIPIcs papers with the DOIs 10.4230/LIPIcs.APPROX/RANDOM.<year>.<n>

Who publishes there#

Institutions with the most APPROX/RANDOM papers, 2024–2026
#InstitutionPapers
1Tel Aviv University13
2Massachusetts Institute of Technology13
3University of Waterloo12
4University of California, Berkeley12
5University of Illinois Urbana-Champaign11
6Harvard University9
7Nanjing University8
8Centre National de la Recherche Scientifique7
9The University of Melbourne7
10Technion – Israel Institute of Technology7
Countries with the most APPROX/RANDOM papers, 2024–2026
#CountryPapers
1United States107
2Israel33
3India21
4Canada18
5China16
6Germany15
7United Kingdom11
8Australia9
9Denmark9
10France8
Keywords with the most APPROX/RANDOM papers, 2024–2026
#KeywordPapers
1approximation algorithms47
2lower bounds29
3query complexity14
4hardness of approximation13
5property testing13
6online algorithms11
7NP-hardness10
8competitive ratio9
9mixing time9
10derandomization8

Most-cited papers#

Most-cited APPROX/RANDOM papers of 2024–2026 (citations counted by OpenAlex)
#CitationsTitlePublishedAuthors
13Ultra-Sparse Expanders and the Free Method2026-01-01Cohen, Gil, Maor, Gal
23Trace Reconstruction from Local Statistical Queries2024-01-01Chen, Xi, De, Anindya, Lee, Chin Ho et al.
32New Constructions of Pseudorandom Codes2025-01-01Ghentiyala, Surendra, Venkatesan Guruswami
42Asynchronous Majority Dynamics on Binomial Random Graphs2025-10-08Divyarthi Mohan, Paweł Prałat
52Improved Online Load Balancing with Known Makespan2024-01-01Martin Böhm, Matej Lieskovský, Sören Schmitt et al.
62On Sampling from Ising Models with Spectral Constraints2024-01-01Andreas Galanis, Alkis Kalavasis, Vardis Kandiros
72Matrix Multiplication Reductions2024-01-01Ashish Gola, Igor Shinkar, Harsimran Singh
82Distributional Online Weighted Paging with Limited Horizon2024-01-01Fairstein, Yaron, Joseph Seffi Naor, Tomer Tsachor
91Improved Bounds for High-Dimensional Equivalence and Product Testing Using Subcube Queries2024-01-01Tomer Adar, Eldar Fischer, Amit Levi
101Shared Randomness in Locally Checkable Problems: The Role of Computational Assumptions2025-01-01Hadad, Adar, Naor, Moni

Conferences in the same field#

SODA · STOC · ICALP · EC · KR · FOCS · SoCG · CAV · LICS · ESA · ITCS · STACS · IJCAR · CCC · GD · SAT · ALENEX

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

@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}
}

Free to reuse for non-commercial purposes with attribution (CC BY-NC 4.0).