Monday, December 18, 2017

[DMANET] Lecturer / Senior Lecturer / Associate Professor position at UNSW Sydney in Algorithms

UNSW Sydney seeks applications for a tenure-track position in Algorithms.
Closing date: 23 February 2018 (midnight, Sydney time).


--------------------------------------------------------------
Lecturer / Senior Lecturer / Associate Professor in Algorithms
School of Computer Science and Engineering
Faculty of Engineering
UNSW Sydney
Job ID 60594
--------------------------------------------------------------

[Note: UNSW also has Lecturer to Professor position openings in Data Science (job ID 60687) and in Medical Image Computing (job ID 60689) with application deadlines on 23 February 2018.]

- One of the world's top engineering universities
- Cutting edge facilities and world-leading researchers
- Commitment to educational excellence and innovation in teaching

At UNSW, we pride ourselves on being a workplace where the best people come to do their best work.

UNSW Engineering is recruiting outstanding and inspirational individuals to join our world-leading group of researchers and teachers to build on our success and take the Faculty into the world's top 20 engineering faculties.

As Australia's leading engineering faculty, we create bold new solutions to globally relevant challenges to improve lives. We combine the world's best facilities and innovative research with an exciting and connected education experience to open doors for our graduates.


About the role.
---------------
We are recruiting for an exceptional candidate into the School's research priority area of Algorithms.

The role will conduct high impact research in Algorithms, and deliver outstanding teaching and student experience in the discipline of Computer Science and Engineering, build industry engagement and contribute significantly to the leadership, service and engagement missions of the School and Faculty.

The appointment would be:
- at level B ($103K - $121K per annum), level C ($125K - $143K per annum) or level D ($149K - $164K per annum), plus 17% superannuation (retirement fund) and leave loading per annum, commensurate with academic qualifications and experience,
- full time
- to a Convertible Tenure Track Employment Contract for an initial fixed term period of 5 years, with conversion to continuing appointment based on satisfactory performance and there being sufficient productive work available.

The Faculty reserves the right to offer an appointment on a continuing basis or to directly appoint to advertised positions.


The School of Computer Science and Engineering.
-----------------------------------------------
UNSW's School of Computer Science and Engineering is one of the largest and most prestigious computing schools in Australia. It offers undergraduate programs in Software Engineering, Computer Engineering, Computer Science and Bioinformatics, as well as a number of combined degrees with other disciplines. It attracts excellent students who have an outstanding record in international competitions. At the postgraduate level there is a large PhD research program and coursework programs at the Master's and Graduate Diploma level in Computing and Information Technology and at Graduate Certificate level in Computing. Our research mission is to be at the forefront of research into new and exciting innovations with profound national and international impact. For further information about the School, please visit http://www.cse.unsw.edu.au/

UNSW Algorithms group: http://www.cse.unsw.edu.au/~algo/

About you.
----------
We are looking for an exceptional candidate who has:
- A PhD in a relevant field
- Proven track record in research and attracting research funding
- A commitment to delivering high quality and innovative teaching at undergraduate and graduate levels.

UNSW desires to be the exemplar Australian university and employer of choice for people from diverse backgrounds. UNSW aspires to ensure equality in recruitment, development, retention and promotion of staff, paying particular attention to ensuring no-one is disadvantaged on the basis of their gender, cultural background, disability or Indigenous origin.

Engineering strongly encourages female applicants and actively supports women to succeed through specific Faculty and UNSW initiatives and generous parental leave provisions and flexible work practices.

Applicants with industry experience are especially welcome.

The preferred candidate will be required to undergo pre-employment checks prior to appointment.


How to apply.
-------------
Submit your application through www.jobs.unsw.edu.au Job ID 60594

Be sure to review the position documentation and systematically address the selection criteria in your application.

Any enquiries can be forwarded to Professor Maurice Pagnucco, Head of School
E: m.pagnucco@unsw.edu.au
T: +61 9385 5518

Applications close: Midnight, Friday 23 February 2018 (AEDT)

Job description: https://applicant.cghrm.unsw.edu.au/psp/hrm/NS_CAREERS/HRMS/c/HRS_HRAM.HRS_APP_SCHJOB.GBL?Page=HRS_APP_JBPST&Action=U&FOCUS=Applicant&SiteId=1&JobOpeningId=60594&PostingSeq=1

**********************************************************
*
* 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 17, 2017

[DMANET] The 2018 Edsger W. Dijkstra Prize in Distributed Computing

The 2018 Edsger W. Dijkstra Prize in Distributed Computing

http://www.podc.org/dijkstra/
http://www.disc-conference.org/wp/dijkstra-prize/

Nominations deadline: March 15, 2018


The Edsger W. Dijkstra Prize in Distributed Computing is named for Edsger Wybe Dijkstra (1930-2002), a pioneer in the area of distributed computing. His foundational work on concurrency, semaphores, mutual exclusion, deadlock, finding shortest paths in graphs, fault-tolerance, self-stabilization, among many other contributions comprises one of the most important supports upon which the field of distributed computing is built. No other individual has had a larger influence on research in principles of distributed computing.

The prize is given for outstanding papers on the principles of distributed computing, whose significance and impact on the theory and/or practice of distributed computing has been evident for at least a decade. The Prize includes an award of $2000.

The Prize is sponsored jointly by the ACM Symposium on Principles of Distributed Computing (PODC) and the EATCS Symposium on Distributed Computing (DISC). This award is presented annually, with the presentation taking place alternately at ACM PODC and EATCS DISC. In 2018 it will be presented at PODC 2018 (Royal Holloway University, UK). The winners of the award will share the cash award, and each winning author will be presented with a plaque. An announcement of each year's prize recipient(s) will be included in the PODC and DISC proceedings of that year, describing the paper's lasting contributions.


Nominations and Eligibility:

Nominations may be made by any member of the scientific community. Each nomination must identify the paper being nominated and include a support letter justifying the nomination, as well as a one-paragraph summary. Papers appearing in any conference proceedings or journals are eligible, as long as they have had a significant impact on research areas of interest within the theory of distributed computing community, and as long as the year of the original publication is at least ten years prior to the year in which the award is given.

Papers authored or co-authored by members of the Award Committee will not be eligible for consideration. Members of the Award Committee can nominate papers as well. However, they must carefully consider nominations from within the community. Members of the Award Committee will be especially sensitive to conflict-of-interests issues if papers by former students or close colleagues are nominated (members of the Award Committee cannot nominate such papers themselves).

Your nomination must be sent to the chair of the Award Committee of this year, Ulrich Schmid (s@ecs.tuwien.ac.at). The nominations deadline is March 15, 2018.


Selection Process:

