Match 2022

2 papers

Top Research Directions

The 4 research directions with Match 2022 papers, ranked by paper count, next to 2021. Share is the fraction of the edition’s papers in the direction.

#Direction20222021Share 2022Share 20212021 rank
1Cross-Domain Molecular Generalization1050.0%0.0%—
2Effective Resistance Metrics for Graph Learning and Analysis1050.0%0.0%—
3Iterative Feature Construction through Decision Tree Induction1050.0%0.0%—
4Real Time Optimization for Deep Learning Deployment1050.0%0.0%—

Download all directions as CSV

Institutions

Institutions credited by Match 2022 papers: a paper credits every institution named in its affiliations, once. 3 institutions share 2 credited papers.

#InstitutionPapersShare20212021 rank
1Changsha University 150.0%0—
2Henan University 150.0%11
3National University of Defense Technology 150.0%0—

Download all institutions as CSV

About this data

Papers. Match 2022 lists 2 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2021 use shares, since the edition went from 2 to 2 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 2 of 2 papers (100.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Match 2022”, https://lacuna.tiptreesystems.com/venue/match/2022.

Impactful Papers

Papers from Match 2022 that shaped research clusters.

Influential

Papers

Title
Deep Forest-Based Intelligent Yield Predicting of Buchwald-Hartwig Coupling Reaction
Wiener Index, Kirchhoff Index in Graphs with Given Girth and Maximum Degree