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. 2018 Flajolet Lecture Prize : call for nominations by 28 Feb
2017 (Mark Daniel Ward)
2. PhD positions in Algorithmic Game Theory and Approximation
Algorithms (Vasilis Gkatzelis)
3. computational optimization (Stefka Fidanova)
4. Two open positions in Siegen (Rob van Stee)
5. Open Postdoc Position in Graph Theory and Combinatorics at
KIT (Torsten Ueckerdt)
----------------------------------------------------------------------
Message: 1
Date: Thu, 19 Jan 2017 16:02:25 +0100
From: Mark Daniel Ward <mdw@purdue.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2018 Flajolet Lecture Prize : call for nominations
by 28 Feb 2017
Message-ID: <caec2903-fe1b-787e-19fe-bd9308d17757@purdue.edu>
Content-Type: text/plain; charset=utf-8; format=flowed
2018 FLAJOLET LECTURE PRIZE
Call for Nominations: the due date is 28 February 2017
The Philippe Flajolet Lecture Prize for outstanding contributions to
analytic combinatorics and analysis of algorithms is awarded every two
years by the Analysis of Algorithms (AofA) community that owes its
existence to Philippe Flajolet. The first Flajolet Lecture was
presented by D. E. Knuth at the 2014 AofA International Conference on
Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of
Algorithms, Paris, France, and the second one by Bob Sedgewich at the
2016 AofA Conference in Krakow, Poland.
The prize is named in honor and recognition of the extraordinary
accomplishments of late Philippe Flajolet, who spent most of his
scientific life at INRIA, France. Philippe is best known for
fundamental advances in mathematical methods for the analysis of
algorithms. His research laid the foundation of a subfield of
mathematics, now known as analytic combinatorics. Analytic
combinatorics is a modern basis for the quantitative study of
combinatorial structures (such as words, trees, mappings, and graphs),
with applications to probabilistic study of algorithms that are based on
these structures. It also strongly influences research in other
scientific domains, such as statistical physics, computational biology,
and information theory. Flajolet's work takes the field forward by
introducing original approaches in combinatorics based on two types of
methods: symbolic and analytic. The symbolic side is based on the
automation of decision procedures in combinatorial enumeration to derive
characterizations of generating functions. The analytic side treats
those functions as functions in the complex plane and leads to precise
characterization of limit distributions. Beyond these foundational
contributions, Philippe's research opened new avenues in various domains
of applied computer science, including streaming algorithms,
communication protocols, database access methods, data mining, symbolic
manipulation, text-processing algorithms, and random generation.
The next Flajolet Lecture will be delivered at the 2018 AofA Conference
in Uppsala, Sweden. Nominations are due on 28 February 2017. The winner
will be selected by a Prize Committee consisting of:
Michael Drmota, Chair (TU Wien)
Mireille Bousquet-Melou (Univ. Bordeaux)
Peter Winkler (Dartmouth College)
Bob Sedgewick, ex officio (Princeton University)
The nomination letter should summarize his/her contributions in one or
two pages. All nominations should be sent to Michael Drmota at
michael.drmota@tuwien.ac.at .
In selecting the Flajolet-Prize winner, the Committee will pay
particular attention to a sustained record of high-impact, seminal
contributions to the research areas most directly impacted by the work
of Flajolet: the foundations of analysis of algorithms and/or analytic
combinatorics. The selection may also be based partly on educational
accomplishments and contributions such as fundamental textbooks and
high-quality students. The final selection will be approved by the
Steering Committee of the AofA.
------------------------------
Message: 2
Date: Thu, 19 Jan 2017 14:43:28 -0500
From: Vasilis Gkatzelis <gkatz@drexel.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD positions in Algorithmic Game Theory and
Approximation Algorithms
Message-ID:
<CAJqzYTGhU5x8NXon42By7Wr=zm3m4Kf6bS_RVT-iKn_CgFHpPA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
The computer science department of Drexel University is offering PhD
positions on the topics of Algorithmic Game Theory and Approximation
Algorithms, under the supervision of Dr. Vasilis Gkatzelis. The positions
are fully funded for 5 years, starting September 2017.
The department is part of the newly formed College of Computing and
Informatics (http://drexel.edu/cci/) of Drexel University, located in the
university city district of Philadelphia, which is also the home of the
University of Pennsylvania. Apart from collaborating with relevant faculty
at Drexel, a successful candidate will also have the opportunity to
collaborate with theory faculty at Penn (http://theory.cis.upenn.edu/).
To receive full consideration, candidates should ensure that a complete
application has been submitted by 15 February 2017. Emails requesting more
information regarding these positions should be sent to gkatz@drexel.edu
Directions regarding how to apply can be found at
http://drexel.edu/cci/programs/graduate-programs/phd-computer-science/
------------------------------
Message: 3
Date: Fri, 20 Jan 2017 12:47:14 +0200
From: Stefka Fidanova <stefka.fidanova@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] computational optimization
Message-ID:
<CAAL360uQ=f=vVh1n0b_0DjW_iUSfHeE6BmYAAwR8NCtc5SnEQg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Call for Papers
10th International Workshop on Computational Optimization (WCO17)
Prague, Czech Republic, September 4-7, 2017
organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2017
===============================
We invite original contributions related to both theoretical and
practical aspects of optimization methods. The list of topics
includes, but is not limited to:
* combinatorial and continuous global optimization
* unconstrained and constrained optimization
* multiobjective and robust optimization
* optimization in dynamic and/or noisy environments
* optimization on graphs
* large-scale optimization, in parallel and distributed computational
environments
* meta-heuristics for optimization, nature-inspired approaches and any
other derivative-free methods
* exact/heuristic hybrid methods, involving natural computing
techniques and other global and local optimization methods
The applications of interest are included in the list below, but are
not limited to:
* classical operational research problems (knapsack, traveling salesman, etc)
* computational biology and distance geometry
* data mining and knowledge discovery
* human motion simulations; crowd simulations
* industrial applications
* optimization in statistics, econometrics, finance, physics,
chemistry, biology, medicine, and engineering.
===============================
Best paper award
The best WCO17 paper will be awarded during the social dinner of FedCSIS2017.
The best paper will be selected by WCO17 co-Chairs by taking into
consideration the scores suggested by the reviewers, as well as the
quality of the given oral presentation.
===============================
Submission and Publication
* Authors should submit draft papers in PDF format.
* The total length of a paper should not exceed 10 pages for regular
paper and 4 pages for short papers (IEEE style). IEEE style templates
are available at http://www.fedcsis.org/.
* Papers will be refereed and accepted on the basis of their
scientific merit and relevance to the workshop.
* Accepted and presented papers will be published in the Conference
Proceedings and included in the IEEE Xplore database and submitted for
different indexations (Position paper will only appear in the
conference proceedings).
* Extended versions of selected papers presented at WCO17 will be
published in edited books of the series "Studies of Computational
Intelligence", Springer.
===============================
Important dates:
Paper submission (sharp / no extensions) : May 10th, 2017
Position paper submission : May 31th, 2017
Author notification : June 14th, 2017
Final paper submission and registration : June 28, 2017
Conference date : September 4-7, 2017
===============================
Organizing Committee
Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Antonio Mucherino, IRISA, University of Rennes 1, France
Daniela Zaharie, West University of Timisoara, Romania
If you have any question do not hesitate to send an email to :
wco2017@fedcsis.org
===============================
--
Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
------------------------------
Message: 4
Date: Fri, 20 Jan 2017 11:25:02 +0000
From: Rob van Stee <rob.vanstee@leicester.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Two open positions in Siegen
Message-ID: <7fd6c0b0-069b-2050-60d0-6a849c9a3bdd@leicester.ac.uk>
Content-Type: text/plain; charset=utf-8
The new Optimization group at the University of Siegen, Germany offers
Two positions (Postdoc or Phd) for 3 years
The research focus of the group which will be headed by Prof. Rob van
Stee is online algorithms, approximation algorithms, and algorithmic
game theory.
The positions are part-time (75%) with salary according to TV-L 13. The
3-year contract comes with the possibility of an extension. Both
positions come with teaching duties (designing course material, grading
assignments, supervising students).
For a postdoc we expect that the candidate has (or is very close to) a
PhD in Computer Science or Mathematics and has a solid background in
discrete math and algorithms.
The applicant should have knowledge and interest in at least one of the
following fields:
- online algorithms
- approximation algorithms
- algorithmic game theory
- graph algorithms
- combinatorics
Please send your applications containing a CV, list of grades and the
names of one or two references by email to rvs4[[at]]mcs.le.ac.uk.
The deadline is 17 February 2017.
If you have further questions, please send an email to the same address.
------------------------------
Message: 5
Date: Fri, 20 Jan 2017 13:01:02 +0000
From: Torsten Ueckerdt <torsten.ueckerdt@kit.edu>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Open Postdoc Position in Graph Theory and
Combinatorics at KIT
Message-ID:
<CAOcVN48bY-zmQBZLpFaxHx-S+6YOfcOqx2COc635mygGX=QCQA@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
The Karlsruhe Institute of Technology (KIT) is the result of the merger of
the University of Karlsruhe and the Research Center, Karlsruhe. It is a
unique institution in Germany, which combines the mission of a university
with that of a large-scale research center of the Helmholtz Association.
With 8000 employees and an annual budget of EUR 650 million, KIT is one of
the largest research and education institutions worldwide.
The Department of Mathematics at the KIT offers a
Research Associate Postdoctoral Position
(Akademische/n Mitarbeiter/in)
to work on Graph theory and Combinatorics.
Young researchers with strong background in discrete mathematics are
invited to apply for this postdoctoral position. A Ph.D. in mathematics or
theoretical computer science is required. Knowledge and experience in graph
theory and combinatorics are expected. An excellent knowledge of English is
required, knowledge of German is preferred.
Specific research topics include generalized Ramsey-type problems, graph
coloring problems, extremal problems in set systems and posets, extremal
problems in graphs. The position responsibility includes teaching four
academic hours per week.
The position is available starting October 1, 2017. The salary grade is E13.
KIT is pursuing a gender equality policy. Women are therefore particularly
encouraged to apply. If qualified, handicapped applicants will be
preferred.
Please submit your application, including a curriculum vitae, a publication
list if any, an outline of your research interests, and arrange for at
least two letters of reference. Applications and reference letters should
preferably be sent via e-mail to maria.aksenovich@kit.edu. Alternatively,
please use:
Prof. Dr. Maria Axenovich
Karlsruher Institut für Technologie
Campus Süd
Institut für Algebra und Geometrie
Englerstr. 2
76131 Karlsruhe,
Germany
maria.aksenovich@kit.edu
For further inquiries on the position, see
http://www.math.kit.edu/iag6/~axenovich/media/ad-postdoc.pdf or contact
Prof. Maria Axenovich via e-mail.
------------------------------
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 20
***************************************
