Thursday, December 17, 2015

[DMANET] PhD Positions in Computer Science, Engineering, Business and Law with a Focus on Future Energy Systems

The design of future energy systems which can cope with fluctuating supply and flexible demand is an important concern of our society. As a PhD student in computer science, economics or law, would you like the opportunity to not only have results that advance the state-of-the-art in your field and have good publications at selective venues, but also seriously engage in interactions with other disciplines, to ensure that your results really give way to better energy systems? As a PhD student in engineering, would you like to not only work on the design of energy systems that are efficient, flexible, resilient and user-friendly, but also do so together with individuals from the above disciplines, using highly innovative methods?

If so, please read on: The German National Research Foundation (DFG) has recently approved the funding of a graduate school 'Energy Status Data -- Informatics Methods for its Collection, Analysis, and Exploitation' at Karlsruhe Institute of Technology (KIT). We now seek to fill several vacancies for PhD students starting in or around May 2016. Important prerequisites are interest in scientific work and a Diploma or Master degree in one of the above disciplines or in a related one, e.g., mathematics, physics, business informatics, industrial engineering and management. Successful candidates should demonstrate academic excellence and rigor as well as curiosity. See http://energystatusdata.kit.edu for more information on the research envisioned, the program and the application procedure. Please apply until January 3rd 2016.

We offer:
- a lot of free space for scientific development,
- excellent personal guidance and support,
- fascinating research topics with a lot of societal relevance,
- an open-minded and highly collaborative research environment
- an international, interdisciplinary research surrounding with numerous occasions for cooperation,
- opportunities for personal growth and further training leveraging the rich infrastructure at KIT, an institution that is both a university and a large-scale research facility,
- an excellent living environment in an attractive, vibrant city in one of the most beautiful regions in Germany,
- a salary that covers the living expenses in Germany well, together with free university registration.

Both DFG and KIT are interested in increasing the share of women working in sciences and looks forward to applications from women in particular. Severely disabled applicants will be given preference in case of equal qualification.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP: 2016 Joint Workshop on Cyber-Physical Security and Resilience in Smart Grids

[Apologies for possible multiple copies of this CFP]


**********************
Call for Papers
**********************

Title: 2016 Joint Workshop on Cyber-Physical Security and Resilience in
Smart Grids
Date: 12th April 2016, Vienna, Austria
Workshop Chairs: Anna Magdalena Kosek (DTU, Denmark), Paul Smith (AIT,
Austria), Reinder Wolthuis (TNO, The Netherlands)
Supporting Projects: SPARKS, SEGRID, SALVAGE

This workshop is part of the CPS week 2016, 11th - 14th April 2016,
Vienna, Austria

Workshop Scope
Future power systems and smart grids will include a greater Information
and Communication Technology (ICT) component,
in order to support future energy services. Whilst this prospect has
many benefits, it also makes power systems and
smart grids more vulnerable to cyber-attacks and introduces increasingly
critical dependencies between the cyber
and physical domain of power systems. The purpose of this workshop is to
be a forum for discussion on the key
challenges in ensuring the security and resilience of cyber-physical
smart grids. This multi-disciplinary
workshop is being co-organized by three major European-funded research
projects in the smart grid area,
namely the SALVAGE, SEGRID and SPARKS projects. The workshop will run
for a full day and include a keynote
speech plus regular paper presentations.

