default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDN. R. Achuthan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j19]Amy Affleck, Aneesh Krishna, Narasimaha Achuthan:
Non-Functional Requirements Framework: A Mathematical Programming Approach. Comput. J. 58(5): 1122-1139 (2015)- 2011
- [j18]Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk:
The Nordhaus-Gaddum problem for the k-defective chromatic number of a P4-free graph. Australas. J Comb. 49: 3-14 (2011) - [j17]Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk
:
On minimal triangle-free graphs with prescribed k-defective chromatic number. Discret. Math. 311(13): 1119-1127 (2011) - 2009
- [j16]B. Ramaseshan, N. R. Achuthan, Roger Collinson:
A Retail Category Management Model Integrating Shelf Space and inventory Levels. Asia Pac. J. Oper. Res. 26(4): 457-478 (2009) - 2008
- [j15]B. Ramaseshan, N. R. Achuthan, Roger Collinson:
Decision Support Tool for Retail Shelf Space Optimization. Int. J. Inf. Technol. Decis. Mak. 7(3): 547-565 (2008) - 2003
- [j14]Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk:
On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph. Electron. Notes Discret. Math. 15: 13-15 (2003) - [j13]N. R. Achuthan:
Single Item Multi-period Multi-retailer Inventory Replenishment Problem with Restricted Order Size. Electron. Notes Discret. Math. 15: 16-19 (2003) - [j12]N. R. Achuthan, Lou Caccetta, Stephen P. Hill:
An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem. Transp. Sci. 37(2): 153-169 (2003) - 2001
- [j11]N. R. Achuthan, A. Hardjawidjaja:
Project Scheduling under Time Dependent Costs - A Branch and Bound Algorithm. Ann. Oper. Res. 108(1-4): 55-74 (2001) - 1999
- [j10]Nirmala Achuthan, N. R. Achuthan, Lou Caccetta:
On the vertex arboricity of graphs with prescribed size. Australas. J Comb. 19: 17-36 (1999) - 1997
- [j9]Mudin Simanihuruk, Nirmala Achuthan, N. R. Achuthan:
On minimal triangle-free graphs with prescribed 1-defective chromatic number. Australas. J Comb. 16: 203-228 (1997) - [j8]Mudin Simanihuruk, Nirmala Achuthan, N. R. Achuthan:
On defective colourings of triangle-free graphs. Australas. J Comb. 16: 259-284 (1997) - 1996
- [j7]Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk:
On defective colourings of complementary graphs. Australas. J Comb. 13: 175-196 (1996) - [j6]Nirmala Achuthan, N. R. Achuthan, Lou Caccetta:
On mixed ramsey numbers. Discret. Math. 151(1-3): 3-13 (1996) - 1994
- [j5]N. R. Achuthan, Lou Caccetta, P. Caccetta, James F. Geelen:
Computational methods for the diameter restricted minimum weight spanning tree problem. Australas. J Comb. 10: 51-72 (1994) - 1993
- [j4]N. R. Achuthan, Lou Caccetta:
Addendum: Minimum weight spanning trees with bounded diameter. Australas. J Comb. 8: 279- (1993) - 1992
- [j3]N. R. Achuthan, Lou Caccetta:
Minimum weight spanning trees with bounded diameter. Australas. J Comb. 5: 261-276 (1992) - 1990
- [j2]Nirmala Achuthan, N. R. Achuthan, Lou Caccetta:
On the Nordhaus-Gaddum class problems. Australas. J Comb. 2: 5-28 (1990) - [j1]N. R. Achuthan, Mudin Simanihuruk:
On potentially P-graphic degree sequences. Australas. J Comb. 2: 29-38 (1990)
Conference and Workshop Papers
- 2013
- [c8]Amy Affleck, Aneesh Krishna, Narasimaha Achuthan:
Optimal Selection of Operationalizations for Non-Functional Requirements. APCCM 2013: 69-78 - [c7]Amit Rudra, Raj P. Gopalan, N. R. Achuthan:
Selecting Adequate Samples for Approximate Decision Support Queries. ICEIS (1) 2013: 46-55 - [c6]Amit Rudra, Raj P. Gopalan, N. R. Achuthan:
Estimating Sufficient Sample Sizes for Approximate Decision Support Queries. ICEIS 2013: 85-99 - 2012
- [c5]Amit Rudra, Raj P. Gopalan, Narasimaha Achuthan:
An Efficient Sampling Scheme for Approximate Processing of Decision Support Queries. ICEIS (1) 2012: 16-26 - 2008
- [c4]Alva Erwin, Raj P. Gopalan, N. R. Achuthan:
Efficient Mining of High Utility Itemsets from Large Datasets. PAKDD 2008: 554-561 - 2007
- [c3]Alva Erwin, Raj P. Gopalan, N. R. Achuthan:
CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach. CIT 2007: 71-76 - [c2]Alva Erwin, Raj P. Gopalan, N. R. Achuthan:
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets. AIDM 2007: 3-10 - 1997
- [c1]Kai Kwong Lau, Mohan J. Kumar, N. R. Achuthan:
Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs. ISPAN 1997: 247-253
Parts in Books or Collections
- 2006
- [p1]N. R. Achuthan, Raj P. Gopalan, Amit Rudra:
Mining Value-Based Item Packages - An Integer Programming Approach. Selected Papers from AusDM 2006: 78-89
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-04-26 18:24 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:
