There are two categories of submission – full papers (submission nowclosed) and exploratory papers. The later submission deadline forexploratory papers allows quick reporting of recent discoveries, work-in-progress and/or partial results. Submissions in the exploratorycategory go through a less rigorous evaluation process than those inthe full paper category. Exploratory papers will not be included in theLNCS proceedings; however, they will be printed locally and given toconference participants.

Submission

Authors are invited to submit extended abstracts of no more than 8pages via the EasyChair system at

Submissions should contain original research that has not previouslybeen published. Submission must be formatted in LaTeX using the LNCSformat (see http://www.springer.com/computer/lncs/lncs+authors) andsubmitted in Portable Document Format (PDF). Papers authored or co-authored by PC members are also welcome.************************************************************ 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/***********************************************************

Scope: We invite submissions of original researches on, but not restricted to, discrete geometry, computational geometry, graph theory, graph algorithms, complexity and winning strategies of games and puzzles.

The collection of abstracts will be distributed electrically.

Submission format: Authors are required to submit a pdf-file of an extended abstract of at most 2 pages in a standard 10-point font on A4-paper to

* Note: * - Any proceedings (e.g., from Springer) won't be published. But * - A special issue on the same theme will be published from * JIP (Journal of Information Processing). * -- http://www.ipsj.or.jp/english/jip/index.html* -- The editor is H. Ito (PC chair of this conference)* -- The deadline of the special issue will be October * -- (i.e., after the conference).* -- The detail information will be noticed soon.* - We have not prepared for special rates at hotels. So, please * make your hotel reservations for yourself. * - The official language for presentations and abstracts of talks * in this conference is English.

The University of Melbourne is seeking an outstanding Research Fellow to conduct leading edge research in automated planning. The project is in conjunction with our research partners at Defence Science and Technology Group (DST Group), and forms part of DST Group's Tyche Special Research Initiative (SRI) into trusted autonomy. It concerns distributed multi-agent planning and reasoning in dynamic environments, with a specific focus on automated planning in unpredicted situations.

The position will be located in the Department of Computing and Information Systems within the Melbourne School of Engineering.

Salary $92,654-$110,022 AUD p.a. plus 9.5% superannuation

The successful candidates will conduct leading-edge research and development in the area of automated planning or a related area.

As part of the team, working with Assoc Professor Adrian Pearce, Professor Liz Sonenberg, Dr. Tim Miller, Dr. Nir Lipovetzky and Dr. Michelle Blom, you would be involved in discovering automated reasoning techniques for robustness and distributed adaptability under irreducible uncertainty in a range of applications, including land vehicles and autonomous team tactics discovery.

The role will involve investigation of The candidate should be prepared for occasional interstate travel, as the research is conducted in close collaboration with our research partners. The position is for a fixed term of 2 years.

RESEARCH GROUP

The successful candidate will be part of a team that works collaboratively on all aspects of the project, from concepts, theoretical underpinning and design, through implementation and experimentation, to publication of results and maintenance and refinement of generated software. Primary responsibilities will involve the development of novel planning and reasoning mechanisms in distributed multi-agent environments.

The successful candidate will be located in the Department of Computing and Information Systems in the Melbourne School of Engineering and will be expected to be an active member of the Department, collaborating with other researchers.

************************************************************ 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/***********************************************************

Privacy in statistical databases is about finding tradeoffs tothe tension between the increasing societal and economical demandfor accurate information and the legal and ethical obligation toprotect the privacy of individuals and enterprises which are therespondents providing the statistical data. In the case ofstatistical databases, the motivation for respondent privacy isone of survival: statistical agencies or survey institutes cannotexpect to collect accurate information from individual orcorporate respondents unless these feel the privacy of theirresponses is guaranteed.

Beyond respondent privacy, there are two additional privacy dimensionsto be considered: privacy for the data owners (organizations owning orgathering the data, who would not like to share the data they havecollected at great expense) and privacy for the users (those whosubmit queries to the database and would like their analyses to stayprivate). Co-utility has shown to provide sustainable solutions touser privacy.

"Privacy in Statistical Databases 2016" (PSD 2016) is a conferencesponsored and organized by the UNESCO Chair in Data Privacy(http://unescoprivacychair.urv.cat) with proceedings published bySpringer-Verlag in Lecture Notes in Computer Science. Generous supportby the Templeton World Charity Foundation is acknowledged. The purposeof PSD 2016 is to attract world-wide, high-level research instatistical database privacy.

Like the aforementioned preceding conferences, PSD 2016 originates inEurope, but wishes to stay a worldwide event in database privacy andSDC. Thus, contributions and attendees from overseas are welcome.

Full papers containing either original technical contributions orhigh-quality surveys on the above topics or on related topics aresought.

A submission should be clearly marked either as an original paper or asurvey. Submissions should contain a cover letter indicating:

1) whether the submission is a survey or an original contribution;2) the title of the submission;3) keywords classifying the paper topic;4) the names and affiliations of authors;5) the e-mail, telephone and facsimile numbers of the contact author.

The submission itself should be sent as an attached PDF file.Submission and their cover letters should be sent to: psd2016@urv.cat

Camera-ready versions of accepted papers should be prepared using theLaTeX2e style or the Word template of Springer Verlag Lecture Notes inComputer Science. For LaTeX2e, a macro package llncs.zip and anexample file typeinst.zip can be downloaded fromhttp://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 ForMicrosoft Word, a template word.zip can be downloaded from the samepage above.

We encourage authors to use the above formats already for theirsubmissions.

LENGTH OF SUBMISSIONS.

Using the above format with 11 point font, the paper should be at most12 pages excluding bibliography and appendices, and at most 16 pagestotal. Committee members are not required to read appendices; thepaper should be intelligible without them. Submissions not meetingthese guidelines risk rejection without consideration of their merits.

5. PROCEEDINGS--------------

Among PSD 2016 accepted papers, a selection will be made based onquality and coverage and the selected papers will be published in theLecture Notes in Computer Science (LNCS) series by Springer. Thisfollows the tradition of the previous PSD conferences.

The remaining accepted papers will be published in a CD with an ISBN.It is possible to submit a paper directly for the CD, which benefitsfrom a later submission deadline (see CD-only dates below).

The form of publication of an accepted paper will be clearly specifiedin the acceptance message. Both the LNCS volume and the CD will be*available at the conference*.

A number of travel grants are made available by the UNESCO Chair inData Privacy, especially for authors and delegates from transitioncountries. Information on grants is posted in the conference web site.

************************************************************ 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/***********************************************************

The Department of Mechanical and Aerospace Engineering of Strathclyde University (Glasgow, UK) is looking for a PhD candidate to work on a research topic focused on Robust Data-Driven Optimisation for aerospace engineering applications.

Project Aims and ObjectiveThe recent world has seen an explosion of available data, gathered from sensors, experiments and direct measurements. The engineering world is shifting from model-centred simulations to the assimilation of data into the modelling process. This opens up a wide area of research where large datasets are used to fine tuning engineering models, design uncertainty sets and infer knowledge about unknown parameters. This is particularly true in optimisation under uncertainties where usually simulation code and an apriori knowledge of the uncertainty distribution of the parameters is known or is assumed to be known. Bringing real data into this process will allow to design robust optimal solutions closer to the real industrial needs and more realistic uncertain scenarios. The main challenges in this field of research want to address the problems of efficiently handling and processing large quantity of data while extracting meaningful knowledge about the optimisation problem and uncertainty sets.

************************************************************ 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/***********************************************************

A joint postdoctoral fellowship will be available at MPII (Saarbruecken)and Universidad de Chile (Santiago) starting in August 2016, or by mutualagreement at any date thereafter. The position is funded by the MPII-UChilecollaborative grant "Fast algorithms for Massive Data Set", therefore weare looking for applicants with interests in the design and analysis ofalgorithms.

The position is for 12 months renewable by mutual agreement. The selectedcandidate will spend 6 months at U. de Chile working with Jose Correa, JoseSoto, Jose Verschae and/or Andreas Wiese and 6 months at MPII working withresearchers from the Algorithms and Complexity group (e.g., ParinyaChalermsook, and/or Antonios Antoniadis). Travel support is available.

Applicants must hold a recent PhD or be close to finishing their thesis.Applications including curriculum vitae, list of publications, researchplan (1 page), and names of references with their e-mail addresses, shouldbe sent electronically to Jose Soto jsoto@dim.uchile.cl . To ensure fullconsideration the application should be sent before the deadline of June1st, 2016. Late applications might be considered on a case by case basis.

The Max-Planck-Institute for Informatics (MPII) is located on the campus ofthe Universitaet des Saarlandes in Saarbruecken, Germany. Currently, around40 researchers of several nationalities work in the Algorithms andComplexity Department. The working language is English. The groupcollaborates with several of the major research institutions in Europe andthe U.S. and has high international visibility.

The University of Chile is the main research institution in Chile. Itsschool of Physical and Mathematical Sciences gathers 200+ full timeprofessors together with a large number of postdocs and researchers. Theschool provides one of the very best research environments in Latin Americafor exact sciences and technology.

<div dir=3D"ltr"><div>A joint postdoctoral fellowship will be available at =MPII (Saarbruecken) and Universidad de Chile (Santiago) starting in August =2016, or by mutual agreement at any date thereafter. The position is funded= by the MPII-UChile collaborative grant &quot;Fast algorithms for Massive D=ata Set&quot;, therefore we are looking for applicants with interests in th=e design and analysis of algorithms.</div><div><br></div><div>The position =is for 12 months renewable by mutual agreement. The selected candidate will= spend 6 months at U. de Chile working with Jose Correa, Jose Soto, Jose Ve=rschae and/or Andreas Wiese and 6 months at MPII working with researchers f=rom the Algorithms and Complexity group (e.g., Parinya Chalermsook, and/or =Antonios Antoniadis). Travel support is available.</div><div><br></div><div=>Applicants must hold a recent PhD or be close to finishing their thesis. A=pplications including curriculum vitae, list of publications, research plan= (1 page), and names of references with their e-mail addresses, should be s=ent electronically to Jose Soto <a href=3D"mailto:jsoto@dim.uchile.cl">jsot=o@dim.uchile.cl</a> . To ensure full consideration the application should b=e sent before the deadline of June 1st, 2016. Late applications might be co=nsidered on a case by case basis.</div><div><br></div><div>The Max-Planck-I=nstitute for Informatics (MPII) is located on the campus of the Universitae=t des Saarlandes in Saarbruecken, Germany. Currently, around 40 researchers= of several nationalities work in the Algorithms and Complexity Department.= The working language is English. The group collaborates with several of th=e major research institutions in Europe and the U.S. and has high internati=onal visibility.</div><div><br></div><div>The University of Chile is the ma=in research institution in Chile. Its school of Physical and Mathematical S=ciences gathers 200+ full time professors together with a large number of p=ostdocs and researchers. The school provides one of the very best research =environments in Latin America for exact sciences and technology.</div></div=>

--94eb2c0827ba2929b20531a20aac--************************************************************ 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/***********************************************************

We could accommodate a few more chapters in our upcoming book on Security Solutions and Applied Cryptography in Smart Grid Communications. If you are interested, kindly directly submit your full chapter by 15 May 2016 (the latest time in earth) at the following URL:

IntroductionElectrical energy storage is a key factor for the future. The consumption of electrical energy (i.e. the use of air conditioning, audio and video devices or electric heating) is increasing every year due; firstly to the increase of the population and secondly by the appearance of new uses of consumption, such as electric cars. With this increase consumption, how to ensure the balance between supply and demand for electricity at all times? To address this problem, the idea of placing the new generation of smart grids to control this energy has appeared in recent literature in different flavors in order to provide electric power supply secure, sustainable and competitive to consumers. In addition, the revolution in smart grid involves a significant change in side of the consumer where consumers will also become producer with the ability of energy storage such as in the vehicle battery, or as a local generation sources such as photovoltaic panels. However, the smart grid develops modern solutions for the next-generation network and digital communication in which many systems and subsystems are interconnected to provide services from end-to-end network between various actors and between intelligent devices that are deployed there. Within each network, a hierarchical structure is composed of different types of networks, such as the HANs (Home Area Networks), the BANs (Building Area Networks), the IANs (Industrial Area Networks), the NANs (Neighborhood Area Networks), the FANs (Field Area Networks), and the WANs (Wide Area Networks). Currently, large societies propose the use of cloud computing in smart grid applications connected with the electrical control center. The main problem in the development of a smart grid is not located at the physical medium but mainly in delivery of reliability and security. The possibility of fitting with active or passive attacks in smart grid network is great to divulge privacy and disrupt energy (e.g. Wormhole Attack, False Data Injection Attack, Black Hole Attack, Grey Hole Attack, DoS Attack, Physical Layer Attack, Colluding Adversary Attack, Routing Table Overflow Attack etc.). Therefore, the security requirements, including authentication, accountability, integrity, non-repudiation, access control and confidentiality should be paid more attention in the future for high performance smart grids. This book will cover the current scope of various methodologies and mechanisms in the theory and practice of security, privacy, intrusion detection, and applied cryptography in smart grid communications in one place.

ObjectiveThis comprehensive and timely publication aims to be an essential reference source, building on the available literature in the field of smart grid security in developing countries while providing for further research opportunities in this dynamic field. It is hoped that this text will provide the resources necessary for policy makers, technology developers and managers to adopt and implement smart grid platforms in developing nations across the globe.

Target AudiencePolicy makers, academicians, researchers, advanced-level students, technology developers, and government officials will find this book useful in furthering their research exposure to pertinent topics in smart grid security and assisting in furthering their own research efforts in this field.

Recommended TopicsThis book will include (but will not be limited to) the following topics. Any other related topics in the area of smart grid security are also welcome :

Submission ProcedureResearchers and practitioners are invited to submit on or before March 5, 2016 (Extended), a 2-3 page chapter proposal clearly explaining the mission and concerns of his or her proposed chapter. Authors of accepted proposals will be notified by March 10, 2016 about the status of their proposals and sent chapter guidelines. Full chapters are expected to be submitted by May 15, 2016. All submitted chapters will be reviewed on a double-blind review basis. Contributors may also be requested to serve as reviewers for this project. Chapters with multiple authors are welcome, even encouraged.

PublisherThis book is scheduled to be published by IGI Global (formerly Idea Group Inc.), publisher of the "Information Science Reference" (formerly Idea Group Reference), "Medical Information Science Reference," "Business Science Reference," and "Engineering Science Reference" imprints. For additional information regarding the publisher, please visit www.igi-global.com. This publication is anticipated to be released in 2016.

Summer school:Quantitative decision support in maritime shippingatTechnical University of Denmark.1st to 9th of August 2016

The focus of the course is on liner shipping and covers the areas Hinterland transport, pre-marshalling, berth scheduling, stowage, routing of containers, empty container repositioning, vessel repositioning, speed optimization, bunker purchasing and network design. The course will have presenters from Maersk and Optivation presenting their decision problems and decision support tools.

Presentation and exercises from the 1st of August to the 5th of August and the 8th and 9th of August. The course is finalized by a report by choice on a research article in the research area or on an assignment provided. The course is 5 ECTS and there is no registration fee. The course is limited to 15 participants.

Please contact Line Blander Reinhardt LBRE @ dtu.dk to sign up for the course.

************************************************************ 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/***********************************************************

All research in algorithmic work in bioinformatics, computational biology and systems biology. The emphasis is mainly on discrete algorithms and machine-learning methods that address important problems in molecular biology, that are founded on sound models, that are computationally efficient, and that have been implemented and tested in simulations and on real datasets. The goal is to present recent research results, including significant work-in-progress, and to identify and explore directions of future research.

Topics:

Original research papers (including significant work-in-progress) or state-of-the-art surveys are solicited in all aspects of algorithms in bioinformatics, computational biology and systems biology - including, but not limited to:

* Methods, software, and data repositories for development and testing of such algorithms and their underlying models, as well as high-performance computing approaches to hard learning and optimization problems.

Proceedings will be published in the Springer series Lecture Notes inBioinformatics, where accepted papers will be allotted 12 pages.Selected papers will also be invited for an extended publication in athematic series in Algorithms for Molecular Biology (AMB).

************************************************************ 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/***********************************************************

The submission deadline of the 10th Multidisciplinary Workshop onAdvances in Preference Handling (M-PREF) at IJCAI 2016 has beenextended by one week. The new deadline is now *May 8th*.

M-PREF is a non-archival venue and there will be no publishedproceedings. However, informal proceedings will be provided at theworkshop and the papers will be posted on the website. Therefore itwill be possible to submit to other conferences and journals both inparallel and subsequent to M-PREF 2016.

======================================================================CALL FOR PAPERS:

Preference handling has become a flourishing topic. There are manyinteresting results, good examples for cross-fertilization betweendisciplines, and many new questions.

Preferences are a central concept of decision making. As preferencesare fundamental for the analysis of human choice behavior, they arebecoming of increasing importance for computational fields such asartificial intelligence, databases, and human-computer interaction aswell as for their respective applications. Preference models areneeded in decision-support systems such as web-based recommendersystems, in automated problem solvers such as configurators, and inautonomous systems such as Mars rovers. Nearly all areas of artificialintelligence deal with choice situations and can thus benefit fromcomputational methods for handling preferences. Preference handling isalso important for machine learning as preferences may guide learningbehavior and be subject of dedicated learning methods. Moreover,social choice methods are also of key importance in computationaldomains such as multi-agent systems.

This broadened scope of preferences leads to new types of preferencemodels, new problems for applying preference structures, and new kindsof benefits. Preferences are studied in many areas of artificialintelligence such as knowledge representation & reasoning, multi-agentsystems, game theory, social choice, constraint satisfaction, decisionmaking, decision-theoretic planning, and beyond. Preferences areinherently a multi-disciplinary topic, of interest to economists,computer scientists, operations researchers, mathematicians and more.

This workshop promotes this broadened scope of preference handling andcontinues a series of events on preference handling at AAAI-02,Dagstuhl in 2004, IJCAI-05, ECAI-06, VLDB-07, AAAI-08, ADT-09,ECAI-2010, ECAI-2012, IJCAI-13, AAAI-14, and IJCAI-15. At theprevious edition of ADT-15 and LPNMR-15, which were co-located, one ofthe conclusions was that collaboration between the two areas can bevery fruitful and should be fostered.

The workshop will provide a forum for presenting advances inpreference handling and for exchanging experiences between researchersfacing similar questions, but coming from different fields. Theworkshop builds on the large number of AI researchers working onpreference-related issues, but also seeks to attract researchers fromdatabases, multi-criteria decision making, economics, etc.

======================================================================TOPICS OF INTEREST======================================================================

The workshop on Advances in Preference Handling addresses allcomputational aspects of preference handling. This includes methodsfor the elicitation, learning, modeling, representation, aggregation,and management of preferences and for reasoning about preferences. Theworkshop studies the usage of preferences in computational tasks fromdecision making, database querying, web search, personalizedhuman-computer interaction, personalized recommender systems,e-commerce, multi-agent systems, game theory, social choice,combinatorial optimization, planning and robotics, automated problemsolving, perception and natural language understanding and othercomputational tasks involving choices. The workshop seeks to improvethe overall understanding of and best methodologies for preferences inorder to realize their benefits in the multiplicity of tasks for whichthey are used. Another important goal is to providecross-fertilization between the numerous sub-fields that work withpreferences.

Researchers interested in preference handling from AI, OR, DB, CS orother computational fields may submit a paper formatted according tothe IJCAI Formatting Instructions and up to 6 pages in length + 1 pagefor references in PDF format. Workshop submissions and camera readyversions will be handled by EasyChair. Feel free to submit eitheranonymized or non-anonymized versions of your work. We have enabledanonymous reviewing so EasyChair will not reveal the authors unlessyou chose to do so in your submission.

At least one author from each accepted paper must register for theworkshop. Please see the IJCAI 2016 Website for information aboutaccommodation and registration.

Markus Endres, University of Augsburg (Germany)Nicholas Mattei, Optimization Research Group, Data 61 (NICTA) and University ofNew South Wales (Australia)Andreas Pfandler, TU Wien (Austria) and University of Siegen (Germany)

************************************************************ 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/***********************************************************

Many of you will be saddened to hear that Horst Sachs has died. He passed away on 25 April 2016, having turned 89 only a few weeks before, on 27 March. - Sachs founded the graph theory school in Ilmenau, which served as an important link between east and west during the iron curtain time and afterwards. More than a hundred scientific papers, among them the seminal book on graph spectra (with Doob and Cvetkovic), established his excellent international reputation. After his retirement in 1992 until his last months he continued his research and showed up regularly at the institute.

Thomas Böhme - Jochen Harant - Matthias Kriesell - Michael Stiebitz

************************************************************ 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/***********************************************************

Getting the highest performances with the lowest costs while respectingenvironmental constraints is one of the most important concerns of thedesigners of production and assembly systems. In addition to that, numeroussub-problems may be considered in the design procedure such as: bufferssizing, equipment selection, line balancing, etc. The aim of this sessionis to introduce heuristic and metaheuristic optimization methods developedto get an efficient design of production systems. We will focus on studiesthat propose approached optimization techniques to solve various designproblems. Regarding the optimization approaches, single criterion and multicriteria optimization approaches could be presented.

This special session will be held as part of the META'16 conference. Pleasesubmit your paper using the online submission system, as described in theinstructions for authors. During the submission process you should indicatethat the paper is for a special session, which is: '*Metaheuristics forsoftware engineering*'. Detailed instructions for submitting the papers areprovided on the conference home page at:http://meta2016.sciencesconf.org/

*​CATEGORIES OF SUBMISSIONS *Several categories of submissions may be accepted:

- *S1*: Extended abstracts of work-in-progress and position papersof a maximum of 3 pages- *S2*: Original research contributions of a maximum of 10 pages- *S3*: High-quality manuscripts that have recently, within thelast year, been submitted or accepted for journal publication

*CONFERENCE PROCEEDINGS *​​Accepted papers in categories *S1* and *S2* will be published in theproceedings that will be available at the conference. In addition, apost-conference Springer book and special issue of Journals is planned tobe published. Participants will be invited to submit extended versions oftheir work for consideration.

************************************************************ 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/***********************************************************

The Matheuristics workshop series is proposed as a primary forum forresearchers working on exploiting mathematical programming techniquesin a (meta)heuristic framework, granting to mathematical programmingapproaches the problem robustness and time effectiveness thatcharacterize heuristics, or exploiting the mathematical programmingmodel formulation in the customization of a heuristic for specific orgeneral problems.

Metaheuristics such as tabu search, simulated annealing, GRASP, VNS,genetic algorithms and ant colonies, have been originally proposed anddeveloped when the available Mixed Integer Programming (MIP)algorithms and software or Constraint Programming methods were not anefficient or even feasible alternative for solving real-world probleminstances, or significant subproblems thereof.

However, research on mathematical programming, and in particular ondiscrete optimization, has led to a state of the art where MIP solversor customized MIP codes can be effective even in a heuristic context,both as primary solvers or as subprocedures.

Matheuristics 2016 aims at collecting contributions that define thestate of the art for the computational effectiveness and efficiency orthe theoretical properties of matheuristics, which are algorithmsand codes that integrate metaheuristics and MIP strategies andsoftware. The workshop will be entirely devoted to this subject ofresearch and its applications. The conference program will consist ofplenary presentations, enriched by a couple of keynote or tutoriallectures. Topics of interest include (but are not limited to):

Although we do not discard their importance, Matheuristics 2016 is notinterested in heuristics tailored to a specific problem that have noelement which can be generalized to other problems (no matter howmathematically sophisticated they are) nor in metaheuristics variantsor implementations that are not justified by a mathematical model.

Submission Instructions========================

Submissions to Matheuristics 2016 should be comprehensive and self-contained,and relevant to the topic of the workshop.

Submissions can be done in one of three categories:

* Contributed article of up to 12 pages. These will be distributed in informal proceedings for the workshop.* Short abstracts of up to 4 pages. Abstracts should be extensive enough to let referees judge the quality and relevance of the work.* Work that has recently been published or submitted elsewhere (journal or high-quality conferences) and is relevant for the workshop for oral presentation only (free format).

The workshop will have informal proceedings that are distributedthrough the Matheuristics 2016 webpage.

The post-conference publication will happen through a special issue in the journal International Transactions in Operational Research (ITOR).

Further Information====================

Up-to-date information will be published on the web siteiridia.ulb.ac.be/matheuristics2016. For information about localarrangements, registration forms, etc., please refer to theabove-mentioned web site or contact the local organizers at theaddress below.

Matheuristics 2016 will be organized back-to-back with ANTS 2016, http://iridia.ulb.ac.be/ants2016/ and the two conferences will share an invited talk and coffee breaks.

************************************************************ 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/***********************************************************

We are proud to announce the release of a major update of our graph partitioning framework KaHiP (Karlsruhe High Quality Graph Partitioning). KaHiP is a family of high quality graph partitioning programs. It contains various graph partitioning algorithms that can be configured to either achieve the best known partitions for many standard benchmark instances or to be a good tradeoff between partition quality and running time. Since our first major release we added:

- advanced multilevel node separator algorithms based on max-flow min-cut computations- better support for social networks and web graphs by using clustering-based contractions- size-constraint label propagation- a java interface as well as some bug fixes

We are glad for any comments and error reports (or even bug fixes) that you send us.

Peter Sanders and Christian Schulz,Karlsruhe Institute of Technology (KIT)************************************************************ 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/***********************************************************

Thursday, April 28, 2016

The Proceedings will be published in the Proceedings of the First International Conference on Real-Time Intelligent Systems, Volume 1 RTIS 2016. (http://www.springer.com/series/11156)

About the Conference

Real-Time Computing covers a broad spectrum of the intensively developing area of low-latency priority-driven system responsiveness under certain time constrains to essential and decisive human-computer interactions with constantly incoming data stream. Research on real-time intelligent systems is of a multi-disciplinary nature, exploiting concepts from the areas as diverse as signal processing technologies, computational intelligence, location systems, data processing, digital document processing and embedded system design. To accomplish its real-time performance, systematic analysis is carried out when the systems are working.

Therefore, over the last few years real-time intelligent computing has radically transformed human life style. In the today's competitive and highly dynamic environment, analyzing data in real time is a must to understand in detail how the systems are processing the data and to reason the outputs and anticipate the trends in intelligent computing, has become critical.

To leverage the full potential of the opportunity build complex real time systems, intense research is required and this conference will serve as one such platform to manifest the ongoing research in the real time intelligence system.The conference welcomes theoretically grounded, methodologically sound research papers from academia and industry that address variety of aspects and innovations related to real-time computing systems.

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

************************************************************ 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/***********************************************************

The 9th International Symposium on Algorithmic Game Theory (SAGT) will take place in Liverpool, UK, September 19-21, 2016. The purpose of SAGT is to bring together researchers from Computer Science, Economics, Physics, Biology and Mathematics to present and discuss original research at the intersection of Algorithms and Game Theory.

The program of SAGT will include both invited talks and presentations for refereed submissions. Confirmed invited speakers are

Authors are invited to submit previously unpublished work on any aspects of algorithmic game theory for possible presentation at the conference. For more detailed call for papers, submission guidelines and instructions see http://sagt16.csc.liv.ac.uk/cfp.html.

It is expected that every accepted paper will be presented at the symposium by one of the authors.

************************************************************ 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/***********************************************************

SIROCCO is devoted to the study of the interplay between communication and knowledge in multi-processor systems from both the qualitative and quantitative viewpoints. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs.

SIROCCO has a tradition of interesting and productive scientific meetings in a relaxed and pleasant atmosphere, attracting leading researchers in a variety of fields in which communication and knowledge play a significant role.

SCOPE

Original papers are solicited from all areas of study of local structural knowledge and global communication and computational complexities. Among the typical areas are distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, and communication complexity. Keeping with the tradition of SIROCCO, new areas are always welcome.

Authors are invited to submit their work in one of the three acceptable formats: novel research contributions, position papers, and surveys. Original research papers must contain results that have not previously appeared and have not been concurrently submitted to a journal or conference with published proceedings. In all cases, any partial overlap with any published or concurrently submitted paper must be clearly indicated.

All submissions must be in English, in PDF format. You can use either of the following layouts for your submissions:

Additional details may be included in an appendix, to be read at the programme committee's discretion.

PROCEEDINGS

The post-proceedings of SIROCCO 2016 will be published by Springer in the Lecture Notes in Computer Science series (LNCS) after the conference.

We will also prepare an informal pre-proceedings volume with author-prepared versions of the papers. The pre-proceedings will be freely available online on the conference web page before the conference.

SPECIAL ISSUE

Selected papers from SIROCCO 2016 will be invited to a special issue of the Theoretical Computer Science journal.

BEST PAPER AWARD

The authors of the best paper will be awarded a prize of 1000 EUR (in total, to be split among the authors), sponsored by Springer. The program committee may choose to split the award among multiple papers.

Please refer to the conference web page at http://sirocco2016.hiit.fi/for more information on SIROCCO 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/***********************************************************

Also, separately, the University of Rochester's Institute for Data Science (which is a close partner to the CS department, and we'll share a new building both will move into in 2017) is recruiting for one full-time Lecturer in Data Science and Computer Science. The ad for that can be found at https://www.rochester.edu/data-science/jobs.html

If these fit you and are of interest to you, please rush to your browser and apply!! (And in case after reading the long versions of the ads you have questions about these positions, fyi the chairs of the CS department and the data science institute are, respectively, Prof. Sandhya Dwarkadas (dwarkadas@cs.rochester.edu) and Prof. Henry Kautz (kautz@cs.rochester.edu).)

Sincerely,Lane A. Hemaspaandra, URCS (the short version of the CS ad is included below)

Lecturer Positions in Computer Science

The University of Rochester Department of Computer Science seeks applicants for two full time lecturer positions. Candidates must have a PhD in computer science or a related discipline and/or significant teaching experience. The preferred candidate will have college teaching experience, a strong commitment to working with students, the ability and passion to help develop new courses along with any necessary labs, and high personal motivation and responsibility. The position may start as early as July 1, 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/***********************************************************

Algorithms have become a fundamental tool in several fields outside of Computer Science, and in several applications algorithms have to cope with computationally hard problems and problems in which the input is gradually disclosed over time. The workshop focuses on the design and analysis of approximation and online algorithms.

WAOA 2016 will be part of ALGO 2016 (http://conferences.au.dk/algo16/home/), which also hosts ESA, ALGOCLOUD, ALGOSENSORS, ATMOS, IPEC, WABI and MASSIVE. ALGO 2016 will take place 22-26 August 2016 in Aarhus, Denmark.

TopicsPapers are solicited in all research areas related to approximation and online algorithms, including, but not limited to:

Proceedings will be published after the workshop takes place in the Springer series Lecture Notes in Computer Science. Instructions for authors can be found at Springer web site (www.springer.com/lncs).

Submission guidelines:

Authors are invited to submit an extended abstract or full paper of at most 12 pages in Springer's LNCS style (please add page numbers) describing original unpublished research. Simultaneous submission to other conferences with published proceedings is not permitted. The title page of the submission should include the authors' full names, addresses, e-mail addresses, and an abstract summarizing the results in roughly 100-200 words; the remainder of the submission should contain a description of the main results and an explanation of their importance. The submission must include a full proof of the results, part of which can be placed in the appendix, whose length is not constrained. Papers should be submitted electronically via the EasyChair submission system at:

************************************************************ 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/***********************************************************