Thursday, July 20, 2017

[DMANET] Call for Papers - Discrete Applied Mathematics Special Volume CTW2017

*Call for Papers**
**
**Special Issue Discrete Applied Mathematics**
**
**15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
(CTW 2017)**
*
_______________________________________________________

The Cologne-Twente Workshops on Graphs and Combinatorial Optimization
have a long tradition of by now annual
events that are organized alternatingly by several academic research
groups at European universities.
The CTW 2017 took place at the University of Cologne (Cologne, Germany)
on June 6-8, 2017.


CTW Workshops usually publish a selection of fully refereed papers in a
special issue of the prestigious
journal ''Discrete Applied Mathematics'' (DAM). Topics either have been
presented at the conference or are
otherwise close to the workshop themes. Submissions of contributions are
welcome also from researchers who
have not personally attended the workshop.

The deadline for submission to this issue is September 29, 2017, in
order to publish the articles as quickly as
possible. If needed, however, extensions of the deadline may be obtained
upon request.

The submission of your contribution should be done via the Elsevier
Editorial System (accessible through the
DAM homepage [http://ees.elsevier.com/dam/ http://ees.elsevier.com/dam/]
). The special issue is referred to as
"Special Issue: CTW 2017" within the DAM submission system.

Instructions for authors can be found at: http://ees.elsevier.com/dam/
http://ees.elsevier.com/dam/

Please see Author Instructions on the site if you have not yet submitted
a paper through this web-based system.
Be sure to note that your work is intended for the Special Issue and to
select the article type
"Special Issue: CTW 2017" so that your paper is assigned to the guest
editors.

Papers will be subject to a strict review process managed by the guest
editors and accepted papers will be published
online individually, before print publication.

Guest Editors:

Bert Randerath (TH Cologne) hubert.randerath@th-koeln.de
Heiko Röglin (University of Bonn) roeglin@cs.uni-bonn.de
Britta Peis (RWTH Aachen) britta.peis@oms.rwth-aachen.de
Oliver Schaudt (RWTH Aachen) schaudt@mathc.rwth-aachen.de
Rainer Schrader (University of Cologne) schrader@zpr.uni-koeln.de
Frank Vallentin (University of Cologne) frank.vallentin@uni-koeln.de

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

[DMANET] Research Fellowship in Complex Networks - University of Melbourne

The School of Mathematics and Statistics at the University of Melbourne is currently looking to fill a two year Research Fellowship in Optimization and Machine Learning of Disrupted Flows in Complex Networks, aimed towards understanding, design and management of resilient networked systems.

You will work with a multidisciplinary team working on challenges at the interface of research fields such as graph theory, data analysis, computer science, operations research, and statistics.

Position description: https://careers.pageuppeople.com/422/ci/en/job/891176/research-fellow-in-optimization-machine-learning-of-flows-in-complex-networks
**********************************************************
*
* 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/
*
**********************************************************

Wednesday, July 19, 2017

[DMANET] Reminder: WINE 2017 deadline is on Aug 2nd.

Reminder: WINE 2017 Deadline is in roughly 2 weeks, on Aug 2nd. The
conference will be held during December 17-20, 2017, at the Indian
Institute of Science, Bangalore, India.

The CFP is here. http://lcm.csa.iisc.ernet.in/wine2017/papers.html

Submission server is here: https://easychair.org/conferences/?conf=wine2017

Some points to raise awareness.

1. A selection of papers accepted to the conference is invited to
GEB/TEAC.
2. WINE has had the best paper award for a couple of years now. In some
years the committee has chosen not to give the award to any paper, but the
option has been there.
3. WINE is seen as being narrower than EC, and some subset of the EC
community doesn't typically submit to WINE. We would like to broaden the
scope of WINE to include all those topics covered in EC. In particular, we
welcome and encourage papers from the AI, OR, and Econ communities.
4. We also welcome experimental papers, and in particular papers that
have both a theoretical and an experimental part are strongly encouraged.

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

[DMANET] [CP / ICLP / SAT 2017] Call for Participation, early registration deadline July 24, 2017

==============================================================================
CP / ICLP / SAT 2017: Call for Participation
==============================================================================

This year CP, ICLP and SAT 2017 will be co-located in Melbourne, Australia
from August 28th to September 1st, 2017 (the week immediately following
IJCAI
2017). We invite researchers, practitioners and businesses in the areas of
Constraint Programming (CP), Logic Programming (LP), and Boolean
satisfiability (SAT) to register and attend this unique scientific trifecta.

In addition to the main technical tracks and the thematic tracks, CP, ICLP
and SAT 2017 will feature a series of co-located workshops, and a co-located
Doctoral Program with funding available to support a limited number of
students.

The early registration for all three conferences is July 24, 2017.

Below you'll find more information about the and the registration.

Venue & accommodation
=====================

CP, ICLP, and SAT 2017 will be held August 28 to September 1, 2017 at the
Melbourne Convention and Exhibition Centre (the X marks the spot).

`
`...--..` -.
`` `-------. `--`
.---...-------.` .----`
``.-----------------.` ------
.-------------------------------.
```.---------------------------------.``
`..-----------------------------------------`
`.----------------------------------------------``
--------------------------------------------------`
.---------------------------------------------------`
`----------------------------------------------------
`----------------------------------------------------`
`---------------------------------------------------`
---------------------------------------------------
`-----------------.....---------------------------.
`-----------.```` `----.------------------`
.-----.````` `-.`.-----------------`
```` ``.---------------.
` --------------
`-----X----..`
```` `.`

.``.`
.---`
..`

Venue and visa information http://cp2017.a4cp.org/venue.html

There are many accommodation options in the proximity of the venue, so that
you can comfortably reach the conference. Our accommodation page includes
some
special promotions for the attendants of CP, ICLP and SAT 2017

Accommodation information http://cp2017.a4cp.org/accommodation.html

The events
==========

CP 2017

The 23rd International Conference on Principles and Practice of Constraint
Programming (CP 2017) is the 23rd edition of the annual conference on all
aspects of computing with constraints, including: theory, algorithms,
environments, languages, models, systems, and applications such as decision
making, resource allocation, scheduling, configuration, and planning.

More information at http://cp2017.a4cp.org/
Registration at http://cp2017.a4cp.org/registration.html

ICLP 2017

Since the first conference held in Marseille in 1982, the International
Conference on Logic Programming (ICLP) has been the premier international
event for presenting research in logic programming. ICLP 2017 is the 33rd
edition of ICLP.

More information at http://iclp17.a4lp.org/
Registration at http://iclp17.a4lp.org/registration.html

SAT 2017

SAT 2017 is the 20th edition of the International Conference on Theory and
Applications of Satisfiability Testing (SAT), the premier annual meeting for
researchers focusing on the theory and applications of the propositional
satisfiability problem, broadly construed.

More information at http://sat2017.gitlab.io/
Registration at http://sat2017.gitlab.io/registration.html


Invited speakers
================

CP, ICLP and SAT 2017 will host co-located plenary talks, by

- Agostino Dovier, University of Udine
- Holger Hoos, University of British Columbia and Universiteit Leiden
- Mark Wallace, Opturion and Monash University
- Nina Narodytska, VMWare Research
- Enrico Pontelli, New Mexico State University


Doctoral Program
================

CP, ICLP and SAT 2017 will also host a co-located doctoral program, a place
for
student researchers to discuss ongoing work in a relaxed atmosphere, as
well as
getting some mentoring from an experienced researcher in the field.

More information at http://cp2017.a4cp.org/doctoral_program/

Sponsors
========

CP, ICLP and SAT 2017 are also made possible by our generous sponsors and
donors. Please take some time to check them out on our Sponsors & Donors
page
http://cp2017.a4cp.org/sponsors.html.

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

Tuesday, July 18, 2017

[DMANET] Call for participation - Summer School on Network Performance Evaluation and Optimization (28.8.-1.9.2017)

Dear colleagues,
I would like to draw your attention to the summer school on network
performance evaluation and optimization, which takes place from 28. August
to 1. September, 2017 at TU Chemnitz, Germany:
https://www.tu-chemnitz.de/etit/kn/summerschool/2017/index.php
The registration is now open. Please forward the CfP to interested
colleagues, researchers and students.
Regards,
Thomas Bauschert

Technische Universität Chemnitz
Chair for Communication Networks
Prof. Dr.-Ing. Thomas Bauschert
D-09126 Chemnitz, Germany
Email: thomas.bauschert@etit.tu-chemnitz.de
<mailto:matthias.werner@informatik.tu-chemnitz.de>
**********************************************************
*
* 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/
*
**********************************************************

Monday, July 17, 2017

[DMANET] DCC '18 special session: Computation over Compressed Data

Dear Colleague,

We are pleased to announce that the next *Data Compression Conference* (DCC
'18) will feature a special session on *Computation over Compressed Data*.
This session extends the special sessions at DCC '14 and '16 on Compact
Data Structures, and we invite you to submit interesting new results you
may have both on *compact data structures* and on *compression-aware
algorithms* (i.e., those that run faster on compressible inputs).

The session will be an opportunity for members of our community to confer
with each other and reinforce our topics' relevance to the wider field of
data compression. If we receive enough suitable papers, we will arrange a
special issue of *Information and Computation* for extended versions of
some of them. Selected papers from the 2014 and 2016 sessions were invited
to special issues of the *Journal of Discrete Algorithms* (published March
2017) and *Algorithmica* (in preparation).

Papers are due by *November 1st*, 2017 (23:59 PST) and the conference will
take place from March 27th to 30th, in Snowbird, Utah (a premier ski resort
in the Rocky Mountains). The DCC submission process (see
http://www.cs.brandeis.edu/~dcc/Call.html) will allow authors to direct
their papers to the special session, but submissions will be otherwise
handled in the same way, will be subject to the same review process and, if
accepted, will be included in the same proceedings.

Best regards,
Travis Gagie and Gonzalo Navarro
(session co-chairs)

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

Friday, July 14, 2017

[DMANET] ANALCO18 accepting submissions until 3 August 2017

All submissions are welcome for ANALCO18 until 3 August 2017.

The Call for Papers for the Meeting on Analytic Algorithmics and Combinatorics (ANALCO18) is available here:

http://www.siam.org/meetings/analco18/ <http://www.siam.org/meetings/analco18/>

ANALCO18 will occur 8-9 January 2018, in New Orleans, Louisiana (USA).

ANALCO occurs as a session within the SODA meeting.

The deadline for submissions is 3 August 2017.

Submissions can be uploaded to EasyChair:

https://www.easychair.org/conferences/?conf=analco18 <https://www.easychair.org/conferences/?conf=analco18>

Please feel welcome to send this information broadly.

Best wishes,
Markus Nebel and Stephan Wagner
ANALCO18 Co-chairs
nebel@techfak.uni-bielefeld.de <mailto:nebel@techfak.uni-bielefeld.de>
swagner@sun.ac.za <mailto:swagner@sun.ac.za>

Prof. Dr. Markus Nebel
AG Algorithmik & Bioinformatik
Universität Bielefeld

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

[DMANET] Helsinki ICT Network: Positions for Exceptional Doctoral Students (deadline July 30, 2017)

The Helsinki Doctoral Education Network in Information and
Communications Technology (HICT) is a joint initiative by Aalto
University and the University of Helsinki, the two leading universities
within this area in Finland. The network involves at present over 60
professors and over 200 doctoral students, and the participating units
graduate altogether more than 40 new doctors each year.

The activities of HICT are structured along five research area specific
tracks:

Algorithms and machine learning
Life science informatics
Networks, networked systems and services
Software and service engineering and systems
User centered and creative technologies

The supervising professors of HICT, whose research groups you can apply
to join via this call, are listed at "http://www.hict.fi/supervisors".
For more information on the call, go to "https://www.hict.fi/autumn_2017".

The online application form closes July 30, 2017 at midnight Finnish
time. For more information and application instructions, see
"http://www.hict.fi".
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] 20 Postdoctoral Researchers in Computer Science (Helsinki, Finland)

Aalto University is looking for excellent researchers in several areas
of Computer Science. For the full call text, topic descriptions and
information about the application process, please visit
http://www.aalto.fi/en/about/careers/jobs/view/1418/. The deadline for
the call is September 24, 2017 Finnish time.
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] PhD program in Analytics for Economics and Management (AEM) - University of Brescia

The University of Brescia offers a new PhD program in /Analytics for
Economics and Management/ (AEM) with courses starting in November. The
PhD program aims at giving answers to the need of expertsin the high
leveluse of data for decision making, with a state of the art education
on a variety oftools and techniques andresearch projects oriented to a
broad range of applications.

The PhD program will cover the areas of:

-Operations Research

-Statistics

-Economics and Finance

Details on the PhD program can be found at

https://sites.google.com/a/unibs.it/aem/

Motivated and committed students with interest in operations research
are encouragedto applyfor one of the 8 places, 6 of which are with
fellowships. Details on how to apply can be found at

https://www.unibs.it/node/15136

M.Grazia Speranza
grazia.speranza@unibs.it

--

Informativa sulla Privacy: http://www.unibs.it/node/8155
**********************************************************
*
* 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/
*
**********************************************************

Thursday, July 13, 2017

[DMANET] FCT 2017 - Early registration ends on July 16th

**********************************************************************

*** Second Call for Participation ***

FCT 2017

21st International Symposium on
Fundamentals of Computation Theory

September 11-13, 2017
Bordeaux, France

**********************************************************************

*** Registration is now open athttp://fct2017.labri.fr/
*** Early registration: July 16, 2017.

**********************************************************************

=========
ABOUT FCT
=========

The Symposium on Fundamentals of Computation Theory (FCT) was established in 1977 for researchers interested in all aspects of theoretical computer science, and in particular algorithms, complexity, formal and logical methods. FCT is a biennial conference. The last preceding Symposia were held in Gdansk, Liverpool, Oslo, Wrocław, Budapest, Lübeck.

FCT 2017 will take place in Bordeaux, which is located in the South West of France. The region is famous for its wines and its gastronomy. The city centre of Bordeaux is classified at the Unesco World Heritage.

================
INVITED SPEAKERS
================

There will be four invited talks at FCT 2017. The invited speakers are:

- Thomas Colcombet (CNRS, Université Paris Diderot, France).
- Martin Dietzfelbinger (Technische Universität Ilmenau, Allemagne).
- Juraj Hromkovic (ETH Zürich, Suisse).
- Anca Muscholl (Université de Bordeaux, France).

There will also be one invited talk in memoriam of Zoltan Esik given by:

- Jean-Eric Pin (CNRS, Université Paris Diderot, France).

===============
ACCEPTED PAPERS (in submission order)
===============

1. Christof Löding and Christopher Spinrath. Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words
2. Max Kanovich, Stepan Kuznetsov and Andre Scedrov. Undecidability of the Lambek calculus extended with subexponential and bracket modalities
3. Endre Boros, Ondrej Cepek and Kazuhisa Makino. Strong Duality in Horn Minimization
4. Joost Engelfriet and Andreas Maletti. Multiple Context-free Tree Grammars and Multi-Component Tree Adjoining Grammars
5. George Manoussakis. Listing all fixed length simple cycles in sparse graphs in optimal time
6. Emmanuel Filiot, Nicolas Mazzocchi and Jean-François Raskin. Decidable Weighted Expressions with Presburger Combinators
7. Holger Petersen. Busy Beaver Scores and Alphabet Size
8. Pierre Ganty and Elena Gutiérrez. Parikh Image of Pushdown Automata
9. Matthias Bentert, Till Fluschnik, André Nichterlein and Rolf Niedermeier. Parameterized Aspects of Triangle Enumeration
10. Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbańska and Paweł Żyliński. The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)
11. Anurag Anshu, Peter Høyer, Mehdi Mhalla and Simon Perdrix. Contextuality in multipartite pseudo-telepathy graph games
12. Alexander Shen. Automatic Kolmogorov complexity and normality revisited
13. Tomasz Jurdzinski and Michał Różański. Deterministic Oblivious Local Broadcast in the SINR Model
14. Jérémie Cabessa and Olivier Finkel. Expressive Power of Evolving Neural Networks Working on Infinite Input Streams
15. Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon Pissis and Yann Ramusat. Minimal absent words in a sliding window & applications to on-line pattern matching
16. Luc Sanselme and Simon Perdrix. Determinism and Computational Power of Real Measurement-based Quantum Computation
17. Nicolas Bousquet, Aline Parreau and Arnaud Mary. Token Jumping in minor-closed classes
18. Christian Engels, Raghavendra Rao B V and Karteek Sreenivasaiah. On depth five Sum-Power-Sum-Power-Sum Circuits: The Role of Middle Σ Fan-in, Homogeneity and Bottom Degree.
19. Albert Atserias, Phokion Kolaitis and Simone Severini. Generalized Satisfiability Problems via Operator Assignments
20. Till Fluschnik, Marco Morik and Manuel Sorge. The Complexity of Routing with Few Collisions
21. Pushkar Joglekar, Raghavendra Rao B V and Siddhartha Sivakumar. On Weak-Space Complexity over Complex Numbers
22. Dima Grigoriev and Vladimir Podolskii. Tropical Combinatorial Nullstellensatz and Fewnomials Testing
23. Gianluca De Marco, Tomasz Jurdziński, Michał Różański and Grzegorz Stachowiak. Subquadratic Non-adaptive Threshold Group Testing
24. Aris Pagourtzis, Giorgos Panagiotakos and Dimitris Sakavalas. Reliable communication via semilattice properties of partial knowledge
25. Indranil Banerjee and Dana Richards. New Results On Routing Via Matchings On Graphs
26. Markus Blaeser, Raghavendra Rao B V and Jayalal Sarma. Testing Equivalence of Polynomials under Scaling
27. Charis Papadopoulos and Spyridon Tzimas. Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
28. Andreas Bärtschi and Thomas Tschager. Energy-efficient fast delivery by mobile agents
29. Kord Eickmeyer and Ken-Ichi Kawarabayashi. FO Model Checking on Map Graphs

