N. R. Achuthan

25 papers B 1C 1Journal 18Unranked 4
YearRankTypeTitle / Venue / Authors
2013 — conf
Estimating Sufficient Sample Sizes for Approximate Decision Support Queries.
ICEIS
Amit Rudra, Raj P. Gopalan, N. R. Achuthan
2013 — conf
Selecting Adequate Samples for Approximate Decision Support Queries.
ICEIS (1)
Amit Rudra, Raj P. Gopalan, N. R. Achuthan
2011 J jnl
On minimal triangle-free graphs with prescribed k-defective chromatic number.
Discret. Math.
Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk
2011 J jnl
The Nordhaus-Gaddum problem for the k-defective chromatic number of a P
Australas. J Comb.
Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk
2009 J jnl
A Retail Category Management Model Integrating Shelf Space and inventory Levels.
Asia Pac. J. Oper. Res.
B. Ramaseshan, N. R. Achuthan, Roger Collinson
2008 J jnl
Decision Support Tool for Retail Shelf Space Optimization.
Int. J. Inf. Technol. Decis. Mak.
B. Ramaseshan, N. R. Achuthan, Roger Collinson
2008 B conf
Efficient Mining of High Utility Itemsets from Large Datasets.
PAKDD
Alva Erwin, Raj P. Gopalan, N. R. Achuthan
2007 — conf
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets.
AIDM
Alva Erwin, Raj P. Gopalan, N. R. Achuthan
2007 C conf
CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach.
CIT
Alva Erwin, Raj P. Gopalan, N. R. Achuthan
2006 — ch.
Mining Value-Based Item Packages - An Integer Programming Approach.
Selected Papers from AusDM
N. R. Achuthan, Raj P. Gopalan, Amit Rudra
2003 J jnl
An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem.
Transp. Sci.
N. R. Achuthan, Lou Caccetta, Stephen P. Hill
2003 J jnl
On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph.
Electron. Notes Discret. Math.
Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk
2003 J jnl
Single Item Multi-period Multi-retailer Inventory Replenishment Problem with Restricted Order Size.
Electron. Notes Discret. Math.
N. R. Achuthan
2001 J jnl
Project Scheduling under Time Dependent Costs - A Branch and Bound Algorithm.
Ann. Oper. Res.
N. R. Achuthan, A. Hardjawidjaja
1999 J jnl
On the vertex arboricity of graphs with prescribed size.
Australas. J Comb.
Nirmala Achuthan, N. R. Achuthan, Lou Caccetta
1997 J jnl
On defective colourings of triangle-free graphs.
Australas. J Comb.
Mudin Simanihuruk, Nirmala Achuthan, N. R. Achuthan
1997 J jnl
On minimal triangle-free graphs with prescribed 1-defective chromatic number.
Australas. J Comb.
Mudin Simanihuruk, Nirmala Achuthan, N. R. Achuthan
1997 — conf
Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs.
ISPAN
Kai Kwong Lau, Mohan J. Kumar, N. R. Achuthan
1996 J jnl
On defective colourings of complementary graphs.
Australas. J Comb.
Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk
1996 J jnl
On mixed ramsey numbers.
Discret. Math.
Nirmala Achuthan, N. R. Achuthan, Lou Caccetta
1994 J jnl
Computational methods for the diameter restricted minimum weight spanning tree problem.
Australas. J Comb.
N. R. Achuthan, Lou Caccetta, P. Caccetta, James F. Geelen
1993 J jnl
Addendum: Minimum weight spanning trees with bounded diameter.
Australas. J Comb.
N. R. Achuthan, Lou Caccetta
1992 J jnl
Minimum weight spanning trees with bounded diameter.
Australas. J Comb.
N. R. Achuthan, Lou Caccetta
1990 J jnl
On potentially P-graphic degree sequences.
Australas. J Comb.
N. R. Achuthan, Mudin Simanihuruk
1990 J jnl
On the Nordhaus-Gaddum class problems.
Australas. J Comb.
Nirmala Achuthan, N. R. Achuthan, Lou Caccetta