IJEA 2010 - International Journal of Experimental Algorithms

Website http://www.cscjournals.org/csc/home.php | Edit Freely

Category Experimental Algorithms;Algorithms

Deadline: September 30, 2010 | Date: October 01, 2010

Venue/Country: Kuala Lumpur, Malaysia

Updated: 2010-09-18 15:58:29 (GMT+9)

Call For Papers - CFP

Volume: 1 Issue: 1

ISSN: 2180-1282

URL: http://www.cscjournals.org/csc/description.php?JCode=IJEA

Important Dates

Paper Submission: September 30 2010

Author Notification: November 01, 2010

Issue Publication: November / December 2010

About IJEA

Experimental Algorithmics studies algorithms and data structures by joining experimental studies with the more traditional theoretical analyses. With this regard, the aim of The International Journal of Experimental Algorithms (IJEA) is (1) to stimulate research in algorithms based upon implementation and experimentation; in particular, to encourage testing, evaluation and reuse of complex theoretical algorithms and data structures; and (2) to distribute programs and testbeds throughout the research community and to provide a repository of useful programs and packages to both researchers and practitioners. IJEA is a high-quality, refereed, archival journal devoted to the study of algorithms and data structures through a combination of experimentation and classical analysis and design techniques. IJEA contributions are also in the area of test generation and result assessment as applied to algorithms.

To build its International reputation, we are disseminating the publication information through Google Books, Google Scholar, Directory of Open Access Journals (DOAJ), Open J Gate, ScientificCommons, Docstoc and many more. Our International Editors are working on establishing ISI listing and a good impact factor for IJEA.

IJEA List of Topics

The realm of International Journal of Experimental Algorithms (IJEA) extends, but not limited, to the following:

Algorithmic Code

Algorithmic Engineering

Algorithmic Network Analysis

Analysis of Algorithms

Approximation Techniques

Cache Oblivious algorithm

Combinatorial Optimization

Combinatorial Structures and Graphs

Computational Biology

Computational Geometry

Computational Learning Theory

Computational Optimization

Data Structures

Distributed and Parallel Algorithms

Dynamic Graph Algorithms

Experimental Techniques and Statistics

Graph Manipulation

Graphics

Heuristics

Mathematical Programming For Algorithms

Metaheuristic Methodologies

Network Design

Parallel Processing

Randomized Techniques in Algorithms

Routing and Scheduling

Searching and Sorting

Topological Accuracy

Visualization Code

VLSI Design