Concepedia

Ajai Kapoor

AK

14

Publications

449

Citations

12

H-Index

1993

Active since

Affiliations

University of Padua(Current)

Carnegie Mellon University

University of Leeds

University of Waterloo

Centro di Ricerca in Matematica Pura ed Applicata

Ajai Kapoor is an author at University of Padua specializing in discrete mathematics, graph theory, and computational complexity.

Top concepts

Discrete MathematicsGraph TheoryEngineeringComputational ComplexityCombinatorial OptimizationComputer ScienceComputational GeometryEducationNetwork AnalysisAutomated Reasoning

Publications per year

1993–2002

14

Publications

14

The Excluded Minors for GF(4)-Representable Matroids

Jim Geelen, A.M.H. Gerards, Ajai Kapoor · Journal of Combinatorial Theory Series B · 2000 · 102 citations

Excluded Minors, Graph Minor, Matroid Theory +2

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

Martin Dyer, Alan Frieze, Ravi Kannan et al. · Combinatorics Probability Computing · 1993 · 53 citations

Mathematical Programming, Engineering, Computational Complexity +20

Even‐hole‐free graphs part II: Recognition algorithm

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor et al. · Journal of Graph Theory · 2002 · 50 citations · Full text

Engineering, Structural Pattern Recognition, Decomposition Theorem +16

Even‐hole‐free graphs part I: Decomposition theorem

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor et al. · Journal of Graph Theory · 2001 · 47 citations

Geometric Graph Theory, Polytime Recognition Algorithm, Engineering +10

Even and odd holes in cap-free graphs

Michele Conforti, Gérard Cornuéjols, Ajai Kapoor et al. · Journal of Graph Theory · 1999 · 38 citations

Geometric Graph Theory, Odd Holes, Graph Theory +7

Rows per page

1–5 of 14