Although the Award Committee is encouraged to consult with the distributed computing community at large, the Award Committee is solely responsible for the selection of the winner of the award. The prize may be shared by more than one paper. All matters relating to the selection process that are not specified here are left to the discretion of the Award Committee.

The list of past winners can be found at http://www.podc.org/dijkstra/ or http://www.disc-conference.org/wp/dijkstra-prize/


Award Committee 2018:

Yehuda Afek, Tel-Aviv University
Idit Keidar, Technion
Boaz Patt-Shamir, Tel-Aviv University
Sergio Rajsbaum, UNAM
Ulrich Schmid (chair), TU Wien
Gadi Taubenfeld, IDC Herzliya


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

Saturday, December 16, 2017

[DMANET] Einstein Workshop "Discrete Geometry and Topology"

Einstein Workshop "Discrete Geometry and Topology"
———————————————————————

Freie Universität Berlin, March 13-16, 2018
http://www.mi.fu-berlin.de/en/math/groups/discgeom/Events/DiscGeomTop

This will be a four day workshop with lectures, presentations and informal discussions on discrete geometry and topology, and related topics (combinatorial topology, computational geometry, polytope theory). It is primarily funded by the Einstein Foundation Berlin, as part of Francisco Santos' Einstein Visiting Fellowship. Additional funding is provided by the project Discretization in Geometry and Dynamics (SFB Transregio 109) and the Berlin Mathematical School.

Confirmed Speakers:
• Karim Adiprasito, Hebrew Univ. Jerusalem and Uni. Leipzig
• Ulrich Bauer, T. U. Munich
• Tristram Bogart, Los Andes University, Bogotá
• Bernardo González-Merino, U. Center of Defence, Murcia
• Gaku Liu, MPI Leipzig
• Martina Juhnke-Kubitzke, Universität Osnabrück
• Monika Ludwig, T. U. Vienna
• Eran Nevo, Hebrew University, Jerusalem
• Isabella Novik, U. of Washington, Seattle
• Guillermo Pineda-Villavicencio, Federation University Australia, Ballarat
• Alexander Postnikov, MIT, Boston
• Eric Sedgwick, De Paul University, Chicago
• Bernd Sturmfels, MPI Leipzig
• Uli Wagner, IST Austria, Vienna

Posters:
There will be some poster sessions for participants to present their work, if they wish. If you are interested in presenting a poster say so in the registration form.

Registration:
To register, fill out and submit the registration form no later than January 31, 2018. Registration is free but having a list of registered participants helps us in the organization.

Support:
We have some funds to cover local expenses of a number of participants. If you need support, say so when registering. Priority will be given to younger participants and the deadline for support application is January 31, 2018

Organizers:
Michael Joswig Technische Universität Berlin
Francisco Santos Universidad de Cantabria
Jonathan Spreer Freie Universität Berlin
Günter Ziegler Freie Universität Berlin

Sincerely,

F. Santos (on behalf of the organizers)

--
Francisco Santos, francisco.santos@unican.es
Departamento de Matematicas, Estadistica y Computacion
Universidad de Cantabria, E-39005 Santander, SPAIN.
Phone: +34-942-201522 - Fax: +34-942-201402
http://personales.unican.es/santosf


**********************************************************
*
* 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] Postdoc in economic and computation at RPI

One funded postdoc position is available in Professor Lirong Xia's group at
the computer science department of Rensselaer Polytechnic Institute.

1. Start date and duration: flexible, tentatively August, 2018 to July 2020.

2. Research focus: applicants in the general field of economics and
computation are welcome. We are particularly looking for applicants with
strong background in computational social choice, group decision-making,
game theory, machine learning, or information aggregation.

3. Deadline: applications received by March 1 will be given full
consideration.

4. How to apply: please send a CV, research statement , and have two
recommendation letters sent to xialirong@gmail.com. Please feel free to
contact the same email address for questions.

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

Friday, December 15, 2017

[DMANET] PODC 2018 Call for Workshops

CALL FOR WORKSHOPS

PODC 2018
July 23-27, 2018, London, United Kingdom
http://www.podc.org/

The 37th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2018) invites proposals for half-day and full-day workshops that are related to the current scope of the conference or are new emerging research fields complementing or extending it, including but not restricted to:

- distributed algorithms: design, analysis, and complexity
- communication networks: algorithms, architectures, services, protocols, applications
- multiprocessor and multi-core architectures and algorithms
- shared and transactional memory, synchronization protocols, concurrent programming
- fault-tolerance, reliability, availability, self-organization, self-stabilization
- codes and reliable communication
- Internet applications, social networks, recommendation systems
- dynamic, adaptive and machine learning based distributed algorithms
- distributed operating systems, middleware platforms, databases
- game-theoretic approaches to distributed computing
- distributed mechanisms design
- peer-to-peer systems, overlay networks, distributed data management
- high-performance, cluster, cloud and grid computing
- wireless networks, mobile computing, autonomous agents and robots
- context-aware distributed systems
- security in distributed computing, cryptographic protocols
- distributed cryptocurrencies and blockchain protocols
- quantum and optics based distributed algorithms
- nanonetworks
- biological distributed algorithms
- sensor, mesh, and ad hoc networks
- specification, semantics, verification of concurrent systems

Workshops will be held in conjunction with PODC on Monday, July 23, 2018 and on Friday, July 27, 2018. Interested members of the community are invited to send proposals for workshops by email to the conference General Chair:

Calvin Newport <cnewport@cs.georgetown.edu>

A workshop proposal should include a description of the subject matter it would cover, the proposed format (e.g., invited speakers, peer-reviewed papers with a proceedings, etc.), and plans for recruiting attendees.

We will be accepting proposals throughout the month of January and will consider them as they arrive. We cannot guarantee to give consideration to proposals arriving after January as we will begin the process of locking in the schedule soon after that point.


**********************************************************
*
* 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 Papers: WG2018

[Please accept our apologies if you receive multiple copies of this email]


WG 2018: CALL FOR PAPERS

44th International Workshop on Graph-Theoretic Concepts in Computer Science

June 27-29 2018, Schloss Lübbenau (near Cottbus), Germany

Website: http://www.wg2018.b-tu.de (will be online next week)

The WG 2018 conference is the 44th edition of the WG series. It will
take place in Schloss Lübbenau in the middle of Spreewald, near
Cottbus, Germany. The conference will take place from Wednesday June
27 to Friday June 29, 2018. Participants are expected to arrive in
Lübbenau on Tuesday June 26, to join the welcome reception in the
evening.


IMPORTANT DATES

Submission of papers: February 26, 2018
Acceptance notification: April 23, 2018
Conference: June 27-29, 2018
Final version: July 31, 2018


AIMS AND SCOPE