Paper Submissions
Submitted papers should not exceed six pages, the workshop language is
English. The submitted papers are required
to comply with the IEEE conference format guidelines
(http://www.ieee.org/conferences_events/conferences/publishing/templates.html).

Please submit your original work via EasyChair submission system
(https://easychair.org/conferences/?conf=cpsrsg2016).
Accepted and presented papers will be submitted to IEEE Xplore
(http://ieeexplore.ieee.org/), subject to final approval
by the conference committee.
Important Dates
Full paper submission deadline: 1st February 2016
Notification deadline: 1st March 2016
Final paper submission deadline: 25th March 2016
Workshop date: 12th April 2016

Links and Resources
Paper guidelines and templates:
http://www.ieee.org/conferences_events/conferences/publishing/templates.html
Submit your PDF: https://easychair.org/conferences/?conf=cpsrsg2016
Registration: http://www.cpsweek.org/2016/reg.html
Venue: http://www.cpsweek.org/2016/venue.html

Topics of interest include, but are not limited to
Intrusion detection systems and security analytics for the smart grid
Resilient control of power systems
Security and resilience metrics for the cyber-physical smart grid
Privacy issues and protection schemes for the smart grid
(Co-)simulation and testbed environments for analyzing security and
resilience
Cyber vulnerability detection and assessment
Risk analysis of cyber-attacks to smart grids
Security architectures for the smart grid
The economics of security and resilience for the smart grid
Regulatory and legal aspects

Program Committee
Rohan Chabukswar, (UTRC, Ireland)
Mathias Ekstedt (KTH, Sweden)
Frank Fransen (TNO, The Netherlands)
Oliver Gehrke (DTU, Denmark)
Robert Griffin (RSA, Switzerland)
Lucie Langer (AIT, Austria)
Kieran McLaughlin, (Queen's University Belfast, UK)
Nuno Neves (FFCUL, Portugal)
Eugeniusz Rosolowski (PWR, Poland)
Judith Rossebo (ABB, Germany)
Alberto Schaeffer-Filho (UFRGS, Brazil)
André Herdeiro Teixeira (TU Delft, The Netherlands)
Marco Tiloca (SICS, Sweden)


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Wednesday, December 16, 2015

Postdoc positions in computational complexity at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for postdoctoral positions in computational complexity.

 

KTH is the leading technical university in Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research environment covering a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. The group has a consistent track record of publishing in the leading theoretical computer science conferences and journals worldwide, and the research conducted here has attracted numerous international awards and grants in recent years.

 

The postdoctoral researchers will be working in the research group of Jakob Nordstrom (http://www.csc.kth.se/~jakobn). Much of the activities of this research group revolve around the themes of proof complexity and SAT solving. On the theoretical side, proof complexity has turned out to have deep, and sometimes surprising, connections to other topics such as, e.g., circuit complexity, communication complexity, and hardness of approximation, and therefore researchers in these or other related areas are more than welcome to apply.

 

This is a full-time employed position for one year with a possible one-year extension. The successful candidate is expected to start in August-September 2016, although this is to some extent negotiable.

 

The application deadline is January 24, 2016. More information and instructions how to apply can be found at http://www.csc.kth.se/~jakobn/openings/D-2015-0816-Eng.php . Informal enquiries are welcome and may be sent to Jakob Nordstrom.


Postdoc positions in SAT solving at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for postdoctoral positions in SAT solving.

 

KTH is the leading technical university in Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research environment covering a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. The group has a consistent track record of publishing in the leading theoretical computer science conferences and journals worldwide, and the research conducted here has attracted numerous international awards and grants in recent years.

 

The postdoctoral researchers will be working in the research group of Jakob Nordstrom (http://www.csc.kth.se/~jakobn). Much of the activities of this research group revolve around the themes of proof complexity and SAT solving. On the practical side, some interesting problems are to gain a better understanding of the performance of current state-of-the-art SAT solvers — in particular, solvers using conflict-driven clause learning (CDCL) — and to explore techniques that would go beyond CDCL, such as approaches based on algebraic or geometric reasoning.

 

These are full-time employed positions for one year with a possible one-year extension. The expected start date is August-September 2016, although this is to some extent negotiable.

 

The application deadline is January 24, 2016. More information and instructions how to apply can be found at http://www.csc.kth.se/~jakobn/openings/D-2015-0823-Eng.php . Informal enquiries are welcome and may be sent to Jakob Nordstrom.


[DMANET] Bristol Algorithms Days - Feb 2-3 2016

Bristol Algorithms Days - 2nd and 3rd Feb 2016

Speakers:

Karl Bringmann, ETH Zürich, Switzerland
Colin Cooper, King's College London, UK
Alina Ene, University of Warwick, UK
Leszek Gąsieniec, University of Liverpool, UK
Paul Goldberg, University of Oxford, UK
Iordanis Kerenidis, LIAFA, University of Paris Diderot, France
Allan Grønlund, University of Aarhus, Denmark
Kurt Mehlhorn, Max-Planck-Institut, Germany
Will Perkins, University of Birmingham, UK
Thomas Sauerwald, University of Cambridge, UK
Iain Stewart, University of Durham, UK

Details are available at
https://www.cs.bris.ac.uk/Research/Algorithms/events/BAD16/index.jsp .

Registration deadline 15 January 2016.

All are welcome to attend.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] SCOR 2016 - 1st Announcement and Call for Papers

**************************************************
CALL FOR PAPERS
5th Student Conference on Operational Research
SCOR 2016
April 8-10 2016, University of Nottingham, UK
www.scor16.com
**************************************************

We are pleased to announce the official launch of the PhD Student
Conference on Operational Research (SCOR 2016), now back for its
fifth instalment. We invite you to join us once again, at the
beautiful University of Nottingham campus the 8-10 April 2016.

The conference takes place just after the NATCOR course, which will
also be held in Nottingham.

PhD students from all European Universities studying Operational
Research, Management Science or a related field are kindly invited to
submit an abstract for presentation at the conference. As some
presenters may still be on an early stage of in their careers, the
work presented does not need to be fully developed or thoroughly
explored as of yet. The purpose of SCOR 2016 is to provide a friendly
environment for the next generation of Operational Researchers to
receive constructive feedback on their work and to meet people with
similar interests.

The scope of the conference includes, but is not limited to:

Big Data and Analytics * Data Envelopment Analysis * Decision Making
under Risk and Uncertainty * Defence and Security * Disaster Management
* Energy and Climate Change * Forecasting * Healthcare * Mathematical
Programming * Metaheuristics * Multiple Criteria Decision Analysis *
Operations Management * Optimisation * Revenue Management * Safety and
Reliability Analysis * Simulation * Stochastic Modelling * Supply Chain
Management * System Dynamics * Transportation and Logistics * Vehicle
Routing.

**** Deadline for abstracts (250 words) submission: ****
**** Friday 19th February 2016 ****

A notification of acceptance will be sent shortly after this
deadline. In order to encourage a wide range of students to attend, an
affordable conference fee will cover accommodation, a full social
program and full catering provided.

Presenters are also invited to submit a paper (no more than 10 pages) on
their work to be published electronically as part of the SCOR 2016
proceedings. This will be available in the Dagstuhl OpenAccess Series in
Informatics (OASIcs). Paper submissions will undergo a selection
process based on refereeing by the Committee. This gives doctoral
candidates a chance to experience the peer-review process and to enhance
their technical writing skills. Although it is not mandatory, it is
again, highly recommended. To get an idea on the paper standards please
visit the SCOR2014 proceedings at
http://drops.dagstuhl.de/opus/portals/oasics/index.php?semnr=14008 .

**** Deadline for papers (max 10 pages) submission: ****
**** Friday 25th March 2016 ****

See you in Nottingham!!!

**********************************************
Follow us on

www.scor16.com

www.facebook.com/scor2016

www.twitter.com/scor2016

www.linkedin.com/company/scor-2016
**********************************************

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP: 1st IEEE Workshop on Parallel and Distributed Processing for Computational Social Systems (ParSocial)

################################################################################################
CALL FOR PAPERS
The 1st IEEE Workshop on Parallel and Distributed Processing for
Computational Social Systems
May 27 2016, Chicago Hyatt Regency, Chicago, Illinois USA.
Conference Website : http://www.lcid.cs.iit.edu/parsocial
Contact Email : parsocial@cs.iit.edu
(In conjunction with IEEE International Parallel & Distributed Processing
Symposium (IPDPS))

IMPORTANT DATES
Paper submission deadline : January 11, 2016
Notification of acceptance : February 14, 2016
Camera-ready papers : February 21, 2016
Workshop : May 27, 2016
################################################################################################

ABOUT PARSOCIAL
Computational methods to represent, model and analyze problems using social
information have come a long way in the last decade. Computational methods,
such as social network analysis, have provided exciting insights into how
social information can be utilized to better understand social processes,
and model the evolution of social systems over time. We have also seen a
rapid proliferation of sensor technologies, such as smartphones and medical
sensors, for collecting a wide variety of social data, much of it in real
time. Meanwhile, the emergence of parallel architectures, in the form of
multi-core/many-core processors, and distributed platforms, such as
MapReduce, have provided new approaches for large-scale modeling and
simulation, and new tools for analysis. These two trends have dramatically
broadened the scope of computational social systems research, and are
enabling researchers to tackle new challenges. These challenges include
modeling of real world scenarios with dynamic and real-time data, and
formulating rigorous computational frameworks to embed social and
behavioral theories. The 1st IEEE Workshop on Parallel and Distributed
Processing for Computational Social Systems (ParSocial) provides a platform
to bring together interdisciplinary researchers from areas, such as
computer science, social sciences, applied mathematics and computer
engineering, to showcase innovative research in computational social
systems that leverage the emerging trends in parallel and distributed
processing, computational modeling, and high performance computing.

The papers selected for ParSocial will be published in the workshop
proceedings. Proceedings of the workshops are distributed at the conference
and are submitted for inclusion in the IEEE Xplore Digital Library after
the conference. There are also plans to invite selected papers for
publication in a special issue of a journal.

CALL FOR PAPERS
Areas of research interests and domains of applications include, but are
not limited to:

*Large-Scale Modeling and Simulation for Social Systems*
Social network based models
Models of social interactions (e.g. influence spread, group formation,
group stability, and social resilience)
Complex Adaptive System (CAS) models (e.g. modeling emergence in social
systems)
Models incorporating socio-cultural factors
Novel agent based social modeling and simulation
Modeling with uncertain, incomplete social data
Models using real-time social data
Representations of social and behavioral theories in computational models
Simulation methodologies for social processes including numerical and
statistical methods
Models for network dynamism
Modeling human and social elements in cyber systems (e.g. cyber-physical
systems, socio-technical systems, and network centric systems)
Social Computing Algorithms for Parallel and Distributed Platforms

*Analysis of massive social data*
Algorithms for dynamic social data
Algorithms for social network analysis
Analysis methods for incomplete, uncertain social data
Social analysis methods on parallel and distributed frameworks
Social computing for emerging architectures (e.g. cloud,
multi-core/many-core, GPU, and mobile computing architectures)

*Application*
Emergency management (e.g. infrastructure resilience, natural disaster
management)
National security (e.g. political stability, counter-terrorism, and
homeland security)
Health science (e.g. disease spread models, health informatics, and health
care analytics)
Social media analytics (e.g. business analytics, political analysis, and
economic analysis)

PAPER SUBMISSION
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.
Please visit the workshop website(http://www.lcid.cs.iit.edu/parsocial) for
details on submission.

For additional information and questions, please send email to
parsocial@cs.iit.edu and indicate "ParSocial 2016" in the subject to avoid
the spam filter.

WORKSHOP ORGANIZERS
John Korah, Illinois Institute of Technology, USA
Eunice E. Santos, Illinois Institute of Technology, USA

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CALL FOR NOMINATIONS - Highlights of Algorithms - HALG 2016

-------------------------------------------------------------------
Highlights of Algorithms - HALG 2016
June 6-8, 2016, Paris, France
http://highlightsofalgorithms.org/

Nominations deadline: January 3, 2016
-------------------------------------------------------------------

The Highlights of Algorithms conference is designed to be a forum for
presenting the highlights of recent developments in algorithms and for
discussing potential further advances in this area. The conference will
provide a broad picture of the latest research in algorithms through a
series of survey and invited talks, as well as possibility for all
researchers and students to present their recent results through a
series of short talks and poster presentations. Attending the Highlights
of Algorithms conference will also be an opportunity for networking and
meeting leading researchers in algorithms.

-------------------------------------------------------

CALL FOR NOMINATIONS

The conference seeks nominations for invited talks that will highlight
recent and interesting algorithmic results.
To nominate please email the proposition of the speaker, topic/title of
the talk, as well as a short support note to the following address:
halg2016.nominations@gmail.com.
All nominations will be carefully reviewed by the program committee to
select speakers that will be invited to the conference.
Please, keep in mind that the conference does not provide financial
support for the speakers.
-------------------------------------------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] 3rd AEC Summer School

===================================================

3rd summer school "Algorithmic and Enumerative Combinatorics"
(AEC 2016)
RISC, J. Kepler University Linz, Austria, August 1-5, 2016

https://www.risc.jku.at/conferences/aec2016/

===================================================

Within the framework of the SFB "Algorithmic and Enumerative
Combinatorics", the summer school AEC 2016 will be held at the
Research Institute for Symbolic Computation (Johannes Kepler
University Linz) in Hagenberg. It is jointly organized with the
combinatorics groups at the University of Vienna and the Vienna
University of Technology.

The goal of this summer school is to put forward the interplay
between the fields of Enumerative Combinatorics, Analytic
Combinatorics, and Algorithmics. This is a very active research
area, which, aside from the three fields fueling each other
mutually, receives as well constant impetus from outside, by its
interaction with algebra, probability, statistical physics, and
computer science.

The summer school will feature three series of lectures, given by

- Alin Bostan (INRIA Saclay, France)
- Dan Romik (University of California at Davis, U.S.A.)
- Jeffrey Shallit (University of Waterloo, Canada)

Each series of lectures will present a recent exciting trend in
these three research fields.

Aside from the three lecture series (5 hours each), there is time
for a limited number of contributed talks (20 minutes each).

There will be no conference fee. Lodging will be arranged at the
Hotel Sommerhaus Hagenberg (around 300 m distance from the venue
where the summer school wll be held). A single room costs 37 Euro
and a double room costs 67 Euro per day (breakfast and internet
connection are included).

There are limited funds available for participant support.

Important deadlines

Application for participant support: June 1, 2016
Submission of contributed talks: June 1, 2016
Acceptance of contributed talks: June 10, 2016
Registration: June 15, 2016


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Tuesday, December 15, 2015

[DMANET] CFP: SIAM Workshop on Network Science 2016

==========================================================
SIAM Workshop on Network Science (NS'16)
July 15 - 16, 2016
The Westin Boston Waterfront
Boston, Massachusetts, USA

CALL FOR PAPERS

www.siam.org/meetings/ns16/
==========================================================


SCOPE
=====

Network science has a rich history, tracing its roots back
through sociology, chemistry, biology, electrical engineering,
computer science, and topology all the way to Euler and the
Königsberg bridges nearly 300 years ago. Network science
studies the mathematical structure of the graphs that arise in
these diverse fields, and the design, analysis, and applications
of algorithms that compute with and on them. The goal of the
SIAM Network Science workshop is to promote cross-fertilization
among the communities that study and apply networks and graphs,
both inside and outside SIAM.

NS'16 will be co-located in Boston with the 2016 SIAM Annual
Meeting (July 11-15) and the SIAM Conference on Life Sciences
(July 11-14).


KEY DATES
=========

Submissions deadline: February 25, 2016
Notification: March 31, 2016
Preregistration and hotel deadline: June 13, 2016
SIAM NS'16: July 15-16, 2016


SUBMISSION
==========

Submission site: easychair.org/conferences/?conf=siamns2016
Latex style: siam.org/meetings/ns16/siam-wns-style.zip

We invite contributions focused on all aspects of mathematical,
algorithmic, and computational techniques in network science.

The workshop will feature three formats for contributed
presentations: 25-minute talks, 5-minute lightning talks in the
"Ignite" format (5 minutes, 20 slides, 15-second auto-advance),
and posters. The program committee will consider all
submissions for all three presentation formats.

Submit a 2-page abstract using the LaTeX style files provided
on the NS'16 web site through the SIAM NS'16 EasyChair site.
Accepted abstracts will be posted online in late May 2016;
authors will be required to submit LaTeX source adhering to
the template in April 2016.


IGNITE TALK FORMAT
==================

The Ignite format is new for NS'16; see www.ignitetalks.io
for a description. We especially want to use this format to
highlight work by early-career researchers. If you feel your
submission is particularly appropriate for an Ignite talk,
please let us know using the checkbox on the EasyChair
submission page.


ORGANIZATION
============

Workshop Co-Chairs:

John Gilbert, UC Santa Barbara
Blair D. Sullivan, NC State

Program Committee:

Ulrik Brandes, Konstanz
Bailey Fosdick, Colorado State
Assefaw Gebremedhin, Washington State
David Gleich, Purdue
Aric Hagberg, Los Alamos Lab
David Kempe, USC
Jeremy Kepner, MIT Lincoln Lab
Carl Kingsford, Carnegie Mellon
Christine Klymko, Lawrence Livermore Lab
Dan Larremore, Santa Fe Institute
Chris Long, US Department of Defense
Vince Lyzinski, Johns Hopkins
Aleksander Madry, MIT
Vahab Mirrokni, Google
Fabrizio Petrini, IBM
Cynthia Phillips, Sandia Labs
Lev Reyzin, UI Chicago
Johan Ugander, Stanford
Sebastiano Vigna, Milano


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP: DEBS 2016 - The 10th ACM International Conference on Distributed and Event-Based Systems

----------------------------------------------------------------------
----------------------------------------------------------------------
CALL FOR PAPERS

10th ACM International Conference on Distributed Event-Based Systems

Irvine, CA, USA,
June 20-24 2016

http://www.debs2016.org
----------------------------------------------------------------------
----------------------------------------------------------------------

OBJECTIVES:

Over the past decade, the ACM International Conference on Distributed
and Event- based Systems (DEBS) has become the premier venue for
contributions in the fields of distributed and event-based systems.
The objectives of the ACM International Conference on Distributed and
Event-Based Systems (DEBS) are to provide a forum dedicated to the
dissemination of original research, the discussion of practical
insights, and the reporting of experiences relevant to distributed
systems and event-based computing. The conference aims at providing a
forum for academia and industry to exchange ideas through industry
papers and demo papers.


SCOPE:

Starting this year DEBS is extending its scope to embrace a broader
set of topics related to distributed systems and event-based
computing. Topics of particular interest may include (but are not
limited to) models, architectures and paradigms of distributed and
event-based systems, middleware systems and frameworks, and
applications, experiences and requirements. The scope of the DEBS
conference covers all topics relevant to distributed and event-based
computing ranging from those discussed in related disciplines (e.g.,
software systems, distributed systems, distributed data processing,
data management, dependability, knowledge management, networking,
programming languages, security and software engineering), to domain-
specific topics of event-based computing (e.g., real-time analytics,
mobile computing, social networking, pervasive, green computing and
ubiquitous computing, sensors networks, user interfaces, big data
processing, spatio-temporal processing, cloud computing, the Internet
of things, peer-to-peer computing, embedded systems and stream
processing), to enterprise-related topics (e.g., complex event
detection, enterprise application integration, real-time enterprises
and web services).

In addition to these traditional topics, the scope of DEBS 2016 will
include the increasingly important area of Internet of Things. New
advances in distributed and event-based systems pose a great potential
for a major contribution in this area. For further information, please
refer to the call for contributions in the track of your choice.

TOPICS COVERED INCLUDE, BUT ARE NOT LIMITED TO:

1) Models, Architectures and Paradigms: Event-driven architectures,
event processing in big data, complex event processing, rule-based
systems, logic-based event recognition, event correlation and pattern
languages.

2) Middleware infrastructures: Distributed data processing,
distributed programming, federated event-based systems, event
dissemination on P2P systems, fault tolerance, reliability and
availability and scalability.

3) Applications, Experience and Requirements: Use cases and
applications of distributed and event-based systems in various domains
including Internet of Things, Smart Cities, Smart Grids, Finance,
Logistics.


Submission Dates:
Abstract submission for research track: Feb 22nd, 2016
Research and industry paper submission: Feb 27th, 2016
Tutorial proposal submission: Mar 7th, 2016
Grand Challenge solution submission: Mar 30th, 2016
Author notification: Apr 18th, 2016
Poster, demo, doctoral
symposium submission: Apr 30th, 2016
Camera ready submission: May 6th, 2016


STRUCTURE:

DEBS 2016 will be organized along six tracks:

1. Research Track that presents original research contributions.
Submissions will be evaluated by an experienced program committee
consisting of eminent researchers from all over the world.

2. Industry and Experience Reports Track meant to report on innovative
deployments of event-based systems. Contributions will be reviewed by
researchers and industry practitioners working in event-based
computing.

3. The Tutorial Track where recognized experts in the field will
present their tutorials on relevant emerging areas of research.

4. Poster and Demo Track where authors can report on work in progress
and/or arrange to demonstrate interesting ideas and applications
pertaining to event- based systems.

5. Doctoral Symposium Track meant for doctoral candidates whose
research area overlaps with event-based systems.

6. Grand Challenge Track: Here the committee will set out a grand
challenge problem and then judge the most innovative approaches for
its solution.

PROCEEDINGS:

Accepted papers will appear in the conference proceedings, which will
be published in the ACM Digital Library. The authors of accepted
papers will be given a choice between different copyright agreements,
in accordance with the recent changes in the ACM policy. The options
will include new opportunities for open access as well as the
traditional ACM copyright agreement.

AUTHORS TAKE NOTE: A new policy by ACM will allow DEBS 2016 to make
the proceedings available ahead of the conference via the ACM Digital
Library. Thus, the official publication date is the date the
proceedings appear in the ACM Digital Library. This date may be up to
two weeks prior to the first day of the conference. The official
publication date affects the deadline for any patent filings related
to published work.


SUBMISSION INFORMATION: http://www.debs2016.org/submission-
guidelines.html


GENERAL CO-CHAIRS:
Avigdor Gal, Technion, Israel
Matthias Weidlich, Humboldt-Universitaet zu Berlin, Germany

RESEARCH TRACK CO-CHAIRS:
Vana Kalogeraki, Athens University of Economics and Business, Greece
Nalini Venkasubramanian, University of California, Irvine, USA

INDUSTRY TRACK CO-CHAIRS:
Malu Castellanos, HP, USA
Alejandro Buchmann, Technische Universitaet Darmstadt, Germany

DOCTORAL SYMPOSIUM CO-CHAIRS:
David Eyers, University of Otago, New Zeland
Leonardo Querzoni, Sapienza University, Italy

TUTORIALS CO-CHAIRS:
Gianpaolo Cugola, Politecnico di Milano, Italy
Bugra Gedik, Bilkent University, Germany

GRAND CHALLENGE CO-CHAIRS:
Vincenzo Gulisano, Chalmers University of Technology, Sweden
Zbigniew Jerzak, SAP AG, Germany
Holger Ziekow, Furtwangen University, Furtwangen, Germany

DEMO AND POSTERS CO-CHAIRS:
Nesime Tatbul, Intel Labs/MIT, USA
Ioannis Katakis, University of Athens, Greece

SPONSORSHIP CO-CHAIRS:
Opher Etzion, Yezreel Valley College, Israel
Christoph Emmersberger, University of Regensburg, Germany

PROCEEDINGS CHAIR:
Thomas Heinze, SAP, USA

PUBLICITY CO-CHAIRS:
Mohammad Sadoghi, IBM T.J. Watson Research Center, USA
Izchak Tzachi Sharfman, Technion, Israel
Vinay Setty, MPI, Germany

WEB CO-CHAIRS:
Matthew Forshaw, Newcastle University, UK
Ye Zhao, Google Inc., USA
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[Mycolleagues] CFP: DEBS 2016 - The 10th ACM International Conference on Distributed and Event-Based Systems

----------------------------------------------------------------------
----------------------------------------------------------------------
CALL FOR PAPERS

10th ACM International Conference on Distributed Event-Based Systems

Irvine, CA, USA,
June 20-24 2016

http://www.debs2016.org
----------------------------------------------------------------------
----------------------------------------------------------------------

OBJECTIVES:

Over the past decade, the ACM International Conference on Distributed
and Event- based Systems (DEBS) has become the premier venue for
contributions in the fields of distributed and event-based systems.
The objectives of the ACM International Conference on Distributed and
Event-Based Systems (DEBS) are to provide a forum dedicated to the
dissemination of original research, the discussion of practical
insights, and the reporting of experiences relevant to distributed
systems and event-based computing. The conference aims at providing a
forum for academia and industry to exchange ideas through industry
papers and demo papers.


SCOPE:

Starting this year DEBS is extending its scope to embrace a broader
set of topics related to distributed systems and event-based
computing. Topics of particular interest may include (but are not
limited to) models, architectures and paradigms of distributed and
event-based systems, middleware systems and frameworks, and
applications, experiences and requirements. The scope of the DEBS
conference covers all topics relevant to distributed and event-based
computing ranging from those discussed in related disciplines (e.g.,
software systems, distributed systems, distributed data processing,
data management, dependability, knowledge management, networking,
programming languages, security and software engineering), to domain-
specific topics of event-based computing (e.g., real-time analytics,
mobile computing, social networking, pervasive, green computing and
ubiquitous computing, sensors networks, user interfaces, big data
processing, spatio-temporal processing, cloud computing, the Internet
of things, peer-to-peer computing, embedded systems and stream
processing), to enterprise-related topics (e.g., complex event
detection, enterprise application integration, real-time enterprises
and web services).

In addition to these traditional topics, the scope of DEBS 2016 will
include the increasingly important area of Internet of Things. New
advances in distributed and event-based systems pose a great potential
for a major contribution in this area. For further information, please
refer to the call for contributions in the track of your choice.

TOPICS COVERED INCLUDE, BUT ARE NOT LIMITED TO:

1) Models, Architectures and Paradigms: Event-driven architectures,
event processing in big data, complex event processing, rule-based
systems, logic-based event recognition, event correlation and pattern
languages.

2) Middleware infrastructures: Distributed data processing,
distributed programming, federated event-based systems, event
dissemination on P2P systems, fault tolerance, reliability and
availability and scalability.

3) Applications, Experience and Requirements: Use cases and
applications of distributed and event-based systems in various domains
including Internet of Things, Smart Cities, Smart Grids, Finance,
Logistics.


