Toggle description

Fully funded Ph.D. positions in Operations Research are available starting now in the department of Civil Engineering at École de technologie supérieure in Montréal (www.etsmlt.ca). You will work under the supervision of prof. Fausto Errico. Fausto Errico is also member of CIRRELT (www.cirrelt.ca) and GERAD (www.gerad.ca), two worldwide renowned research centers in Operations Research, also located in Montréal. Opportunities for co-supervisions with other members of these two centers are possible and welcome.

Montréal (http://www.tourisme-montreal.org) is a vibrating, dynamic metropolis located in the province of Quebec, Canada. It hosts 5 major universities and it is often rated among the top cities worldwide for its quality of life.

Several research topics are available. The main application fields are: 1) Planning of innovative transit systems, 2) Electric vehicles and related stochastic and dynamic routing problems and 3) Management of hydropower generation. Generally speaking, the above applications require the solution of hard combinatorial problems featuring stochastic and dynamic aspects.

As a Ph.D. candidate you are expected to carry out top-level research to develop efficient solution algorithms for hard combinatorial problems. Methods include: decomposition strategies for large mathematical programs such as column generation, Benders decomposition, Lagrangean relaxation; implicit enumeration schemes, such as branch-and-cut and branch-and-price; two-stage and multi-stage stochastic programming; stochastic and approximate dynamic programming.

You hold a master’s degree in Operations Research, Applied Mathematics, Computer Science or related fields. You must have a strong background in the above-mentioned solution methods. You must demonstrate advanced skills in C/C++ programming languages and you are at ease with mathematical programming solvers (CPLEX, Gurobi, etc).

If interested, please send your application to Fausto Errico (fausto.errico@cirrelt.ca). Applications should contain the following material in a single PDF file: 1. A one-page cover letter explaining your motivations to pursue a Ph.D. in Operations Research in Montréal and indicating your preferred start date 2. A one-page document explaining your research interests and how they fit in the above-mentioned research themes 3. Your up-to-date, complete Curriculum Vitae 4. The copy of your master’s thesis 5. Transcripts from bachelor’s and master’s degrees 6. A copy of your publications, if it applies 7. The names and contact details of one or two academic referees, one of which should be your master’s thesis supervisor

You can apply in English, French, Spanish or Italian. However, you must be fluent in English. Knowledge of French is desirable, but not necessary. Reviewing of applications will start immediately.
Applications are accepted until positions are filled.

Toggle description

Applications are invited for PhD positions in the group of Danupon Nanongkai at the Theoretical Computer Science department, KTH Royal Institute of Technology, Stockholm, Sweden. We are looking for people who want to work on one or more aspects of the project "Distributed and Dynamic Graph Algorithms and Complexity", supported by the ERC starting grant.

Candidates who have strong interests in exploring the impact of the following techniques in the fields of distributed and dynamic graph algorithms are especially desired: (i) algebraic techniques (e.g. fast algorithms for matrix multiplication and computing ranks), (ii) spectral techniques (e.g. fast algorithms for computing maximum flow, sparsest cut, and tree embedding), and (iii) communication complexity.

For more information and how to apply, please visit https://sites.google.com/site/dannanongkai/vacancies.

Toggle description

1-year research assistantship on the topic "Metodi e modelli per la logistica distributiva del farmaco: soluzioni centralizzate e distribuite". Renewable for further 6 months.

Toggle description