WG conferences aim to connect theory and applications by demonstrating
how graph-theoretic concepts can be applied in various areas of
computer science. The goal is to present recent results and to
identify and explore directions for future research. Submitted papers
should describe original results in any aspects of graph theory
related to computer science, including but not restricted to:

- design and analysis of sequential, parallel, randomized,
parameterized, and distributed graph and network algorithms,
- structural graph theory with algorithmic or complexity applications,
- computational complexity of graph and network problems,
- graph grammars, graph rewriting systems and graph modeling,
- graph drawing and layouts,
- computational geometry,
- computational biology,
- random graphs and models of the web and scale-free networks, and
- support of these concepts by suitable implementations and
applications.


SUBMISSIONS AND PROCEEDINGS

Contributors are invited to submit an extended abstract of at most 12
pages Springer LNCS format including title, abstract, but excluding
references, without changes to the settings of margins and vertical
spacing, and with numbered pages. Proofs omitted due to space
restrictions must be placed in an appendix, to be read by program
committee members at their discretion. Simultaneous submission of
papers to any other conference with proceedings published or made
publicly available, or submitting papers previously accepted for
journal publication is not allowed. Invited papers and accepted
contributions will be published in the conference proceedings in the
Lecture Notes in Computer Science (LNCS) series of Springer-Verlag.

Please submit your paper electronically at:

https://easychair.org/conferences/?conf=wg2018


BEST PAPER AWARD AND BEST STUDENT PAPER AWARD

Thanks to a generous donation by Springer Verlag, WG 2018 is able to
offer awards of 500 Euro for the best paper and the best student
paper. The awards will be decided by the program committee. The
committee can decide to split the award(s) over multiple papers.
Papers eligible for the best student paper can have non-student
co-authors, but the main work in a paper that is a candidate for the
best student paper award must be done by co-authors that were students
at the time of submission, and the award can be received only by such
co-authors. It must be indicated at the time of submission whether a
paper is candidate for this award.


INVITED SPEAKERS

Maria Chudnovsky (Princeton University, USA)
Martin Milanic (University of Primorska, Koper, Slovenia)
Martin Skutella (TU Berlin, Germany)


PROGRAM COMMITTEE

Therese Biedl (University of Waterloo, Canada)
Andreas Brandstädt (Universität Rostock, Germany, co-chair)
Kathie Cameron (Wilfrid Laurier University, Waterloo, Canada)
Steven Chaplick (Julius-Maximilians-Universität Würzburg, Germany)
Derek Corneil (University of Toronto, Canada)
Feodor Dragan (Kent State University, USA)
Thomas Erlebach (University of Leicester, United Kingdom)
Celina de Figueiredo (Universidade Federal do Rio de Janeiro, Brazil)
Fedor Fomin (University of Bergen, Norway)
Michel Habib (IRIF, CNRS, Université Paris-Diderot, France)
Pinar Heggernes (University of Bergen, Norway)
Ekkehard Köhler (BTU Cottbus-Senftenberg, Germany, co-chair)
Jan Kratochvíl (Charles University, Prague, Czech Republic)
Dieter Kratsch (Université de Lorraine, Metz, France)
Ross McConnell (Colorado State University, Fort Collins, USA)
Klaus Meer (BTU Cottbus-Senftenberg, Germany, co-chair)
Petra Mutzel (TU Dortmund, Germany)
Christophe Paul (LIRMM, CNRS, Université de Montpellier, France)
Dieter Rautenbach (Universität Ulm, Germany)
Ignasi Sau (LIRMM, CNRS, Université de Montpellier, France)
Oliver Schaudt (RWTH Aachen, Germany)
Dimitrios M. Thilikos (LIRMM, CNRS, Université de Montpellier, France,
and National and Kapodistrian University of Athens, Greece)
Annegret Wagler (Université Clermont Auvergne, Clermont-Ferrand, France)


LOCAL ORGANIZING COMMITTEE:

Jesse Beisegel
Carolin Denkert
Romain Gengler
Diana Hübner
Uwe Jähnert
Karla Kersten
Ekkehard Köhler
Klaus Meer
Robert Scheffler
Martin Strehler


CONTACT INFORMATION

wg2018@lists.b-tu.de

**********************************************************
*
* 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] 2nd AIROYoung Workshop – Fee waiver and travel grants for young researchers

We are pleased to announce the 2nd AIROYoung Workshop which will take
place on March 1-2 at the University of Calabria, Italy, on the topic:
Logistics Optimisation and Applied Operational Research.

AIROYoung is the youth chapter of AIRO, the Italian O.R. Society. The
AIROYoung workshop is the perfect venue for PhD students and young
researchers to showcase their work, get feedback and network.

To increase the participation of young researchers, we offer the
following support:
* No enrollment fee;
* Free accommodation for 3 nights (28 Feb, 01 and 02 Mar);
* Free meals (2 lunches and one social dinner);
* Free shuttle from Lamezia Terme Airport (SUF).
Travel support is offered on a first-come, first-serve basis, until
there are available funds.

This year's invited speakers are:
* Geir Hasle, Acting Research Manager, Group of Optimisation,
Mathematics and Cybernetics, SINTEF Digital (Oslo, Norway)
* Roberto Roberti, Assistant Professor in Logistics, School of
Business and Economics, Vrije Universiteit (Amsterdam, the
Netherlands)

Contributed talks are welcome on all topics pertaining to O.R.

Other information can be found at the workshop's website:
https://workshop.airoyoung.org/

The organising committe,

Annarita De Maio

Giusy Macrina

Rosario Paradiso

Vittorio Solina

**********************************************************
*
* 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] PhD position (fully funded, 100%) in cryptography, bioinformatics

The Computational Biology and Simulation group invites applications for
a research assistant/Ph.D. student position. The PhD degree can be
awarded either in computer science or biology.

The research effort is part of the BMBF-funded HiGHmed consortium and
will focus on the cryptographically assurance of
bioinformatics/biostatistical procedures to maintain privacy of patients
in medical research and care.

Ideally, you have a background (M.Sc. degree) in computer science,
bioinformatics, mathematics, or statistics. Willingness to acquire
additional know-how, e.g., human genetics, is mandatory, as well as the
ability to work in an interdisciplinary setting together with, e.g.,
biomedical researchers and clinicians.

The position is suppossed to be filled as soon as possible, as the
projects runs from Jan.2018 to 2021. The successful applicant will be
hired for a first phase until June 2019, subject to extension upon
satisfactory performance.

Details can be found on our homepage http://www.kay-hamacher.de and on
http://highmed.org

