Ajai Kapoor

According to our database, Ajai Kapoor authored at least 19 papers between 1993 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Solving business problems: the business-driven data-supported process.

Mark D. Rodgers, Sayan Mukherjee, Benjamin Melamed, Alok Baveja, Ajai Kapoor

Ann. Oper. Res., January, 2024

2020

Stopping Covid-19: A pandemic-management service value chain approach.

Alok Baveja, Ajai Kapoor, Benjamin Melamed

Ann. Oper. Res., 2020

2002

Even-hole-free graphs part I: Decomposition theorem.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

J. Graph Theory, 2002

Even-hole-free graphs part II: Recognition algorithm.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

J. Graph Theory, 2002

2001

Balanced 0-1 Matrices II. Recognition Algorithm.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

J. Comb. Theory, Ser. B, 2001

Balanced 0-1 Matrices I. Decomposition.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

J. Comb. Theory, Ser. B, 2001

Perfect, ideal and balanced matrices.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

Eur. J. Oper. Res., 2001

2000

Triangle-free graphs that are signable without even holes.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

J. Graph Theory, 2000

The Excluded Minors for GF(4)-Representable Matroids.

James F. Geelen, A. M. H. Gerards, Ajai Kapoor

J. Comb. Theory, Ser. B, 2000

Edge-Coloring Bipartite Graphs.

Ajai Kapoor, Romeo Rizzi

J. Algorithms, 2000

A Theorem of Truemper.

Michele Conforti, Bert Gerards, Ajai Kapoor

Comb., 2000

1999

Even and odd holes in cap-free graphs.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

J. Graph Theory, 1999

1998

A Theorem of Truemper.

Michele Conforti, Ajai Kapoor

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Universally Signable Graphs.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

Comb., 1997

Finding an Even Hole in a Graph.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

Perfect Matchings in Balanced Hypergraphs.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

Comb., 1996

1995

A Mickey-Mouse Decomposition Theorem.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

Recognizing Balanced 0, +/- Matrices.

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem.

Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani

Comb. Probab. Comput., 1993