Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | "Algorithmica - incl. option to publish open access" (Editorial Board)

Algorithmica

Algorithmica

Editor-in-Chief: Ming-Yang Kao

ISSN: 0178-4617 (print version)
ISSN: 1432-0541 (electronic version)

Journal no. 453

$199.00 Personal Rate e-only for the Americas
Get Subscription

Online subscription, valid from January through December of current calendar year

Immediate access to this year's issues via SpringerLink

3 Volume(-s) with 12 issue(-s) per annual subscription

Automatic annual renewal

More information: >> FAQs // >> Policy

Editor-in-Chief
Prof. Ming-Yang Kao
Department of Electrical Engineering and Computer Science
Northwestern University
2145 Sheridan Road, Room M324
Evanston, IL 60208, USA
kao@northwestern.edu

Founding Editor-in-Chief (1984-2004)
C. K. Wong
IBM, Yorktown Heights, New York, USA
The Chinese University of Hong Kong, Hong Kong

Application Experience-Editor: D. T. Lee
Problems-Editor: Bernard Chazelle


Executive Committee
John E. Hopcroft, Ming-Yang Kao, Richard M. Karp,
C. L. Liu, Franco P. Preparata


Editorial Board

Prof. Dr. Susanne Albers
Institut für Informatik
Humboldt-Universität zu Berlin
Unter den Linden 6
10099 Berlin, Germany

Prof. Andris Ambainis
Department of Combinatorics and Optimization
Faculty of Mathematics
200 University Avenue West
Waterloo, ON N2L 3G1, Canada

Prof. Lars Arge
Department of Computer Science
University of Aarhus
IT-parken, Aabogade 34
DK-8200 Aarhus N, Denmark

Prof. James Aspnes
Department of Computer Science
Yale University
51 Prospect Street
P.O. Box 208285
New Haven, CT 06520-8285 USA

Prof. Allan B. Borodin
Department of Computer Science
University of Toronto
Toronto, Ontario, Canada M5S 1A4

Prof. Timothy M. Chan
School of Computer Science
200 University Ave W.
University of Waterloo
Waterloo, Ontario Canada N2L 3G1

Dr. Xi Chen
Computer Science Department
Columbia University
500 West 120 Street, Room 450
New York, New York 10027

Prof. Joseph Cheriyan
Combinatorics and Optimization Department
200 University Ave W.
University of Waterloo
Waterloo, Ontario Canada N2L 3G1

Dr. Edith Cohen
AT&T Labs - Research, Room A105
180 Park Ave., PO Box 971
Florham Park, NJ 07932-0971 USA

Dr. Richard Cole
Computer Science Department
Courant Institute of Mathematical Science, New York University
251 Mercer Street
New York, NY 10012-1185 USA

Dr. Marek Cygan
Institute of Informatics
University of Warsaw
ul. Banacha 2
Warsaw, Poland

Prof. Xiaotie Deng
Department of Computer Science
University of Liverpool
Liverpool
L69 3BX
United Kingdom

Fedor V. Fomin
University of Bergen, Norway.
Institutt for informatikk
Universitetet i Bergen
Postboks 7803
5020 Bergen, Norway

Prof. Harold N. Gabow
Department of Computer Science
Campus Box 430
University of Colorado
Boulder, CO 80309, USA

Prof. Anupam Gupta
Department of Computer Science
Carnegie Mellon University
7203 Gates Building
Pittsburgh, PA 15213, USA

Prof. Mohammad Hajiaghayi
Computer Science Department
University of Maryland
A.V. Williams Building, Room 3249
College Park, MD 20742, USA

Prof. Sariel Har-Peled
Computer Science Department
University of Illinois at Urbana-Champaign
201 N. Goodwin Avenue
Urbana, IL 61801 USA

Prof. John E. Hopcroft
Department of Computer Science
Room 405, Upson Hall
Cornell University
Ithaca, NY 14853, USA

Prof. Giuseppe F. Italiano
Dipartimento di Informatica, Sistemi e Produzione
Università di Roma "Tor Vergata"
via del Politecnico 1
00133 Roma, Italy

Prof. Kazuo Iwama
School of Informatics
Kyoto University
Kyoto 606-8501, Japan

Prof. Tao Jiang
Department of Computer Science and Engineering
University of California - Riverside
Riverside, CA 92521, USA

