Ajai Kapoor

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 2

Top Topics

Virtual Organisations

Service Provisioning

Mission Critical

Management Policies

Top Venues

Ann. Oper. Res.

Publications

Mark D. Rodgers, Sayan Mukherjee, Benjamin Melamed, Alok Baveja, Ajai Kapoor
Solving business problems: the business-driven data-supported process. Ann. Oper. Res. 332 (1) (2024)
Alok Baveja, Ajai Kapoor, Benjamin Melamed
Stopping Covid-19: A pandemic-management service value chain approach. Ann. Oper. Res. 289 (2) (2020)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Even-hole-free graphs part I: Decomposition theorem. J. Graph Theory 39 (1) (2002)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Even-hole-free graphs part II: Recognition algorithm. J. Graph Theory 40 (4) (2002)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Balanced 0-1 Matrices II. Recognition Algorithm. J. Comb. Theory, Ser. B 81 (2) (2001)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Perfect, ideal and balanced matrices. Eur. J. Oper. Res. 133 (3) (2001)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Balanced 0-1 Matrices I. Decomposition. J. Comb. Theory, Ser. B 81 (2) (2001)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Triangle-free graphs that are signable without even holes. J. Graph Theory 34 (3) (2000)
James F. Geelen, A. M. H. Gerards, Ajai Kapoor
The Excluded Minors for GF(4)-Representable Matroids. J. Comb. Theory, Ser. B 79 (2) (2000)
Michele Conforti, Bert Gerards, Ajai Kapoor
A Theorem of Truemper. Comb. 20 (1) (2000)
Ajai Kapoor, Romeo Rizzi
Edge-Coloring Bipartite Graphs. J. Algorithms 34 (2) (2000)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Even and odd holes in cap-free graphs. J. Graph Theory 30 (4) (1999)
Michele Conforti, Ajai Kapoor
A Theorem of Truemper. IPCO (1998)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Universally Signable Graphs. Comb. 17 (1) (1997)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Finding an Even Hole in a Graph. FOCS (1997)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Perfect Matchings in Balanced Hypergraphs. Comb. 16 (3) (1996)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
A Mickey-Mouse Decomposition Theorem. IPCO (1995)
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
Recognizing Balanced 0, +/- Matrices. SODA (1994)
Martin E. Dyer, Alan M. Frieze, Ravi Kannan, Ajai Kapoor, Ljubomir Perkovic, Umesh V. Vazirani
A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. Comb. Probab. Comput. 2 (1993)