Submission Dates:
Abstract submission for research track: Feb 22nd, 2016
Research and industry paper submission: Feb 27th, 2016
Tutorial proposal submission: Mar 7th, 2016
Grand Challenge solution submission: Mar 30th, 2016
Author notification: Apr 18th, 2016
Poster, demo, doctoral
symposium submission: Apr 30th, 2016
Camera ready submission: May 6th, 2016


STRUCTURE:

DEBS 2016 will be organized along six tracks:

1. Research Track that presents original research contributions.
Submissions will be evaluated by an experienced program committee
consisting of eminent researchers from all over the world.

2. Industry and Experience Reports Track meant to report on innovative
deployments of event-based systems. Contributions will be reviewed by
researchers and industry practitioners working in event-based
computing.

3. The Tutorial Track where recognized experts in the field will
present their tutorials on relevant emerging areas of research.

4. Poster and Demo Track where authors can report on work in progress
and/or arrange to demonstrate interesting ideas and applications
pertaining to event- based systems.

5. Doctoral Symposium Track meant for doctoral candidates whose
research area overlaps with event-based systems.

6. Grand Challenge Track: Here the committee will set out a grand
challenge problem and then judge the most innovative approaches for
its solution.

PROCEEDINGS:

Accepted papers will appear in the conference proceedings, which will
be published in the ACM Digital Library. The authors of accepted
papers will be given a choice between different copyright agreements,
in accordance with the recent changes in the ACM policy. The options
will include new opportunities for open access as well as the
traditional ACM copyright agreement.