The Technische Universität Darmstadt intends to increase the number of
female researchers and encourages female candidates to apply. In
case of equal qualifications applicants with a degree of disability of
at least 50 or equal will be given preference. Wages and salaries are
according to the collective agreements on salary scales, which apply to
the Technische Universität Darmstadt (TV-TU Darmstadt).

Please address your applications to Prof. Dr. Kay Hamacher, TU
Darmstadt, Schnittspahnstr. 10, 64287 Darmstadt, or via email (only one
pdf-file!) to hamacher@bio.tu-darmstadt.de

For those who want to send their application confidentially,
gpg-encrypted emails are recommend. Kay Hamacher's GPG-Key is available
under
http://pgp.mit.edu:11371/pks/lookup?op=get search=0x506EACA65092F411

Code. No. 541

application deadline: 15-Jan-2018
**********************************************************
*
* 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 Papers: SetVR 2018 Workshop @ Diagrams 2018

Dear colleagues,

We invite submissions to International Workshop on Set Visualization and Reasoning 2018 (SetVR 2018).
https://sites.google.com/site/setvr2kn/current-workshop

Conference dates: 18th--22nd June, 2018
Location: Edinburgh, UK
Deadline for submission: 5th February, 2018

****************************************************************************
SetVR 2018 will be the 6th meeting, with the first one held in 2004, previously called the Euler Diagrams Workshop. It aims to promote theoretical, empirical, applied research on visualization and diagrammatic reasoning, especially, about sets (set-theoretical and grouped data). SetVR 2018 welcomes submissions of types: full papers (16 pages) and short papers (8 pages; at least 5 pages). Accepted papers are expected to be published on-line by CEUR Workshop Proceedings (CEUR-WS.org).

SetVR 2018 will run as part of Diagrams 2018 conference, which will be held from June 18th to 22nd in 2018, and is expected to occupy one day during this period. http://www.diagrams-conference.org/2018/

Organizers
Yuri Sato (University of Brighton, UK)
Zohreh Shams (University of Cambridge, UK)

Program Committee
Bilal Alsallakh (Bosch Research and Technology Center, USA)
Jim Burton (University of Brighton, UK)
Peter Chapman (Edinburgh Napier University, UK)
Renata De Freitas (Universidade Federal Fluminense, Brasil)
Mateja Jamnik (University of Cambridge, UK)
Sven Linker (University of Liverpool, UK)
Luana Micallef (Helsinki Institute for Information Technology HIIT, Finland)
Peter Rodgers (University of Kent, UK)
Gem Stapleton (University of Brighton, UK)

___________________________________________________________
This email has been scanned by MessageLabs' Email Security System
on behalf of the University of Brighton. For more information see:
https://staff.brighton.ac.uk/is/computing/Pages/Email/spam.aspx

**********************************************************
*
* 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, December 14, 2017

[DMANET] CFP: COMSOC-2018 (Seventh International Workshop on Computational Social Choice)

First Call for Papers: Seventh International Workshop on Computational
Social Choice

(COMSOC-2018)
Troy, NY, USA, June 25--27, 2018

Webpage: www.cs.rpi.edu/~xial/COMSOC18/main.html

***********************************************************
MISSION
***********************************************************

Computational social choice is a rapidly growing discipline at the
interface of social choice theory and computer science. It is concerned
with the application of computational techniques to the study of social
choice mechanisms, and with the integration of social choice paradigms into
computing. The aim of the workshop is to bring together different
communities: computer scientists interested in computational issues in
social choice; people working in artificial intelligence and multiagent
systems who are using ideas from social choice to organize societies of
artificial software agents; logicians interested in the logic-based
specification and analysis of social procedures; and last but not least,
researchers coming from social choice theory itself: economists,
mathematicians and computer scientists.

***********************************************************
PAPER SUBMISSION
***********************************************************

Submissions of papers describing original or recently published work on all
aspects of computational social choice are invited. Topics of interest
include, but are not limited to computational issues that arise in the
analysis of

- Preference elicitation
- Preference representation languages
- Restricted preference domains
- Voting rules
-- axiomatic properties
-- manipulation, control and bribery
-- voting equilibria and dynamics
- Judgement aggregation
- Fair division and allocation
- Matching and coalition formation
- Opinion diffusion and aggregation on social networks
- Recommendation systems
- Software for collective decision-making

We welcome both theoretical and empirical work on these topics, including,
in particular, research on algorithms (exact, approximate, parameterized,
online and distributed), learning, logic, uncertainty and simulations in
the context of social choice.

Papers will have to be submitted electronically via Easychair. All
submitted papers will be reviewed by the program committee. Accepted
papers will be collected in informal workshop notes; however, the workshop
has no formal proceedings and the authors retain their copyright. Each
accepted paper will have to be presented by one of the authors, with the
constraint that each workshop participant gives at most one talk
(exceptions can be made due to unforeseen circumstances).

COMSOC-2018 will also include a poster session. Posters will be selected
based on abstracts. Unlike regular submissions, they will not be reviewed
by the program committee; the intention is to accept all posters that fall
within the scope of the workshop subject to space constraints. The details
of the poster session will be announced later.

Please contact either one of the program chairs in case of any questions:

o Edith Elkind (elkind@cs.ox.ac.uk)
o Lirong Xia (xialirong@gmail.com)


***********************************************************
IMPORTANT DATES
***********************************************************

o Paper submission deadline: March 1, 2018
o Notification of authors: early April, 2018
o Workshop dates: June 25-27, 2018

**********************************************************
*
* 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] 8 Postdoc Positions in Mathematics at TU Darmstadt, Germany

The department of mathematics at TU-Darmstadt offers 8 two year Postdoc
positions in any mathematical research field connected to the existing
research groups. Eligible are candidates that have international
experience, e.g., by a Ph.D. from a foreign university.

TU Darmstadt is a university with around 27,000 students. It features
many strong research fields, in particular, mechanical and electrical
engineering and mathematics. It is located in the middle-sized town
Darmstadt, near to Frankfurt in the attractive Main-Rhein area.

The Department of Mathematics at TU Darmstadt is very active and
involved in many scientific collaborations. The department is organized
into the working groups Algebra, Analysis, Applied Geometry, Didactics
of Mathematics, Logic, Numerical Analysis and Scientific Computing,
Optimization, and Stochastics. The positions are open to any research
topic, in particular, Mathematical Optimization.

For more information about the department, see

http://www3.mathematik.tu-darmstadt.de/index.php?id=5&L=1

For the application process, see

https://www.intern.tu-darmstadt.de/dez_vii/stellen/stellen_details_251200.en.jsp
**********************************************************
*
* 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 13, 2017

[DMANET] FAW 2018: Last Call For Papers

FAW 2018 Call for Papers

