The aim of this “International workshop on Graph Algorithms (IWGA2015)”, to be held on May 13, 2015, Malaysia, is to provide a forum for researchers working on problems based on theory and algorithms on graphs, to disseminate their research findings, to interact with other researchers with similar interests and benefit from invited talks and discussions with international experts in this field. Prospective authors are invited to submit their original research contributions in theoretical and algorithmic aspects of graphs. IWGA2015 is partly supported by Ministry of Higher Education (MOHE), Malaysia.

Topics of interest (but not limited to):

- Graph theory and its applications (all aspects)
- Network theory, Social Network Analysis and Applications
- Algorithmic graph theory
- Matroid Theory
- Graphs & Combinatorial optimization
- Graph Applications in Image Processing, Pattern Recognition, Machine Learning & other areas

PAPER SUBMISSION
Prospective authors are invited to submit their original research contributions in theoretical and algorithmic aspects of graphs.
The paper can be 4-8 pages in LNCS style (LaTeX or WORD) (Click here) and submitted electronically as a pdf file to the email: iwga2015@cs.usm.my

REGISTRATION
IWGA 2015 Participants are requested to register by filling up the form (available in the website) and sending it along with scanned copy of proof of payment (ecopy) of registration fee to the email: khairol@usainsgroup.com cc: iwga2015@cs.usm.my

Registration fee :
a) For author of an accepted paper RM 850 *
b) For participant without paper presentation RM 450
At least one author of an accepted paper needs to register and pay the registration fee on or before April 05, 2015. Registration fee includes for category a), paper presentation , proceedings and Lunch & Tea on May 13, 2015; For category b), Lunch and Tea on May 13, 2015.
* Partial waiver of registration fee can be given for category a) with genuine reasons. Request can be sent to the organizers (email: iwga2015@cs.usm.my) who will decide to provide partial waiver based on the reasons (like student author with no funding etc.)

PUBLICATION
Papers accepted and registered for the workshop will be selected for the special issues based on their ranking . Authors of selected papers will be invited after the workshop to submit substantially revised versions. The submissions will be subject to further refereeing according to journal standards before acceptance for publication in the special issues of following reputed journals :

- International Journal of Networking and Virtual Organisations (Scopus)
- Journal of Combinatorial Mathematics and Combinatorial Computing (To be confirmed)

PRE-WORKSHOP EVENT
A “Two-day Course on Graph Algorithms and its Industrial Applications - Tutorial and Case studies” on May 11-12, 2015, to be presented by Prof. Dr. S. Arumugam & Prof. Dr. Bharati Rajan, is also organized. Details will soon be available in http://103.6.196.136/~usainsgr/services/educational-services/

WORKSHOP VENUE
Eureka Building (Nearer to Sungai Dua USM Entrance), Universiti Sains Malaysia (USM), Penang, Malaysia

Prof. Dr. S. Arumugam
Senior Professor (Research) & Dean(R&D), Kalasalingam University, India; Visiting Professor, Department of Computer Science, Liverpool Hope University, Liverpool, UK; Adjunct Professor, Department of Computer Science, Ball State University, Muncie, USA. He is the Director of National Centre for Advanced Research in Discrete Mathematics (n-CARDMATH) at Kalasalingam University. He has executed a number of projects awarded by Dept. of Science & Tech. and National Board of Higher Mathematics, India, on topics in Graph theory and algorithms, including domination, reconstruction of graphs, graphoidal covers. He has published more than 180 reputed journal articles. He has been a recipient of a number of prestigious awards including Fellow of The Institute of Combinatorics and Applications (FTICA), Canada. He has also authored a number of books.

Prof. Dr. Bharati Rajan
Conjoint Professor, School of Electrical Engineering and Computer Science, University of Newcastle, Australia; Formerly, Professor Emeritus (awarded by University Grants Commission, India) & Professor, Department of Mathematics, Loyola College, (Autonomous Institution under University of Madras), Chennai, India. She has executed projects sanctioned by Univ. grants commission, India on topics: Resolvability in graphs, interconnection networks and metric dimension. She has published more than 160 research papers in reputed journals and conferences. She has edited special issues for several reputed journals including Journal of Discrete Algorithms, International Journal of Mathematics and Computer Science, Journal of Combinatorial Mathematics and Combinatorial Computing.

Assoc. Prof. Dr. Roslan Hasni
School of Informatics and Applied Mathematics, Univ. Malaysia Terengganu, Malaysia. His research interests include graph coloring, chemical graphs and nano-structures, graph labeling and domination in graphs. He has published more than 90 research papers in reputed journals and conferences. He has executed several Malaysian Govt. projects in the area of graph theory