AUTHORS TAKE NOTE: A new policy by ACM will allow DEBS 2016 to make
the proceedings available ahead of the conference via the ACM Digital
Library. Thus, the official publication date is the date the
proceedings appear in the ACM Digital Library. This date may be up to
two weeks prior to the first day of the conference. The official
publication date affects the deadline for any patent filings related
to published work.


SUBMISSION INFORMATION: http://www.debs2016.org/submission-
guidelines.html



GENERAL CO-CHAIRS:
Avigdor Gal, Technion, Israel
Matthias Weidlich, Humboldt-Universitaet zu Berlin, Germany

RESEARCH TRACK CO-CHAIRS:
Vana Kalogeraki, Athens University of Economics and Business, Greece
Nalini Venkasubramanian, University of California, Irvine, USA

INDUSTRY TRACK CO-CHAIRS:
Malu Castellanos, HP, USA
Alejandro Buchmann, Technische Universitaet Darmstadt, Germany

DOCTORAL SYMPOSIUM CO-CHAIRS:
David Eyers, University of Otago, New Zeland
Leonardo Querzoni, Sapienza University, Italy

TUTORIALS CO-CHAIRS:
Gianpaolo Cugola, Politecnico di Milano, Italy
Bugra Gedik, Bilkent University, Germany