The 12th International Frontiers of Algorithmics Workshop (FAW 2018 , http://itcs.shufe.edu.cn/FAW2018) will be held on May 8-10, 2018 at Guangzhou, Guangdong Province, China. FAW 2018 will provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.

Keynote Speaker
Andrew Chi-Chih Yao (Tsinghua University)

Invited Speakers:
Yijia Chen (Fudan University)
Ran Duan (Tsinghua University)
Nick Gravin (Shanghai University of Finance and Economics)
Mingji Xia (Chinese Academy of Sciences)

Important Dates
Submission deadline Dec. 29, 2017 (23:59 Beijing Time)
Author Notification of acceptance Feb. 1, 2018
Final version due Feb. 19, 2018
Conference Dates May 8-10, 2018

Special Issue
Selected high quality papers will be invited to a special issue in the journal of Theoretical Computer Science. The invited papers will go through the normal reviewing process.

Program Committee

Jianer Chen, co-chair
Pinyan Lu, co-chair
Hee-Kap Ahn
Georgios Barmpalias
Xiaohui Bei
Wenbin Chen
Yukun Cheng
Radu Curticapean
Ran Duan
Fedor Fomin
Mordecai J. Golin
Heng Guo
Xin Han
Iyad Kanj
Bundit Laekhanukit
Lap-Kei Lee
Minming Li
Bingkai Lin
Tian Liu
Neeldhara Misra
Kim Thang Nguyen
Pan Peng
Venkatesh Raman
Dominik Scheder
Dimitrios Thilikos
Changjun Wang
Ge Xia
Boting Yang
Chee Yap
Deshi Ye
Chihao Zhang
Jialin Zhang

Submission Guidelines and Publication Information

The submission deadline is December 29, 2017 (23:59 Beijing Time). All submissions are electronic via EasyChair, and the submission server is now available at https://easychair.org/conferences/?conf=faw2018.
Submissions must adhere to the following guidelines: Papers must be formatted using the LNCS style, file without altering margins or the font point. A submission should not exceed 12 pages, including references, but excluding the optional appendix. Proofs omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion. Papers that deviate from these guidelines risk being rejected without consideration of their merits.
The proceedings of the Conference will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS), Lecture Notes in Computer Science (LNCS) series, and will be available for distribution at the conference.

**********************************************************
*
* 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] Several Funded Doctoral Studentships in Oxford University's Department of Computer Science

Several Funded Doctoral Studentships in Computer Science at Oxford University

Several funded PhD positions are available in Oxford University's Department of Computer Science, supported by an ERC Starting Grant and a Royal Society Grant held by Standa Zivny. The goal of these projects is to understand the mathematics and computational complexity of constraint satisfaction problems (CSPs), mostly via the lens of convex relaxations (such as linear programming and semidefinite programming). The positions are available from 1 October 2018 and will be for 3 years (with the possibility of extension). The positions come with a travel support and no teaching duties (but the possibility of doing some teaching). The students will be members of Oxford's Algorithms and Complexity Theory Group. The candidates should have a first-class degree in mathematics or theoretical computer science. While there is no general deadline, applications received by 8 January will also be eligible for other sources of funding from Oxford's Department of Computer Science and thus will receive full consideration. Informal inquiries by email (standa.zivny@cs.ox.ac.uk <mailto:standa.zivny@cs.ox.ac.uk>) are welcome.

To apply, proceed as described in the link below and mention Standa Zivny in your application as the primary supervisor.

http://www.cs.ox.ac.uk/news/1371-full.html <http://www.cs.ox.ac.uk/news/1371-full.html>

**********************************************************
*
* 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] CSR 2018: Last Call for Papers

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

Last Сall for Papers
The 13th International Computer Science Symposium in Russia, CSR-2018
Moscow, Russia
June 6-10, 2018


---------------------------------
CSR is an annual conference that intends to reflect the broad scope of
international cooperation in computer science. The topics covered vary
from year to year, but in general try to cover as much of the
contemporary computer science as possible.

TOPICS

include, but are not limited to:

algorithms and data structures
combinatorial optimization
constraint solving
computational complexity
cryptography
combinatorics in computer science
formal languages and automata
algorithms for concurrent and distributed systems, networks
proof theory and applications of logic to computer science


---------------------------------
Important dates

Deadline for submissions: December 16, 2017 (23:59 anywhere on Earth).
Notification of acceptance: February 11, 2018.
Final Version: February 26 2018
Conference dates: June 6-10, 2018.


---------------------------------
Opening lecture

Noga Alon (Tel Aviv University, Israel)


---------------------------------
Invited lectures

Markus Bläser (Saarland University, Germany)
Vladimir Gurvich (Rutgers University, USA)
Alexander Kulikov (St. Petersburg Department of Steklov Institute of
Mathematics, Russia)
Kurt Mehlhorn (Max-Planck-Institut für Informatik, Germany)
Michael Saks (Rutgers University, USA)
Rahul Santhanam (University of Oxford, UK)
László A. Végh (London School of Economics, UK)


---------------------------------
Submission and publication

Authors are invited to submit papers presenting original research in the
conference topics, in electronic form (pdf format) via EasyChair.

Submission server: https://easychair.org/conferences/?conf=csr2018

Submissions must be unpublished, not under review for publication
elsewhere, and provide sufficient information to judge their merits.

Submissions must be in English, and not exceed 12 pages, including the
title page, in Springer's LNCS LaTeX style (instructions available
here). Additional material, to be read at the discretion of reviewers
and PC members, may be provided in a clearly marked appendix or by
reference to a manuscript on a web site.

Accepted papers will be published in an LNCS volume by Springer.
Instructions for formatting camera-ready versions will be communicated
to the authors of accepted papers.
At least one of the authors must commit to presenting the paper at the
conference.

---------------------------------
Support

There is a funding to reduce the registration fee for students authoring
a paper in the conference.

---------------------------------
Program Committee

Maxim Babenko (HSE and Yandex, Russia)
René van Bevern (Novosibirsk State University, Russia)
Mikołaj Bojańczyk (University of Warsaw, Poland)
Holger Dell (Saarland University, Germany)
Edith Elkind (Oxford, UK)
Fedor V. Fomin (University of Bergen, Norway), chair
Fabrizio Grandoni (IDSIA, Switzerland)
Dmitry Itsykson (St. Petersburg Department of Steklov Institute of
Mathematics, Russia)
Mikko Koivisto (University of Helsinki, Finland)
Antonina Kolokolova (Memorial University of Newfoundland, Canada)
Alexander S. Kulikov (St. Petersburg Department of Steklov Institute of
Mathematics, Russia)
Jakob Nordström (KTH Royal Institute of Technology, Sweden)
Alexander Okhotin  (St. Petersburg State University, Russia)
Vladimir V. Podolskii (Steklov Mathematical Institute and HSE, Russia)
Ilya Razenshteyn (Columbia University, USA)
Saket Saurabh (IMSC, India and University of Bergen, Norway)
Alexander Shen (LIRMM, France and IITP, Russia)
Arseny Shur (Ural Federal University, Russia)
Dirk Oliver Theis (University of Tartu, Estonia)
Meirav Zehavi (Ben-Gurion University of the Negev, Israel)