===============================
FURTHER INFORMATION AND CONTACT
===============================

For more details, please visit the FCT 2017 website:http://fct2017.labri.fr/ (now open for registration).

For further information, please send an e-mail tofct2017@labri.fr.

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

[DMANET] JOEL I. SEIFERAS RETIREMENT CELEBRATION: JoelFest: A Day of Talks by Zvi Galil, Shafi Goldwasser, Jon Kleinberg, and Muthuramakrishnan Venkitasubramaniam

JOEL I. SEIFERAS RETIREMENT CELEBRATION:
JoelFest: A Day of Talks by
Zvi Galil,
Shafi Goldwasser,
Jon Kleinberg, and
Muthuramakrishnan Venkitasubramaniam

Monday, September 4, 2017 (Labor Day), 9AM—5PM


ANNOUNCEMENT AND REGISTRATION REQUEST

Our dear colleague Joel I. Seiferas retired on December 31, 2016,
after more than 37 years at the University of Rochester's Department
of Computer Science, and became professor emeritus of computer
science.

Joel generously asked that the department make his retirement
celebration be a day of accessible, enjoyable talks by interesting
theoreticians.

So to celebrate Joel's career and recognize his transition to emeritus
status, the department is hosting a day of accessible, enjoyable talks
by interesting theoreticians, namely, we'll have a day of talks from
9AM to 5PM on Monday, Sept. 4 (Labor Day), by:
* Zvi Galil, the John P. Imlay Dean of Computing and Professor
at Georgia Tech's College of Computing,
* Shafi Goldwasser, the RSA Professor of Electrical Engineering
and Computer Science at MIT,
* Jon Kleinberg, Tisch University Professor of Computer Science
at Cornell University, and
* Muthuramakrishnan Venkitasubramaniam, Department of Computer
Science, University of Rochester.