GRAND CHALLENGE CO-CHAIRS:
Vincenzo Gulisano, Chalmers University of Technology, Sweden
Zbigniew Jerzak, SAP AG, Germany
Holger Ziekow, Furtwangen University, Furtwangen, Germany

DEMO AND POSTERS CO-CHAIRS:
Nesime Tatbul, Intel Labs/MIT, USA
Ioannis Katakis, University of Athens, Greece

SPONSORSHIP CO-CHAIRS:
Opher Etzion, Yezreel Valley College, Israel
Christoph Emmersberger, University of Regensburg, Germany

PROCEEDINGS CHAIR:
Thomas Heinze, SAP, USA

PUBLICITY CO-CHAIRS:
Mohammad Sadoghi, IBM T.J. Watson Research Center, USA
Izchak Tzachi Sharfman, Technion, Israel
Vinay Setty, MPI, Germany

WEB CO-CHAIRS:
Matthew Forshaw, Newcastle University, UK
Ye Zhao, Google Inc., USA
---------------------------------
Very happy holiday seasons and new year.
I love you. I'm Sorry. Please forgive me. Thank you.
----------------------------------
_______________________________________________
Mycolleagues mailing list
Mycolleagues@mailman.ufsc.br
http://mailman.ufsc.br/mailman/listinfo/mycolleagues

