default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAjai Kapoor
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]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): 705-741 (2024)- 2020
- [j14]Alok Baveja, Ajai Kapoor, Benjamin Melamed:
Stopping Covid-19: A pandemic-management service value chain approach. Ann. Oper. Res. 289(2): 173-184 (2020)
2000 – 2009
- 2002
- [j13]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even-hole-free graphs part I: Decomposition theorem. J. Graph Theory 39(1): 6-49 (2002) - [j12]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even-hole-free graphs part II: Recognition algorithm. J. Graph Theory 40(4): 238-266 (2002) - 2001
- [j11]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Perfect, ideal and balanced matrices. Eur. J. Oper. Res. 133(3): 455-461 (2001) - [j10]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Balanced 0-1 Matrices I. Decomposition. J. Comb. Theory B 81(2): 243-274 (2001) - [j9]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Balanced 0-1 Matrices II. Recognition Algorithm. J. Comb. Theory B 81(2): 275-306 (2001) - 2000
- [j8]Michele Conforti, Bert Gerards, Ajai Kapoor:
A Theorem of Truemper. Comb. 20(1): 15-26 (2000) - [j7]Ajai Kapoor, Romeo Rizzi:
Edge-Coloring Bipartite Graphs. J. Algorithms 34(2): 390-396 (2000) - [j6]James F. Geelen, A. M. H. Gerards, Ajai Kapoor:
The Excluded Minors for GF(4)-Representable Matroids. J. Comb. Theory B 79(2): 247-299 (2000) - [j5]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Triangle-free graphs that are signable without even holes. J. Graph Theory 34(3): 204-220 (2000)
1990 – 1999
- 1999
- [j4]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even and odd holes in cap-free graphs. J. Graph Theory 30(4): 289-308 (1999) - 1998
- [c4]Michele Conforti, Ajai Kapoor:
A Theorem of Truemper. IPCO 1998: 53-68 - 1997
- [j3]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Universally Signable Graphs. Comb. 17(1): 67-77 (1997) - [c3]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Finding an Even Hole in a Graph. FOCS 1997: 480-485 - 1996
- [j2]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Perfect Matchings in Balanced Hypergraphs. Comb. 16(3): 325-329 (1996) - 1995
- [c2]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
A Mickey-Mouse Decomposition Theorem. IPCO 1995: 321-328 - 1994
- [c1]Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Recognizing Balanced 0, +/- Matrices. SODA 1994: 103-111 - 1993
- [j1]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: 271-284 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