The talks are all free and open to the public, and we very much hope
you will attend them. The web page

http://www.cs.rochester.edu/u/lane/=joelfest/

has the information (schedule, travel, lodging, etc.) on the event,
and on how to register (**please register by August 22nd** so we know
how many will attend and can get right the room size for the talks;
registering is about a 1-minute process), and on how---if you won't be
able to attend but would like to send a message for Joel to be given
on that day---to do so.

Much hoping to see you there!

Cheers,
Lane A. Hemaspaandra, Daniel Stefankovic, and Muthu Venkitasubramaniam
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] ISSAC 2017 - Final Call for Participation

-------------------------------------------------------------

ISSAC 2017

International Symposium on Symbolic and Algebraic Computation
University of Kaiserslautern, Germany,
July 25-28 2017.

FINAL CALL FOR PARTICIPATION

Online Registration until July 23rd
http://www.issac-conference.org/2017/

-------------------------------------------------------------

The International Symposium on Symbolic and Algebraic Computation is
the premier conference for research in symbolic computation and
computer algebra. ISSAC 2017 will be the 42nd meeting in the series,
which started in 1966 and has been held annually since 1981. The
conference presents a range of invited speakers, tutorials, poster
sessions, software demonstrations and vendor exhibits with a
centerpiece of contributed research papers.

ISSAC 2017 is held on 25-28 July 2017 at the University of
Kaiserslautern, Germany. Tutorial Sessions will be held on July 25th
2017. For the final program, please visit

http://www.issac-conference.org/2017/program.php

Call for Participation:
-----------------------
Online registration is still possible until July 23rd. After this, only
on-site registration
is possible for an additional fee of 50 Euro For details on fees and
how to register
online, please visit

http://www.issac-conference.org/2017/registration.php

As usual, discounts are available for students and SIGSAM
members. On-site registration will be available, but incurs an extra fee.


Accepted Papers:
----------------
The program committee has accepted 55 papers as listed here:
http://www.issac-conference.org/2017/papers.php


Invited Speakers:
-----------------

Mark van Hoeij (Florida State University, USA)
Title: Closed Form Solutions for Linear Differential and Difference
Equations

Gabriele Nebe (RWTH Aachen, Germany)
Title: Computing with arithmetic groups

James Worrell (University of Oxford, UK)
Title: Decision Problems for Linear Dynamical Systems

Abstracts are available here:
http://www.issac-conference.org/2017/invited.php


Tutorials:
----------

Hongbo Li (Chinese Academy of Sciences, China)
Title: Automated Geometric Reasoning with Geometric Algebra: Theory and
Practice

Marni Mishna (Simon Fraser University, Canada)
Title: Algorithmic Approaches for Lattice Path Combinatorics

Damien Stehlé (INRIA, France)
Title: Lattice reduction algorithms

Abstracts are available here:
http://www.issac-symposium.org/2017/tutorials.php


Posters and Software Presentations:
-----------------------------------
The committee has accepted 13 poster and 6 software presentations as
listed here:
http://www.issac-conference.org/2017/posters.php
http://www.issac-conference.org/2017/software.php


Satellite Workshops/Conferences:
--------------------------------