Prof. Haim Kaplan
Blavatnik School of Computer Science
Tel Aviv University
Haim Levanon 55
Tel Aviv-Yafo, Israel

Prof. Richard M. Karp
ICSI (International Computer Science Institute)
1947 Center St., Suite 600
Berkeley, CA 94704-1198, USA

Prof. Ken-ichi Kawarabayashi
National Institute of Informatics
2-1-2 Hitotsubashi
Chiyoda-ku, Tokyo, Japan

Samir Khuller
Dept. of Computer Science
University of Maryland
College Park, MD 20742, USA

Prof. Lap Chi Lau
David R. Cheriton School of Computer Science 
University of Waterloo
Waterloo, Ontario  
Canada N2L 3G1

Prof. D. T. Lee
Institute of Information Science
Academia Sinica
Nankang, Taipei 11529
Taiwan

Konstantin Makarychev 
Microsoft Research 
One Microsoft Way 
Redmond, WA 98052 
USA

Dr. Nimrod Megiddo
Dept. K53
The IBM Almaden Research Center
650 Harry Road
San Jose, CA 95120-6099, USA

Dr. Joseph Mitchell
Department of Applied Mathematics and Statistics
State University of New York at Stony Brook
Stony Brook, NY 11794-3600, USA

Prof. Joseph (Seffi) Naor 
Computer Science Dept.
Technion
Haifa 32000
Israel

Prof. Rafail Ostrovsky
UCLA Comp Sci
Box 951596, 3732 BH
Los Angeles, CA, 90095-1596, USA

Prof. Seth Pettie 
University of Michigan 
Department of EECS 
Ann Arbor, MI 48109, USA

Prof. Yuval Rabani
The Rachel and Selim Benin School of Computer Science and Engineering
The Hebrew University of Jerusalem
91904 Jerusalem
Israel

Prof. Ronitt Rubinfeld
Computer Science and Artificial Intelligence Laboratory, MIT
32 Vassar Street, Bldg. 32-G698
Cambridge, MA 02139, USA

Prof. Robert Sedgewick
Department of Computer Science
Princeton University
35 Olden Street
Princeton, NJ 08544, USA

Paul G. Spirakis
Department of Computer Engineering & Informatics
University of Patras, School of Engineering
GR 265 00, Patras
Greece

Prof. Madhur Tulsiani 
Department of Computer Science
Toyota Technological Institute at Chicago
and University of Chicago
Chicago, Illinois 60637, USA

Prof. Chris Umans
Department of Computing and Mathematical Sciences
California Institute of Technology
1200 E. California Blvd. 
Pasadena, CA 91125, USA