- Through this link above you can "subscribe", "unsubscribe", or change your settings in the list.
- ENJOY this COURTESY offered by FEDERAL UNIVERSITY OF SANTA CATARINA.

[DMANET] ALEA in Europe Meeting -- 22-26 February 2016 -- Munich - registration

==========================

ALEA in Europe Meeting

Munich, 22-26 February 2016

<http://www.alea-in-europe.com/> http://www.alea-in-europe.com/

==========================

(apologies for multiple copies)

We are pleased to announce the second ALEA in Europe meeting, to be held in
Munich 22-26 February 2016.

This five day meeting and school is an activity in the context of the
<http://aleanetwork.net/index.php> ALEA network and aims at bringing together
researchers working on Random Discrete Structures in Computer Science,
Probability and Statistical Physics. The goal is to provide postdocs and
students the unique opportunity to learn from leading experts the state of the
art results and methods and to meet fellow colleagues.

The meeting will feature three distinguished series consisting of three lectures
each, five invited seminars, and a number of shorter talks by some of the
participants.

Topics of interest include: discrete random structures, combinatorics,
probability theory, bio inspired computation, statistical physics.

Participation is free of charge. However, please register until February 7,
2016.

Main speakers:

Marc Noy (UPC Barcelona)

Christina Goldschmidt (Oxford)

Benjamin Doerr (LIX, Ecole Polytechnique)

Invited Seminars:

Mihyun Kang (TU Graz)

Carola Doerr (Université Pierre et Marie Curie)

Mathias Schacht (University of Hamburg)

Johannes Lengler (ETH Zurich)

Benedikt Stufler (University of Munich)

Organization:

Konstantinos Panagiotou (University of Munich)


**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

ESA Test-of-Time Award 2015

___________________________________________________________________________________
Announcement of the ESA Test-of-Time Award 2015

European Symposium on Algorithms (ESA)
http://esa-symposium.org/
___________________________________________________________________________________

The ESA Test-of-Time Award (ESA ToTA) recognizes outstanding papers in
algorithms research that were published in the ESA proceedings 19-21
years ago and which are still influential and stimulating for the field
today.

The award committee selected the following two papers for the ESA ToTA 2015.
The papers stand out for their impact and wide use in the algorithms field, and for their excellent citation records up to the present day.

From ESA 03-95:

Mechthild Stoer, Frank Wagner:
A Simple Min Cut Algorithm
Proceedings ESA'94, also in: JACM 44:4 (1997) 585-591

Laudatio
The minimum cut problem in graphs is a basic problem in network analysis
and is needed, for example, as the separation routine in branch-and-cut
algorithms for the Traveling Salesman problem. Stoer and Wagner gave an
elegant and efficient algorithm for the problem that avoids the computation
of maximum flows, building upon previous work by Nagamochi and Ibaraki. The
same algorithm was independently found by Frank. The algorithm continues to
be taught because of its elegance and used because of its efficiency and ease
of implementation.

From ESA 94-96:

Sudipto Guha, Samir Khuller:
Approximation Algorithms for Connected Dominating Sets
Proceedings ESA'96, also in: Algorithmica 20:4 (1998) 374-387

Laudatio
It is natural to require connectedness as an additional constraint for a
dominating set, for example, in ad hoc wireless networks. Domination
guarantees coverage and connectedness guarantees communication between
the selected nodes. Guha and Khuller gave polynomial algorithms for a
logarithmic-factor approximation to its solution. Under the usual
assumptions, this is the best possible. Their much-cited work has
stimulated similar research for connected variants of many other graph
problems.

Exceptionally, in this first year in which award is given, the
ESA ToTA 2015 committee was asked to consider all qualifying papers from
ESA 93-95 and ESA 94-96, respectively.

Award Committee: Jan van Leeuwen, Kurt Mehlhorn and Mike Paterson
_________________________________________________________________________________________

[DMANET] ESA Test-of-Time Award 2015

___________________________________________________________________________________
Announcement of the ESA Test-of-Time Award 2015

European Symposium on Algorithms (ESA)
http://esa-symposium.org/
___________________________________________________________________________________

The ESA Test-of-Time Award (ESA ToTA) recognizes outstanding papers in
algorithms research that were published in the ESA proceedings 19-21
years ago and which are still influential and stimulating for the field
today.

The award committee selected the following two papers for the ESA ToTA 2015.
The papers stand out for their impact and wide use in the algorithms field, and for their excellent citation records up to the present day.

>From ESA 03-95:

Mechthild Stoer, Frank Wagner:
A Simple Min Cut Algorithm
Proceedings ESA'94, also in: JACM 44:4 (1997) 585-591

