Bijective Combinatorics
Bijective Combinatorics is a subfield of combinatorics that studies combinatorial structures and problems primarily through the construction and analysis of explicit bijections between sets of discrete objects, in order to establish enumerative identities and structural correspondences.
279
Publications
10.2K
Citations
440
Authors
261
Institutions
Publications per year
2017–2026
23
279
Graph theory, combinatorics, and applications
Yousef Alavi, Gary Chartrand, Ortrud R. Oellermann · 2017 · 520 citations
Crossings and nestings of matchings and partitions
William Chen, Eva Y.P. Deng, Rosena R. X. Du et al. · Transactions of the American Mathematical Society · 2006 · 280 citations · Full text
1–5 of 279
440
7
h-index
6
h-index
Laboratoire d'Informatique de l'École Polytechnique, France
6 publications · 361 citations
6
h-index
6
h-index
5
h-index
1–5 of 440
261
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
15 publications
859 citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
23 publications
657 citations
Laboratoire d'Informatique de l'École Polytechnique
Palaiseau, France
10 h-index
15 publications
753 citations
Université de Bordeaux
Bordeaux, France
9 h-index
14 publications
558 citations
IIT@MIT
Cambridge, United States
8 h-index
11 publications
458 citations
Laboratoire Bordelais de Recherche en Informatique
Talence, France
8 h-index
11 publications
341 citations

Nankai University
Tianjin, China
7 h-index
16 publications
1.1K citations
University of California San Diego
San Diego, United States
6 h-index
9 publications
379 citations
1–8 of 261
46 publications · 1.5K citations
21
h-index
23 publications · 842 citations
17
h-index
22 publications · 530 citations
14
h-index
13 publications · 345 citations
11
h-index
Repository · 10 publications · 161 citations
10
h-index
1–5