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. PhD position, 3 years, graph algorithms, Université de
Lorraine, Metz, FRANCE (Dieter Kratsch)
2. 2nd CfP: Special Issue in Journal of Heuristics on
Metaheuristics for Combinatorial Optimization
(José Francisco Chicano García)
3. ICALP 2016 - Early registration reminder (Nicola Galesi)
4. Symposium Discrete Mathematics 2016 (Tibor Szabo)
5. grants within the SFB Transregio 154 (Frauke Liers)
6. Tenure-track position in mathematics, Aalto University
(Pekka Orponen)
7. ACP Summer School on Constraint Programming (Willem-Jan van Hoeve)
----------------------------------------------------------------------
Message: 1
Date: Sat, 21 May 2016 17:54:17 +0200
From: Dieter Kratsch <dieter.kratsch@univ-lorraine.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD position, 3 years, graph algorithms, Université
de Lorraine, Metz, FRANCE
Message-ID: <D7AB90AD-8CF4-4048-9513-63E3F4BE8865@univ-lorraine.fr>
Content-Type: text/plain; charset=utf-8
Within the ANR project GraphEn we have the financial support for a PhD position (3 years). The subject within the field of graph algorithms is entitled:
<< Enumeration in Graphs and Hypergraphs : Algorithms and Complexity >>
The ANR project GraphEn deals with enumeration problems. Contrary to the ubiquitous optimization problems, the task in enumeration problems is to enumerate all objects of the input satisfying a certain property. In our research the number of those objects is usually exponential in the input size.
The classical approach is said to be output-sensitive and measures the running time in the size of the input and the output. A major goal is to construct algorithms of polynomial delay. The recent input-sensitive approach measures the running time in the size of the input. Hence such algorithms are exact exponential ones. This latter approach can also be used to establish upper bounds on the number of objects enumerated. Enumeration is a young field in algorithms with hopefully many new ideas and techniques to be found. Combining enumeration with other algorithmic approaches, as e.g. parameterized algorithms, will be studied as well.
Background in enumeration algorithms or exact exponential algorithms would be an asset. Candidates should have a strong background in construction and analysis of algorithms. Background in graphs and graph algorithms is highly desirable. Knowledge in discrete mathematics and graph theory is appreciated.
Candidates should have a Master's degree in Computer Science or related fields. The grant is a standard french PhD support. The gross salary is 1684 euros and it may be increased by teaching (in french).
Applications (including CV, letter of motivation, letter of recommendation) should be send to Dieter Kratsch, the supervisor of the PhD project, at dieter.kratsch@univ-lorraine.fr no later than june 15, 2016. English is required language. French may be useful in every day life, teaching, etc.
The city of Metz is located in the east of France 60 kilometers from Saarbrücken (Germany) and 60 kilometers from Luxembourg City. By TGV one can go to Paris in 1 hour and 20 minutes.
Informal inquiries to the above e-mail address are also welcome. Further information is available at
ANR GraphEn : http://graphen.isima.fr
Dieter Kratsch
Université de Lorraine
LITA, Metz
------------------------------
Message: 2
Date: Fri, 20 May 2016 14:03:54 +0200
From: José Francisco Chicano García <chicano@lcc.uma.es>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2nd CfP: Special Issue in Journal of Heuristics on
Metaheuristics for Combinatorial Optimization
Message-ID: <0018F341-E856-4C85-85DF-462A09ED53C0@lcc.uma.es>
Content-Type: text/plain; charset=utf-8
===============================================================
Special Issue in Journal of Heuristics
on Metaheuristics for Combinatorial Optimization
(second call for papers)
http://www.franciscochicano.es/joh-metacop
===============================================================
** DESCRIPTION
Combinatorial Optimization Problems consist in finding an optimal solution (according to some objective function) from a finite search space. These problems arise in Industry and Academia and, unfortunately, most of them cannot be solved efficiently, that is, they are NP-hard and no polynomial time algorithm is known to solve them. For this reason, in the last decades researches have investigated the use of approximated algorithms to find near optimal solutions to these problems. In particular, a great research effort has been devoted to the development of metaheuristic algorithms to solve combinatorial optimization problems, like Evolutionary Algorithms, Ant Colony Optimization, Particle Swarm Optimization, Iterated Local Search, Variable neighbourhood Search, Hybrid Metaheuristics, etc.
Successfully solved problems include scheduling, timetabling, network design, transportation and distribution problems, vehicle routing, traveling salesman, graph problems, satisfiability, energy optimization problems, packing problems and planning problems.
Prominent examples of metaheuristics include evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, ant colony optimization, particle swarm optimization, variable neighbourhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, hyperheuristics and hybrid algorithms.
We encourage authors to submit original high-quality research on the application of metaheuristic algorithms to combinatorial optimization problems.
** SUBMISSION GUIDELINES
All submissions have to be prepared according to the "instructions for authors" as published in the journal website at http://www.springer.com/mathematics/applications/journal/10732 . Authors should submit their manuscripts to the Journal of Heuristics Editorial Manager at https://www.editorialmanager.com/heur . When submitting a paper, please select the special issue article type "S.I. : Metaheuristics for Combinatorial Optimization".
** TENTATIVE SCHEDULE
15 July 2016 submission deadline
15 November 2016 authors notification
15 February 2017 authors' revisions
5 June 2017 final notification
12 June 2017 final manuscript
Fall 2017 tentative publication
** GUEST EDITORS
Bin Hu
e-mail: Bin.Hu@ait.ac.at
Austrian Institute of Technology, Austria
Francisco Chicano
e-mail: chicano@lcc.uma.es
University of Málaga, Spain
------------------------------
Message: 3
Date: Fri, 20 May 2016 17:24:53 +0200
From: Nicola Galesi <nicola.galesi@uniroma1.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ICALP 2016 - Early registration reminder
Message-ID:
<CAM4vYr=qJSxF45d2G_GpWz_4SQz9AA=iw+wwsKMi0Lcer7K7Ag@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Please remind that the EARLY REGISTRATION period for ICALP 2016 ends on
May 31, 2016.
The 43rd International Colloquium on Automata, Languages and Programming
(ICALP 2016) will be held in Rome (Italy) from July 12-th to 15-th 2016 (
http://www.easyconferences.eu/icalp2016/index.html).
The list of ACCEPTED PAPERS is here (
http://www.easyconferences.eu/icalp2016/accepted.html)
Conference's INVITED SPEAKERS are:
- Subhash Khot (New York University, USA)
- Marta Z. Kwiatkowska (Oxford University, UK)
- Xavier Leroy (INRIA, Paris, France)
- Devavrat Shah (MIT, USA)
The following 2016 AWARDS will give a talk during the conference:
- Steve Brookes (Carnegie Mellon, USA) and Peter O'Hearn (UCL, UK) --
Gödel Prize
- Dexter Kozen (Cornell - USA) -- EATCS award
- Mark Braverman (Princeton, USA) -- Presburger award
The PROGRAM of the conference is available here (
http://www.easyconferences.eu/icalp2016/index.html).
Info about ACCOMMODATION here (
http://www.easyconferences.eu/icalp2016/accommodation.html)
------------------------------
Message: 4
Date: Sun, 22 May 2016 18:56:02 +0200
From: Tibor Szabo <szabo@zedat.fu-berlin.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Symposium Discrete Mathematics 2016
Message-ID: <8eab5ff5-7584-a421-3736-39fbcef0d77b@zedat.fu-berlin.de>
Content-Type: text/plain; charset=utf-8; format=flowed
The Symposium on Discrete Mathematics, the biennial meeting of the
Discrete Mathematics section (Fachgruppe Diskrete Mathematik) of the
German Mathematical Society (DMV), will take place in Berlin on July
15–16, 2016, just two days before the 7th European Congress of Mathematics.
The main speakers are
Petter Brändén (Stockholm),
Ben Green (Oxford),
Jochen Könemann (Waterloo),
Daniela Kühn (Birmingham),
Marc Noy (UPC Barcelona).
The registration page is now open:
http://discretemath.imp.fu-berlin.de/SDM2016/index.html
The early registration period ends on June 30th.
------------------------------
Message: 5
Date: Sun, 22 May 2016 21:48:14 +0200
From: Frauke Liers <frauke.liers@math.uni-erlangen.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] grants within the SFB Transregio 154
Message-ID: <57420CFE.4020502@math.uni-erlangen.de>
Content-Type: text/plain; charset=utf-8; format=flowed
The SFB Transregio 154 on Mathematical Modelling, Simulation and
Optimization using the Example of Gas Networks is looking for
applicants to several open Phd grants. Funding is up to 12 months and
is in compliance with the regulations of the German Research
Foundation.
The primary goal of the Transregio (http://trr154.fau.de) is to
provide certified novel answers to some of the grand challenges in the
turnaround of the energy policy, based on mathematical modeling,
simulation and optimization. In order to achieve this goal new
paradigms in the integration of these disciplines and in particular in
the interplay between integer and nonlinear programming in the context
of stochastic data have to be established and brought to bear.
Applicants of any nationality are eligible and we are in particular
encouraging female applicants.
Details about the application process can be found at
http://trr154.fau.de/index.php/en/scholarships
------------------------------
Message: 6
Date: Sun, 22 May 2016 23:50:22 +0300
From: Pekka Orponen <pekka.orponen@aalto.fi>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Tenure-track position in mathematics, Aalto
University
Message-ID: <8609c82f-88e7-7773-9a4a-b46f0efa5a8d@aalto.fi>
Content-Type: text/plain; charset="utf-8"; format=flowed
Aalto University School of Science invites applications for a tenure
track or tenured position:
ASSISTANT OR ASSOCIATE PROFESSOR IN MATHEMATICS
The main research areas of the Department of Mathematics and Systems
Analysis at Aalto University (mathsys.aalto.fi/en) are:
analysis
discrete mathematics
numerical analysis and mechanics
stochastics and statistics
systems and operations research.
Applications are welcome from all research areas. In particular,
candidates in operations research and statistics are encouraged to
apply. A doctoral degree in mathematics or in a closely related
discipline is required.
For full consideration, apply by May 31, 2016. For further information,
please visit "http://www.aalto.fi/en/about/careers/jobs/view/484/".
------------------------------
Message: 7
Date: Mon, 23 May 2016 09:54:08 -0400
From: Willem-Jan van Hoeve <vanhoeve@andrew.cmu.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] ACP Summer School on Constraint Programming
Message-ID: <0fcc8274-f4e6-a3e8-ea53-7c595cd70b3d@andrew.cmu.edu>
Content-Type: text/plain; charset=utf-8; format=flowed
The 2016 ACP Summer School on Constraint Programming will take place in
Cork, Ireland, from June 20 to 24, 2016. The school will offer a general
introduction to the capabilities and current research directions in the
area of Constraint Programming. It is organized by the Insight Centre
for Data Analytics, and chaired by Helmut Simonis.
The summer school speakers include Nicolas Beldiceanu, Hadrien
Cambazard, John Hooker, Lars Kotthoff, Barry O'Sullivan, Jean-Charles
Régin, and Helmut Simonis.
In addition to the main program, the summer school will also run a
programming competition based on a small, real-world problem. Students
can try out different solutions techniques during the week, including
their own favorite tools.
More information can be found here: http://school.a4cp.org/summer2016/
------------------------------
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 99, Issue 20
**************************************
No comments:
Post a Comment