Laudatio
The minimum cut problem in graphs is a basic problem in network analysis
and is needed, for example, as the separation routine in branch-and-cut
algorithms for the Traveling Salesman problem. Stoer and Wagner gave an
elegant and efficient algorithm for the problem that avoids the computation
of maximum flows, building upon previous work by Nagamochi and Ibaraki. The
same algorithm was independently found by Frank. The algorithm continues to
be taught because of its elegance and used because of its efficiency and ease
of implementation.

>From ESA 94-96:

Sudipto Guha, Samir Khuller:
Approximation Algorithms for Connected Dominating Sets
Proceedings ESA'96, also in: Algorithmica 20:4 (1998) 374-387

Laudatio
It is natural to require connectedness as an additional constraint for a
dominating set, for example, in ad hoc wireless networks. Domination
guarantees coverage and connectedness guarantees communication between
the selected nodes. Guha and Khuller gave polynomial algorithms for a
logarithmic-factor approximation to its solution. Under the usual
assumptions, this is the best possible. Their much-cited work has
stimulated similar research for connected variants of many other graph
problems.

Exceptionally, in this first year in which award is given, the
ESA ToTA 2015 committee was asked to consider all qualifying papers from
ESA 93-95 and ESA 94-96, respectively.

Award Committee: Jan van Leeuwen, Kurt Mehlhorn and Mike Paterson
_________________________________________________________________________________________

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Monday, December 14, 2015

[DMANET] Postdoctoral Positions at U. de Chile

Two postdoctoral positions are available at the Department of
Industrial Engineering of Universidad de Chile (Santiago) starting in
April 2016, or by mutual agreement at any date thereafter. The
positions emerge as a joint venture between the Institute for Market
Imperfections and Public Policy <http://mipp.cl>, led by professor
Juan Escobar <http://www.dii.uchile.cl/~jescobar/>, and the Millennium
Nucleus Information and Coordination in Networks
<http://acgo.uchile.cl>, led by professor Jose Correa
<http://www.dii.uchile.cl/~jcorrea/>.

The selected candidates will devote fully to research, spending a
significant fraction of their time working on a large scale and high
impact project related to matching markets and market design. The
appointment will be for a period of 12 months, renewable by mutual
agreement, with a gross monthly salary of 1.700.000 CLP. Shorter
periods may also be considered. Travel support is available.

Applicants must hold a recent (or be close to completion) PhD in Computer
Science, Economics, Operations Research or related fields and should have
provable
research expertise in game theory. Knowledge and background on
matching theory is a plus though not a requirement. Applications
including curriculum vitae, list of publications, research plan (1
page), and names of references with their e-mail addresses, should be
sent electronically to Jose Correa or Juan Escobar. To ensure full
consideration the application should be sent before the deadline of
January 15th, 2016. Late applications will be considered on a case by
case basis.

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] CFP: EXPLORE 2016 @ AAMAS 2016: The 3rd Workshop on Exploring Beyond the Worst Case in Computational Social Choice

CFP: EXPLORE 2016 @ AAMAS 2016: The 3rd Workshop on Exploring Beyond the Worst Case in Computational Social Choice

To be held at the 15th Conference for Autonomous Agents and Multi-Agent Systems, AAMAS 2016

May 9th or 10th, 2016

Singapore

http://www.explore-2016.preflib.org/

Computational Social Choice (ComSoc) is a rapidly developing field at the intersection of computer science, economics, social choice, and political science. Many, often disjoint, groups of researchers both outside and within computer science study group decision making and preference aggregation. The computer science view of social choice focuses on computational aspects of social choice and importing ideas from social choice into computer science, broadly. While the surge of research in this area has created dramatic benefits in the areas of market matchings, recommendation systems, and preference aggregation, much of the ComSoc community remains focused on worst case assumptions.

As ComSoc evolves there is an increased need to relax or revise some of the more common assumptions in the field: worst case complexity, complete information, and overly-restricted domains, among others. This means going beyond traditional algorithmic and complexity results and providing a more nuanced look, using real data, parameterized algorithms, and human and agent experimentation to provide a fresh and impactful view of group decision making. This goes hand in hand with highlighting the practical applications of much of the theoretical research - as much of the most impactful work in ComSoc does. It also involves looking at more complex preference aggregation settings that help model real world requirements.

We encourage research related to:

* Algorithms
* Empirical Studies
* Average case analysis
* Identification of tractable sub-cases
* Fixed parameter complexity analysis
* Benchmarking and analysis from the preference handling and recommendation systems
* Studies of matching and auction mechanisms
* Crowd-sourcing and other real-world data aggregation domains.

Many of these tools, techniques, and studies are concentrated in a particular sub-field and researchers in other areas of ComSoc and related communities may be keen to import some of the tools and techniques developed in other areas.

Program Notes
-------------
The workshop is currently scheduled for a full day. We plan for the program to include an invited talk from a local researcher and possibly a short tutorial.

Important Dates
---------------
Paper Submission Deadline: February 1, 2016
Author Notification: March 1, 2016
Conference and Workshop: May 9 or 10, 2016

Organization Committee
----------------------
Haris Aziz, Data61 and UNSW
Felix Brandt, Technische Universität München
David Manlove, University of Glasgow
Nicholas Mattei, Data61 and UNSW

Submission Instructions
-----------------------
Submissions will be handled by EasyChair, the site is available at https://easychair.org/conferences/?conf=explore2016.
Papers should be in AAMAS format, allowing 8 pages of text plus 1 page for references.

Travel and Attendance Information
---------------------------------
The workshop will be held in conjunction with AAMAS 2016 in Singapore. Please see the AAMAS website for more information regarding registration, travel, and accommodations: http://sis.smu.edu.sg/aamas2016.

We hope to see you there.
--Haris, Felix, David, and Nicholas

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

[DMANET] computational optimization

------------

Call for Papers

9th International Workshop on Computational Optimization (WCO 2016)
Gdansk, Poland, September 11 - 14, 2016)

organized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE
AND INFORMATION SYSTEMS
FedCSIS - 2016

http://www.fedcsis.org/

====================

We invite original contributions related with both theoretical and
practical aspects of optimization methods.
The list of topics includes, but is not limited to:

