researcher

A. Kolla

25 papers hereh-index 14785 citations46 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author1
first author3
middle author14
last author6

Across the 24 of 25 papers where every author was matched, so the position is known.

fields

cs.DS11
quant-ph5
cs.DM3
cs.CC2
cs.NI2
math.CA1

identity via Semantic Scholar / OpenAlex

activity

20062026

most citedHigh Throughput Data Center Topology Design

21 citations · 67 across the 19 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DS2018

Lower bounds for Max-Cut in $H$ -free graphs via semidefinite programming

Charles Carlson, Alexandra Kolla, Ray Li +3

For a graph $G$ , let $f (G)$ denote the size of the maximum cut in $G$ . The problem of estimating $f (G)$ as a function of the number of vertices and edges of $G$ has a long history…

cs.DS2018

Spectrally Robust Graph Isomorphism

Alexandra Kolla, Ioannis Koutis, Vivek Madan +1

We initiate the study of spectral generalizations of the graph isomorphism problem. (a)The Spectral Graph Dominance (SGD) problem: On input of two graphs $G$ and $H$ does there exi…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Lower bounds for Max-Cut in H-free graphs via semidefinite programming

Spectrally Robust Graph Isomorphism

Lower bounds for Max-Cut in $H$ -free graphs via semidefinite programming