[DMANET] CFP: Special Issue of TCS on "Combinatorial Optimization: Theory of algorithms and complexity"

[Apologies in advance for multiple postings]

CALL FOR PAPERS

THEORETICAL COMPUTER SCIENCE
Special Issue on "Combinatorial Optimization: Theory of algorithms and
complexity"

We invite submissions of research articles for a special issue in the
journal "Theoretical Computer Science" (TCS) on "Combinatorial
Optimization: Theory of algorithms and complexity".

This special issue is associated with the 2nd International Symposium on
Combinatorial Optimization (ISCO 2012) that took place in Athens,
Greece, April 19-21, 2012. However, the invitation for submissions is
not restricted to the papers presented at the conference. It is open to
all relevant articles in combinatorial optimization with emphasis on
aspects regarding theory of algorithms and complexity.

With this special issue, we wish to present current research on
algorithmic and complexity issues of combinatorial optimization. This
has been an overly active field in the last decades and the purpose of
the special issue would be to identify new techniques and problem
domains, expose new results and indicate directions for further
research. High quality research papers are solicited to address both
theoretical issues as well as questions arising in application domains.

Potential topics include (but are not limited to) the following:
algorithms and data structures,
approximation and on-line algorithms,
randomness in computing,
computational complexity,
exact and parameterized algorithms,
computational geometry,
algorithmic game theory,
graph theory and combinatorics,
parallel and distributed algorithms,
computational algebra and coding theory,
combinatorial aspects in computational biology.

The deadline for submissions is September 28, 2012.

To ensure that all manuscripts are correctly identified for inclusion
into the Special Issue, it is important that during the online
submission at the TCS website, the authors select "TCS-A Comb Opt
(Paschos/Milis/Mark)".

Papers will be refereed according to the standards of TCS and we will do
our best to have the refereeing procedure timely finished. The tentative
schedule for this procedure is:

Notification of acceptance: January 15, 2013
Submission of revisions: February 28, 2013
Final Decision: April 17, 2013.


Additional information about the special issue can be obtained from the
guest editors.

Guest Editors:

Vangelis Markakis,markakis@gmail.com
Department of Informatics,
Athens University of Economics and Business

Ioannis Milis,milis@aueb.gr
Department of Informatics,
Athens University of Economics and Business

Vangelis Th. Paschos,vangelis.Paschos@dauphine.fr
LAMSADE, CNRS and Université Paris-Dauphine
Institut Universitaire de France

----------------------------------------------------------------------------------------
This call is available
at:http://www.journals.elsevier.com/theoretical-computer-science/call-for-papers/special-issue-on-combinatorial-optimization/
----------------------------------------------------------------------------------------

________________________________________________________
Ioannis Milis,
Associate Professor,
Department of Informatics,
Athens University of Economics and Business,
76, Patission str., 104 34 Athens, Greece.
Phone: + 30 210 8203537, Fax: + 30 210 8226105



**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************