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