Thursday, August 17, 2017

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

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 05.09.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, 09.08.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/
*
**********************************************************

Wednesday, August 16, 2017

[DMANET] Professorship "Sustainable Transportation Logistics (Physical Internet)" at JKU Linz

The Faculty of Social Sciences, Economics & Business at the Johannes
Kepler University Linz (Austria) invites applications for a full-time,
tenured faculty position as a

***
Professor for
Sustainable Transportation Logistics with a focus on "Physical Internet"
http://www.jku.at/content/e213/e152/e141/e14908/e14907/e14896/e307677?showlang=eng
***

Application deadline: August 31, 2017

The successful candidate is expected to support the development and
expansion of research in the field of the "Physical Internet" at the
Johannes Kepler University and will represent this field in research and
teaching in all of its sub-areas. Research activities will focus on the
future-oriented design of a logistical flow of goods and using the
Physical Internet to strive for a sustainable, positive economic,
ecological, and socially relevant impact. Accordingly, the successful
candidate will work equally on conducting application-oriented and
base-knowledge research in both logistical and computer science-related
research topics. In the field of teaching, the successful candidate will
be expected to develop a new area of specialization in conjunction with
existing courses already offered at the Johannes Kepler University. The
successful candidate will also be willing to independently address and
carry out administrative tasks at the university/department as well as
actively take part in academic committees.

The successful candidate must

(a) hold a post-doctorate (venia docendi) degree or a comparable
post-doctorate degree, preferably with a focus on transportation
logistics and/or computer science,
(b) demonstrate past experience in conducting base-knowledge research
with a focus on logistics and/or computer sciences,
(c) possess experience in academia and teaching at all levels,
(d) submit a list of publications on an international level and a list
of all academic lectures, presentations, etc.,
(e) show professional relationships with companies and industries
demonstrated through ongoing projects in collaboration with companies,
(f) show experience in acquiring external funding, and
(g) show international experience and professional contacts.

In addition to the key qualifications as cited above, the successful
candidate is expected to possess a strong social skill set.

The annual gross salary is €90,000 to €110,000; the actual net income
amount can only be negotiated with the Rector.

The Johannes Kepler University wishes to increase the proportion of
academic female faculty members and, for this reason, especially
welcomes applications by qualified women. If applicants are equally
qualified, a woman will be given preference for this position.

The applicant may not have been previously employed at an Austrian
university since 2013.

Prospective applicants interested in the position are requested to
electronically send an application in adherence to the stated criteria,
together with the requested documentation (including all relevant
documents, application form, current CV, list of publications, and a
list of all courses taught, etc.) to the Rector of the Johannes Kepler
University of Linz (bewerbung@jku.at).

Information for Applicants:
http://www.jku.at/Rektorat/content/e6424/e6423/e307677/e307687/StellenprofilSustainableTransportationLogistics_eng.pdf

Application Form:
http://www.jku.at/Rektorat/content/e6424/e6423/e307677/e307688/ApplicationForm_eng.doc


**********************************************************
*
* 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, August 15, 2017

[DMANET] Open positions: Two lecturer/senior lecturer positions in algorithms at the University of Sydney

Two lecturer/senior lecturer (assistant professor) positions in algorithms
available at the University of Sydney, Australia.

Closing date: 11:30pm, Sunday, 27 August 2017 (Sydney time)

Full ad: http://bit.ly/2wBCOxv

The School of Information Technologies at the University of Sydney is
embarking on an exciting growth journey, adding several new positions which
will complement our core areas of strength pushing the frontiers to new
research areas. As part of this plan, the School of Information
Technologies (SIT) invites applications from outstanding candidates for a
continuing Lecturer or Senior Lecturer position (Level B/C) in Algorithms
starting immediately. The level of appointment will be commensurate with
qualifications and experience.

This is an attractive opportunity for candidates with an interest and
passion for high quality excellent research and teaching. Strong candidates
from all areas of algorithmic research are sought, including but not
limited to: algorithm analysis, graph algorithms, algorithmic game theory,
approximation algorithms, combinatorial optimization, quantum algorithms
and computational learning theory.

To be successful, you will have a PhD in computer science, or a closely
related discipline. You must show evidence of excellent research
achievements in areas of algorithms and the ability to publish your
research in highly-ranked outlets. You will be expected to teach a range of
computer science courses including algorithms related courses. A strong
commitment to teaching and learning is required as well as evidence of
ability to lecture and prepare new teaching material. The candidate is
expected to teach in a broad range of computer science subjects including
algorithms and computing theory.

