Bipartite Matching

Bipartite Matching is a matching in a bipartite graph where each edge connects a vertex from one partition to a vertex in the other, such that no two edges share a common vertex, thereby maximizing the number of paired vertices under the constraint of pairwise disjointness.

797

Publications

44.9K

Citations

1.8K

Authors

687

Institutions

Publications per year

2017–2026

224

Authors

1.8K

  1. AM
    Aranyak Mehta

    Google (United States), United States

    10 publications · 2K citations

    10

    h-index

  2. TK
    Telikepalli Kavitha

    Tata Institute of Fundamental Research, India

    9 publications · 347 citations

    9

    h-index

  3. VV
    Vijay V. Vazirani

    Georgia Institute of Technology, United States

    8 publications · 2K citations

    8

    h-index

  4. AA
    Ariful Azad

    Lawrence Berkeley National Laboratory, United States

    6 publications · 160 citations

    6

    h-index

  5. DN
    Danupon Nanongkai

    University of Vienna, Austria

    6 publications · 196 citations

    6

    h-index

1–5 of 1.8K

Venues

  1. arXiv (Cornell University)

    Repository · 39 publications · 1.1K citations

    19

    h-index

  2. SIAM Journal on Computing

    19 publications · 4.3K citations

    16

    h-index

  3. Discrete Mathematics

    19 publications · 577 citations

    14

    h-index

  4. Discrete Applied Mathematics

    14 publications · 411 citations

    13

    h-index

  5. Networks

    11 publications · 337 citations

    10

    h-index

1–5