For authors and editors


  • Journal Citation Reports®
    2016 Impact Factor
  • 0.735
  • Aims and Scope

    Aims and Scope

    Close

    The development of algorithms is an integral part of computer science. The increasing complexity and scope of computer applications makes the design of efficient algorithms essential.

    Algorithmica is an international journal which publishes original papers on algorithms that are either (i) theoretical papers addressing problems arising in practical areas or (ii) experimental papers that have general appeal because of their practical importance or techniques. Papers are expected to make significant contributions, judged in terms of theoretical analysis, simulations, or algorithm behavior on data from applications. The areas listed below are representative areas; papers in other areas are certainly welcome.

    The fields of interest include algorithms in applied areas such as: VLSI, distributed computing, parallel processing, automated design, robotics, graphics, data base design, software tools, as well as algorithms in fundamental areas such as sorting, searching, data structures, computational geometry, and linear programming. It is expected that the areas covered by this journal will change as new technologies, methodologies and applications develop.

    In addition to these regular papers, the journal features two special sections: Application Experience and Problems.

    The objective of the Application Experience section is to publish findings obtained from applications of theoretical results to practical situations. Findings include, but are not limited to, difficulties encountered in the course of the implementation or testing of algorithms (e.g., handling of degenerate cases which are often not addressed in detail but which actually occur in practice), nontrivial deviations of actual running times of the implemented algorithms from the asymptotic analytical studies, comparisons of actual performance of various algorithms proposed, and discussions of applicability of theoretical studies in practice. All submissions will be subject to the reviewing process and copies of source codes should be made available upon request by the Editor for reviewing purposes.

    The Problems section publishes short papers presenting problems on selected topics of computer science. Special emphasis will be given to papers surveying open problems in a specific area of interest. Contributions will begin with a title and an introductory statement identifying a theme of research, followed by a list of related problems which to the author's knowledge are as yet unsolved. Authors are encouraged to annotate the text with comments, background material and appropriate references. All submissions will be subject to the reviewing process.

    Special issues devoted to a single topic are also planned.

  • Submit Online
  • Open Choice - Your Way to Open Access
  • Instructions for Authors

    Instructions for Authors

    Close

  • Resources for Journal Authors
  • Author Academy: Training for Authors
  • Copyright Information

    Copyright Information

    Close

    Copyright Information

    For Authors

    Submission of a manuscript implies: that the work described has not been published before (except in form of an abstract or as part of a published lecture, review or thesis); that it is not under consideration for publication elsewhere; that its publication has been approved by all co-authors, if any, as well as – tacitly or explicitly – by the responsible authorities at the institution where the work was carried out.

    Author warrants (i) that he/she is the sole owner or has been authorized by any additional copyright owner to assign the right, (ii) that the article does not infringe any third party rights and no license from or payments to a third party is required to publish the article and (iii) that the article has not been previously published or licensed. The author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. Transfer of copyright to Springer (respective to owner if other than Springer) becomes effective if and when a Copyright Transfer Statement is signed or transferred electronically by the corresponding author. After submission of the Copyright Transfer Statement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted by Springer.

    The copyright to this article, including any graphic elements therein (e.g. illustrations, charts, moving images), is assigned for good and valuable consideration to Springer effective if and when the article is accepted for publication and to the extent assignable if assignability is restricted for by applicable law or regulations (e.g. for U.S. government or crown employees).

    The copyright assignment includes without limitation the exclusive, assignable and sublicensable right, unlimited in time and territory, to reproduce, publish, distribute, transmit, make available and store the article, including abstracts thereof, in all forms of media of expression now known or developed in the future, including pre- and reprints, translations, photographic reproductions and microform. Springer may use the article in whole or in part in electronic form, such as use in databases or data networks for display, print or download to stationary or portable devices. This includes interactive and multimedia use and the right to alter the article to the extent necessary for such use.

    Authors may self-archive the Author's accepted manuscript of their articles on their own websites. Authors may also deposit this version of the article in any repository, provided it is only made publicly available 12 months after official publication or later. He/she may not use the publisher's version (the final article), which is posted on SpringerLink and other Springer websites, for the purpose of self-archiving or deposit. Furthermore, the Author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at link.springer.com".

    Prior versions of the article published on non-commercial pre-print servers like arXiv.org can remain on these servers and/or can be updated with Author's accepted version. The final published version (in pdf or html/xml format) cannot be used for this purpose. Acknowledgement needs to be given to the final publication and a link must be inserted to the published article on Springer's website, accompanied by the text "The final publication is available at link.springer.com". Author retains the right to use his/her article for his/her further scientific career by including the final published journal article in other publications such as dissertations and postdoctoral qualifications provided acknowledgement is given to the original source of publication.

    Author is requested to use the appropriate DOI for the article. Articles disseminated via link.springer.com are indexed, abstracted and referenced by many abstracting and information services, bibliographic networks, subscription agencies, library networks, and consortia.

    For Readers

    While the advice and information in this journal is believed to be true and accurate at the date of its publication, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may have been made. The publisher makes no warranty, express or implied, with respect to the material contained herein.

    All articles published in this journal are protected by copyright, which covers the exclusive rights to reproduce and distribute the article (e.g., as offprints), as well as all translation rights. No material published in this journal may be reproduced photographically or stored on microfilm, in electronic data bases, video disks, etc., without first obtaining written permission from the publisher (respective the copyright owner if other than Springer). The use of general descriptive names, trade names, trademarks, etc., in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.

    Springer has partnered with Copyright Clearance Center's RightsLink service to offer a variety of options for reusing Springer content. For permission to reuse our content please locate the material that you wish to use on link.springer.com or on springerimages.com and click on the permissions link or go to copyright.com, then enter the title of the publication that you wish to use. For assistance in placing a permission request, Copyright Clearance Center can be connected directly via phone: +1-855-239-3415, fax: +1-978-646-8600, or e-mail: info@copyright.com.


    © Springer Science+Business Media New York

Services for the Journal

Alerts for this journal

 

Get the table of contents of every new issue published in Algorithmica.