Friday, April 26, 2019

[DMANET] *Reminder* Final CFP: "Graph Partitioning: Theory, Engineering and Applications"

*REMINDER* FINAL CALL FOR PAPERS:

Dear Colleagues,

We cordially invite you to submit a manuscript for consideration and
possible publication in a special issue on "Graph Partitioning: Theory,
Engineering and Applications" to be published in the open access MDPI
journal Algorithms (http://www.mdpi.com/journal/algorithms), indexed by EI,
ESCI and Scopus.

The submission manuscript deadline is *30 June 2019*. The main themes
include all facets of recent graph partitioning algorithms, including
shared-memory parallel and distributed algorithms, streaming algorithms,
exact algorithms, approximation algorithms, local search, genetic
algorithms, metaheuristics, hardness results, parameterized algorithms,
variations in objective functions and alternate partitioning primitives
(such as edge partitioning) or process mapping algorithms. For more details
please visit the website:
https://www.mdpi.com/journal/algorithms/special_issues/Graph_Partitioning

You may share this invitation with your team members and colleagues;
co-authors are most welcome.

Please let me know within a month or as soon as possible if you and your
colleagues are interested in submitting a manuscript for this special
issue. If more time is needed, please feel free to tell us (
algorithms@mdpi.com). Your contribution would be most welcome.

Algorithms is fully open access. Open access (unlimited and free access by
readers) increases publicity and promotes more frequent citations, as
indicated by several studies. As open access is supported by the authors
and their institutes, an Article Processing Charge (APC) of CHF 850 applies
to accepted papers. You may be entitled to a discount if you have
previously received a discount code or if your institute is participating
in the MDPI Institutional Open Access Program (IOAP); for more information
see:http://www.mdpi.com/about/ioap.

For further details on the submission process, please see the instructions
for authors at the journal website (
http://www.mdpi.com/journal/algorithms/instructions).

We hope this topic is of interest to you and look forward to collaborating
with you in the near future.

/Best regards, Darren Strash and Christian Schulz/
/Guest Editors/


Submission information:
Research articles, review articles as well as short communications are
invited.

Submitted manuscripts should not have been published previously nor be
under consideration for publication elsewhere, except for in conference
proceedings. All submissions will be thoroughly refereed through a
peer-review process. Manuscripts should be submitted online atwww.mdpi.com
after registering and logging in.

Accepted articles will be published continuously in the journal (as soon as
accepted) and will be listed together on the special issue website. A guide
for authors and other information related to the submission of manuscripts
is available on the "Instructions for Authors" page. The article processing
charge for publication in this open access journal is also listed on the
journal's webpage.

Deadline:
The deadline for manuscript submissions is 30 June 2019.

About the journal:
Algorithms (ISSN 1999-4893; CODEN: ALGOCH) is an international open access
journal of computer science, theory, methods and interdisciplinary
applications, data and information systems, software engineering,
artificial intelligence, automation, and control systems. It is published
online quarterly by MDPI.


**********************************************************
*
* 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/
*
**********************************************************