N. R. Achuthan

According to our database1, N. R. Achuthan authored at least 28 papers between 1990 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

1990
1995
2000
2005
2010
2015
0
1
2
3
4
1
1
2
1
1
3
1
1
2
2
1
1
1
2
3
1
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Non-Functional Requirements Framework: A Mathematical Programming Approach.
Comput. J., 2015

2013
Estimating Sufficient Sample Sizes for Approximate Decision Support Queries.
Proceedings of the Enterprise Information Systems - 15th International Conference, 2013

Selecting Adequate Samples for Approximate Decision Support Queries.
Proceedings of the ICEIS 2013, 2013

Optimal Selection of Operationalizations for Non-Functional Requirements.
Proceedings of the Ninth Asia-Pacific Conference on Conceptual Modelling, 2013

2012
An Efficient Sampling Scheme for Approximate Processing of Decision Support Queries.
Proceedings of the ICEIS 2012 - Proceedings of the 14th International Conference on Enterprise Information Systems, Volume 1, Wroclaw, Poland, 28 June, 2012

2011
On minimal triangle-free graphs with prescribed k-defective chromatic number.
Discret. Math., 2011

The Nordhaus-Gaddum problem for the k-defective chromatic number of a P<sub>4</sub>-free graph.
Australas. J Comb., 2011

2009
A Retail Category Management Model Integrating Shelf Space and inventory Levels.
Asia Pac. J. Oper. Res., 2009

2008
Decision Support Tool for Retail Shelf Space Optimization.
Int. J. Inf. Technol. Decis. Mak., 2008

Efficient Mining of High Utility Itemsets from Large Datasets.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2008

2007
A Bottom-Up Projection Based Algorithm for Mining High Utility Itemsets.
Proceedings of the Integrating Artificial Intelligence and Data Mining, 2007

CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach.
Proceedings of the Seventh International Conference on Computer and Information Technology (CIT 2007), 2007

2006
Mining Value-Based Item Packages - An Integer Programming Approach.
Proceedings of the Data Mining - Theory, Methodology, Techniques, and Applications, 2006

2003
An Improved Branch - and - Cut Algorithm for the Capacitated Vehicle Routing Problem.
Transp. Sci., 2003

On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph.
Electron. Notes Discret. Math., 2003

Single Item Multi-period Multi-retailer Inventory Replenishment Problem with Restricted Order Size.
Electron. Notes Discret. Math., 2003

2001
Project Scheduling under Time Dependent Costs - A Branch and Bound Algorithm.
Ann. Oper. Res., 2001

1999
On the vertex arboricity of graphs with prescribed size.
Australas. J Comb., 1999

1997
On defective colourings of triangle-free graphs.
Australas. J Comb., 1997

On minimal triangle-free graphs with prescribed 1-defective chromatic number.
Australas. J Comb., 1997

Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

1996
On mixed ramsey numbers.
Discret. Math., 1996

On defective colourings of complementary graphs.
Australas. J Comb., 1996

1994
Computational methods for the diameter restricted minimum weight spanning tree problem.
Australas. J Comb., 1994

1993
Addendum: Minimum weight spanning trees with bounded diameter.
Australas. J Comb., 1993

1992
Minimum weight spanning trees with bounded diameter.
Australas. J Comb., 1992

1990
On potentially P-graphic degree sequences.
Australas. J Comb., 1990

On the Nordhaus-Gaddum class problems.
Australas. J Comb., 1990


  Loading...