—————————————

Organizers

Vladimir V. Podolskii (Steklov Mathematical Institute and HSE, Russia),
conference chair
Alexey Milovanov (HSE, Russia)
Alexander Rubtsov (HSE, Russia)


---------------------------------
Steering Committee for the CSR series

Edward A. Hirsch (St.Petersburg, RU)
Juhani Karhumaki (Turku, FI)
Alexander S. Kulikov (St. Petersburg, RU)
Ernst W. Mayr (Munich, DE)
Alexander Razborov (Chicago, US and Moscow, RU)
Mikhail Volkov (Ekaterinburg, RU)


---------------------------------
Further information and contacts

Web: http://logic.pdmi.ras.ru/csr2018/
Email: csr2018@googlegroups.com.

---------------------------------
Previous CSR conferences


The list of previous CSR webpages can be found at
http://logic.pdmi.ras.ru/~csr/
**********************************************************
*
* 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] PhD Scholarship on Multi-criteria Decision-Making and Optimisation at the University of Manchester, UK

***
PhD Scholarship on Multi-criteria Decision-Making and Optimisation at the
University of Manchester, UK
***

This PhD scholarship offers three years' funding, including tuition fees and
annual stipend of approximately £15,000 for candidates commencing their studies
in September 2018. The successful candidate will receive a generous research
support and conference allowance, and have access to a robust doctoral research
training programme, dedicated research resources, training in transferable
skills, visiting speaker seminar programme, and associate with existing
research centres and groups. Students are encouraged to undertake training and
development in teaching and deliver teaching/research assistantship duties on a
paid basis to further enhance their experience in preparation for their future
careers.

The Project
===========

In many strategic problems in logistics, managements, planning, and
manufacturing, a Decision Maker (DM) must find solutions that optimise
multiple, conflicting criteria and decide among them, which nowadays often
involves the DM interacting with some automated process implemented as a
Multi-criteria Decision-Making and Optimisation (MCDMO) algorithm. In reality,
decision-making is influenced by human factors (cognitive biases, fatigue,
mistakes) that have been thoroughly studied in behavioural economics and
psychology. The design of algorithms able to cope with these human factors
remains an open challenge.

This project aims to devise realistic, general "simulations" of DMs (machine
DMs) that explicitly model these human factors as configurable parameters,
independent of specific preferences. Machine DMs will enable the empirical
analysis of algorithms with respect to particular human factors. Parameters of
machine DMs may be explicitly set to mimic human behaviours (e.g. risk-averse
vs. risk-seeking). The ultimate goal is the development of the next generation
of data analytics and decision support methods that adapt to the human factors
prominent on particular problem scenarios, thus helping humans to make better
decisions.

Entry Requirements
==================

Applications are sought from exceptional UK, EU and international students with
an outstanding academic background, ideally in Computer Science, Mathematics,
Operations Research, Data Science, Business Analytics, Industrial Engineering,
Economics, or other discipline within business and operations management. The
successful candidate must have a strong programming background
(C/C++/Java/R/Python) and good analytical and communication skills. An
understanding of multi-criteria decision-making and/or mathematical and
heuristic multi-objective optimization techniques is highly desirable.


More information:
=================

http://www.jobs.ac.uk/job/BGK717/phd-scholarship-quantitative-models-of-realistic-human-decision-makers-for-data-analytics-and-optimisation

--
Dr Manuel López-Ibáñez | Lecturer at the Decision and Cognitive Sciences
Research Centre | Alliance Manchester Business School | The University of
Manchester | F29, Booth St East, Manchester M13 9SS, UK | +44 (0) 16130 68996 |
http://lopez-ibanez.eu

**********************************************************
*
* 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] MIP 2018 : second announcement, poster details

We are pleased to announce that the 2018 workshop in Mixed Integer
Programming (MIP 2018) will be held June 18 – 21 at Clemson University
(Greenville, South Carolina). The 2018 Mixed Integer Programming
workshop will be the fifteenth in a series of annual workshops held in
North America designed to bring the integer programming community
together to discuss very recent developments in the field. The
workshop consists of a single track of invited talks and features a
poster session that provides an additional opportunity to share and
discuss recent research in MIP.

All workshop participants are invited to submit a poster abstract
before March 1, 2018. There will be an award for the best poster
presented by a student. To submit an abstract, please email a detailed
abstract of the poster (using 11pt font, at most two pages) to:

mip2018poster@gmail.com

Space for posters is limited, and the submitted poster abstracts will
be used to select the accepted posters. Therefore, it is important
that the abstract provides a good description of the research to be
presented. We expect to send out acceptance notifications around March
15.

For more information and updates, please see the workshop website at:
https://or.clemson.edu/mip-2018/

Program Committee

* Philipp Christophel, SAS
* Simge Küçükyavuz, University of Washington
* Ruth Misener, Imperial College London
* Giacomo Nannicini (chair), IBM Research
* Alejandro Toriello, Georgia Institute of Technology

Local Committee

* Akshay Gupte (chair), Clemson University
* Matthew Saltzman, Clemson University
* Cole Smith, Clemson University

Confirmed Speakers

* Bob Bixby, Gurobi
* Chen Chen, Ohio State University
* Gérard Cornuéjols, Carnegie Mellon University
* Yuri Faenza, Columbia University
* Ricardo Fukasawa, University of Waterloo
* Matthew Galati, SAS
* Andres Gomez, University of Pittsburgh
* Aida Khajavirad, Carnegie Mellon University
* Pierre Le Bodic, Monash University
* Quentin Louveaux, Université de Liège
* Marco Lübbecke, RWTH Aachen
* Miles Lubin, Google
* Stephen Maher, Lancaster University
* Enrico Malaguti, Università di Bologna
* Jim Ostrowski, University of Tennessee
* Joe Paat, ETH Zurich
* Annie Raymond, University of Washington
* Suvrajeet Sen, University of Southern California
* David Shmoys, Cornell University
* Cole Smith, Clemson University
* Wolfram Wiesemann, Imperial College

**********************************************************
*
* 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] CiE 2018 - 2nd Call for Papers

Apologies for multiple postings.

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

CiE 2018: Sailing Routes in the World of Computation
Kiel, Germany
July 30 - August 3, 2018
http://cie2018.uni-kiel.de
http://www.computability.org.uk