Informal enquiries are welcome, and can be made to Joachim Gudmundsson (
joachim.gudmundsson@sydney.edu.au).

**********************************************************
*
* 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, August 14, 2017

[DMANET] Announcement: [Algorithms] Special Issue "Online Algorithms"

Dear Colleagues,

We cordially invite you to submit a manuscript for consideration and
possible publication in a Special Issue on "Online Algorithms" to be
published in the open access journal Algorithms
(http://www.mdpi.com/journal/algorithms), which is indexed by EI and ESCI.

The submission manuscript deadline is 30 November 2017. The goal of this
Special Issue is to offer a forum for exchanging new ideas about the
design and analyses of online algorithms for various optimization
problems. For more details please visit the website:
http://www.mdpi.com/journal/algorithms/special_issues/Online_Algorithms

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

Please let me know within a month or as soon as possible if you and your
colleagues are interested in submitting a manuscript for this special
issue. Your contribution would be most welcome.

Kind regards,
Ms. Yi Zhang
Assistant Editor

Algorithms CiteScore 2016: 1.15
https://www.scopus.com/sourceid/21100199795

--
MDPI Branch Office, Wuhan
Tel. +86 27 878 086 58;
Fax: +86 27 876 125 88
E-Mail: algorithms@mdpi.com
http://www.mdpi.com/journal/algorithms/

MDPI AG
St. Alban-Anlage 66, 4052 Basel,
Postfach, CH-4020 Basel, Switzerland
Tel. +41 61 683 77 34; Fax +41 61 302 89 18
http://www.mdpi.com/


**********************************************************
*
* 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] Building Bridges II. registration

Dear Colleague,

We apologoze for the possible multiple posting. The registration for

Building Bridges II.
Conference to celebrate 70th birthday of László Lovász
Budapest, Hungary
July 2 - 6, 2018

is open now. Please go to page

http://www.renyi.hu/conferences/ll70/registration/

for details.

It is hard to believe but true: László (Laci) Lovász will turn seventy in
2018. His contributions to discrete mathematics and theory of algorithms
have been fundamental. He has connected combinatorics and theoretical
computer science with other areas of mathematics in many ways. To celebrate
Laci's birthday and his extraordinary achievements, the János Bolyai
Mathematical Society, the Eötvös University, and the Alfréd Rényi Institute
of Mathematics organize an international conference. Titled "Building
Bridges II", the meeting will be held in Budapest, Hungary, July 2 to 6,
2018. The scientific program will consist of invited lectures and poster
sessions.

Confirmed invited speakers include


Noga Alon László Babai Anders Björner
Béla Bollobás Christian Borgs Sourav Chatterjee
Jennifer Chayes Persi Diaconis Uriel Feige
Tibor Jordán Jacob Fox Jeff Kahn
Gil Kalai Ravi Kannan Peter Keevash
Nathan Linial Jaroslav Nešetřil Alexander Razborov
Lex Schrijver Joel Spencer Balázs Szegedy
Endre Szemerédi Tamás Szőnyi Terry Tao
Éva Tardos Gábor Tardos Santosh Vempala
Vu Ha Van Avi Wigderson Ágnes Backhausz
Endre Csóka Péter Csíkvári László Végh
Hamed Hatami

Best wishes,
Attila Sali
Secretary of the Organizing Committee
**********************************************************
*
* 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] 2-Year Stipend for a PhD Student in Text Algorithms at University of Warsaw, Poland

One stipend position for a PhD student is opening in the "Algorithms for
text processing with errors and uncertainties" project that is carried out
within the HOMING programme of the Foundation for Polish Science. The
project is co-financed by the European Union under the European Regional
Development Fund.

The maximum duration of the stipend is 21 months, starting Oct 2, 2017. The
deadline for applications is *Aug 25, 2017*.

A candidate should have a status of a PhD student on the starting date of
the project. This could include eligibility for PhD studies at the
University of Warsaw in the recruitment during September 2017.

The goal of the project is the design of pattern matching algorithms when
errors and uncertainties occur in the data. The expected developments of
the project are in the scope of computer science while the motivation stems
mainly from computational biology. In pattern matching with errors we are
to report approximate matches with bounded edit or Hamming distance.
Uncertain texts are texts with don't care symbols, indeterminate symbols,
or positions that specify a probability distribution over the alphabet
(so-called Position-Weight Matrices). The scope of problems considered in
the project includes pattern matching in the off-line, on-line, and
streaming setting, text indexing, internal text queries, and computation of
similarity measures.

The key responsibilities include:

