Send dmanet mailing list submissions to
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. New stream COMBINATORIAL OPTIMIZATION within the master
"Modelling, Optimization, Decision, Organization", University
Paris-Dauphine, France (Vangelis Paschos)
2. Special Issue of the EURO Journal on Transportation and
Logistics: deadline extension (Manuel Iori)
3. Ph.D position on massively parallel optimization and
simulation of electrical networks (Mohand MEZMAZ)
4. Postdoc position in algorithm design: The University of
Melbourne (Tony Wirth)
5. BDA 2014 --- 1st call for papers (Yuval Emek)
6. Final Call for Papers: Approx and Random 2014 (Stefan Kraft)
----------------------------------------------------------------------
Message: 1
Date: Wed, 9 Apr 2014 12:03:13 +0300
From: Vangelis Paschos <paschos@lamsade.dauphine.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] New stream COMBINATORIAL OPTIMIZATION within the
master "Modelling, Optimization, Decision, Organization", University
Paris-Dauphine, France
Message-ID:
<CAAvNmXqSfFktcT1-vcoMK7m2L=Gz+aRXoPyfox=a8=mPVkUbEg@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
Master Modeling, Optimization, Decision, Organization (MODO)
Stream: COMBINATORIAL OPTIMIZATION
We are glad to announce the opening of a one-year stream COMBINATORIAL
OPTIMIZATION within the master Modeling, Optimization, Decision,
Organization (MODO) offered by the University Paris-Dauphine, France.
This stream is devoted to the study of the fundamental theoretical and
applied aspects of Combinatorial Optimization (Complexity theory,
Design of efficient algorithms for solution of optimization problems,
Advanced Graph Theory, Mathematical Programming, Approximation theory,
Models of Combinatorial Optimization, Applications to hard
combinatorial problems, etc.).
The courses of the stream will be taught in English.
Students studying within the stream will graduate with a MSc in
Computer Science. More information about the program including the
application procedure can be found at
http://modo.dauphine.fr/en/master-program/combinatorial-optimisation-stream.html
Tuition fees are around 500 euros per year.
--
Vangelis Th. Paschos
LAMSADE, University Paris-Dauphine, CNRS and IUF
http://www.lamsade.dauphine.fr/~paschos/
------------------------------
Message: 2
Date: Wed, 09 Apr 2014 12:01:34 +0200
From: Manuel Iori <manuel.iori@unimore.it>
To: DMANET@zpr.uni-koeln.de
Subject: [DMANET] Special Issue of the EURO Journal on Transportation
and Logistics: deadline extension
Message-ID: <53451A7E.5010000@unimore.it>
Content-Type: text/plain; charset=UTF-8; format=flowed
Call for Papers - Apologies for multiple copies
============================================================
Special Issue on packing problems arising in transportation and logistics
of the EURO Journal on Transportation and Logistics
http://transp-or.epfl.ch/euroJournal/special.php?id=9
(deadline extension)
============================================================
Aim of the special issue is to provide an insight of the most recent
results of the research in new variants of packing and loading problems
arising in transportation and logistics applications. In particular, new
problems arising in Smart City, Last Mile integration, and City
Logistics are welcome, as well as in broader definitions of existing
packing and loading problems, including multi-dimensional and
multi-attribute problems, integration between packing and routing, and
stochastic problems. A special focus will be given to tactical and
strategic problems, as well as to the management of uncertainty of the
parameters.
Possible topics include (but are not limited to):
? Integration of packing and routing
? Uncertainty management and stochastic packing problems
? Introduction of realistic additional constraints
? Impact of additional operational constraints on packing algorithms
? Generalized packing algorithms
? Multi-attribute packing problems
? Rich and generalized packing problems
In order to submit a paper for a Special Issue, Log on the editorial
manager using the Author Login.
Select Submit New Manuscript in the main menu.
In the drop down list associated with Choose Article Type, select the
desired special issue. The entries corresponding to the special issues
start with SI.
============================================================
Deadline to submit manuscripts: : May 01, 2014
Tentative publication date: April 01, 2015
Guest Editors:
Manuel Iori, University of Modena and Reggio Emilia, Italy,
Manuel.Iori@unimore.it
Guido Perboli, Politecnico di Torino, Italy and CIRRELT, Montr?al,
Canada, guido.perboli@polito.it
Walter Rei, Universit? du Qu?bec ? Montr?al (UQAM) and CIRRELT,
Montr?al, Canada, rei.walter@uqam.ca
------------------------------
Message: 3
Date: Wed, 9 Apr 2014 13:30:04 +0200
From: Mohand MEZMAZ <mohand.mezmaz@gmail.com>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Ph.D position on massively parallel optimization and
simulation of electrical networks
Message-ID:
<CAHX=e5USc3sR1WAb9dFG11A7YWqn4QvfGHMHnGKaQgz33AHOsw@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
Dear all,
A joint Ph.D position on optimization and simulation of electrical
networks using massively parallel heterogeneous computing, will be
potentially opened at Universit? Lille - Universit? de Mons with the
support of "Maison de la Simulation". The proposal is available at:
http://www.maisondelasimulation.fr/Images/News/345/Proposition-these-MdlS-Lille1-UMONS.pdf
The proposal has been selected by the jury of "Maison de la
Simulation" for a potential
support. However, a second selection round will be performed on the
pairs "proposal/applicant" to guarantee the Ph.D grant funding.
The Ph.D will take place at "Maison de la Simulation"
(http://www.maisondelasimulation.fr/), but the student will have
several stays at Universit? Lille 1 (Inria Lille - LIFL), Universit?
de Mons and Tractebel Engineering, Brussels.
Applicants can contact for further details on the proposal and send
(deadline: May 5th) a CV together with reference letters and academic
transcripts to:
Nouredine.Melab_at_lifl.fr
Daniel.Tuyttens_at_umons.ac.be
Mohand.Mezmaz_at_umons.ac.be
Best Regards,
Mohand Mezmaz
University of Mons
------------------------------
Message: 4
Date: Thu, 10 Apr 2014 15:42:52 +1000
From: Tony Wirth <awirth@unimelb.edu.au>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc position in algorithm design: The University
of Melbourne
Message-ID:
<CAG4013wHw15N5uV92_p3wdyGD+DjhSrauBFNdsTTWgm9f76NyQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
We have funding for a two-year postdoc position in the Department
of Computing and Information Systems at The University of Melbourne,
Australia. We are looking for strong candidates in the region bordered
by algorithm design, information retrieval, and web search.
The position closes April 20 (Australian Eastern Standard Time); see
https://careers.pageuppeople.com/422/caw/en/job/882079/research-fellow-in-algorithm-design
for details and the required application process.
Alistair Moffat
Tony Wirth
------------------------------
Message: 5
Date: Thu, 10 Apr 2014 09:22:04 +0300
From: Yuval Emek <yemek@ie.technion.ac.il>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] BDA 2014 --- 1st call for papers
Message-ID:
<CAJfs=WyFs5DUjJZxFHQpm3a0sOjWKxg=BtVe96otRZ07thO8OA@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
*** Apologies for multiple messages ***
=============================================================================
The 2nd Workshop on Biological Distributed Algorithms (BDA 2014)
October 11-12, 2014 in Austin, Texas USA - in conjunction with DISC 2014
http://www.cs.cmu.edu/~saketn/BDA2014/
=============================================================================
We are excited to announce the second workshop on Biological
Distributed Algorithms (BDA). BDA is focused on the relationships
between distributed computing and distributed biological systems and
in particular, on analysis and case studies that combine the two. Such
research can lead to better understanding of the behavior of the
biological systems while at the same time developing novel
computational algorithms that can be used to solve basic distributed
computing problems.
The first BDA workshop, BDA 2013, was collocated with DISC 2013 (the
27th International Symposium on Distributed Computing) in Jerusalem.
BDA 2014 will be collocated with DISC 2014 in Austin, Texas. It will
take place just before DISC, on Saturday and Sunday, October 11-12,
2014.
Like BDA 2013, BDA 2014 will include talks on distributed algorithms
related to a variety of biological systems. However, this time we will
devote special attention to communication and coordination in insect
colonies (e.g. foraging, navigation, task allocation, construction)
and networks in the brain (e.g. learning, decision-making, attention).
===========
SUBMISSIONS
===========
We solicit submissions describing recent results relevant to biological
distributed computing. We especially welcome papers describing new insights
and / or case studies regarding the relationship between distributed
computing and biological systems even if these are not fully formed. Since
a major goal of the workshop is to explore new directions and approaches,
we especially encourage the submission of ongoing work. Selected
contributors would be asked to present, discuss and defend their work at
the workshop. Submissions should be in PDF and include title, author
information, and a 4-page extended abstract.
Please use the following EasyChair submission link:
http://www.easychair.org/conferences/?conf=bda2014
Note: The workshop will not include published proceedings. In particular,
we welcome submissions of papers describing work that has appeared or is
expected to appear in other venues.
===============
IMPORTANT DATES
===============
July 18, 2014 - Paper submission deadline
August 18, 2014 - Decision notifications
October 11-12, 2014 - Workshop
================
INVITED SPEAKERS
================
Dmitri Chklovskii - HHMI Janelia Farm
Anna Dornhaus - University of Arizona
Ofer Feinerman - Weizmann Institute
Deborah Gordon - Stanford
Nancy Lynch - MIT
James Marshall - University of Sheffield
Saket Navlakha - CMU
Stephen Pratt - Arizona State University
Andrea Richa - Arizona State University
=================
PROGRAM COMMITTEE
=================
Ziv Bar-Joseph - CMU (co-chair)
Anna Dornhaus - University of Arizona
Yuval Emek - Technion (co-chair)
Amos Korman - CNRS and University of Paris Diderot (co-chair)
Nancy Lynch - MIT
Radhika Nagpal - Harvard
Saket Navlakha - CMU
Nir Shavit - MIT
--
Yuval Emek, Ph.D.
Assistant Professor
Industrial Engineering and Management
Technion - Israel Institute of Technology
http://ie.technion.ac.il/~yemek/
------------------------------
Message: 6
Date: Thu, 10 Apr 2014 09:54:04 +0200
From: Stefan Kraft <stkr@informatik.uni-kiel.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Final Call for Papers: Approx and Random 2014
Message-ID: <53464E1C.50802@informatik.uni-kiel.de>
Content-Type: text/plain; charset=UTF-8
APPROX 2014 and RANDOM 2014
17th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2014
&
18th Intl. Workshop on Randomization and Computation - RANDOM 2014
http://cui.unige.ch/tcs/random-approx/
Sep. 4-6, 2014
UPC, Barcelona
Call for papers
SCOPE
17th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2014
18th Intl. Workshop on Randomization and Computation - RANDOM 2014
The 17th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2014), and the 18th.
International Workshop on Randomization and Computation (RANDOM'2014)
will be held in 4-6 September 2014 at Barcelona.
APPROX'2014 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2014 focus on
applications of randomness to computational and combinatorial problems.
RANDOM'2014 is the eighteenth workshop in the series; APPROX'2014 is
the seventeenth in the series.
TOPICS
Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:
APPROX
- design and analysis of approximation algorithms
- hardness of approximation
- small space, sub-linear time and streaming algorithms
- embeddings and metric space methods
- mathematical programming methods
- combinatorial problems in graphs and networks
- algorithmic game theory and economics
- computational geometric problems
- approximate learning
- online algorithms
- approaches that go beyond worst case analysis
- other applications
RANDOM
- design and analysis of randomized algorithms
- randomized complexity theory
- pseudorandomness and derandomization
- random combinatorial structures
- random walks/Markov chains
- expander graphs and randomness extractors
- probabilistic proof systems
- random projections and embeddings
- error-correcting codes
- average-case analysis
- property testing
- computational learning theory
SUBMISSIONS
Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx2014
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random2014
Note: You will be asked to login using an EasyChair account. Directions
on how to register for such an account are available at the submission
servers (you may also have an old account from a previous conference
submission).
The submission must be received by 17:00pm (PDT) of April 17 for your
submission to be considered.
Submission Format: Submissions should start with the title of the
paper, each author's name, affiliation, and e-mail address, followed by
a one-paragraph summary of the results to be presented. This should
then be followed by a technical exposition on single-spaced pages on
letter-size paper, using reasonable margins and at least 11-point
font. The first 10 pages should contain the main ideas and techniques
used to achieve the results including motivation and a clear comparison
with related work (not including the references). There is no page
limit but any material beyond the first 10 pages will be read at the
sole discretion of the program committee.
Simultaneous submission to other conferences with published proceedings
is not allowed.
PROCEEDINGS
Accepted papers will be published in the online proceedings of the
conference in the Leibniz International Proceedings in
Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees
perennial, free and easy electronic access, while the authors retain
the rights over their work. Further detail will be available early
January at the conference website.
Previous proceedings of APPROX appeared as LNCS 1444, 1671, 1913, 2129,
2462, 2764, 3122, 3624, 4110 and 4627 while previous proceedings of
RANDOM appeared as LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624,
4110, 4627 and as Proceedings in Informatics 8.
IMPORTANT DATES
Submissions: April 17th, Thursday
Notifications: June 6th, Friday
Camera ready: June 20th, Friday
PROGRAM COMMITTEES
Approx
Niv Buchbinder - Tel-Aviv University
Deeparnab Chakrabarty - Microsoft Research, India
Siu On Chan - Microsoft Research, New England
Shuchi Chawla - University of Wisconsin
Eden Chlamtac - Ben Gurion University
Nikhil Devanur (Chair) - Microsoft Research, Redmond
Alina Ene - Princeton University
Konstantinos Georgiou - University of Waterloo
Telikepalli Kavitha - Indian Institute of Science, Bangalore
Ken Ichi Kawarabayashi - National Institute of Informatics, Tokyo
Jochen Koenemann - University of Waterloo
Amit Kumar - Indian Institute of Technology, New Delhi
Konstantin Makarychev - Microsoft Research, Redmond
Debmalya Panigrahi - Duke University
Thomas Rothvoss - University of Washington
Barna Saha - AT&T Shannon Research Laboratory, New Jersey
Bruce Shepherd - MCGill University
Aravind Srinivasan - University of Maryland
David Williamson - Cornell University
Random
Louigi Addario-Berry - MCGill University, Canada
Nayantara Bhatnagar - University of Delaware
Amin Coja-Oghlan - Goethe University, Germany
David Galvin - University of Notre Dame, Indiana
Valentine Kabanets - Simon Fraser University, Canada
Michael Molloy - University of Toronto
Cris Moore (Chair) - Santa Fe Institute
Assaf Naor - New York University
Krzysztof Onak - IBM T.J. Watson Research Center
Dana Ron - Tel-Aviv University
Alex Russell - University of Connecticut
Dominik Scheder - Aarhus University
Devavrat Shah - Massachusetts Institute of Technology
Perla Sousi - University of Cambridge
Mario Szegedy - Rutgers University
Amnon Ta-Shma - Tel-Aviv University
Thomas Vidick - Newton Institute, Cambridge, UK
Program Chairs
APPROX
Nikhil Devanur - Microsoft Research, Redmond
email: nikdev@microsoft.com
RANDOM
Cris Moore - Santa Fe Institute
email: mmore@santafe.edu
Workshop Chairs
Jos? Rolim, U. of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen, U. of Kiel
e-mail: kj@informatik.uni-kiel.de
Organizing Commitee Chair
Carme Alvarez - Universitat Polit?cnica de Catalunya
email: alvarez@lsi.upc.edu
CONFERENCE WEB PAGE
http://cui.unige.ch/tcs/random-approx/
------------------------------
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 74, Issue 12
**************************************
No comments:
Post a Comment