IMPORTANT DATES:
============================

Deadline for abstract submission: January 17, 2018
Deadline for article submission: February 1, 2018
Notification of acceptance: April 6, 2018
Final versions due: April 20, 2018

Deadline for informal presentations submission: April 20, 2018
(The notifications of acceptance for informal presentations will be
sent a few days after submission.)

Early registration before: May 30, 2018


CiE 2018 is the fourteenth conference organized by CiE (Computability
in Europe), a European association of mathematicians, logicians,
computer scientists, philosophers, physicists and others interested in
new developments in computability and their underlying significance
for the real world.

Previous meetings have taken place in Amsterdam (2005), Swansea
(2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada
(2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014),
Bucharest (2015), Paris (2016), and Turku (2017).


TUTORIAL SPEAKERS:
==================

Pinar Heggernes (Bergen, Norway)
Bakhadyr Khoussainov (Auckland, NZ)


INVITED SPEAKERS:
=================

Kousha Etessami (Edinburgh, UK)
Johanna Franklin (Hempstead, US)
Mai Gehrke (Paris, France)
Alberto Marcone (Udine, Italy)
Alexandra Silva (London, UK)
Jeffrey O. Shallit (Waterloo, Canada)

ORGANIZED BY:
=============

Department of Computer Science, Kiel University

For questions please contact the organisers at the e-mail address
cie2018@email.uni-kiel.de


SPECIAL SESSIONS (and organisers):
==================================

Approximation and Optimisation — Organisers: Leah Epstein (Haifa),
Klaus Jansen (Kiel)
Bioinformatics and Bio-inspired Computing — Organisers: Andre Franke
(Kiel), Victor Mitrana (Bucharest)
Computing with Imperfect Information — Organisers: Tim McNicholl
(Iowa), Mariya Soskova (Wisconsin-Madison)
Continuous Computation — Organisers: Ulrich Berger (Swansea), Dieter
Spreen (Siegen)
History and Philosophy of Computing — Organisers: Liesbeth de Mol
(Lille), Giuseppe Primiero (Middlesex)
SAT-Solving — Organisers: Vijay Ganesh (Waterloo), Olaf Beyersdorff (Leeds)

The speakers of the special sessions will be announced soon.


PROGRAMME COMMITTEE:
====================

Eric Allender (Rutgers), Arnold Beckmann (Swansea), Marco Benini
(Insubria), Olaf Beyersdorff (Leeds), Patricia Bouyer (Paris),
Alessandra Carbone (Paris), Barbara Csima (Waterloo), Anuj Dawar
(Cambridge), Henning Fernau (Trier), Ekaterina Fokina (Vienna), Peter
Høyer (Calgary), Georgiana Ifrim (Dublin), Lila Kari (Waterloo), Elham
Kashefi (Edinburgh), Karen Lange (Wellesley), Benedikt Löwe
(Amsterdam), Barnaby Martin (Durham), Florin Manea (Kiel), Klaus Meer
(Cottbus), Russell Miller (New York, co-chair), Angelo Montanari
(Udine), Andrey Morozov (Novosibirsk), Anca Muscholl (Bordeaux), Dirk
Nowotka (Kiel, co-chair), Arno Pauly (Bruxelles), Isabella Peters
(Kiel), Giuseppe Primiero (Middlesex), Henning Schnoor (Kiel), Monika
Seisenberger (Swansea), Shinnosuke Seki (Tokyo), Mariya Soskova
(Wisconsin–Madison), Raymond Turner (Essex), Peter Van Emde Boas
(Amsterdam), Heribert Vollmer (Hannover).

CONTRIBUTED PAPERS:
===================

The CiE conferences serve as an interdisciplinary forum for research
in all aspects
of computability, foundations of computer science, logic, and
theoretical computer science, as well as the interplay of these areas
with practical issues in computer science and with other disciplines
such as biology, mathematics, philosophy, or physics.

The PROGRAMME COMMITTEE cordially invites all researchers (European
and non-European) to submit their papers in all areas related to the
above for presentation at the conference and inclusion in the
proceedings at https://easychair.org/conferences/?conf=cie2018 .

Papers must be submitted in PDF format, using the LNCS style
(available at ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip)
and should have a maximum of 10 pages, including references but
excluding a possible appendix in which one can include proofs and
other additional material. Papers building bridges between different
parts of the research community are particularly welcome.

The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.

INFORMAL PRESENTATIONS:
=======================

Continuing the tradition of past CiE conferences, in addition to the
formal presentations based on the LNCS proceedings volume, CiE 2018
will host a track of informal presentations, that are prepared very
shortly before the conference and inform the participants about
current research and work in progress. The deadline for the submission
of abstracts for informal presentations is May 1st, 2018.

WOMEN IN COMPUTABILITY:
=======================

We are very happy to announce that within the framework of the Women
in Computability programme, sponsored by ACM-Women, we are able to
offer four grants of up to 250 EUR for junior female researchers who
want to participate in CiE 2018. Applications for this grant should be
sent to Liesbeth De Mol, liesbeth.demol@univ-lille3.fr, before 15 May
2018 and include a short cv (at most 2 pages) and contact information
for an academic reference. Preference will be given to junior female
researchers who are presenting a paper (including informal
presentations) at CiE 2018.

HaPoC Grants | Commission for the History and Philosophy of Computing
=====================================================================

The HaPoc Council is happy to announce the availability of two HAPOC
travel grants of 250USD each to support participation to the
conference. To be eligible for a grant, a paper or informal
presentation in the area of history and/or philosophy of computing
accepted at CiE 2018 is required. In order to apply for a grant,
please send the following details to info@hapoc.org: cv, the paper or
informal presentation submitted, accompanied by the acceptance email,
a detailed budget indicating any other funding possibilities (if
available).

Association CiE:
http://www.computability.org.uk

CiE Conference Series:
http://www.computability.org.uk/index.php/cie-conference-series/

**********************************************************
*
* 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] Open postdoc position on Approximation Algorithms, Quantum Information and Semidefinite Optimization at CWI, Amsterdam, The Netherlands

***********************************************
CWI, Amsterdam, The Netherlands

Open postdoc position

***********************************************

Centrum Wiskunde & Informatica (CWI) has a vacancy in the Network & Optimization research group for a
postdoc in the research project

"Approximation Algorithms, Quantum Information and Semidefinite Optimization".