- Design and analysis of efficient algorithms for pattern matching in
the presence of errors and uncertainties
- Preparation of manuscripts and presenting them at international
conferences
- Optional: Implementation of selected algorithms

A successful candidate will take part in research on key problems in the
area of text algorithms. The project is conducted at the Faculty of
Mathematics, Informatics and Mechanics, University of Warsaw which is a
leading institution in the field of theoretical computer science. The
official partners of the project are experienced researchers and PhD
students from the UK and France. You will be able to disseminate the
results of your work at international conferences. Your results will be
expected to become the basis of your PhD thesis.
More details can be found at the website:
https://www.mimuw.edu.pl/~jrad/tpeu.html

For further information, feel free to contact me at jrad@mimuw.edu.pl

Best regards,
Jakub Radoszewski
**********************************************************
*
* 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/
*
**********************************************************

Sunday, August 13, 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

http://hipc.org/foundations-of-big-data-computing-workshop/
************************************************************************************************

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 Chair: Arindam Pal (TCS Research and Innovation)
* Proceedings Chair: Ren Chen, USC (HiPC proceedings chair)
* Industry Liaison: Vivek Yadav (FullStackNet, India)

Technical Program Committee:

Medha Atre, IIT Kanpur

Ariful Azad, Lawrence Berkeley National Laboratory

Biplab Banerjee, IIT Roorkee

Suren Byna, Lawrence Berkeley National Laboratory

Nabanita Das, Indian Statistical Institute

Oded Green, Georgia Institute of Technology

Manish Kurhekar, Visvesvaraya National Institute of Technology

Suresh Marru, Indiana University

Arindam Pal, TCS Research

Laks Raghupathi, Shell, India

Sudip Seal, Oak Ridge National Laboratory

Gokul Swamy, Amazon

Devesh Tiwari, Northeastern University

Abhinav Vishnu, Pacific Northwest National Laboratory

Yinglong Xia, Huawei Research America

Jaroslaw Zola, University of Buffalo

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

Friday, August 11, 2017

[DMANET] 2017 COIN-OR Cup

Announcing the thirteenth annual "COIN-OR Cup" competition,
sponsored by the COIN-OR Foundation.

Guidelines:
* A submission or nomination must contain:
1. a synopsis of an effective use of COIN-OR or
valuable contribution to COIN-OR (or both!),
2. an explanation of its significance.

* The winner must accept the prize in person at the 2017 INFORMS
Annual Meeting so we can all celebrate appropriately (see "Celebration"
below).

* Submission deadline: Friday, September 22nd, 2017.

* Self-nominations are welcome.

* We especially encourage nominations of effective use of COIN-OR that
the community may not know about.


Celebration: The 2017 COIN-OR Cup will be awarded at a celebration
during the INFORMS Annual meeting in Houston, TX. All entrants,
their supporters, and other interested parties are welcome to join the
celebration and regale, rile, and roast the prize winners. Details
of the event will be announced later.

The winning entry will be announced at this celebration event,
and posted on the COIN-OR website https://www.coin-or.org .


Please e-mail your submissions to coin-cup@coin-or.org in a single
zipped archive, containing a description of your submission and copies
of all relevant papers/documents.


2017 COIN-OR Cup Committee:
Giacomo Nannicini (chair), IBM T.J. Watson
Andrew Conn, IBM T.J. Watson
Thomas Wortmann, Singapore University of Technology and Design
**********************************************************
*
* 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] Final Call for Posters: Graph Drawing and Network Visualization GD 2017

===========================================================================

Final Call for Posters

GD 2017

25th International Symposium on
Graph Drawing and Network Visualization

September 25-27, 2017 - Boston, MA, U.S.A.
http://graphdrawing.org/gd2017

===========================================================================

Graph Drawing is concerned with the geometric representation of graphs
and constitutes the algorithmic core of Network Visualization. Graph
Drawing and Network Visualization are motivated by applications where it
is crucial to visually analyze and interact with relational datasets.
Examples of such application areas include data science, social
sciences, Web computing, information systems, biology, geography,
business intelligence, information security and software engineering.

GD has been the main annual event in this area for more than 20 years.
Its focus is on combinatorial and algorithmic aspects of graph drawing
as well as the design of network visualization systems and interfaces.
GD 2017 will take place September 25-27, 2017 at the Northeastern
University in Boston, Massachusetts, USA. Researchers and practitioners
working on any aspects of graph drawing and network visualization are
invited to submit posters and to participate in the symposium.

POSTER SUBMISSION INFORMATION
-----------------------------

