dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. Interactions with Combinatorics, June 29-30 Birmingham, UK
(Andrew Treglown)
2. 2017 IEEE CEC Theory Special Session *EXTENDED DEADLINE*
(Andrew M. Sutton)
3. PhD position in Extremal and Probabilistic Combinatorics
(Patel, Viresh)
4. 2nd CFP with new dates: Graph Algorithm Building Blocks (GABB
@ IPDPS'17) (Aydin Buluc)
5. Reminder for submission: 1st AIROYoung workshop (Lavinia Amorosi)
6. IFORS 2017 - sessions "Urban Mobility" and "Vehicle Routing
with Multiple Trips" - submission deadline February 10th, 2017
(Gianessi Paolo)
----------------------------------------------------------------------
Message: 1
Date: Tue, 10 Jan 2017 16:25:51 +0000
From: Andrew Treglown <A.C.Treglown@bham.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Interactions with Combinatorics, June 29-30
Birmingham, UK
Message-ID:
<3BED44450C8E934DA21DF8562A7032D60118EAF722@EX12.adf.bham.ac.uk>
Content-Type: text/plain; charset="us-ascii"
Dear all,
On June 29-30 2017, the University of Birmingham is hosting the workshop "Interactions with Combinatorics".
The invited speakers are Zdenek Dvorak (Prague), Leslie Goldberg (Oxford), Peter Hegarty (Chalmers, Gothenburg), Daniel Horsley (Monash), Oleg Pikhurko (Warwick), Oriol Serra (Barcelona), Julia Wolf (Bristol) and Yufei Zhao (Oxford).
The workshop is open to all and registration is free. There will also be chance for some participants to give contributed talks. More information about the event can be found on the workshop's webpage http://web.mat.bham.ac.uk/~treglowa/interactionscombinatorics
We hope you can join us in Birmingham!
Andrew Treglown and Allan Lo
------------------------------
Message: 2
Date: Tue, 10 Jan 2017 19:01:14 +0100
From: "Andrew M. Sutton" <andrew.sutton@hpi.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2017 IEEE CEC Theory Special Session *EXTENDED
DEADLINE*
Message-ID: <1e5ab592-73e6-2748-9eab-12a012634b11@hpi.de>
Content-Type: text/plain; charset="utf-8"; format=flowed
CALL FOR PAPERS (DEADLINE EXTENDED)
CEC 2017 Special Session on
Theoretical Foundations of Bio-inspired Computation
June 5 - 8, 2015, Donostia - San Sebastian, Spain
*** EXTENDED submission deadline: January 30, 2017 ***
Website: https://hpi.de//friedrich/conf/cec2017.html
=================
TCS Special Issue
=================
Selected papers will be invited to a *special issue* of the journal of
Theoretical Computer Science.
==========
Motivation
==========
Bio-inspired search heuristics often turn out to be highly successful
for optimization in practice. The theory of these randomized search
heuristics explains the success or the failure of these methods in
practical applications. Theoretical analyses lead to the understanding
of which problems are optimized (or approximated) efficiently by a
given algorithm and which are not.
The benefits of theoretical understanding for practitioners are
threefold.
1. Aiding the algorithm design,
2. guiding the choice of the best algorithm for the problem at
hand,
3. determining the optimal parameter settings.
The theory of evolutionary computation has grown rapidly in recent
years. The primary aim of this special session is to bring together
people working on theoretical aspects of bio-inspired computation. The
latest breakthroughs in the theory of bio-inspired computation will be
reported and new directions will be set.
=====
Scope
=====
Potential authors are invited to submit papers describing original
contributions to the foundations of evolutionary computation. Although we
are most interested in theoretical foundations, computational studies
of a foundational nature are also welcome.
The scope of this special session includes (but is not limited to) the
following topics:
* Theoretical foundations of bio-inspired heuristics
* Exact and approximation runtime analysis
* Black box complexity
* Self-adaptation
* Population dynamics
* Fitness landscape and problem difficulty analysis
* No free lunch theorems
* Statistical approaches for understanding the behavior of
bio-inspired heuristics
* Computational studies of a foundational nature
All problem domains will be considered including:
* combinatorial and continuous optimization
* single‐objective and multi‐objective optimization
* constraint handling
* dynamic and stochastic optimization
* co‐evolution and evolutionary learning
================
Paper Submission
================
To submit to the special session:
1. prepare your manuscript following the IEEE CEC 2017 paper
submission guidelines (see http://www.cec2017.org),
2. submit your manuscript electronically in the CEC 2017 system:
http://ieee-cis.org/conferences/cec2017/upload.php,
3. *IMPORTANT* On the submission system you must select
"SS31. Theoretical Foundations of Bio-inspired Computation"
as "Main Research Topic".
Special session papers are treated in the same way as regular
conference papers.
===============
Important Dates
===============
* Paper submissions: January 30, 2017 (Extended)
* Notification of acceptance: March 6, 2017
==========================
Special Session Organizers
==========================
Pietro S. Oliveto
Department of Computer Science
University of Sheffield
Sheffield, UK
http://staffwww.dcs.shef.ac.uk/people/P.Oliveto/
Andrew M. Sutton
Algorithm Engineering Group
Hasso-Plattner-Institute
Potsdam, Germany
https://hpi.de/friedrich/people/andrew-m-sutton.html
----------------------------------------------------------------------
This special session is organized as a part of the IEEE CIS Task Force
on Theoretical Foundations of Bio-inspired Computation
Task Force Website:
http://staffwww.dcs.shef.ac.uk/people/P.Oliveto/CIStheory.html
------------------------------
Message: 3
Date: Tue, 10 Jan 2017 19:03:25 +0000
From: "Patel, Viresh" <V.S.Patel@uva.nl>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] PhD position in Extremal and Probabilistic
Combinatorics
Message-ID: <FD549E851842DC4599A1D652297F03812F82E936@MBX02.uva.nl>
Content-Type: text/plain; charset="Windows-1252"
KdV Institute, University of Amsterdam
Vacancy number: 16-606
Closing Date: 28 February 2017
The Korteweg-de Vries Instituut voor Wiskunde (KdV Institute), which is the mathematical research institute of the Faculty of Science of the University of Amsterdam, offers a PhD position on the topic of Extremal and Probabilistic Combinatorics under the supervision of Dr Viresh Patel. The successful candidate will be part of the Discrete Mathematics group (Prof. Lex Schrijver, Dr Guus Regts, Dr Viresh Patel, two postdocs and three PhD students). The candidate will also participate in activities related to NETWORKS, a nationwide Dutch research programme on stochastic, algorithmic and combinatorial aspects of networks.
Possible directions for research include but are not limited to:
extremal graph theory and combinatorics;
probabilistic methods in combinatorics;
algorithms (in particular the Travelling Salesman Problem).
The position is funded by a TOP grant of the NWO (the Dutch Organization for Scientific Research). It includes substantial travel funding, and the applicant will be encouraged to attend conferences and to collaborate internationally.
The starting date of project is no later than 1 August 2017.
Requirements - Applicants should have (or expect to soon have) a masters degree in mathematics (or a substantial component in mathematics) and should have an interest in graph theory, combinatorics or a closely related topic. Proficiency in English is a requirement.
Further information - See http://www.uva.nl/en/research/phd/phd-vacancies/item/16-606-phd-candidate-in-extremal-and-probabilistic-combinatorics.html for full job advert. For additional information please contact: dr. Viresh Patel (v.s.patel@uva.nl).
Appointment - The appointment will be on a temporary basis for a period of 4 years (initial appointment will be for a period of 18 months and after satisfactory evaluation it can be extended for a total duration of 4 years) and should lead to a dissertation (PhD thesis). An educational plan will be drafted that includes attendance of courses and (international) meetings. The PhD candidate is also expected to assist in teaching of undergraduates. Based on a full-time appointment (38 hours per week) the gross monthly salary will range from €2,191 in the first year to €2,801 in the last year. The Collective Labour Agreement for Dutch universities is applicable.
Job application - Applications should be submitted to application-science@uva.nl and should include:
a letter of motivation;
a detailed CV (including a list of your degree courses and grades);
a copy of your master thesis or a draft of it (if not available, please submit a copy of your bachelor thesis).
Please make sure all your material is attached in only one pdf.
Letters of recommendations (two per applicant) can be sent directly to application-science@uva.nl In the subject line should be written: 'Letter of recommendation for ...' and the name of the applicant.
The closing date for receipt of completed applications is 28 February 2017.
------------------------------
Message: 4
Date: Tue, 10 Jan 2017 12:55:37 -0800
From: Aydin Buluc <abuluc@lbl.gov>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd CFP with new dates: Graph Algorithm Building
Blocks (GABB @ IPDPS'17)
Message-ID:
<CA+vcEgCvo_usF1Zt-SF+LTC4nLPFBwStUKMA2Tk5Mv6f7k4B-w@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Graph Algorithm Building Blocks (GABB) 2017
An IEEE IPDPS 2017 Workshop, May 29, 2017, Orlando, Florida, USA
=== Scope and Goals ===
This workshop series started with the narrow goal of exploring the
definition of a set of basic building blocks for graph algorithms (
http://graphblas.org), analogous to the Basic Linear Algebra Subprograms
(BLAS) in numerical linear algebra. Over the years, our scope has
expanded. We've welcomed a wide range of papers into GABB covering graph
computations with an emphasis on high-performance and parallel computing.
We expect this trend to continue in 2017.
In particular, while we retain our focus on "building blocks" for graph
computations (including those not based on linear algebra), we also welcome
work that focuses on libraries and frameworks to support applications that
use graph algorithms.
Our target audience is developers of graph algorithms, researchers in
high-performance computing working on irregular applications, applied
mathematicians working on fundamental algorithmic building blocks for graph
computations, and application scientists using graphs in their
computational work and data analysis.
=== Submission and Dates ===
Submitted manuscripts may not exceed ten (10) single-spaced double-column
pages using 10-point size font on 8.5x11-inch pages (IEEE conference
style), including figures, tables, and references (see IPDPS Call for
Papers for more details). All papers will be peer-reviewed. Proceedings of
the workshops are distributed at the conference and are submitted for
inclusion in the IEEE Xplore Digital Library after the conference.
*Important dates (updated):*
Submissions due: *January 31, 2017 EST 23:59pm*
Notification: February 21, 2017
Final Camera-Ready Manuscript due: March 15, 2017
- Workshop web page: http://graphanalysis.org/workshop2017.html
- Submission page: https://easychair.org/conferences/?conf=gabb17
=== Program Committee ===
David A. Bader, Georgia Institute of Technology
Aydın Buluç, Lawrence Berkeley National Lab (co-chair)
Jonathan Berry, Sandia National Labs
John Gilbert, UC Santa Barbara
Vasia Kalavri, KTH Royal Institute of Technology
Jeremy Kepner, MIT Lincoln Labs
Chris Long, US Department of Defense
Andrew Lumsdaine, Pacific Northwest National Lab and University of
Washington
Tim Mattson, Intel Corp. (co-chair)
Kamesh Madduri, Penn State University
Henning Meyerhenke, Karlsruhe Institute of Technology
John Owens, University of California, Davis
Fabrizio Petrini, Inter Corp.
Semih Salihoglu, University of Waterloo
Edgar Solomonik, University of Illinois, Urbana-Champaign
Sivan Toledo, Tel-Aviv University
------------------------------
Message: 5
Date: Wed, 11 Jan 2017 10:59:45 +0100
From: Lavinia Amorosi <lavinia.amorosi@uniroma1.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Reminder for submission: 1st AIROYoung workshop
Message-ID:
<CAM+03Ps7njNoaU53O4pxt7vj3HMEu_RmdF_DoL8uwoVO1wa=nQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Dear Colleagues,
We would like to kindly remind that the submission deadline for the
1st AIROYoung workshop on Emerging Optimisation Problems in Complex
Networks is getting closer.
Important Dates
===============
*Deadline for submissions: January 15th, 2017*
Workshop: February 16th-17th, 2017
Submissions
===========
Interested applicants can send a short abstract (max 1 page) to
airo.young.researchers@gmail.com
<airo.young.researchers@gmail.com?subject=AIROYoung%20Workshop%20Submission>
Location
================
Department of Statistical Sciences, University of Rome, Sapienza.
Invited Speakers
===============
Justo Puerto, University of Sevilla, Spain.
Maria Grazia Scutellà, University of Pisa, Italy.
*Participation* to the workshop is *free* of charge and it is possible to
reserve your *accommodation at a special rate* booking via AIROYoung.
Furthermore, AIROYoung members can request a *travel grant *(for more
details see the workshop website *http://workshop.airoyoung.org
<http://workshop.airoyoung.org>*).
We invite contributions from *all researchers* in the area of
Network Optimization. Young researchers (PhD students, recent PhD
graduates) can also contribute their work on other areas. These works will
be presented in a special «Young Researchers» session.
The organizing committee:
Lavinia Amorosi (University of Rome, Sapienza)
Alberto Maria Santini (University of Bologna)
------------------------------
Message: 6
Date: Wed, 11 Jan 2017 17:57:19 +0100
From: Gianessi Paolo <paolo.gianessi@emse.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] IFORS 2017 - sessions "Urban Mobility" and "Vehicle
Routing with Multiple Trips" - submission deadline February 10th, 2017
Message-ID: <990a01e5-3786-6382-68e8-243b90fae6b9@emse.fr>
Content-Type: text/plain; charset=utf-8; format=flowed
===========================================================================================
21st Conference of the International Federation of Operational
Research Societies
IFORS 2017 — OR/Analytics for a Better World
Invitation to submit a paper for the sessions: Urban Mobility
Vehicle Routing
with Multiple Trips
Abstract submission deadline: February 10th, 2017
===========================================================================================
Dear Colleagues,
Diego Cattaruzza (diego.cattaruzza@ec-lille.fr) and I are organizing the
following two
sessions:
Urban mobility (session code: 1beb2843)
Vehicle Routing with Multiple Trips (session code: dcfab396)
of the Vehicle Routing stream (area: Location, Logistics,
Transportation, Traffic) of the
21st Conference of the International Federation of Operational
Research Societies
(IFORS 2017) "OR/Analytics for a Better World"
which will be held on July 17-21, 2017 in Québec City, Canada,
(http://ifors2017.ca).
Urban Mobility:
Since 2007, at least 72% of the European population lives in urban
zones.
This results in a huge number of urban movements towards working
places or leisure time
activities. Moreover, flows needed to supply markets, stores or
private places,
contribute in reaching the capacity limit of urban road networks.
Resulting pollution,
noise, congestion (among the others) considerably worsen quality of
life in urban areas.
To face these problems, public authorities introduce particular
regulations and study
alternative transport policies and delivery systems. On the other
side, companies take
more and more into account dynamics which are peculiar to the urban
environment (rush
hours, limited acces zones) so as to further optimize their delivery
plans.
In this session we are interested in the last advances focused in
enhancing the urban
mobility of people and goods.
Vehicle Routing with Multiple Trips:
The well-studied Capacitated Vehicle Routing Problem (CVRP) aims at
determining a set
of routes to serve a set of customers so as to minimize a given
objective function,
under the assumption that each vehicle of the available fleet
performs at most one
route during the planning horizon.
Dropping this assumption gives rise to the VRP with Multiple Trips.
This family of
problems received an increasing interest of the reszearch community
in the last decade,
mostly due to the nature of deliveries in urban areas, where reduced
size vehicles are
normally used, resulting in much shorter routes with respect to the
workday time horizon.
In this session we are interested in the recent advances in the
study of this optimization
problem.
Should you be interested in submitting some current or recent work
related to one of these
topics, please send your abstract by following the guidelines at:
http://ifors2017.ca/submit-abstract
Please provide the associated code when submitting your abstract, and
keep in mind that
the abstract submission deadline is:
February 10th, 2017.
Please do not hesitate to contact us for whichever question.
Kindest regards,
Paolo Gianessi (paolo.gianessi_at_emse.fr)
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 107, Issue 9
**************************************
No comments:
Post a Comment