Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Swastik Kopparty

Swastik Kopparty

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Complexity×1Algorithms×1Combinatorics×1

Frequent co-authors

Shubhangi Saraf1×

Research Timeline

2026
On the CGGRT Criterion for Detecting Bipartite Perfect Matchings in NC

This paper presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.

Highlighted terms show continued research focus across papers

Papers

cs.CCcs.DSmath.COTheoreticalRecentJul 17, 2026

On the CGGRT Criterion for Detecting Bipartite Perfect Matchings in NC

Swastik Kopparty, Shubhangi Saraf

This paper presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.

View →