* unconstrained and constrained optimization
* combinatorial optimization
* continues optimization
* global optimization
* multiobjective optimization
* optimization in dynamic and/or noisy environments
* large scale optimization
* parallel and distributed approaches in optimization
* random search algorithms, simulated annealing, tabu search and other
derivative free optimization methods
* nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
* hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
*computational biology and optimization
* distance geometry and applications
* optimization methods for learning processes and data mining
* application of optimization methods on real life and industrial problems
* computational optimization methods in statistics, econometrics,
finance, physics, chemistry, biology, medicine, engineering etc.

====================

Important dates:

18.04.2016 (April 18, 2016) – Full paper submission

30.05.2016 (May 30, 2016) - Position paper submission

13.06.2016 (June 13, 2016) – Notification of acceptance

04.07.2016 (July 04, 2016) – Camera-ready version of the accepted paper

====================

Submission and Publication


* Authors should submit draft papers as PDF.
* The total length of a paper should not exceed 10 pages for full
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 paper will be published in the Conference
Proceedings and included in the IEEE Xplore database (pending) and
indexed in the DBLP.
* Extended versions of selected papers presented during the conference
will be published as Special Issue(s) of Springer Studies of
Computational Intelligence.
====================

If you have any question do not hesitate to send a mail to wco2016@fedcsis.org .

Organizing Committee

Stefka Fidanova, Bulgarian Academy of Science, Bulgaria
Daniela Zaharie, West University of Timisoara, Romania
Antonio Mucherino, IRISA, France

--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Sunday, December 13, 2015

[DMANET] SPAA 2016 Date Change

Due to scheduling issues at Asilomar Conference Grounds, the date of the
SPAA 2016 conference has been changed to July 11-13, 2016. The
submission deadlines remain the same.

Updated call for papers is below.

Best regards,

Nodari Sitchinava
SPAA Publicity Chair


======================================================
SPAA 2016 Call for Papers
======================================================

28th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA 2016)
July 11-13, 2016
Asilomar State Beach, California, USA
http://spaa.acm.org

======================================================

Important Dates:

Submission deadlines:
- Regular papers: February 5, 11:59pm HAST
- Brief announcements: February 26, 11:59pm HAST

Rebuttal period: March 22-25
Notification: April 11

======================================================

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
- Parallel Complexity Theory
- Scheduling in Parallel Systems
- Specification and Verification of Concurrent Systems
- Parallel and Distributed Architectures
- Multiprocessor and Multicore Architectures
- Transactional Memory Hardware and Software
- Instruction Level Parallelism and VLSI
- Compilers and Tools for Concurrent Programming
- Algorithms for GPUs and Other Alternative Parallel Architectures
- High-Performance Parallel Computing and Architectures
- Green & Power-Efficient Algorithms and Architectures
- Algorithms for Social Networks
- Biological Distributed Algorithms
- Network Algorithms
- Algorithms for Routing and Information Dissemination
- Peer-to-Peer Systems
- Mobile, Ad-Hoc, Wireless and Sensor Networks
- Fault-tolerance and Reliability
- Self-stabilization and Self-organization
- Security and Privacy in Distributed and Parallel Systems
- Parallel/Distributed Computational Learning
- Game Theory and Collaborative Learning
- Parallel/Distributed issues in Big Data
- 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 two pages.
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.

Authors may request that a regular paper be considered as a brief
announcement. As far as possible, the program committee will remain
blind to this request until status as a regular paper has been resolved.
Such a request will not affect the chances of the manuscript to be
accepted as a regular paper.

Submission details:

Papers should be submitted in standard ACM format, i.e., 9-point font on
8.5x11 inch pages. For detailed submission instructions and formatting,
please see http://spaa.acm.org.

Awards:

Every regular paper is eligible for the best paper award.


======================================================

Program Committee:

Dan Alistarh (Microsoft Research)
Yossi Azar (Tel Aviv Univ.)
Michael Bender (Stony Brook Univ.)
Costas Busch (Louisiana State Univ.)
Yuval Emek (Technion)
Antonio Fernández Anta (IMDEA)
Jeremy Fineman (Georgetown Univ.)
Phil Gibbons (CMU)
Seth Gilbert (NUS)
Magnús M. Halldórsson (Reykjavík University)
Stephan Holzer (MIT)
Fabian Kuhn (Univ. of Freiburg)
Yossi Lev (Oracle)
Ishai Menache (Microsoft Research)
Ben Mosely (Wash. Univ. in St. Louis)
Calvin Newport (Georgetown Univ.)
Merav Parter (MIT)
Boaz Patt-Shamir (Tel Aviv Univ.)
Seth Pettie (Univ. of Michigan)
Cynthia Phillips (Sandia Natl. Lab.)
Kirk Pruhs (Univ. of Pittsburgh)
Peter Robinson (Queen's Univ. Belfast)
Thomas Sauerwald (Cambridge)
Stefan Schmid (Aalborg Univ.)
Michael Scott (Univ. of Rochester)
Julian Shun (UC Berkeley)
Aravind Srinivasan (Univ. of Maryland)
Maxwell Young (Mississippi State Univ.)


======================================================

Conference Committee:

Program Chair: Seth Gilbert (NUS)
General Chair: Christian Scheideler (Univ. of Paderborn)
Local Arrangements: Bradley Kuszmaul (MIT)
Treasurer: David Bunde (Knox College)
Publicity Chair: Nodari Sitchinava (Univ. of Hawaii, Manoa)
Secretary: Jeremy Fineman (Georgetown Univ.)

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************

Postdoc positions in SAT solving at KTH Royal Institute of Technology

The Theory Group at KTH Royal Institute of Technology invites applications for postdoctoral positions in SAT solving.

 

KTH is the leading technical university in Sweden. The Theory Group at KTH (http://www.csc.kth.se/tcs/) offers a strong research environment covering a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. The group has a consistent track record of publishing in the leading theoretical computer science conferences and journals worldwide, and the research conducted here has attracted numerous international awards and grants in recent years.

 

The postdoctoral researchers will be working in the research group of Jakob Nordstrom (http://www.csc.kth.se/~jakobn). Much of the activities of this research group revolve around the themes of proof complexity and SAT solving. On the practical side, some interesting problems are to gain a better understanding of the performance of current state-of-the-art SAT solvers — in particular, solvers using conflict-driven clause learning (CDCL) — and to explore techniques that would go beyond CDCL, such as approaches based on algebraic or geometric reasoning.

 

These are full-time employed positions for one year with a possible one-year extension. The expected start date is August-September 2016, although this is to some extent negotiable.

 

The application deadline is January 24, 2016. More information and instructions how to apply can be found at http://www.csc.kth.se/~jakobn/openings/D-2015-0823-Eng.php . Informal enquiries are welcome and may be sent to Jakob Nordstrom.