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. 2 PhD positions in Combinatorial Optimization
(Monaldo Mastrolilli)
2. SPAA 2017 2nd Call for Papers (Nodari Sitchinava)
3. Matheuristics@MIC - call for abstracts (Vittorio Maniezzo)
4. CALL FOR PARTICIPATION: 4th Day on Computational Game Theory,
ETH Zurich, Feb 17, 2017 (Duetting,PD)
----------------------------------------------------------------------
Message: 1
Date: Wed, 11 Jan 2017 18:00:10 +0100
From: Monaldo Mastrolilli <monaldo@idsia.ch>
To: "DMANET@zpr.uni-koeln.de" <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] 2 PhD positions in Combinatorial Optimization
Message-ID: <mailman.19.1484235056.2486.dmanet@zpr.uni-koeln.de>
Content-Type: text/plain; charset="utf-8"
The Algorithms and Complexity Group of IDSIA (www.idsia.ch), University of Lugano (Switzerland), opens two Ph.D. positions in the area of approximation algorithms with special focus on Lift and Project methods and Sum of Squares hierarchy for combinatorial optimization. The position is supported by the SNSF Grant "Lift and project methods for machine scheduling".
The position is for 3 years, with the possibility of an extension by 1 year (subject to approval by SNSF). The gross salary is roughly 50.000 CHF per year (low taxes).
Candidates should have an excellent academic degree in mathematics, theoretical computer science or a related area.
A solid background in Algorithms, Computational Complexity, Discrete Mathematics, Probability Theory, and/or Graph Theory is
helpful. Good communication skills and solid English writing skills are necessary. In addition, the successful candidate will be highly self-motivated, passionate about her/his work, and have good ability to work both independently as well as in a team.
Team members will have the opportunity to cooperate with the Algorithms and Complexity group at IDSIA, which currently consists of 8 researchers. IDSIA offers an international working environment.
Lugano is a tidy and lively town, with a wonderful view on Ceresio lake and mountains around. Ticino Canton offers many opportunities for hiking, biking, skiing, etc.
Any interested candidate should email a detailed CV (including a list of passed Master degree exams with marks, a list of publications, if any, and at most 3 references) to "monaldo@idsia.ch" as soon as possible and not later than 5th March 2017.
The position will be filled as soon as a strong candidate will apply. In order to receive full consideration, please fill in the following form
http://www.form-ru.app.supsi.ch/view.php?id=205660
For any question, do not hesitate to contact:
Prof. Monaldo Mastrolilli
monaldo@idsia.ch
http://people.idsia.ch/~monaldo/
------------------------------
Message: 2
Date: Wed, 11 Jan 2017 17:19:20 -1000
From: Nodari Sitchinava <nodari@hawaii.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] SPAA 2017 2nd Call for Papers
Message-ID: <3fb3106d-9f2c-e1bb-a408-d8f3e50f2489@hawaii.edu>
Content-Type: text/plain; charset=utf-8; format=flowed
==================================================================
SPAA 2017 Call for Papers
==================================================================
29th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2017)
July 24 - 26, 2017
Washington D.C., USA
https://spaa.acm.org/
This year, SPAA is co-located with PODC 2017.
==================================================================
Important Dates:
Submission deadlines:
- Regular papers: February 9, 11:59pm EDT
- Brief announcements: February 9, 11:59pm EDT
These are firm deadlines. No extensions will be granted.
- Rebuttal period: March 27-30, 11:59pm EDT
- Notification: April 23
- Camera-ready copy due: May 23
==================================================================
Submissions are sought in all areas of parallel algorithms and
architectures, broadly construed, including both theoretical and
experimental perspectives. Topics of interest include, but are not
limited to:
- Parallel and Distributed Algorithms
- Parallel and Distributed Data Structures
- Algorithmic Game Theory
- Scheduling in Parallel Systems
- Parallel/Distributed Issues in Big Data
- Parallel and Distributed Architectures and I/O
- Streaming Algorithms
- Collaborative Learning Algorithms
- Network Algorithms
- Algorithms for Social Networks
- Multiprocessor and Multicore Architectures
- Transactional Memory Hardware and Software
- Algorithms for GPUs and Other Alternative Parallel Architectures
- High-Performance Parallel Computing and Architectures
- Green & Power-Efficient Algorithms and Architectures
- Instruction Level Parallelism and VLSI
- Biological Distributed Algorithms
- Mobile, Ad-Hoc, Wireless and Sensor Networks
- Algorithms for Routing and Information Dissemination
- Peer-to-Peer Systems
- Compilers and Tools for Concurrent Programming
- Fault-tolerance and Reliability
- Self-stabilization and Self-organization
- Security and Privacy in Distributed and Parallel Systems
- Parallel/Distributed Computational Learning
- Parallel Complexity Theory
- Specification and Verification of Concurrent Systems
- Resource Management and Awareness
Regular Papers:
Regular papers should report on original research, submitted exclusively
to this conference. Submissions may not exceed ten (10) single-spaced
double-column pages. (Papers will be judged based on their quality and
not their length — short papers are welcome.) The title page,
bibliography and designated figure pages (containing only figures) are
not counted toward the ten pages. (Illustrative figures are encouraged.)
All necessary details to substantiate the main claims of the paper
should be included in a clearly marked appendix. Regular papers will be
allotted up to 10 pages in the proceedings.
Brief announcements:
SPAA also solicits brief announcements that raise issues of interest to
the SPAA community. Brief announcements may not exceed three pages and
their titles should start with ``Brief Announcement:''. Examples of good
brief announcements include: (i) papers previously published elsewhere
of interest to SPAA, (ii) work in progress, (iii) announcement of
tools/libraries, (iv) challenge problems posed to the community, (v)
corrections to earlier results. Brief announcements may also include
smaller results of interest.
All regular rejected papers automatically will be considered for brief
announcements. Titles of regular papers which do not want to be
considered for this option should start with ``Full Paper ONLY:''. Brief
announcements will be allotted up to 3 pages in the proceedings.
Paper Submissions:
Submitted manuscripts may not exceed ten (10) single-spaced
double-column pages for regular papers and three (3) single-spaced
double-column pages for brief announcements, using 10-point size font on
8.5x11 inch pages, not counting the title page, bibliography and
designated figure pages ). The title page should contain the title,
author names and affiliations, followed by a brief abstract. See
http://www.acm.org/sigs/publications/proceedings-templates (version 2.8,
May 2015)
for details, including the sig-alternate-05-2015.cls style file and a
sample file. Additional details may be added in a clearly marked
appendix that will be read at the discretion of the program committee.
Please indicate in the title of your manuscript whether this is a
regular paper or a brief announcement.
Regular papers submitted to SPAA may not be under simultaneous
consideration for a journal or any conference or workshop with published
proceedings (other than as a brief announcement for a previous conference).
Authors are encouraged to post full versions of their submissions in a
freely accessible on-line repository such as the arxiv, the ECCC, or the
Cryptology ePrint archive. We expect that authors of accepted regular
papers will make full versions of their papers, with proofs, available
by the camera-ready deadline. (This should be done in a manner
consistent with the ACM Copyright Policy.)
The deadline for ALL submissions is February 9.
Rebuttal Period:
There will be a rebuttal period during which the authors can point out
misunderstandings or comment on critical questions that the PC members
may have. It will take place on March 27-30.
Notification:
Authors will be sent notification of acceptance or rejection by e-mail
on or before April 23. A camera-ready copy of each accepted abstract
must be prepared according to the ACM guidelines for inclusion in the
proceedings of the conference and must be received by the date to be
determined later.
Awards:
Every regular paper is eligible for the best paper award. The program
committee may decline to make this award or may split the award among
multiple papers.
==================================================================
Program Committee:
PC Chair: Mohammad T. Hajiaghayi, University of Maryland, College Park
Umut Acar Carnegie Mellon University
Susanne Albers Technical University of Munich
Hossein Asadi Sharif University of Technology
Nikhil Bansal Eindhoven University of Technology
Hossein Bateni Google Research
Petra Berenbrink Simons Fraser University
Keren Censor-Hillel Technion
Hubert Chan The University of Hong Kong
Rajesh Chitnis Weizmann Institute of Science
Frank Dehne Carleton University
Martin Farach-Colton Rutgers University
Pierre Fraigniaud CNRS and University Paris Diderot
Mohsen Ghaffari ETH Zurich
Michael Goodrich University of California, Irvine
Fabrizio Grandoni IDSIA
Mohammad Hajiaghayi (chair) University of Maryland, College Park
Martin Hoefer MPI Informatik, Saarbrücken
Samir Khuller University of Maryland
Ravi Kumar Google Research
Silvio Lattanzi Google Research
Aleksander Madry MIT
Friedhelm Meyer auf der Heide Paderborn University
Vahab Mirrokni Google Research
Morteza Monemizadeh Rutgers University
Seffi Naor Technion
Richard Peng Georgia Institute of Technology
Boaz Patt-Shamir Tel Aviv University
Giuseppe Persiano Università di Salerno
Cynthia A Phillips Sandia National Laboratories
Yuval Rabani The Hebrew University of Jerusalem
Rachid Guerraoui EPFL
Harald Raecke TU München
Rajmohan Rajaraman Northeastern University
Mauricio Resende Amazon
Laura Sanità University of Waterloo
Alex Slivkins Microsoft Research, NYC
Peter Varman Rice University
Roger Wattenhofer ETH Zurich
Ryan Williams Stanford University and MIT
David Woodruff IBM Almaden Research Center
==================================================================
Conference Committee:
General Chair
Christian Scheideler, University of Paderborn
Secretary
Jeremy Fineman, Georgetown University
Treasurer
David Bunde, Knox College
Publicity Chair
Nodari Sitchinava, University of Hawaii at Manoa
Local Arrangements Chair
Jeremy Fineman, Georgetown University
Calvin Newport, Georgetown University
==================================================================
--
Nodari Sitchinava
Assistant Professor
Department of ICS
University of Hawaii at Manoa
http://www2.hawaii.edu/~nodari
------------------------------
Message: 3
Date: Thu, 12 Jan 2017 09:27:10 +0100
From: Vittorio Maniezzo <vittorio.maniezzo@unibo.it>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Matheuristics@MIC - call for abstracts
Message-ID: <e603b3a2-c73d-cc1b-3cb2-1f50c334f3af@unibo.it>
Content-Type: text/plain; charset="utf-8"; format=flowed
***********************************************************
CALL FOR ABSTRACTS
***********************************************************
Metaheuristic International Conference (MIC 2017)
Barcelona, Spain, July 4th-7th 2015
Abstract submission deadline: 23 January 2017 (tell me if you need
reasonable extensions)
Special Session webpage: http://mic2017.upf.edu/special-sessions/
Scope of the session
Matheuristics are a means to get model grounded good quality feasible
solutions for complex optimization problems. The range of problems for
which matheuristic techniques have proved effective has widened, going
from the most theoretic ones to actual real-world case studies. This has
been possible because the range of matheuristic techniques has similarly
widened, showing the high research potential of studies aimed at the
design of generic heuristic methods based on mathematical formulations
of the problem of interest.
This session aims at bringing together the researchers exploiting
mathematical programming (MP) techniques in a metaheuristic framework or
working on granting to mathematical programming approaches the
constrained-CPU-time effectiveness which characterizes metaheuristics.
Topics of interest for the session include but are not limited to
studies on:
* Novel matheuristic frameworks;
* Dual information and decomposition in metaheuristics;
* Hybridizing metaheuristics with exact methods;
* Experimental analysis and modeling of matheuristics;
* Real world case histories of matheuristic applications.
* Metaheuristics as exact method components.
Abstract submission
Submissions to the special sessions will be through the same submission
site as for the main conference with the rules detailed below. Abstracts
can be submitted in any of these forms:
S1) Original research contributions for publication in the conference
proceedings of a maximum of 10 pages.
S2) Extended abstracts of work-in-progress of a maximum of 3 pages.
S3) High-quality manuscripts that have recently, within the last six
months, been submitted or accepted for journal publication.
All contributed paper submissions will be peer reviewed. Accepted papers
will be published in the online proceedings that will be available at
the conference. Accepted contributions of categories S1 and S2 will be
published in the MIC 2017 conference proceedings. Accepted
contributions of category S3 will be orally presented at the conference,
but not be included into the conference proceedings.
As authors of an invited session, you will submit the paper as follows.
1) Access the easychair web: https://easychair.org/conferences/?conf=mic2017
2) Choose the first option (12nd Metaheuristics International Conference):
3) fill the form and at the end choose the corresponding invited session
(Matheuristics).
Submission guidelines can also be found here:
http://mic2017.upf.edu/submission/
Important dates
**********************************************************************
* Submission deadline: January 23, 2017
* Notification of acceptance: February 27, 2017
* Camera-ready papers: March 6, 2017
* Early registration due date: March 31, 2017
* Conference: July 4-7 2017
**********************************************************************
Special session organizer
Vittorio Maniezzo (Dept. Computer Science, University of Bologna, Italy)
Vittorio.maniezzo@unibo.it
--
________________________________________________________________
Vittorio Maniezzo, prof. || vittorio.maniezzo@unibo.it
Department of Computer Science || tel. +39 331 6382417
University of Bologna || skype: vittorio.maniezzo
via Sacchi, 3, 47521 Cesena, Italy || www.csr.unibo.it/~maniezzo
------------------------------
Message: 4
Date: Thu, 12 Jan 2017 10:57:48 +0000
From: "Duetting,PD" <P.D.Duetting@lse.ac.uk>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] CALL FOR PARTICIPATION: 4th Day on Computational
Game Theory, ETH Zurich, Feb 17, 2017
Message-ID: <72B96C98-F8DD-432F-B456-BC39B18A108B@lse.ac.uk>
Content-Type: text/plain; charset="utf-8"
==============================================
CALL FOR PARTICIPATION
4th Day on Computational Game Theory
February 17, 2017
ETH Zurich, Switzerland
URL: http://paulduetting.com/agtday/
==============================================
The 4th Day on Computational Game Theory will take place on
Friday, February 17, 2017 at ETH Zurich.
The event will be preceded by a reception and an open problem
session in the afternoon of Thursday, February 16.
The goal of the workshop is to provide an opportunity to
present research, exchange ideas and foster collaboration
among researchers interested in computational aspects of
game theory, social choice, and related areas, at an informal
level.
The scientific program will consist of two invited lectures
plus 6-7 contributed 20-minutes presentations. To submit a talk,
please send an email including title and short abstract to
Paul Duetting (p.d.duetting@lse.ac.uk).
There is no registration fee. But for organizational purposes,
please register on the workshop webpage.
The organizers,
Paul Duetting (London School of Economics)
Peter Widmayer (ETH Zurich)
Sven Sueken (University of Zurich)
Paolo Penna (ETH Zurich)
------------------------------
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 10
***************************************
No comments:
Post a Comment