This research project aims to explore the limits of efficient computation within classical and quantum computing, using semidefinite optimization as a main unifying tool. The position involves research into the mathematical and computer science aspects of approximation algorithms for discrete optimization, quantum entanglement in communication, and complexity of fundamental problems in classical and quantum computing.
We especially welcome applicants with a solid background and interest in algebraic methods for optimization.
The project will be carried out in collaboration between Monique Laurent from the CWI Networks & Optimization research group, Ronald de Wolf from the CWI Algorithms & Complexity research group, and Nikhil Bansal from the department of mathematics and computer science of the Technical University Eindhoven. The position is funded through an NWO-TOP grant.
More background information about the project can be found at the website:

http://projects.cwi.nl/quantumdsp/

For details about the application procedure please visit the website:

https://www.cwi.nl/jobs/vacancies/postdoc-in-the-research-project-approximation-algorithms-quantum-information-and-semidefinite-optimization

**********************************************************
*
* 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 12, 2017

[DMANET] CCA 2018: First call for papers

First Call for Papers for the

Fifteenth International Conference on
Computability and Complexity in Analysis (CCA 2018)

http://cca-net.de/cca2018/

Held in Honour of Klaus Weihrauch's 75th Birthday

August 5-8, 2018, Lake Kochel, Germany
______________________________________________________________


Venue

The conference takes place at the Georg-von-Vollmar Academy
in Kochel, Germany. Kochel am See is beautifully located at
Lake Kochel at the edge of the Bavarian Alps, approximately
70 km south of Munich, from where it can easily be reached.

The conference CCA 2018 is preceded by the conference
Computability in Europe (CiE 2018) that takes place in Kiel,
in the north of Germany, from July 30 to August 3, 2018.


Topics

- Computable analysis
- Complexity on real numbers
- Constructive analysis
- Domain theory and analysis
- Effective descriptive set theory
- Theory of representations
- Computable numbers, subsets and functions
- Randomness and computable measure theory
- Models of computability on real numbers
- Realizability theory and analysis
- Reverse analysis
- Real number algorithms
- Implementation of exact real number arithmetic


Invited Speakers
- Daniel Graca (Faro, Portugal)
- Neil Lutz (Piscataway, USA)
- Florian Steinberg (INRIA, France)
- Pieter Collins (Maastricht, Netherlands)
- Ludovic Patey (Lyon, France)
- Diogo Pocas (Hamilton, Canada)
- Rupert Hölzl (Munich, Germany)
- Matthias Schröder (Darmstadt, Germany)


Scientific Programme Committee

- Laurent Bienvenu (Montpellier, France)
- Hannes Diener (Christchurch, New Zealand)
- Denis Hirschfeldt (Chicago, USA)
- Rupert Hölzl (Munich, Germany)
- Zvonko Iljazovic (Zagreb, Croatia)
- Takayuki Kihara (Nagoya, Japan)
- Elvira Mayordomo (Zaragoza, Spain)
- Norbert Müller (Trier, Germany)
- Ning Zhong (Cincinnati, USA)
- Martin Ziegler, chair (Daejeon, Republic of Korea)


Organising Committee

- Vasco Brattka, chair (Munich, Germany)
- Peter Hertling (Munich, Germany)
- Rupert Hölzl (Munich, Germany)
- Philip Janicki (Munich, Germany)


Submissions

Authors are invited to submit 1-2 pages abstracts in PDF format,
including references via the following web page:

https://easychair.org/conferences/?conf=cca2018

If full versions of papers are already available as technical report
or arXiv version, then corresponding links should be added to the
reference list. Final versions of abstracts might be distributed to
participants in hardcopy and/or in electronic form.


Dates

* Submission deadline: April 2, 2018
* Notification of authors: May 7, 2018
* Final version: June 4, 2018
* Registration deadline: June 18, 2018
* Conference: August 5-8, 2018


Conference Web Page

http://cca-net.de/cca2018/
--8323329-1036883327-1513106442=:27813--

**********************************************************
*
* 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] 6th Student Conference on Operational Research (SCOR 2018)

To Phd Supervisors:

*6th Student Conference on Operational Research(SCOR 2018)*

*April 6-8 2018, University of Nottingham, UK*

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

PhD students from all 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
2018 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 & Analytics * Data Mining * Energy * Forecasting * Graphs /
Networks * Healthcare * Heuristics * Inventory * Mathematical Programming *
Multicriteria Decision Analysis * Neural Networks / Machine Learning *
Optimisation and Applications * Reliability / Risk Assessment * Scheduling
/ Timetabling * Stochastic Modelling * Supply Chain Management * Simulation
/ System Dynamics * Transport /Logistics.

Plenary talks will be given by various OR professionals undertaking a wide
range of exciting careers. This will give students an opportunity to
consider the many career paths available to them after completing their
doctorate.

Please note that abstract submission is now open.

Deadline for abstract (250 words) submission: Friday 2nd February 2018

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 2018
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
SCOR2016 proceedings.

Deadline for PAPERS submission: Friday 30th March 2018

For latest news, follow us at Twitter, Facebook or Instagram @scor2018 .

www.scor18.com

See you in Nottingham!!!

--

Informativa sulla Privacy: http://www.unibs.it/node/8155

**********************************************************
*
* 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] PostDoc position in Algorithms and Complexity at IDSIA, University of Lugano, Switzerland

The Algorithms and Complexity Group of IDSIA, University of Lugano
(Switzerland), opens one PostDoc position in algorithms and
complexity, with a special focus on approximation algorithms.
This position is supported by the
Swiss National Foundation Grant "Approximation Algorithms for Network Problems".

The appointment is for one year with the possibility of extension.
The position is already available, and there is some flexibility on
the starting date.

The gross salary is roughly 80.000 CHF per year (low taxes, around 15%).
There are no teaching duties and there is generous travel support.
The ideal candidate should hold (or be close to obtaining) a Ph.D. in
Computer Science or related fields, and should have a solid
publication record in the area of algorithms and complexity (possibly
in approximation algorithms). Top conferences in this area include
STOC, FOCS, SODA, ICALP, and ESA.

Team members will have the opportunity to cooperate with the
Algorithms and Complexity group at IDSIA, which currently counts 7
researchers.

IDSIA offers an international working environment. Lugano is a tidy
and lively town, with a wonderful view on Ceresio lake and mountains
around. Ticino Canton offers many opportunities for hiking, biking,
skiing, etc. Local restaurants serve very good (Italian style!) food.

Further details about the project can be found at:
http://people.idsia.ch/~grandoni/SNF2015.html

The interested candidates should email
- a detailed CV, including a list of publications and 2-3 references, and
- a short summary of past and current research interests
to:
fabrizio@idsia.ch

The deadline for the application is 31st of January 2018.
For any question, do not hesitate to contact:

Prof. Fabrizio Grandoni
fabrizio@idsia.ch
http://people.idsia.ch/~grandoni/
**********************************************************
*
* 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/
*
**********************************************************