| 2001 |
|---|
| 12 | EE | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Balanced 0-1 Matrices I. Decomposition.
J. Comb. Theory, Ser. B 81(2): 243-274 (2001) |
| 11 | EE | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Balanced 0-1 Matrices II. Recognition Algorithm.
J. Comb. Theory, Ser. B 81(2): 275-306 (2001) |
| 2000 |
|---|
| 10 | EE | Michele Conforti,
Bert Gerards,
Ajai Kapoor:
A Theorem of Truemper.
Combinatorica 20(1): 15-26 (2000) |
| 9 | | Ajai Kapoor,
Romeo Rizzi:
Edge-Coloring Bipartite Graphs.
J. Algorithms 34(2): 390-396 (2000) |
| 8 | EE | James F. Geelen,
A. M. H. Gerards,
Ajai Kapoor:
The Excluded Minors for GF(4)-Representable Matroids.
J. Comb. Theory, Ser. B 79(2): 247-299 (2000) |
| 1998 |
|---|
| 7 | EE | Michele Conforti,
Ajai Kapoor:
A Theorem of Truemper.
IPCO 1998: 53-68 |
| 1997 |
|---|
| 6 | EE | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Finding an Even Hole in a Graph.
FOCS 1997: 480-485 |
| 5 | | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Universally Signable Graphs.
Combinatorica 17(1): 67-77 (1997) |
| 1996 |
|---|
| 4 | | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Perfect Matchings in Balanced Hypergraphs.
Combinatorica 16(3): 325-329 (1996) |
| 1995 |
|---|
| 3 | | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
A Mickey-Mouse Decomposition Theorem.
IPCO 1995: 321-328 |
| 1994 |
|---|
| 2 | | Michele Conforti,
Gérard Cornuéjols,
Ajai Kapoor,
Kristina Vuskovic:
Recognizing Balanced 0, ± Matrices.
SODA 1994: 103-111 |
| 1993 |
|---|
| 1 | | 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.
Combinatorics, Probability & Computing 2: 271-284 (1993) |