The International Workshop on Parallel Symbolic Computation (PASCO
2017), will be held
on July 23rd-24th 2017 (prior to ISSAC'17) at University of Kaiserslautern.

The Second International Workshop on Satisfiability Checking and
Symbolic Computation (SC2 2017)
will be held on July 29th 2017 (after ISSAC'17) at University of
Kaiserslautern.

We are looking forward to seeing you in Kaiserslautern.

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

Wednesday, July 12, 2017

[DMANET] Postdoc position at Warwick Mathematics Department

Applications are invited for a postdoctoral research fellowship funded by the ERC funded project entitled "Random Graph Geometry and Convergence". The post is for 2 years starting October 2017 or later. A strong background in discrete probability is expected.

The application deadline is July 23rd. See
https://atsv7.wcn.co.uk/search_engine/jobs.cgi?owner=5062452&ownertype=fair&jcode=1658521&vt_template=1457&adminview=1
for details about the application process.
See http://homepages.warwick.ac.uk/~maslar/WebSite/RGGC.htm
for some info about the project.

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

[DMANET] Stellenausschreibung wiss. Mitarbeiter/in am Institut für Transportlogistik (TU Dortmund)

Mit über 6.200 Beschäftigten in Forschung, Lehre und Verwaltung und ihrem einzigartigen Profil gestaltet die Technische Universität Dortmund Zukunftsperspektiven: Das Zusammenspiel von Ingenieur- und Naturwissenschaften, Gesellschafts- und Kulturwissenschaften treibt technologische Innovationen ebenso voran wie Erkenntnis- und Methoden fortschritt, von dem nicht nur die 34.200 Studierenden profitieren.

An der Technischen Universität Dortmund ist in der Fakultät Maschinenbau, im Institut für Transportlogistik zum nächstmöglichen Zeitpunkt die Stelle

einer / eines wissenschaftlich Beschäftigten

zunächst befristet bis zum 31. Mai 2019 (Projektlaufzeit) mit der Option auf Verlängerung zu besetzen. Die Vertragslaufzeit wird dem Qualifizierungsziel angemessen gestaltet. Die Entgeltzahlung erfolgt entsprechend den tarifrechtlichen Regelungen nach Entgeltgruppe E 13 TV-L bzw. ggfls. nach dem Übergangsrecht (TVÜ-L). Es handelt sich hierbei um eine Ganztagsstelle. Eine
Beschäftigung in bzw. Reduzierung auf Teilzeit ist grundsätzlich möglich.

In einem interdisziplinären Team forschen und lehren die Mitarbeiterinnen und Mitarbeiter des ITL im Bereich der Verkehrs- und Transportlogistik. Dabei stehen die Optimierung von Verkehrsflüssen oder die Verbesserung der Ressourcenplanung und
-nutzung in logistischen Anlagen im Mittelpunkt der Aktivitäten.

Anforderungsprofil

* Überdurchschnittlich abgeschlossenes wissenschaftliches Hochschulstudium (Diplom/Master) in der Fachrichtung Informatik, (Wirtschafts-)Mathematik, Verkehrsingenieurwesen o. ä.,
* Fundierte Kenntnisse in mathematischer, insbesondere diskreter, Optimierung und Algorithmenentwicklung,
* Interesse an logistischen Fragestellungen, insbesondere im Bereich des ÖPNV
* Programmierkenntnisse (z. B. C++ oder Java) sind wünschenswert,
* Erfahrungen im Umgang mit einer Modellierungssprache (GAMS, Aimms, etc.) sind von Interesse
* Sicherer Umgang mit den gängigen Office-Anwendungen
* Gute Englischkenntnisse,
* Interesse an einer selbstständigen Bearbeitung von wissenschaftlich anspruchsvollen Fragestellungen,
* Fähigkeit zur Zusammenarbeit in einem interdisziplinären Team, soziale Kompetenz und ein hohes Maß an Engagement und Kooperationsbereitschaft.

Aufgabenbereich

Die Deutsche Forschungsgemeinschaft (DFG) hat die Forschergruppe "Integrierte Planung im öffentlichen Verkehr" eingerichtet. In diesem überregionalen Vorhaben ist das Ziel der Forschungsarbeit des Instituts für Transportlogistik der Technischen Universität Dortmund, vorherrschende Unsicherheiten bei verschiedenen Planungsproblemen im öffentlichen Verkehr besser mit Hilfe mathematischer Optimierung und Simulation handhaben zu können und so zu robusteren Lösungen im täglichen Betrieb zu gelangen. Die Technische Universität Dortmund will den Anteil von Frauen in der Wissenschaft in der Fakultät Maschinenbau erhöhen und bittet daher insbesondere Frauen um ihre Bewerbung. Es wird darauf hingewiesen, dass die Bewerbung geeigneter Schwerbehinderter erwünscht ist. Sie sind interessiert? Dann senden Sie uns Ihre Bewerbung mit den üblichen Unterlagen bitte bis zum 03.08.2017 unter Angabe der Referenznummer w46-17 an:

Technische Universität Dortmund
Herrn Univ.-Prof. Dr.-Ing. Uwe Clausen
Institut für Transportlogistik (ITL)
Leonhard-Euler-Straße 2
44227 Dortmund

Für Fragen steht zur Verfügung:
Herr Sven Langkau
Tel.: 0231/755-7329
E-Mail: langkau@itl.tu-dortmund.de<mailto:langkau@itl.tu-dortmund.de>

Dortmund, 07.07.2017

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

[DMANET] Second announcement: Kolkom 2017 (Colloquium on Combinatorics)

Dear colleagues,

we invite you to the 36th conference "Colloquium on Combinatorics" (Kolkom 2017), which takes place at Paderborn University, on November 24-25, 2017.

The Colloquium on Combinatorics is a forum that brings together young researchers and well established scientists. The colloquium will cover all parts of Combinatorics and Discrete Mathematics in a broad sense, including combinatorial aspects in Algebra, Geometry, Optimization and Computer Science.

For more information see www.kolkom.de.


We hope seeing you in Paderborn in November!

Eckhard Steffen and Kai-Uwe Schmidt


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

Tuesday, July 11, 2017

[DMANET] Postdoc at North Carolina State University in Practical Parameterized Algorithms

The Department of Computer Science at North Carolina State University
invites applications for a Postdoctoral Research Scholar. The researcher
will focus on obtaining results in theoretical computer science and
graph theory
relevant to the initiatives engaged by Dr. Blair D. Sullivan's group
(Theory in Practice), currently funded by the Army Research Office and the
Moore Foundation's Data Driven Discovery Initiative. For more information,
please see http://www.csc.ncsu.edu/faculty/bdsullivan.

Research areas may include (but are not limited to) parameterized
algorithms, approximation schemes, and applied structural graph theory. The
scholar will help identify and tackle key challenges in improving the
practicality of structural graph approaches and fixed parameter algorithms
for complex network analysis. Position will include a mix of traditional
theoretical computer science results and more domain-focused
collaborations. There is no teaching requirement, but by mutual consent the
postdoc may teach a theory-related course in the department (additional
compensation available). This is an excellent opportunity for a dynamic
junior researcher who is interested in engaging in algorithms research with
an interdisciplinary component.

A PhD in computer science or mathematics is required before the starting
date of the position. A successful candidate will have demonstrated
expertise in theoretical computer science including parameterized
algorithms/complexity, experience in at least one programming language
(e.g. C/C++, Python), and excellent writing and communication skills. Women
and members of under-represented minority groups are particularly
encouraged to apply. The position is for a period of up to two years, and
is available starting immediately.

Official applications consisting of a CV, research statement, and reference
information must be submitted via:
https://jobs.ncsu.edu/postings/87136. Applications
will be reviewed on a rolling basis until the position is filled. Informal
inquiries are welcome via email (blair_sullivan@ncsu.edu) - please use
a subject of "Postdoc Inquiry."
--
Blair D. Sullivan, Ph.D.
Department of Computer Science
North Carolina State University
(919) 513-0453

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

Monday, July 10, 2017

[DMANET] GraMSec 2017 CALL FOR PARTICIPATION

******************************************************************
GraMSec 2017
The Fourth International Workshop on Graphical Models for Security
Co-located with CSF 2017

Santa Barbara, CA, USA - August 21, 2017
http://gramsec.uni.lu/
******************************************************************

GraMSec REGISTRATION IS NOW OPEN

To register please follow the instructions given at
http://www.gramsec.uni.lu/registration.php

If you need a visa support letter, please check
http://csf2017.tecnico.ulisboa.pt/visa.html

ABOUT GraMSec

Graphical security models provide an intuitive but systematic
methodology to analyze security weaknesses of systems and to evaluate
potential protection measures. Such models have been subject of
academic research and they have also been widely accepted by the
industrial sector, as a means to support and facilitate threat
analysis and risk assessment processes. The objective of GraMSec is to
contribute to the development of well-founded graphical security
models, efficient algorithms for their analysis, as well as
methodologies and tools for their practical usage.

INVITED TALK

Anoop Singhal, NIST
Security Metrics and Risk Analysis for Enterprise Systems

ACCEPTED REGULAR PAPERS

* Karin Bernsmed, Christian Frøystad, Per Håkon Meland, Dag Atle
Nesheim, and Ørnulf Jan Rødseth
Visualizing Cyber Security Risks with Bow-Tie Diagrams

* Angèle Bossuat and Barbara Kordy
Evil Twins: Handling Repetitions in Attack–Defense Trees - A Survival
Guide

* Aitor Couce-Vieira, Siv Hilde Houmb, and David Ríos-Insua
CSIRA: A Method for Analysing the Risk of Cybersecurity Incidents

* Peter Gjøl Jensen, Axel Legay, Kim Guldstrand Larsen, and Danny
Bøgsted Poulsen
Quantitative Evaluation of Attack Defense Trees using Stochastic
Timed Automata

* Dan Ionita, Margaret Ford, Alexandr Vasenev, and Roel Wieringa
Graphical Modeling of Security Arguments: Current State and Future
Directions

ACCEPTED SHORT PAPERS

* Olga Gadyatskaya and Rolando Trujillo-Rasua
New Directions in Attack Tree Research: Catching up with Industrial Needs

* Ryan Habibi, Jens Weber, and Morgan Price
Circle of Health Based Access Control for Personal Health Information
Systems

* Letitia Li, Florian Lugou, and Ludovic Apvrille
Security Modeling for Embedded System Design

* Brian Ruttenberg, Dave Blumstein, Jeff Druce, Michael Howard, Fred
Reed, Leslie Wilfong, Crystal Lister, Steve Gaskin, Meaghan Foley, and
Dan Scofield
Probabilistic Modeling of Insider Threat Detection Systems

GENERAL CHAIR
Sjouke Mauw, University of Luxembourg, Luxembourg

PROGRAM COMMITTEE CO-CHAIRS
Ketil Stølen, SINTEF Digital and University of Oslo, Norway
Peng Liu, Pennsylvania State University, USA

CONTACT
For inquiries please send an e-mail to gramsec17@easychair.org


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

[DMANET] Post-doctoral fellowship and PhD studentship: "Design by optimization in swarm robotics"

We are currently recruiting a post-doctoral fellow and a phd student with background in optimization / automatic design of algorithms.

For further information, please see:

http://demiurge.be/openings/postdoc-optimization.html
http://demiurge.be/openings/phd-optimization.html

The post-doctoral fellow and the phd student will be supervised by Mauro Birattari and Thomas Stutzle in the framework of the DEMIURGE project.

DEMIURGE is a research project funded by the European Commission via an ERC Consolidator Grant. The DEMIURGE project is hosted by IRIDIA, the artificial intelligence laboratory of the Universit libre de Bruxelles, Belgium. IRIDIA is a leading laboratory that is world-renowned for its contributions to swarm intelligence, collective robotics, and automatic design/fine-tuning of algorithms.

The scope of the DEMIURGE project is the design by optimization of robot swarms. Our goal is to advance the state of the art in swarm robotics by developing the DEMIURGE: an intelligent system that is able to design robot swarms in a totally integrated and automatic way.

The DEMIURGE team
info@demiurge.be
**********************************************************
*
* 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/
*
**********************************************************

Friday, July 7, 2017

[DMANET] Call for site pre-proposals: ISMP 2021

Call for site pre-proposals: ISMP 2021

The Symposium Advisory Committee (SAC) of the Mathematical Optimization
Society issues a call for pre-proposals to organize and host ISMP 2021,
the triennial International Symposium on Mathematical Programming.

ISMP is the flagship event of our society, regularly gathering over a
thousand scientists from around the world. The conference is usually
held in or around the month of August. Hosting ISMP provides a vital
service to the mathematical optimization community and often has a
lasting effect on the visibility of the hosting institution. It also
presents a significant challenge. This call for pre-proposals is
addressed at local groups willing to take up that challenge. The
tradition would be that only sites outside of Europe are eligible to
host ISMP 2021 (because ISMP 2018 is in Europe).

Preliminary bids will be examined by the Symposium Advisory Committee
(SAC), which will then issue invitations for detailed bids. The final
decision will be made and announced during ISMP 2018 in Bordeaux.
Members of the SAC are

·Jon Lee, USA, chair

·John Birge, USA

·Natashia Boland, USA

·Jose Correa, Chile

·Satoru Iwata, Japan

·Martin Skutella, Germany

·Levent Tuncel, Canada

·Yinyu Ye, USA

·Karen Aardal, Netherlands (ex officio)

·Luis Nunes Vicente, Portugal (ex officio)

Preliminary bids should be brief and contain information pertaining to the

1.location,

2.facilities,

3.logistics: accommodation and transportation, and

4.likely local organizers.

Further information can be obtained from any member of the advisory
committee. Please address your preliminary bids until October 15, 2017
to Jon Lee (jonxlee@umich.edu).

--
Jon Lee
Industrial and Operations Engineering Department
1205 Beal Avenue
University of Michigan
Ann Arbor, MI 48109-2117
USA

jonxlee@umich.edu
http://umich.edu/~jonxlee


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

Thursday, July 6, 2017

[DMANET] TCS Special Issue on "Graph Searching: Theory and Applications"

Special Issue on Graph Searching: Theory and Applications

Manuscripts are solicited for a special issue in the journal "Theoretical Computer Science" (TCS) on the topic "Theory and Applications of Graph Searching". The scope of the issue is inspired by, but not limited to papers presented in the 8th International Workshop on Graph Searching: Theory and Algorithms (GRASTA 2017).

Graph searching involves a team of mobile agents (called searchers or pursuers or cops) that aims at capturing a set of escaping agents (called evaders or fugitives or robbers) that hide in a network which may be modeled by a graph. Many variants of graph searching have been studied in the literature, such as pursuit-evasion games or cops and robbers games. These variants are either application driven, i.e., motivated by settings of practical interest, or are inspired by foundational issues at the intersection of Computer Science, Discrete Mathematics, and Artificial Inteligence. As a result, graph searching has attracted significant interest from different areas of Mathematics, Computer Science and Operations Research.

With this Special Issue, we aim to further foster research in the area of Graph Searching by presenting recent results and directions for future research. The purpose of the Special Issue is to highlight recent research both from the applied and the theoretical point of view. Topics of interest include (but are not limited to) the following:

Graph Searching and Logic
Graph Parameters Related to Graph Searching
Graph Searching and Robotics
Conquest and Expansion Games
Search, Patrolling and Surveillance Games
Graph Searching and Robotics
Conquest and Expansion Games
Database Theory and Robber and Marshals Games
Probabilistic Techniques in Graph Searching
Monotonicity and Connectivity in Graph Searching
New Variants and Performance Measures of Graph Searching
Graph Searching and Distributed Computing
Graph Searching and Network Security
Searching on Unbounded Domains

Submission format and guidelines

All submissions must contain original work in English. The manuscript and any supplementary material should be submitted using the Elsevier Editorial System (EES) at http://ees.elsevier.com/tcs. The authors must select "SI: Graph_Searching_GRASTA17" when they reach the "Article Type" step in the submission process. All submitted papers will be refereed according to the rigorous standards of TCS. The editorial team will make all effort to ensure the timely completion of the refereeing process. Requests for additional information should be addressed to the guest editors.

Important dates

Submission deadline: October 30, 2017
Final decision notification: August 30, 2018
Publication of special issue: November 30, 2018

Guest Editors

Spyros Angelopoulos
Nicolas Nisse
Dimitrios M. Thilikos


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

Wednesday, July 5, 2017

[DMANET] Call for papers: First Symposium on Simplicity in Algorithms

**************************************************************************************
CALL FOR PAPERS

First Symposium on Simplicity in Algorithms
Co-located with ACM-SIAM Symposium on Discrete Algorithms (SODA'18)
January 7-10, 2018
New Orleans, LA, USA

Submission deadline: August 24, 2017

Website: https://simplicityalgorithms.wixsite.com/sosa/
**************************************************************************************

*Symposium on Simplicity in Algorithms* is a new conference in theoretical
computer science dedicated to advancing algorithms research by promoting
simplicity and elegance in the design and analysis of algorithms. The
benefits of simplicity are manifold: simple algorithms manifest a better
understanding of the problem at hand; they are more likely to be
implemented and trusted by practitioners; they are more easily taught and
are more likely to be included in algorithms textbooks; they attract a
broader set of researchers to difficult algorithmic problems.


Papers in all areas of algorithms research are sought. An ideal submission
will advance our understanding of an algorithmic problem by, for example,

* introducing a simpler algorithm, or

* presenting a simpler analysis of an existing algorithm, or

* offering insights that generally simplify our understanding of
important computational problems.

An ideal submission will contain *novel ideas* or *attractive insights* but
is not expected to prove *novel theorems*, i.e., the results themselves can
be known, but their presentation must be new.


Proceedings:
The proceedings will be published in Schloss Dagstuhl's OpenAccess
Series in Informatics (OASIcs).


Important Dates:
Submission deadline: August 24, 2017
Notification of acceptance/rejection: October, 2017
Camera-ready deadline: November, 2017


Program Committee:
Keren Censor-Hillel, Technion
Edith Cohen, Google, Mountain View
Edith Elkind, University of Oxford
Jeremy Fineman, Georgetown University
Mohsen Ghaffari, ETH Zürich
David Karger, MIT
Richard Karp, University of California, Berkeley
Valerie King, University of Victoria
Dániel Marx, Hungarian Academy of Sciences
Moni Naor, Weizmann Institute of Science
Raimund Seidel (Chair), Universität des Saarlandes
Robert Tarjan, Princeton University
Virginia Vassilevska Williams, MIT
David Williamson, Cornell University
David Woodruff, IBM Almaden
Uri Zwick, Tel Aviv University

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

[DMANET] DFIOT 2017 - Extended Deadline 10 Aug. 2017

------------------------------------------------------------------------------------
----------Apologies for multiple copies of this announcement---------
------------------------------------------------------------------------------------

Workshop on Data Fusion in the Internet of Things (DFIoT)

http://dfiot2017.nce.ufrj.br/

Co-located with IEEE 15th International Conference on Pervasive
Intelligence and
Computing – PICom 2017 (http://cse.stfx.ca/~picom2017/)
Orlando, USA

----------------------------------------------------------------------

CALL FOR PAPERS

The recent technological advances in computer and communication
technologies have been fostering an enormous growth in the number of smart
objects available for usage. The integration of these smart objects into
the Internet originated the concept of Internet of Things (IoT). The IoT
vision advocates a world of interconnected objects, capable of being
identified, addressed, controlled, and accessed via the Internet. Such
objects can communicate with each other, with other virtual resources
available on the web, with information systems and human users. IoT
applications involve interactions among several heterogeneous devices, most
of them directly interacting with their physical surroundings.

New challenges emerge in this scenario as well as several opportunities to
be exploited. One of such opportunities regards the leveraging of the
massive amount of data produced by the widely-spread sensors to produce
value-added information for the end users. In this context, techniques to
promote knowledge discovery from the huge amount of sensing data are
required to fully exploit the potential usage of the IoT devices. In this
context, data fusion techniques are data techniques dealing with the
association, correlation, and combination of data and information from
single and multiple sources to achieve refined position and identity
estimates, and complete and timely assessments of situations and threats,
and their
significance. Since IoT data is usually dynamic and heterogeneous, it
becomes important to investigate techniques for understanding and resolving
issues about data fusion in IoT. Employment of such Data fusion techniques
are useful to reveal trends in the sampled data, uncover new patterns of
monitored variables, make predictions, thus improving decision making
process, reducing decisions response times, and enabling more intelligent
and
immediate situation awareness.

The goal of this Workshop is to present and discuss the recent advances in
the interdisciplinary data fusion research areas applied to IoT. We aim to
bring together specialists from academia and industry in different fields
to discuss further developments and trends in the data fusion area.

Topics appropriate for this workshop include (but are not necessarily
limited to):

• Data collection and abstraction in IoT
• Knowledge fusion in IoT
• Machine learning, data mining and fusion for IoT
• Data streams fusion in IoT
• Data models for IoT
• Fusion models for IoT
• Subjective Logic applied to IoT
• Dynamic analysis in IoT
• Social data fusion and social IoT
• Probabilistic reasoning in IoT
• Decision systems in IoT
• Web data fusion
• Image Fusion
• Tracking

The submission dates are:

• Submission Due: 10 August 2017
• Author Notification: 24 August 2017
• Camera-ready Paper Due: 1 September 2017

Authors are invited to submit their original research work that has not
previously been published or under review in any other venue. Papers should
be prepared in IEEE CS Proceedings format and submitted via EDAS systems.
Research papers should explore a specific technology problem and propose a
complete solution to it. Authors should submit 6 pages Research papers
using IEEE template. At least one of the authors of any accepted paper is
requested to register and present the paper at the conference.

Organizing Committee:

• Claudio M. de Farias – Federal University of Rio de Janeiro - Brazil
• Flávia C. Delicato – Federal University of Rio de Janeiro – Brazil
• Luci Pirmez – Federal University of Rio de Janeiro - Brazil

Program Committee:

• Atslands Rego – Federal University of Ceará – Brazil
• Danielo Gomes – Federal University of Ceará – Brazil
• Kevin Wang – The University of Auckland – New Zealand
• Rodrigo Pereira David – INMETRO – Brazil
• Antonio Balzanella – Dipartimento di Matematica e Fisica, Seconda
Universita degli
Studi di Napoli – Italy
• Celio Albuquerque – Fluminense Federal University – Brazil
• Haibo Zhang – University of Otago – New Zealand
• Paulo Pires – Federal University of Rio de Janeiro – Brazil
• Raquel A. F. Mini – PUC-Minas – Brazil
• Andre Aquino – Federal University of Alagoas – Brazil
• Wei Li – University of Sydney – Australia
• Antonio Guerrieri – ICAR – Italy
• Reyes Juarez Ramirez – University of Baja California – Mexico
• Jose Brancalion – Embraer – Brazil
• Andrea Omicini – University of Bolonha – Italy
• Flavio Mello – Federal University of Rio de Janeiro – Brazil
• Jonice Oliveira – Federal University of Rio de Janeiro – Brazil
• Jó Ueyama – University of São Paulo – Brazil
• Haibin Zhu – Nipissing University – Canada
• Raffaele Gravina – University of Calabria – Italy
• Arnoldo Diaz Ramirez – Instituto Tecnologico de Mexicali – Mexico
• Joni Amorim – University of Campinas – Brazil
• José Neuman – Federal University of Ceará – Brazil
• Alessandra De Paola – Università degli Studi di Palermo – Italy
• Florin Pop – University Politehnica of Bucharest / ICI Bucharest – Romenia
• Belur Dasarathy – Independent Consultant – USA
• Giancarlo Fortino – University of Calabria – Italy
• Priscila Machado Vieira Lima – Federal University of Rio de Janeiro –
Brazil
• Audun Josang – University of Oslo – Norway
• Francisco Herrera – University of Granada – Spain
• Adriana Vivácqua – Federal University of Rio de Janeiro – Brazil

-------------------------------------------------------------
Alessandra De Paola - Ph.D.
DIID - Dipartimento dell'Innovazione Industriale e Digitale
Università degli Studi di Palermo
Viale delle Scienze, Edificio 6, 3° piano
90128 Palermo
phone: +39 091 238 62604
e-mail: alessandra.depaola@unipa.it

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

[DMANET] Professorship and other permanent positions in Algorithms at the University of Sheffield

The Department of Computer Science at the University of Sheffield is
currently advertising the following positions:

- Chair in Algorithms
- Lecturer/Senior Lecturer/Reader in Algorithms

You can find more information on here:
https://www.sheffield.ac.uk/dcs/jobs/index

The closing date is 21 July 2017.

Please let me know if you have any questions.

Best regards,
Dirk

--
Dr. Dirk Sudholt
Senior Lecturer in Computer Science
Head of Algorithms Research
MSc Admissions Tutor
University of Sheffield
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] Decision Making in Manufacturing and Services (DMMS 2017) - last call for papers

Dear Colleague:

The Organizing Committee would like to cordially invite you to attend
the International Conference on Decision Making in Manufacturing and
Services (DMMS 2017) which is to be introduced during the Jubilee 20th
Symposium on Application of Systems Theory (ZTS 2017). The conferences
will take place in Zakopane, Poland, in September 26-30, 2017, hosted
by the Department of Operations Research, Faculty of Management, AGH
University of Science and Technology.
For detailed information, please find attached call for papers or visit
conference website: www.dmms.zarz.agh.edu.pl

With warm regards,
Tadeusz Sawik
Chairman of Organizing Committee

--
Organizing Committee
of the 1st Conference on Decision Making in Manufacturing and Services
AGH University of Science and Technology
Faculty of Management
Dep. of Operations Research
30, Mickiewicza Av., 30-059 Kraków

Komitet Organizacyjny
Jubileuszowego XX Sympozjum Zastosowania Teorii Systemów
Jubilee 20th Symposium on Application of Systems Theory
Akademia Górniczo-Hutnicza
Wydział Zarządzania
Katedra Badań Operacyjnych
Al. Mickiewicza 30, 30-059 Kraków

=====
e-mail: dmms@zarz.agh.edu.pl
tel. +48 617 43 34
www.dmms.zarz.agh.edu.pl
**********************************************************
*
* 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/
*
**********************************************************

Tuesday, July 4, 2017

[DMANET] BigDF 2017: IEEE International Workshop on Foundations of Big Data Computing

*******************************************************************************
CALL FOR PAPERS

IEEE International Workshop on Foundations of Big Data Computing (BigDF 2017)
In conjunction with HiPC 2017 (http://www.hipc.org)
December 18, 2017
Le Meridien, Jaipur, India

https://sites.google.com/site/hipcbigdf/
*********************************************************************************

What constitutes a "Big Data" problem? What application domains are
best suited to benefit from Big Data analytics and computing? What are
the traits and characteristics of an application that make it suited
to exploit Big Data analytics? How can Big Data systems and frameworks
be designed to allow the integration and analysis of complex data
sets? How can research in Big Data Analytics benefit from the latest
advances in supercomputing and High Performance Computing (HPC)
architectures? The goal of this workshop is to address questions like
these that are fundamental to the advancement of Big Data computing,
and in the process, build a diverse research community that has a
shared vision to advance the state of knowledge and discovery through
Big Data computing.

Topics of interest include research contributions and innovative
methods in the following areas (but not limited to):

* Scalable tools, techniques and technologies for Big Data analytics
(e.g., graph and stream data analysis, machine learning and emerging
deep learning methods)
* Algorithms and Programming Models for Big Data
* Big Data applications - Challenges and Solutions (e.g., life
sciences, health informatics, geoinformatics, climate, socio-cultural
dynamics, business analytics, cybersecurity)
* Scalable Big Data systems, platforms, services, and management
* Big Data toolkits, workflows, metrics, and provenance.

We invite paper submissions that describe original research
contributions in the area of Big Data computing, and position papers
that highlight the potential challenges and opportunities that arise
in Big Data computing. We also invite short papers that describe
work-in-progress original research.

Regular papers can be up to 8 pages long and short papers can be up to
4 pages long. All submissions will undergo rigorous peer-review by the
technical program committee, and accepted manuscripts will appear in
the HiPC workshop ("HIPCW") proceedings and will be indexed by IEEE
digital library. Authors of the accepted manuscripts will be required
to present their work at the workshop proceedings.

Paper Submission link: The paper submission opens July 1, 2017. Click
on the following link for submitting your papers:
https://www.easychair.org/conferences/?conf=hipcbigdf17

Authors can submit an abstract prior to submitting the full paper for
review. The abstract is not mandatory but is recommended to help
organizers plan the review phase in a timely fashion (i.e., authors
can submit a full paper without having submitted an abstract).
However, submissions with only full papers will be reviewed.

Organizing Committee:

* General Chairs: Dinkar Sitaram (PESIT), Ananth Kalyanaraman
(Washington State University)
* Program Chairs: Madhu Govindaraju (SUNY Binghamton), Saumyadipta
Pyne (IIPH, Hyderabad)
* Publicity Chairs: Arindam Pal (TCS Research and Innovation)
* Proceedings Chair: Ren Chen, USC (HiPC proceedings chair)
* Industry Liaison: Vivek Yadav (FullStackNet, India)

Regards,
Arindam Pal, Ph.D.
Research Scientist
TCS Research
http://www.cse.iitd.ac.in/~arindamp/

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

[DMANET] Second announcement: 5th International Combinatorics Conference (5ICC)

#### Second announcement ####
5th International Combinatorics Conference (5ICC)
Dates: Dec 4-9 2017
Venue: Monash University, Melbourne, Australia
Web: http://www.monash.edu/5icc/
e-mail
: 5icc@monash.edu

***Registration is now open*** for 5ICC, which is the fifth in a series
of major combinatorics conferences that are run once per decade by the
Combinatorial Mathematics Society of Australasia. Researchers in any
area of discrete mathematics and its applications are warmly
invited. Students are also encouraged to attend, and there will be a
prize for the best student talk.

Plenary Speakers:

Bill Chen, Nankai University
Maria Chudnovsky, Princeton University
Charlie Colbourn, Arizona State University
Marston Conder, University of Auckland
David Eppstein, University of California, Irvine
Joanna Fawcett, Cambridge University
Jacob Fox, Stanford University
Daniela Kühn, Birmingham University
Barbara Maenhaut, University of Queensland
Brendan McKay, Australian National University
Alexander Scott, Oxford University
Paul Seymour, Princeton University
Balázs Szegedy, Rényi Institute
Le Anh Vinh, Vietnam National University

There will be a welcome function in the evening on Sunday 3 December.
Talks will start on Monday 4 Dec and finish lunchtime on Saturday 9 Dec.
The conference excursion will be in the afternoon of Wednesday 6 Dec.
The conference banquet will be in the evening on Friday 8 Dec.
Note that December is the first month of summer in Australia.

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

[DMANET] PhD Position(s) in Social Choice at the Nanyang Technological University, Singapore

At least one PhD position is available, supported by a scholarship that
includes a monthly stipend and tuition fees, with the "Biased Games in
Social Choice" project at the School of Computer Science and Engineering
(SCSE) of the Nanyang Technological University (NTU).
PhD starting date is either January 2018 or August 2018.

ABOUT THE PROJECT: Biased Games in Social Choice

Game Theory is applied in the field of Social Choice, which deals with
opinion aggregation to select an alternative reasonably acceptable by a
community, to analyse the effects of strategic expressions by community
members. An example of such strategic expression is a candidate in a
political election that withdraws from the race to ensure the victory of
another candidate. Game Theoretical analysis allows to formally capture and
analyse the range of possible outcomes of such behaviours.

In the "Biased Games in Social Choice" project, a particular flavour of
behaviours is investigated where a player's benefit from any opinion
expression is offset, i.e. biased. E.g., to maintain the ostensible party
unity, a political candidate would rather not run at all, than compete
against anohter party member and lose. The project will concentrate on
seeking real world human-like biases in Social Choice domains and capturing
them in game theoretic models.

ABOUT THE SCHOOL:
The School of Computer Science and Engineering (SCSE) is part of the
College of Engineering at NTU, and offers a range of highly competitive
specialisations.

http://scse.ntu.edu.sg/Programmes/ProspectiveStudents/Graduate/Pages/Graduate.aspx

SCSE is home to a wide range of research expertise, from Computer Vision to
Machine Learning, and from Big-Data to Multi-Agent Systems. Represented by
more than a hundred faculty members, this comprises a most versatile and
rich environment for AI-related research with strong impact on the field.

http://www3.ntu.edu.sg/SCSE/moss_staffac.asp

In fact, according to the Times Higher Education, NTU is ranked 3rd
world-wide in terms of AI research citation impact.

https://www.timeshighereducation.com/data-bites/which-countries-and-universities-are-leading-ai-research

REQUIREMENTS:
We are looking for excellent applicants with a Bachelor or Master degree in
Computer Science, Mathematics or another related field, who are motivated
to carry out world leading research. Knowledge in one or more of the
following areas is preferred: Computational Artificial Intelligence,
Computational Game Theory, Discrete Mathematics and Combinatoric Methods.
Good communication skills and English language proficiency are a necessity.
Natural applicant intelligence and humour are mandatory.

HOW TO APPLY:
The deadline for applications in 31st of July 2017
Please use _both_ of the following two simple steps:
1) Notify the project's PI: Asst/P Svetlana (Lana) Obraztsova via
lana@ntu.edu.sg
2) Use the on-line application system at
http://admissions.ntu.edu.sg/graduate/Pages/home.aspx

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

[DMANET] SOFSEM 2018 - deadline extended

-- S O F S E M 2018 --
44th International Conference on
Current Trends in Theory and Practice of Computer Science
Krems an der Donau, Austria
January 29 - February 2, 2018

Website: http://sofsem2018.ocg.at

The DEADLINE for submissions to SOFSEM 2018 is EXTENDED to JULY 14, 2017, as
requested by various colleagues. Papers should be submitted using EasyChair,
following the instructions at http://sofsem2018.ocg.at.

If you intend to submit a paper and haven't so yet, please upload an abstract
now, followed by a full version no later than JULY !4th.

PROGRAM COMMITTEE CHAIR
A Min Tjoa (TU Wien, Austria)

SOFSEM 2018 TRACKS

A. FOUNDATIONS OF COMPUTER SCIENCE

B. SOFTWARE ENGINEERING: METHODS, TOOLS, APPLICATIONS

C. DATA, INFORMATION and KNOWLEDGE ENGINEERING

For PhD students there is:
D. STUDENT RESEARCH FORUM

PROCEEDINGS
Proceedings will be published in the Series Lecture Notes in Computer Science
of Springer Verlag.

IMPORTANT DATES:
Paper Abstracts Deadline................ now
Full Papers Deadline.................... July 14, 2017 (EXTENDED)
Notification (Acceptance/Rejection)..... September 21, 2017
Camera-ready Papers..................... October 4, 2017
Author Registration Deadline............ October 15, 2017
Poster Deadline......................... November 20, 2017
Early Registration Deadline............. November 24, 2017
Posters Camera-ready.................... December 5, 2017
Poster Author Registration Deadline......December 12, 2017
Late Registration Deadline.............. January 28, 2018
Conference...............................January 29 - February 2, 2018

ORGANIZATION:
AUSTRIAN COMPUTER SOCIETY (OCG)
Organizing Committee Chair
Ronald Bieber (OCG, Austria)

CONTACT
Christine Haas
Austrian Computer Society (OCG)
1010 Vienna | Wollzeile 1
Austria
christine.haas@ocg.at
http://sofsem2018.ocg.at

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

[DMANET] Postdoctoral Position, University of Kiel

A postdoctoral position in algorithms is available in the research group
of Prof. Dr. Klaus
Jansen, Algorithms and Complexity at the Department of Computer Science
of Kiel
University (CAU Kiel), Germany, within the research project

"Structural results and their application in scheduling and packing
problems"

funded by the Deutsche Forschungsgemeinschaft (DFG).
The position is for 3 years (TV-L 13) starting 1st September 2017 (the
exact date is
negotiable).

The main research focus of the DFG project is to prove structural
results for integer linear
programs and to design FPT algorithms and approximation algorithms
for bin packing and scheduling on identical machines. Therefore, the
applicant should have a
strong interest in Theoretical Computer Science, particularly in
Algorithms.

Applicants should hold (or should be close to obtaining) a PhD degree in
Computer Science
or Mathematics, and should have a solid publication record in the area
of algorithms and
complexity. Top conferences in this area include STOC, FOCS, SODA, IPCO,
ESA, ICALP,
and STACS.

Kiel University aims at increasing the number of women in research and
academic teaching
and strongly encourages applications of accordingly qualified women.
Women will be
preferred, provided equal qualifications and scientific performance.
The CAU supports the employment of severely disabled persons. Therefore,
severely
disabled persons will be preferred, provided equal qualifications and
scientific performance.
Applicants with a migration background are particularly welcomed.


The application material should include (1) a cover letter describing
the interest in the
position, (2) a CV and a list of publications, (3) copies of university
certificates and (4) the
names and contact information of at least two references. The material
should be sent
electronically until July 14, 2017 to Klaus Jansen under
<kj@informatik.uni-kiel.de>.


Prof. Dr. Klaus Jansen
Department of Computer Science
Technical Faculty of the
Christian-Albrechts-University of Kiel
Christian-Albrechts-Platz 4
24118 Kiel, Germany.
https://www.algo.informatik.uni-kiel.de/

We expressly refrain from asking for photographs, therefore we ask you
not to send a photo
with your application.

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

[DMANET] Fwd: Postdoc opportunity in Turin (Italy)

Dear all,

I was asked to forward this to all potentially interested people: there's a
postdoc position at the university of Turin, details (and links) below.
Research topics include Random Graphs and Levy Processes.

Please mind the **EARLY DEADLINE**: July 14.

If you have any questions please contact Federico Polito at
federico.polito@unito.it

Best regards,

Elisabetta


---------- Forwarded message ----------

Applications for a two-year postdoc position at the Mathematics Department,
University of Torino, Italy, are open.
The postdoctoral researcher will be funded within the project "Memory in
Evolving Graphs" (Università di Torino / Compagnia di San Paolo).
Knowledge of random graphs and random time-change techniques is appreciated.
Approximate starting date: September/October 2017.


Deadline for application: 11:59 AM, July 14, 2017 (Rome time)

Call: https://www.serviziweb.unito.it/albo_ateneo/?area=Albo
&action=Read_Download&id_attach=19938

Application procedure: https://pica.cineca.it (look for "Bando assegni di
ricerca - Tornata III 2017")

Full details at: http://bandi.miur.it/bandi.php/public/fellowship/id_
fellow/132390


For any clarification or question please write me: federico.polito@unito.it


--
Federico Polito

Department of Mathematics
University of Torino
Via Carlo Alberto, 10
10123, Torino, Italy
Email: federico.polito@unito.it
Tel: +39 011 6702862
Web: www.federicopolito.it
**********************************************************
*
* 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/
*
**********************************************************

[DMANET] IEEE CIM: Special Issue on Computational Intelligence Techniques in Bioinformatics and Bioengineering (Submission Deadline 15th November 2017)

** Apologies for multiple postings **

#####################################################################

Special Issue in the IEEE Computational Intelligence Magazine (IEEE CIM)
on *Computational Intelligence Techniques in Bioinformatics and
Bioengineering*

https://tinyurl.com/IEEE-CIM-SI-CITBB2018
#####################################################################


*Aims and scope*

The focus of the special issue is on emerging topics at the interface of
computational intelligence, Bioinformatics and Bioengineering.

This is a rich area that includes important and diverse problems, such as
protein structure prediction, systems and synthetic biology, visualization
of large-scale biological data sets, epigenomics, as well as touches on a
vast range of topics in biomedical engineering, bioprocessing and
healthcare informatics, such as biomedical imaging/data modelling and
mining, biomarker discovery, development of personalized medicine and
treatment, mining of big healthcare dataset, biopharmaceutical manufacture
and computer-assisted closed-loop problems.

The computational intelligence community in bioinformatics and
bioengineering is fragmented and large. The aim of the special issue we are
proposing will be to capture some of the ongoing interdisciplinary research
that draws upon joint expertise in the domains of optimization and learning
via computational intelligence techniques and bioinformatics and
bioengineering. The focus will be to provide both breadth in the diversity
of selected problems and depth in state-of-the-art techniques for selected
problems.

*Topics of Interest include (but are not limited to)*

· Evolution, phylogeny, comparative genomics
· Gene expression array analysis
· Metabolic pathway analysis
· MicroRNA analysis
· Molecular sequence alignment and analysis
· Pattern recognition/data mining/optimization methods in
Bioinformatics
· Visualization of large biological data sets
· Systems and synthetic biology
· Structure prediction and folding
· Modelling, simulation, and optimization of biological systems
· Biological network reconstruction/robustness/evolvability
· Epigenomics
· Medical imaging and pattern recognition
· Biomedical data modelling/data mining/model parametrization
· Parallel/high performance computing
· Big data analysis and tools for biological and medical data
· Biomarker discovery and development
· Health data acquisition/analysis/mining
· Healthcare information systems/knowledge representation/reasoning
· Personalized medicine and treatment optimization
· Biopharmaceutical manufacturing
· Closed-loop optimization methods/platforms


*Submission Process*

The IEEE CIM requires all prospective authors to submit their manuscripts
in electronic format, as a PDF file. The maximum length for Papers is
typically 20 double-spaced typed pages with 12 point font, including
figures and references. Submitted manuscript must be typewritten in English
in single column format. Authors of Papers should specify on the first page
of their submitted manuscript up to 5 keywords. Additional information
about submission guidelines and information for authors is provided at the IEEE
CIM website
<http://cis.ieee.org/ieee-computational-intelligence-magazine/134-ieee-computational-intelligence-magazine-paper-submission-guidelines-and-information-for-authors.html>
.

Submission will be made via https://easychair.org/conf
erences/?conf=ieeecimcitbb2018
.


*Important dates*


15th November, 2017: Submission of manuscript

15th January, 2018: Notification of review results

15th February, 2018: Submission of revised manuscript

15th March, 2018: Submission of final manuscript

*August 2018: Publication*


*Guest Editors*

Richard Allmendinger

University of Manchester, UK

e-mail: richard.allmendinger@manchester.ac.uk

Daniel Ashlock

University of Guelph, Canada

Email: dashlock@uoguelph.ca

Sansanee Auephanwiriyakul

Chiang Mai University, Thailand

email: sansanee@eng.cmu.ac.th
**********************************************************
*
* 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/
*
**********************************************************