Journal of Graph Algorithms and Applications

*************************************************************************
* *
* ANNOUNCEMENT AND CALL FOR PAPERS *
* *
* JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS *
* *
* *
* http://www.cs.brown.edu/publications/jgaa/ *
* *
*************************************************************************






EDITORS-IN-CHIEF:


Roberto Tamassia, Brown University, rt@cs.brown.edu
Ioannis G. Tollis, University of Texas at Dallas, tollis@utdallas.edu




ADVISORY BOARD (preliminary):


S. Even, Technion
G. N. Frederickson, Purdue University
T. C. Hu, University of California at San Diego
C. L. Liu, University of Illinois
K. Mehlhorn, Max-Planck-Institut fur Informatik
F. P. Preparata, Brown University
I. H. Sudborough, University of Texas at Dallas
R. E. Tarjan, Princeton University and NEC Research Institute
M. Yannakakis, AT&T Bell Laboratories




EDITORIAL BOARD (preliminary):


G. Di Battista, University of Rome
P. Eades, University of Newcastle
D. Eppstein, University of California at Irvin
A. Gibbons,University of Warwick
M. T. Goodrich, Johns Hopkins University
A. Itai, Technion
A. Kahng, University of California at Los Angeles
Y. Kajitani, Tokyo Institute of Technology
M. Kaufmann, Universitat Tubingen
J. S. B. Mitchell, State University of New York at Stony Brook
T. Nishizeki, Tohoku University






PRELIMINARY ANNOUNCEMENT


The Journal of Graph Algorithms and Applications (JGAA) is a new
electronic journal that is available on the World Wide Web.
JGAA has high scientific standards and takes advantage of current
electronic document technology.


The electronic format will allow the authors to add various useful
appendices to their articles after publication, including corrections,
implementations, multimedia animations, conference presentations,
examples, and extended bibliographies.


A ``first volume'' consisting of 5-7 papers is planned for the Fall of
1996. Further articles will be made available on the Web as soon as
they are accepted.


The volumes of JGAA will be available for distribution in printed
form to libraries until archival standards for digital libraries
are established.




SCOPE


Topics of interest include but are not limited to:




          * Design and analysis of graph algorithms: exact and
approximation graph algorithms; centralized and distributed
graph algorithms; static and dynamic graph algorithms;
internal- and external-memory graph algorithms; sequential and
parallel graph algorithms; deterministic and randomized graph
algorithms.


          * Experiences with graph algorithms: animations;
experimentations; implementations.


          * Applications of graph algorithms: computational
biology; computational geometry; computer graphics;
computer-aided design; computer and interconnection networks;
constraint systems; databases; graph drawing; graph embedding
and layout; knowledge representation; multimedia; software
engineering; telecommunication networks; user interfaces and
visualization; VLSI circuits; World-Wide Web.






CALL FOR PAPERS


Papers describing original research and surveys addressing emerging
areas are being sought.


Papers should be submitted to one of the Editors-in-Chief in electronic
form (postscript, LaTeX, or HTML). Multiple files should be sent
possibly as uuencoded compressed tar archives. Authors may request at
the time of submission that a specific member of the editorial board
handle their paper. All communications between the editors, authors,
and reviewers will be done by email.


The editors firmly believe that fast review time is an essential
component of scholarly practice. JGAA will try to keep the review time
within six months.


*************************************************************************
* http://www.cs.brown.edu/publications/jgaa/ *
*************************************************************************

Return to the comp.compilers page.
Search the comp.compilers archives again.