The following pages link to Ajai Kapoor (Q203961):
Displaying 18 items.
- (Q1375055) (redirect page) (← links)
- Universally signable graphs (Q1375057) (← links)
- A theorem of Truemper (Q1586353) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm (Q1850526) (← links)
- Stopping Covid-19: a pandemic-management service value chain approach (Q2158609) (← links)
- Perfect matchings in balanced hypergraphs (Q2563509) (← links)
- Even-hole-free graphs. I: Decomposition theorem (Q2778281) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- (Q3840346) (← links)
- Even and odd holes in cap-free graphs (Q4238043) (← links)
- A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem (Q4289294) (← links)
- (Q4335200) (← links)
- (Q4398363) (← links)
- (Q4500707) (← links)
- Edge-Coloring Bipartite Graphs (Q4943084) (← links)
- A mickey-mouse decomposition theorem (Q5101425) (← links)
- Perfect, ideal and balanced matrices (Q5943927) (← links)