The Algorithms and Complexity Group at Durham University (http://community.dur.ac.uk/algorithms.complexity/) invites postdoctoral researchers to apply for Durham International Junior Research Fellowships to spend 2 years doing research in our group. More information about JRF, including eligibility criteria, can be found here: https://www.dur.ac.uk/ias/diferens/junior/

Note that eligibility criteria include
(a) "Applicants will normally hold a doctorate and have significant post-doctoral research experience, or its equivalent in a commercial or industrial environment. Exceptional candidates without post-doctoral experience will also be considered." and
(b) "Researchers must not have resided or carried out their main activity (work, studies, etc) in the UK for more than 12 months in the 3 years immediately prior to 1 July 2017. Compulsory national service and/or short stays such as holidays are not taken into account."

Interested parties should contact Head of Group Prof. Iain Stewart (i.a.stewart@durham.ac.uk), or any staff member (http://community.dur.ac.uk/algorithms.complexity/people.html) with relevant research interests, to discuss the application.

Toggle description

A three-year postdoctoral position is available in the Combinatorics and Graph Theory group (http://www.mi.fu-berlin.de/en/math/groups/geokomb/index.html) of the Department of Mathematics and Computer Science at the Freie Universität Berlin, starting from the Fall of 2017. The successful candidate is expected to hold a PhD in mathematics or related field by the start of the appointment and have an interest in extremal and/or probabilistic combinatorics, or graph theory. The position is part of the research group of Tibor Szabó (http://page.mi.fu-berlin.de/szabo/). The teaching load is 4 hours per week each semester.

Qualified candidates are asked to submit a cover letter, CV, list of publications, research statement, and arrange three letters of recommendation to be sent by the reference writers. The preferred mean of submission is via email to Ms. Beate Pierchalla (bpiercha@zedat.fu-berlin.de); please write "postdoc position" in the Subject. Alternatively, hard copy applications can be mailed to

Beate Pierchalla
Institut für Mathematik
Freie Universität Berlin
Arnimallee 3
14195 Berlin
Germany

Applications received by December 16th will receive full consideration.

The Freie Universität Berlin (with the motto "International Network University") has been selected as one of the "Universities of Excellence" of Germany. In 2006 an English language graduate program, the Berlin Mathematical School (http://www.math-berlin.de/), was established in cooperation with the other two research universities of Berlin. Discrete Mathematics has a great tradition in the city and enjoys a unique status (Research Training Group "Methods for Discrete Structures" (http://www.math.tu-berlin.de/MDS/)).

Toggle description

A postdoctoral Research Fellow position is available in “A graph theoretical approach for combinatorial designs” at the University of Birmingham (UK), funded by an EPSRC project (PI: Allan Lo). This post is available for a period of one year, with a starting date between 1 May 2017 and 1 October 2017.

The successful candidate will join the Combinatorics Group in the School of Mathematics at the University of Birmingham. The profile and research interests of this group may be found at: http://web.mat.bham.ac.uk/combinatorics/main.html

Applicants should have a PhD in mathematics awarded or submitted at the time of taking up the position, a strong record of research and publications, and familiarity with extremal and probabilistic combinatorics.

Informal enquiries about applications are very welcome and should be directed to Allan Lo (s.a.lo at bham.ac.uk). Further details of the post, together with information on application procedures, can be found via: http://www.hr.bham.ac.uk/jobs

The closing date for applications is 16 December 2017, and the position reference is 56232.

Toggle description

Mathematical Optimization and Data Analytics
University of California, Davis

The Department of Mathematics at the University of California, Davis invites applications for an Assistant Professor (tenure-track) faculty position in the areas of Mathematical Optimization and Data Analytics starting July 1, 2017.

Minimum qualifications for the position include a Ph.D. degree or its equivalent in the Mathematical Sciences or a related field and excellent potential for performance in teaching and research. Duties include mathematical research, undergraduate and graduate teaching, and departmental, university and professional service. Candidates are expected to engage in interdisciplinary research within the UC Davis Data Science Initiative.

Additional information about the Department may be found at https://www.math.ucdavis.edu/

Applications will be accepted until the position is filled. For full consideration, completed applications should be received by December 15, 2016. To apply: submit the AMS Cover Sheet and supporting documentation electronically through http://www.mathjobs.org/

The University of California, Davis, is an affirmative action/equal opportunity employer with a strong institutional commitment to the achievement of diversity among its faculty and staff.

Toggle description

The Simons Institute for the Theory of Computing at UC Berkeley invites applications for Research Fellowships for academic year 2017-18.

Simons-Berkeley Research Fellowships are an opportunity for outstanding junior scientists (at most 6 years from PhD by Fall 2017) to spend one or both semesters at the Institute in connection with one or more of its programs. The programs for 2017-18 are as follows:

* Bridging Continuous and Discrete Optimization (Fall 2017)
* Real-Time Decision Making (Spring 2018)
* The Brain and Computation (Spring 2018)

Applicants who already hold junior faculty or postdoctoral positions are welcome to apply. In particular, applicants who hold, or expect to hold, postdoctoral appointments at other institutions are encouraged to apply to spend one semester as a Simons-Berkeley Fellow subject to the approval of the postdoctoral institution.

Further details and application instructions can be found at http://simons.berkeley.edu/fellows2017. Information about the Institute and the above programs can be found at http://simons.berkeley.edu.

Deadline for applications: 15 December, 2016.

Alistair Sinclair
Associate Director, Simons Institute for the Theory of Computing

Toggle description

Postdoctoral positions at SINTEF Optimisation!

We are looking for professional and dedicated candidates to work for our Optimisation group at SINTEF ICT in Oslo, in the department of Applied Mathematics. The duration will be two years, with the intention to make it a permanent position if all parties are interested.

About us: SINTEF is the largest independent research organisation in Scandinavia. We create value through knowledge generation, research and innovation, and develop technological solutions that are brought into practical use. We are a broadly based, multidisciplinary research institute that possesses international top-level expertise in technology, medicine, and the social sciences. SINTEF is an independent, non-commercial organisation and our profits are invested in new research, scientific equipment, and development of novel expertise.

SINTEF Optimisation: We are currently 14 researchers, some of whom also work as software engineers. For the past 20 years, we have been developing optimisation methods, software prototypes, libraries, and components. We have built expertise at an international level and have a good publication record. Our group conducts basic and applied research on planning, scheduling, routing, sequencing, and timetabling problems. Our main market areas are transportation: road, railway, maritime, and aviation; healthcare; sports; and finance. We work with commercial solvers (Cplex, Gurobi, etc.) as well as our own software libraries that have been refined over many years and contain a range of different solution methods (exact and approximate). In recent years, we have developed our own discrete event simulator that has been used in several industrial projects. We commercialise our results, either through existing solution vendors, spin-off companies, or directly to end users. Our revenues come from users in industry and the public sector, often supported by Norwegian or EU funding bodies.

Positions: We are looking for candidates with a PhD in applied mathematics, operations research, computer science, or similar. Optimisation experience from industry is an advantage. As a researcher, your responsibilities will involve mathematical modelling, development of optimisation algorithms as well as software development. In addition, you are expected to contribute to the acquisition of new projects, and further development of our market areas.
Fluency in English is expected along with excellent communication and presentation skills. The positions also require excellent communication and presentation skills. Moreover, you should be curious, inventive, have a proactive attitude, and be able to deliver expected results at an appointed time.

Expertise: We require a solid background in combinatorial optimisation, and seek candidates with expertise in several of the following areas:
- Mathematical programming
- Decomposition methods
- Heuristics, metaheuristics, and matheuristics
- Constraint programming
- Real-time optimisation
- Exact and approximate methods for solving problems with uncertainty
- Discrete event simulation
- Multi-agent systems

Experience in statistics and machine learning is not required but would be a plus.
Software development skills: We are looking for candidates with excellent programming skills in C# or C++. Skills in Java, python, and R would be a plus.

We offer:
- Challenging research tasks based on industry applications.
- A good work environment with skilful, experienced, and creative research colleagues.
- Well-established national and international scientific and industrial networks.
- Good opportunities for career development both for candidates that seek academic careers or industrial careers
- Competitive salary (subject to qualifications).
- A large degree of autonomy, and flexible working hours.
- Social benefits (pension plan, insurance, possibility for kindergarten, etc.).

Duration: The duration will be two years, with the intention to make it a permanent position if all parties are interested.

Location: SINTEF ICT’s office in Oslo.

How to apply: Please apply online. Your application should include CV and Cover letter.

Closing date for applications: December 15, 2016.

For more information about the position, please contact research manager Tomas Eric Nordlander (Tomas.Nordlander@sintef.no or +47 98824892).

Toggle description

Call for Tenure-track Assistant Professor

The Faculty of Informatics of the Università della Svizzera italiana (USI), located in beautiful Lugano, Switzerland, invites young researchers to apply for an
Assistant Professor position.
The Faculty of Informatics at USI was established in October 2004 and offers BSc, MSc, and PhD degrees with an innovative, project-based, and interdisciplinary curriculum. The
official teaching language of the Faculty is English. The Faculty has strong competences in many areas of informatics and computational science, and we are looking to complement
and extend our research areas.
The successful candidate is expected to conduct world-class research and to contribute to teaching at all levels. Applicants with strong research records in all areas of informatics are welcome. USI specifically encourages female candidates to apply with the goal of increasing the proportion of female professors.

Basic requisites:
PhD or equivalent

Applications with curriculum vitae, list of publications, names of three referees, and statements on research and teaching should be sent in electronic form to: opencall@usi.ch

Applications received by December 15, 2016 will be given priority.
Targeted starting date for the position is September 1, 2017.

General information about the Faculty of Informatics can be found at http://www.inf.usi.ch
Questions concerning the position can be addressed to the Dean’s office: decanato.inf@usi.ch

Toggle description

The Department of Informatics and Telecommunications at the National and Kapodistrian University of Athens has an opening for a tenure-track faculty position in "Algorithms and Complexity", at the rank of Assistant Professor. Candidates must have established a strong theory research record and demonstrate a clear potential for further academic advancement. The language of instruction in the department is Greek.

The (hard) deadline for applying is December 12, 2016. Details for the application procedure can be found here (in Greek):

http://www.di.uoa.gr/announcements/faculty/1883

Further enquiries may be directed to Stavros Kolliopoulos (sgk@di.uoa.gr).

Toggle description

Applications are invited for a Postdoctoral Researcher or a PhD student at the Department of Production and Logistics of the University of Wuppertal, Germany. The position is full-time and can be started as soon as possible for the applicant. The position is funded for three years (salary according to level E13).

We have a research focus on operations research methods with application in logistics, production planning and supply chain management. Applicants should have a business administration and/or theoretical/mathematical background and an interest in at least one of the following topics:
- operational research
- auction theory
- computational complexity theory
- scheduling theory

Postdoctoral researchers from other fields may apply as well, but should be prepared to detail how they fit in the research profile of the group. All applicants should have an excellent first academic degree in computer science, mathematics, business administration or a related discipline. Applications should include a detailed CV, a copy of master (or PhD) thesis, a brief statement of research interests, and a list of publications (if applicable). Please send the application not later than Dec 12th, 2016 to:

Bergische Universität Wuppertal,
Fakultät für Wirtschaftswissenschaft - Schumpeter School of Business and Economics,
Lehrstuhl für Produktion und Logistik,
Herrn Prof. Dr. Dirk Briskorn, 42097 Wuppertal

and via email to briskorn@uni-wuppertal.de

Toggle description

Application Deadline: 05-Dec-2016
Salary: £36,001 to £40,523 per annum
Location: Computer Science Department, University of Bristol, UK
Application link: http://bit.ly/2gdawB1

Based in the Department of Computer Science of the University of Bristol you will carry out research within a project concerned with the development of new algorithms as well as provable time and space lower bounds. Our current work focuses on pattern matching in dynamically changing data however we also have a broader interest in other aspects of algorithms/theory research.

The post will require a high level of expertise in areas which may include but not be limited to data structures and algorithms, discrete probability, discrete mathematics and combinatorics.

Candidates with interests in both lower bounds and algorithms or only one of the two are strongly encouraged to apply.

Algorithms and upper bounds

The emphasis will be on developing algorithms and data structures with provable performance bounds. Depending on your interests, you may also at times implement and test algorithms related to the proposal. A particular focus will be on faster and/or more space efficient algorithms for combinatorial pattern matching in dynamically changing as well as streaming data.

Lower bounds

This part will have as its main focus the development of time and space lower bounds. As a team we have in recent years shown new time and space lower bounds for streaming problems as well as time-space trade-offs for the element distinctness problem. This part of the role will be to extend this work in this exciting area of research.

You will have a Ph.D. in theoretical computer science (“Track A”) or closely related area together with a strong track record of international publications in algorithms or theoretical computer science (“Track A”) venues. This may include for example, ICALP/SODA/STOC/FOCS. We also welcome applications from talented computer scientists whose main interest has been in mainstream “Track A” theory rather than specifically pattern matching.

In addition you will have excellent written and spoken communication skills including the ability to explain and share deep concepts. You will also have a strong mathematical background.

Please clearly state why you are interested in this post and how your previous track record makes you suitable for the role.

The post is being offered on a full time, fixed term contract with funding up to December 31 2017.

Informal enquiries to Raphael Clifford at clifford@cs.bris.ac.uk

Toggle description

The Department of Combinatorics and Optimization at the University of Waterloo invites applications for one or more open rank, tenure-track or tenured faculty positions. Applicants should have research interests in one of the following areas: Algebraic Combinatorics, Continuous Optimization, Cryptography, Discrete Optimization, and Graph
Theory.

A Ph.D. degree and evidence of excellence in research and teaching are required. Successful applicants are expected to maintain an active program of research, to attract and supervise graduate students, and to participate in undergraduate and graduate teaching.The salary range for the position is $105,000 to $155,000. Negotiations beyond this salary range will be considered for exceptionally qualified candidates. The effective date of appointment is July 1 2017.

Interested individuals should apply using the MathJobs site. Applications should include a curriculum vitae, research and teaching statements, and up to three reprints/preprints. In addition, at least three reference letters should be submitted.

Inquiries may be addressed to combopt@uwaterloo.ca or to:
Jochen Koenemann,
Chair, Department of Combinatorics and Optimization, University of Waterloo,
Waterloo, Ontario, Canada N2L 3G1.

Closing date for receipt of applications is December 1, 2016.

The University of Waterloo respects, appreciates and encourages diversity. We welcome applications from all qualified individuals including women, members of visible minorities, Aboriginal peoples and persons with disabilities. All qualified candidates are encouraged to apply; however, Canadian citizens and permanent residents will be given priority.

Three reasons to apply: https://uwaterloo.ca/watport/why-waterloo

Toggle description

The Department of Mathematics and Computer Science at Wesleyan University invites applications for a tenure track assistant professorship in Computer Science to begin in Fall 2017. Candidates must have a Ph.D. in Computer Science or similar discipline in hand by the time of appointment, and must have a strong research record and experience in teaching. Theory, programming languages, algorithms, and networking are well-represented in the department. We encourage candidates in all areas of Computer Science to apply, including those who deepen our existing research strengths, and especially encourage candidates who can contribute to the diversity (broadly conceived) of the department.

Duties include conducting an independent program of research, teaching, advising and mentoring students, and participating in faculty governance at the departmental and university level. Tenure track faculty in Computer Science at Wesleyan have a 2/1 teaching load (three courses per year). Wesleyan values both research and teaching highly and has a strong and diverse student body.

We will begin reviewing applications on Dec. 1, 2016. Applications must include a cover letter, curriculum vitae, research statement, teaching statement and at least four letters of recommendation, one of which discusses teaching. As part of your teaching statement or cover letter we invite you to describe your cultural competencies and experiences engaging a diverse student body.

Applications must be submitted online at https://academicjobsonline.org/ajo/jobs/7547. Other correspondence regarding this position may be sent to cssearch@wesleyan.edu.

Toggle description

A Junior Research Assistant is sought at the University of Modena and Reggio Emilia, to work with Prof. Mauro dell'Amico on the European Project "Architecture for EurOpean Logistics Information eXchange".

Toggle description

The optimisation group at Delft University of Technology in the Netherlands is seeking a PhD student on the project “Encoding, reconstructing and comparing complex evolutionary scenarios” financed by The Netherlands Organization for Scientific Research (NWO). This project aims at developing new graph theory, algorithms and software tools which can be used by biologists to reconstruct networks describing the evolutionary relationships between species. The standard, well-studied model for describing such relationships is the phylogenetic tree, which has leaves representing species and internal vertices representing divergence events. However, actual evolutionary histories are often complex webs of diverging and combining lineages, which can better be described by networks than by trees. Accurately reconstructing such networks is a challenging task. Therefore, this project involves the development of new (graph) theory, algorithms and software as well as working with biologists to apply the developed theory and software in practice.

For more information, see https://www.academictransfer.com/employer/TUD/vacancy/36363/lang/en/

Toggle description

Segnalo la possibilità di finanziamento di un assegno di ricerca triennale nell'ambito del progetto "NILE-NEXUS: Opportunities for a sustainable food-energy-water future in the Blue Nile Mountains of Ethiopia" finanziato dalla Belmont Foundation. Il progetto sarà sviluppato con la collaborazione dei seguenti partner:
- Johns Hopkins University (USA)
- University of Wisconsin-Madison (USA)
- Addis Ababa University (Etiopia)
- University of Bonn (Germania)
- Università di Brescia

Al candidato è richiesto il possesso del titolo di Dottore di Ricerca con competenza in ambito informatico, modellistico e di tecniche di ottimizzazione/simulazione, e con capacità di interazione con gruppi di ricerca a livello internazionale.
Gli interessati possono contattare la sottoscritta (claudia.archetti@unibs.it) o il responsabile per l'unità di Brescia, Gianni Gilioli (gianni.gilioli@unibs.it).

Di seguito una breve descrizione del progetto.

Le Blue Nile Mountains costituiscono il bacino idrico da cui trae origine il Nilo Blu, in Etiopia. Sono aree montuose, densamente popolate che sperimentano una serie di difficoltà legate alla disponibilità di cibo, alla pressione demografica e al degrado ambientale (in primo luogo il degrado dei suoli).
Si tratta di aree a elevata piovosità e la disponibilità idrica ha messo in moto una serie di progetti per lo sfruttamento energetico di tale risorsa (dighe e centrali idroelettriche). Questo sfruttamento genera un potenziale conflitto con l’uso di acqua per la produzione agricola.
Il progetto ha l’obiettivo di analizzare le opzioni di gestione e adattamento ai problemi connessi al potenziale conflitto tra esigenze a scala locale, come la produzione di cibo e l’utilizzo dell’acqua, e gli obiettivi a scala nazionale di soddisfacimento del fabbisogno energetico di un paese, come l’Etiopia, in rapido sviluppo. L’analisi è condotta a diverse scale spaziali, quella del singolo villaggio agro-pastorale, considerando diverse tipologie a seconda delle caratteristiche agro-ecologiche e socio-economiche e quella regionale, considerando l’insieme dei villaggi del bacino del Nilo Blu. Anche diverse scale temporali saranno considerate a seconda del tipo di analisi, da quella a breve termine per quanto concerne le risposte del sistema alla variazione stagionale delle forzanti ambientali a quella a lungo termine (20-30 anni) relative agli effetti di trend climatici o demografici.

La ricerca si basa sull’analisi di sistemi agropastorali costituiti da una serie di sottosistemi posti tra loro in interazione. Questi sottosistemi sono caratterizzati da una o più variabili di stato che identificato il “capitale” specifico presente in un dato istante nel sottosistema. La dinamica dei sottosistemi è caratterizzata da processi di produzione/crescita e consumo/prelievo di tale capitale (es. produzione agricola). I sottosistemi sono sottoposti alla influenza di drivers ambientali (funzioni forzanti ambientali esterne al sistema e stressori che costituiscono potenziali fattori di rischio, es. cambiamento climatico) e alla influenza di dinamiche socio-economiche a media e larga scala (es. commercio di prodotto agricoli). I sottosistemi considerati sono quelli idrologico, ambientale, agricolo, socio-economico e istituzionale.

Il sistema è oggetto di una analisi di ottimizzazione multicriterio in cui devono essere soddisfatti, in primo luogo, gli obiettivi multipli della sicurezza alimentare (produzione di cibo) e della massimizzazione del contributo idrico alla produzione di energia.

A scala locale, dietro opportune ipotesi sugli scenari da analizzare, la dinamica del sistema è analizzata tramite approssimazione numerica di sistemi di o.d.e. che descrivono i processi all’interno di ogni sottosistema al fine di ricercare ricerca di soluzioni ottime ai problemi di sfruttamento delle risorse idriche, di produzione agricola e di conservazione del capitale naturale e sociale.

A scale spaziali superiori e per orizzonti temporali di lungo periodo possono essere condotte anche analisi di ottimizzazione basate su tecniche esatte o euristiche.

Un caro saluto.
Claudia Archetti (claudia.archetti@unibs.it)

Toggle description

We offer scholarships to support outstanding students for the Master’s Program in Logic and Computation at TU Wien, Vienna, Austria. Among the program’s seven focus areas are the topics Algorithms and Complexity Theory.

Details can be found at http://logic-cs.at/master/grants-and-scholarships/

Application deadline is November 30, 2016.

Toggle description

Two postdoc positions are available in the Department of Computer Science at the University of Oxford as part of the ERC Starting Grant Power of Algorithms in Discrete Optimisation (PowAlgDO) led by Standa Zivny. The project will run from 01/2017 to 12/2021 and will focus on establishing the power of convex relaxations (such as linear and semidefinite programming) for various classes of constraint satisfaction problems (CSPs) with respect to exact and approximate solvability.

The positions are available from 1 January 2017 (or later) and will be for 3 years (with the possibility of extension). The positions comes with a travel support and no teaching duties (but the possibility of doing some teaching). The postholders will be members of Oxford's Algorithms and Complexity Theory Group.

The deadline is 30 November. Interviews will be held on 15 December.

More details can be found at http://www.cs.ox.ac.uk/news/1194-full.html

Toggle description

Fields: Operations research; Applied Mathematics

Activity: Beside the development of research themes belonging to the Scientific Disciplinary Sector MAT/09-Operations Research and of interest to the researcher, the expected research activity will consist in the application of Operations Research methods to problems of interest to various research areas of the School. Tutorship and mentoring of the PhD students; participation in the development of the School's research activities.

Profile: The successful candidate is expected to have an attested research experience in the Scientific Disciplinary Sector MAT/09-Operations Research, demonstrated through an adequate number of works published in relevant international journals/conferences relevant for the Scientific Disciplinary Sector MAT/09-Operations Research, and of works, even of interdisciplinary character, published in relevant international journals/conferences related to the scientific sectors and research macro-areas of the School, provided that in such works the development and/or application of Operations Research methods represent a significant component. The successful candidate must have an attested experience as teacher of Ph.D. courses, held in English, and characterized by the presence of a significant component in the use of Operations Research and/or Applied Mathematics methods.

Formal requirements: PhD in Mathematics or a field related to the present call obtained in Italy or abroad. Curriculum with a suitable scientific background for carrying out research activity in the required field. Excellent knowledge of English, both written and spoken. The selection is reserved for applicants who have benefited for at least three years, even non-consecutive, research grants or post-doctoral grants or of similar contracts, grants or scholarships in foreign universities (under art. 24, comma 3, lett. b) of the Law 240/2010). Candidates not admitted for selection are Full or Associated University professors and presently employed research fellows on a permanent contract.

Specific requirements: Adequate number of works published in relevant international journals/conferences in the areas of the present call, both at national and international level; attested experience as teacher of Ph.D. courses, held in English, and characterized by the presence of a significant component in the use of Operations Research and/or Applied Mathematics methods, in Italian and foreign academic institutions.

Type of contract: Ricercatore tempo determinato (legge 240/2010 art.24 comma 3 lettera b) ) - Tenure Track Assistant Professor

Gross remuneration: Ricercatore tempo determinato (legge 240/2010 art. 24 comma 3 lettera b))

Duration: 3 years

Toggle description

PhD students in Air Traffic and Logistics and in Unmanned Traffic Management are sought. The first position is about facility location (involving modeling and optimization), the second is about traffic simulation (involving stochastic and computational geometry); both positions have strong practical components.

More details and links for application may be found at
http://www.liu.se/jobba/lediga-jobb?l=en&&rmpage=job&rmjob=3954&rmlang=UK
http://www.liu.se/jobba/lediga-jobb?l=sv&&rmpage=job&rmjob=3922&rmlang=SE (only in Swedish)

Please contact valentin.polishchuk@liu.se with questions.

Toggle description

The Algorithms and Complexity group of IRIF - previously LIAFA - (CNRS and University ParisDiderot), Paris, France, is seeking excellent candidates for one or more postdoctoral positions in classical and quantum computing. Topics of interest include (but are not limited to): algorithms, streaming algorithms, approximation algorithms, online algorithms, communication complexity, cryptography (including post-quantum cryptography), computational game theory, quantum computing, computational applications of logic, randomness in computing.

IRIF is a joint laboratory of the CNRS (the French National Center for Scientific Research) and University Paris Diderot - Paris 7. For more information about IRIF, please see http://www.irif.univ-paris-diderot.fr , and for more information about the Algorithms and Complexity group please see http://algo.irif.univ-paris-diderot.fr . Further information may be obtained from any of the permanent members of the group.

The starting date of the position(s) will usually be in September 2017 but can be negotiated.
The application should include a CV, a summary of research and names of at least three references. For further instructions on how to submit applications, please visit the "openings" sections at: algo.irif.univ-paris-diderot.fr .
The position(s) will be financed either by the team's own resources, or via joint applications of the candidate and the team to external funding sources.

Applications should be received by November 15, 2016.

Toggle description

The Algorithms and Complexity group of IRIF - previously LIAFA - (CNRS and University ParisDiderot), Paris, France, is seeking excellent candidates for one or more postdoctoral positions in classical and quantum computing. Topics of interest include (but are not limited to): algorithms, streaming algorithms, approximation algorithms, online algorithms, communication complexity, cryptography (including post-quantum cryptography), computational game theory, quantum computing, computational applications of logic, randomness
in computing.

IRIF is a joint laboratory of the CNRS (the French National Center for Scientific Research) and University Paris Diderot - Paris 7. For more information about IRIF, please see
http://www.irif.univ-paris-diderot.fr , and for more information about the Algorithms and Complexity group please see http://algo.irif.univ-paris-diderot.fr .
Further information may be obtained from any of the permanent members of the group.

The starting date of the position(s) will usually be in September 2017 but can be negotiated.

The application should include a CV, a summary of research and names of at least three references. For further instructions on how to submit applications, please visit the "openings" sections at: algo.irif.univ-paris-diderot.fr .

The position(s) will be financed either by the team's own resources, or via joint applications of the candidate and the team to external funding sources.

Applications should be received by November 15, 2016.

Toggle description

Yahoo Research is growing its strategic research teams to enable the company to build new products and platforms that our customers need, now and in the future. We have exciting job openings in several technical focus areas that are located in our New York City office located one block from the Times Square.

We hire the best scientific minds who like to roll up their sleeves, make new discoveries and contribute to the success of the business. We are looking for Research Scientists with a PhD degree in Computer Science, Electrical Engineering or Mathematical Optimization. Our scientists specialize in designing and building scalable and reliable distributed and parallel systems that serve all the aspects of big data like data mining, optimization, machine learning, computational economics and analytics. We design innovative algorithms to push the capacity, performance and reliability of our platforms, exploit novel hardware and software architectures, and evaluate the impact in Web-scale production settings. We actively contribute to the scientific and open source communities in foundations of Computer Science, Machine Learning, Mathematical Optimization and Computational Economics.

Here are some reasons to explore this opportunity:
1. We have a huge number of research problems to solve that lie on the intersection of Optimization, Machine Learning and Computational Economics. If you are an expert in one of these fields and want to expand your research profile this is an ideal place for you.
2. We work on game changing products and solutions, you can quickly see how your research ideas and algorithms influence revenue and user engagement.
3. We care about you continuing your fundamental research, publishing papers and keeping track of the latest technologies developed in your respective field.

Responsibilities Include:
· Deep dive into the data to understand and apply patterns, while maintaining a sense of the big picture.
· Work closely with colleagues on the engineering team to put research results into action.
· Provide thought leadership to guide the direction of Yahoo products and services.
· Push your own research agenda and look to influence our products and services with your expertise.

Required Skills and Qualifications
· PhD in Computer Science, Electrical Engineering or Mathematical Optimization.
· Strong research track record (academic or industrial) in one of the following areas: Mathematical Optimization and Algorithm Design, Data Analytics, Machine Learning, Computational Economics (auctions, pricing, mechanism design) or related areas.
· Strong design and implementation skills in Java or C++. Experience with large-scale production code development a plus.
· Ability to conduct research that is justified and guided by business opportunities.
· Strong communication and presentation skills.

The soft application deadline is November 10, 2015.
Please send your CV and a short letter of interest to Maxim Sviridenko (sviri@yahoo-inc.com).