Amey Bhangale - Citegraph

Author Info

Name	Affiliation	Papers
AMEY BHANGALE	Rutgers State Univ, Dept Comp Sci, Piscataway, NJ 08855 USA	19
Collaborators	Citations	PageRank
18	10	6.71
Referers	Referees	References
25	87	59

Publications (19 rows)

Collaborators (18 rows)

Referers (25 rows)

Referees (87 rows)

Title	Citations	PageRank	Year
Optimal inapproximability of satisfiable k-LIN over non-abelian groups	0	0.34	2021
Simultaneous Max-Cut Is Harder to Approximate Than Max-Cut.	0	0.34	2020
Improved Inapproximability of Rainbow Coloring.	0	0.34	2020
UG-hardness to NP-hardness by Losing Half.	0	0.34	2019
Simplified inpproximability of hypergraph coloring via t-agreeing families.	0	0.34	2019
NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many Colors.	0	0.34	2018
Near-optimal approximation algorithm for simultaneous Max-Cut.	0	0.34	2018
A Note On The Joint Entropy Of N/2-Wise Independence	0	0.34	2018
NP-hardness of coloring $2$-colorable hypergraph with poly-logarithmically many colors.	0	0.34	2018
An Improved Dictatorship Test with Perfect Completeness.	0	0.34	2017
Bicovering: Covering Edges With Two Small Subsets of Vertices.	1	0.36	2017
A short note on the joint entropy of n/2-wise independence.	0	0.34	2017
Improved approximation algorithm for the Dense-3-Subhypergraph Problem.	0	0.34	2017
Bicovering: Covering edges with two small subsets of vertices.	0	0.34	2016
Cube vs. Cube Low Degree Test.	1	0.37	2016
The complexity of computing the minimum rank of a sign pattern matrix.	5	0.50	2015
On Fortification of Projection Games	3	0.40	2015
On Fortification of General Games.	0	0.34	2015
A Characterization of hard-to-cover CSPs.	0	0.34	2014

1