The submission of posters on graph drawing, network visualization, and
related areas is solicited. The poster session will provide a forum
for the communication of late-breaking research results (which may also
appear elsewhere) to the GD community. Authors of posters should prepare
an abstract (up to two pages in unmodified LNCS style -- no times
package is allowed) that must be submitted together with the poster.
Abstracts of accepted posters will appear in the conference proceedings
(two pages). The maximum size for a poster is A0 (84.1 cm x 118.9 cm).
The posters must be in portrait mode.

Each submission will then consist of two pdf files (the two-page
abstract and the poster) and must include names, email addresses and
contact information of the contributors. Contributions must be submitted
via EasyChair following the link provided on the conference web site.

BEST POSTER AWARD
-----------------

To recognize the effort of the participants in preparing and presenting
their posters in a clear and elegant way, there will be a Best Poster
Award voted on by the GD 2017 attendees.

IMPORTANT DATES
---------------

• Poster submission deadline August 17 (23:59 PDT)
• Notification of poster acceptance August 28
• Final versions due September 3
• Symposium September 25-27

INVITED SPEAKERS
----------------

Timothy M. Chan, University of Illinois at Urbana-Champaign, USA
Alessandro Vespignani, Northeastern University, US

PROGRAM COMMITTEE
-----------------

Daniel Archambault, Swansea University, GB
Benjamin Bach, University of Edinburgh, GB
Fabian Beck, Universität Duisburg-Essen, DE
Michael Bekos, Universität Tübingen, DE
Therese Biedl, University of Waterloo, CA
Giordano Da Lozzo, UC Irvine, US
Vida Dujmovic, University of Ottawa, CA
Stephane Durocher, University of Manitoba, CA
Tim Dwyer, Monash University, AU
Fabrizio Frati (co-chair), Università Roma Tre, IT
Martin Gronemann, Universität zu Köln, DE
John Alexis Guerra Gómez, Universidad de los Andes, CO
Michael Hoffmann, ETH Zürich, CH
Yifan Hu, Yahoo Research, US
Takayuki Itoh, Ochanomizu University, JP
Anna Lubiw, University of Waterloo, CA
Kwan-Liu Ma (co-chair), UC Davis, US
Fabrizio Montecchiani, Università degli Studi di Perugia, IT
Martin Nöllenburg, Technische Universität Wien, AT
Arnaud Sallaberry, LIRMM, FR
Andrew Suk, University of Illinois at Chicago, US
Antonios Symvonis, National Technical University of Athens, GR
Ioannis Tollis, University of Crete, GR
Csaba Tóth, California State University Northridge, US
Alexander Wolff, Universität Würzburg, DE
Jian Zhao, FX Palo Alto Laboratory, US

ORGANIZING COMMITTEE
--------------------

Cody Dunne (co-chair), Northeastern University, US
Alan Keahey (co-chair), Conversant, US

CONTEST COMMITTEE
-----------------

Philipp Kindermann, Universität Würzburg, DE
Maarten Löffler (chair), Utrecht University, NL
Ignaz Rutter, Karlsruhe Institute of Technology, 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/
*
**********************************************************

Thursday, August 10, 2017

from Lane A. Hemaspaandra: 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

[DMANET] EATCS Bulletin, call for abstracts

EATCS Bulletin, http://eatcs.org/index.php/eatcs-bulletin, has a
section for "Technical contributions." To stimulate this section
further, we have just started publication abstracts of works
that have been accepted by journals and/or conferences or have
appeared in major archives. The topics of interest include all areas
of theoretical computer science (for instance, see topics of the three
Tracks of ICALP, http://www.easyconferences.eu/icalp2016/cfp.html).

Abstracts should be rather detailed, 2-3 pages long in the format
given at http://eatcs.org/index.php/eatcs-bulletin. Submissions
should include the information on the full paper (the name of
conferences, archives, etc) and sufficiently detailed explanation of
its merits, e.g., importance, motivations, clear comparison with
existing results and novelty and/or new ideas of proof techniques.

The Bulletin is published in Feb, Jun and Oct. The deadline for the
abstract submission is 15th of the previous month, for instance, Aug
15, 2017 for the Oct issue of this year. All materials including
tex and pdf files should be sent electrically to bulletin@eatcs.org
and iwama@kuis.kyoto-u.ac.jp. Acceptance/rejection, decided based on
its merit mentioned above, will be notified as soon as possible. The
Bulletin will not require copy-right transfer for accepted abstracts.

Kazuo Iwama
Editor-in-Chief
Bulletin, European Association for Theoretical Computer Science
**********************************************************
*
* 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/
*
**********************************************************