AIRO Young Opportunities

Do you know of more opportunities?

Let us know using the form below, filling in our form, or posting to our group.

Your name
Your email
Title
Url

Refine your search

Search

  Only look for open opportunities
  Only look for opportunities in academia
  Only look for opportunities in the industry

Displaying opportunities 476 - 500 of 514 in total
Expires Title Institution Country Link Type
01 Dec 2016 PhD position in graph theory and algorithms for evolutionary biology

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/

TU Delft Netherlands Go Academia
01 Dec 2016 Research Assistant in Operational Research (Logistics)

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".

University of Modena and Reggio Emilia Italy Go Academia
01 Dec 2016 Tenure-track Assistant Professorship in CS

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.

Wesleyan University United States Go Academia
30 Nov 2016 Postdoc in Optimisation/Simulation

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)

NILE-NEXUS Project United States, Ethiopia, Germany, Italy Go Academia
30 Nov 2016 Scholarships for a Master Programme in Logic and Computation

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.

Technical University of Vienna Austria Go Academia
30 Nov 2016 Postdoc positions in Algorithms and Complexity

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

University of Oxford United Kingdom Go Academia
28 Nov 2016 Assistant Professor (tenure track) in Operational Research

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

School for Advanced Studies - Lucca Italy Go Academia
17 Nov 2016 PhD Positions in Air Traffic and Logistic

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.

Linköping University Sweden Go Academia
15 Nov 2016 Postdoc position in computing

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.

IRIF France Go Academia
15 Nov 2016 Postdoc position in classical and quantum computing

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.

IRIF France Go Academia
10 Nov 2016 Fixed-term 1-year Assistant Professor position (German speaking)

Toggle description

Open position - Assistant Professor with PhD maternity substitution, expected for 1 year
Graz University of Technology
Institute of Discrete Mathematics
Working Group Structure Theory and Stochastics

Starting date: January 1st 2017.
Requirements: PhD or equivalent university degree in Mathematics, awarded before the beginning of the engagement.
Desired qualifictations: scientific work in the fields of Stochastic Processes (random walks), Graph Theory, Geometric Group Theory, possibly combining those topics; in particular stochastic and deterministic aggregation models. Readiness to collaborate in research projects in these areas. Teaching duties of at least 4 hours per week per semester, in particular for Mathematics in the Engineering sciences, in German (!).

Deadline for applications: November 10, 2016.
For details regarding position and applications, see http://www.math.tugraz.at/~woess/position

Graz University of Technology Austria Go Academia
10 Nov 2016 Research Scientist

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).

Yahoo Research United States Go Industry
10 Nov 2016 Research fellow in Applied Modelling and Optimisation

Toggle description

The Faculty of Information Technology at Monash University, Melbourne, Australia, has strong research programs across many aspects of modelling and optimisation. The faculty is expanding its joint research with industry and other research disciplines, applying advanced analytics and decision support to solve scientific and industrial problems.

In this role you will conduct joint applications-oriented research with external industry and research partners applying advanced methods developed by the Monash optimisation team. You will also be involved in the implementation of software solutions that realise the benefits of our optimisation research in practical applications.

As the successful applicant, you will have a PhD in a relevant field of information technology or engineering and an excellent record of innovative research and development in software for resource optimisation. You will also have a demonstrated capacity to apply optimisation methods to real-world problems. If you believe you match this profile, we look forward to receiving your application.

This is a three year fixed-term full-time position, at $64,450 - $87,471 pa (Level A) or $92,074 - $109,339 pa (Level B), plus 17% employer superannuation. Applications close Thursday 10 November 2016, 11:55pm AEDT.

For full details please see http://careersmanager.pageuppeople.com/513/cw/en/job/551138/research-fellow-applied-modelling-and-optimisation

Monash University, Melbourne Australia Go Academia
07 Nov 2016 Postdoc position in Massive Data Algorithmics

Toggle description

Center for Massive Data Algorithmics (MADALGO), is a basic research center funded by the Danish National Research Foundation. The center is located in the Department of Computer Science, Aarhus University, Denmark, but also includes researchers at CSAIL, Massachusetts Institute of Technology, at the Max Planck Institute for Informatics and at
Frankfurt University. The center covers all areas of the design, analysis and implementation of algorithms and data structures for processing massive data (interpreted broadly to cover computations where data is large compared to the computational resources), with focus on I/O-efficient, cache-oblivious and streaming algorithms. See www.madalgo.au.dk for more information. In addition, the center researchers have a strong emphasis on computational complexity, in particular within the areas of data structure lower bounds and fine-grained complexity (the recent "hardness in P" area).

Starting February 1, 2017 or later, one or more postdoc positions are available at MADALGO under the supervision of Professor Lars Arge (www.madalgo.au.dk/~large), Professor Gerth S. Brodal (www.madalgo.au.dk/~gerth), Associate Professor Peyman Afshani (www.madalgo.au.dk/~peyman), Assistant Professor Kasper Green Larsen (www.madalgo.au.dk/~larsen) and Assistant Professor Thomas Dueholm Hansen (www.madalgo.au.dk/~tdh). MADALGO welcomes postdoctoral researchers with clearly demonstrated experience and skills in computational complexity and/or the design and analysis of algorithms and data structures.

Researchers with experience in one or more of the areas I/O-efficient, cache-oblivious, streaming algorithms and computational complexity are preferred. The responsibilities of MADALGO postdocs include work on the above areas in collaboration with center researchers, along with modest teaching responsibilities.

The application deadline for the position is November 7th, 2016. Applicants should apply by sending a letter of interest and a CV, as well as indicate at least two names of references for recommendations, to MADALGO center manager Trine Holmgaard (email tjh@madalgo.au.dk).

Aarhus University Denmark Go Academia
01 Nov 2016 Postdoc position in Vehicle Routing and Scheduling

Toggle description

The DFG-funded project ENS.VRSP: Efficient Neighborhood Search in Vehicle Routing and Scheduling offers the following two positions starting January 1st, 2017. The extended application deadline is November, 1st.

- 1 research assistant / postdoc (full-time, Entgeltgruppe 13 TV-L) at JGU Mainz (Prof. Dr. Stefan Irnich), and
- 1 research assistant / PhD-level (75%, Entgeltgruppe 13 TV-L) at RWTH Aachen (Prof. Dr. Michael Schneider).

JGU Mainz Germany Go Academia
01 Nov 2016 PhD position in Vehicle Routing and Scheduling

Toggle description

The DFG-funded project ENS.VRSP: Efficient Neighborhood Search in Vehicle Routing and Scheduling offers the following two positions starting January 1st, 2017. The extended application deadline is November, 1st.

- 1 research assistant / postdoc (full-time, Entgeltgruppe 13 TV-L) at JGU Mainz (Prof. Dr. Stefan Irnich), and
- 1 research assistant / PhD-level (75%, Entgeltgruppe 13 TV-L) at RWTH Aachen (Prof. Dr. Michael Schneider).

RWTH Aachen Germany Go Academia
31 Oct 2016 Postdoc position in Machine Learning and Graph Theory

Toggle description

The Information Sciences group and the Center for Nonlinear Studies at the Los Alamos National Laboratory have an opening at a postdoctoral level. The research will involve elements of machine learning and graph theory. It will be a part of a multi-disciplinary project in high-performance simulation that is based on a dynamic graph modeling of physical processes.

Candidates are expected to have strong analytical and programming skills. The successful applicant should have a strong publication record and will be expected to publish results in high impact peer-reviewed journals and conferences. This is a long-term appointment (up to three years), so candidates who can commit to a longer time frame will be preferred. However, candidates available for shorter periods may be considered for internships.

Qualifications:
(1) A PhD in Computer Science, Computer Engineering, or Mathematics;
(2) Research-level expertise in at least one of the following: machine learning, graph theory;
(3) Strong programming skills;
(4) Demonstrated ability to publish research in peer-reviewed journals or conference proceedings in the areas of machine learning and/or graph theory;
(5) Excellent oral presentation and writing skills
(6) Willingness to work in interdisciplinary project teams and learn about other fields

Applications received before October 31, 2016 will receive a full consideration.

US citizenship is NOT required for this position.

For informal inquiries you can contact Hristo Djidjev, djidjev@lanl.gov

Los Alamos National Laboratories United States Go Academia
31 Oct 2016 Postdoc position in Graph Theory and Algorithmic Metatheorems

Toggle description

The Faculty of Informatics of Masaryk University (FI MU) in Brno, Czech Republic, http://www.fi.muni.cz/, invites applications for Post-doctoral positions in all areas of Computer Science.

This includes, in particular, the area of Structural and Topological/geometric Graph Theory, and Algorithmic Metatheorems.
Please contact Petr Hlineny if you are interested in these particular topics (or can suggest a strong candidate).

* Offer
The positions are awarded for one year with an extension to the second year after a review. Gross salary is 50,000 CZK per month which, with an
optional 10% bonus, sums to more than 24,000 EUR per year. Additional funds of 4,000 EUR per year will be available for travel and material
expenses. Expected start date of the contract is Jan 1, 2017, but a later start date may be negotiated. Deadline for application: October 31, 2016

* Requirements and application procedure
See: http://www.muni.cz/general/employment_offers/32687v
All candidates are expected to be fluent in English, while prior knowledge of Czech is not required. Candidates will be evaluated on the ground of their strong international research record.

Masarik University of Brno Czech Republic Go Academia
30 Oct 2016 Postdoc position in algorithms and algorithms engineering

Toggle description

Department of Computer Science
University of Vienna

Postdoc position in algorithms and algorithms engineering

Two postdoc positions are available in the research group “Theory and Applications of Algorithms” as part of the ERC Project of Professor Monika Henzinger. See http://cs.univie.ac.at/taa/research/projects/project/infproj/1051/ for more information.

The positions are available starting January 1, 2017 (or later) and will be of 2 years.

If you are interested, please send your application(CV and names of 3 references) to monika.henzinger@univie.ac.at by October 30, 2016.

University of Vienna Austria Go Academia
28 Oct 2016 Junior Research Group Leader in "Optimisation under uncertainty"

Toggle description

Position of junior research group leader for "Optimization under Uncertainty" at TU Berlin

In the framework of the Einstein Center for Mathematics Berlin (ECMath) we are looking for candidates to lead a junior research group "Optimization under Uncertainty" in the area of Algorithmic Discrete Mathematics. The position is paid according to "Entgeltgruppe 14 TV-L Berliner Hochschulen".

The area of Algorithmic Discrete Mathematics plays a key role as a connecting link between mathematics, computer science, and applications in economics and industry. Candidates are expected to have a solid background in Algorithmic Discrete Mathematics with clear connections to Discrete Optimization and the ECMath Innovation Area "Mathematics in Metropolitan Infrastructure". Favored research areas are Optimization under Uncertainty, Robust Optimization, and Algorithmic Game Theory. Candidates should be interested in interdisciplinary projects with other scientific disciplines as well as industry.

We are looking for postdocs who have already proved their scientific independence and are about to establish their own research program. Initially the position is limited to 3 years and might be extended to 6 years upon positive evaluation and subject to availability of funds. The junior research group also includes a position for a PhD student.

Please send your written application by October 28th, 2016 with appropriate documentation to

TU Berlin
- Der Praesident -
Fak. II, Sekr. MA 3-1
Str. des 17. Juni 136
10623 Berlin
Germany

Please send copies only. Original documents will not be returned.

TU Berlin Germany Go Academia
28 Oct 2016 PhD position in Approximation Algorithms for Robust Scheduling

Toggle description

We are looking for an outstanding student with a good background in combinatorial optimization and good English skills to start a thesis in approximation algorithms for robust scheduling. The thesis should start between January and December 2017. More details are available here:

https://www.lirmm.fr/content/download/10857/163594/file/opt_comb.pdf

Interested students should send a CV to michael.poss@lirmm.fr including marks, ranking, and letters of recommendation.

Marin Bougeret
Michael Poss

University of Montpellier France Go Academia
26 Oct 2016 Grant in "Analytical models for risk evaluation and liability management of Pillar-2-type pension systems"

Toggle description

OECD pension systems have undergone a relevant restructuring and transition process over the last few years towards the establishment of a three pillar system, based on a reduction of the weight of classical pillar-1 social security systems in favour of pillar-2 private-sector‐specific and corporate occupational funds, largely implying a growing involvement of insurance companies and pension funds, as well as an increasing popularity of pillar-3 individual retirement policies. Limiting our interest to saving processes in the retirement sector and specifically on pillar 2, thus primarily linked to large corporation and industrial sectors, occupational funds concentrate a relevant set of complex modelling and mathematical issues, recently further increased by the introduction of regulatory frameworks in OECD countries (cf https: //eiopa.europa.eu European Insurance and Occupational Pensions Authority).

Those methodological implications emerge in particular when taking the stimulating perspective of an intertemporal and intergeneration transformation of saved income for deferred consumption leading to an optimal dynamic asset ‐ liability management by a defined benefit pension fund (PF). Consider in particular an economic agent (a CEO or a central investment committee, or alike) who on the grounds of a received mandate, is seeking a long‐term PF sustainability goal under an extended set of risk constraints.

This problem carries indeed a set of sub‐problems with relevant statistical and mathematical implications:
‐ A market‐based or market‐consistent valuation of liabilities and assets: on the asset side, this involves an investment portfolio needed to fund the pensions payments net of contributions and on the liability side the defined benefit obligation (DBO) of the Fund.
‐ The estimation of the risk exposure related with the liabilities: as the market yield curve varies, so will discount factors adopted to determine the PF DBO. Furthermore PF liabilities depend on adopted pensions indexation schemes and their revaluation in real, inflation‐adjusted terms, requiring the use of stochastic methods. Finally PF are exposed to the so‐called longevity risk and members population dynamics.
‐ The definition of an objective function capturing a trade‐off between short‐ and long‐term decision criteria: among the former an adequate liquidity and interest rate risk‐immunization approach and medium‐term profitability and among the latter the minimization of solvency risk and maximization of risk‐adjusted returns.

The adoption of a dynamic optimization approach appears in this respect a first choice, following recent experiences particularly in UK and Northern European economies.

University of Bergamo Italy Go Academia
17 Oct 2016 Postdoc positions in Operational Research

Toggle description

Postdoctoral fellowships are available in the Department of Mathematics at TU Munich. We are seeking exceptional, highly motivated candidates with expertise or interest in algorithms, algorithmic game theory, combinatorial optimization, integer programming, machine learning, or stochastic optimization.

Positions are initially for one year, with the possibility of extension. The starting date is flexible. Compensation is competitive and depends on the applicant’s qualification. Funds for conference travel, extended stays abroad, visitor programs, and other activities are available.

Located in southern Germany, very close to the Alps, Munich is considered one of the most beautiful and livable cities, rich in culture and with ample opportunities for leisurely activities. TU Munich is ranked among the best universities in the world. Its highly renowned Math and CS Departments provide an excellent environment for both young and established researchers. The group, headed by Alexander von Humboldt-Professor Andreas S. Schulz, has an international focus and maintains strong collaborations with leading scientists worldwide.

Applicants should have a PhD degree in mathematics, theoretical computer science, operations research, or a related discipline. Applications should include a detailed CV, a brief statement of research interests and career aspirations, transcripts, and names and contact details of at least three references.

Please send your application via email, as a single pdf file, to our assistant, Ms. Jamila Tazit, at jamila.tazit@tum.de. The deadline to ensure full consideration is October 17, 2016. Late applications may be considered on a case-by-case basis.

TUM is an equal opportunity employer. Women are particularly encouraged to apply. For candidates with equal qualification, preference will be given to people with disabilities.

TU Munich Germany Go Academia
17 Oct 2016 Postdoc position in sublinear and randomised algorithms

Toggle description

Applicants are sought for a postdoctoral position in connection with a grant of Artur Czumaj (http://www.dcs.warwick.ac.uk/~czumaj/).

We are looking for highly qualified candidates with a PhD degree (or expecting to get one very soon) in combinatorics, discrete mathematics, theoretical computer science, or related fields. The main focus of the post is on the research in the broadly understood area of design and mathematical analysis of sublinear and randomized algorithms, including research in property testing and combinatorics, and sublinear-time approximation algorithms for combinatorial and optimization problems.

The position is affiliated with the Centre for Discrete Mathematics and its Applications, DIMAP (http://www2.warwick.ac.uk/dimap/) and the Foundations of Computer Science Research Group (http://www.dcs.warwick.ac.uk/research/focs/) in the Department of Computer Science at the University of Warwick.

The post is available for up to 2 years.

Closing date for receipt of applications: October 17, 2016.

Informal inquiries should be addressed to Artur Czumaj at A.Czumaj@warwick.ac.uk.

Formal applications, which include CV with a list of publications, a research statement, and a short statement highlighting your suitability for this post, should be made following the link at http://www.jobs.ac.uk/job/ATZ889/research-fellow-76864-105/.

Closing date: October 17, 2016.

University of Warwick United Kingdom Go Academia
15 Oct 2016 Postdoc position in approximation algorithms

Toggle description

This is to announce one-year postdoc positions (with possible extensions) at the Institute of Informatics, University of Warsaw, Poland. The positions are supported by the ERC Starting Grant TOTAL: “Technology transfer between modern algorithmic paradigms” led by Marek Cygan. The project is focused on two algorithmic paradigms being approximation algorithms and fixed parameter tractability. Also, in the project we will study (randomized) local search heuristics. We would like to note that the algorithmic group in Warsaw is strong and growing.

We are looking for outstanding candidates with a Ph.D. (or soon to obtain a Ph.D.) in Computer Science or Mathematics who have already proven their high scientific potential in the area of algorithms through publications in proceedings of highly ranked international conferences and/or journals. Strong background in approximation algorithms, fixed parameter tractability or Markov chains’ mixing time analysis will be an advantage.

The base annual gross salary is 105,000PLN, however this amount may be increased for exceptionally good candidates. For comparison, this translates to 2.05 times the average salary in Poland (see also http://www.numbeo.com/cost-of-living/city_result.jsp?country=Poland&city=Warsaw&displayCurrency=PLN for a detailed summary the costs of living in Warsaw). The position comes with a generous travel support and _no_ teaching duties.

The review of applicants will begin immediately and continue in an all-year-round manner. The starting date is flexible and the review of candidates will be performed at least once per 3 months to fill vacant positions. The first evaluation will be performed on October 15, 2016, hence we encourage all candidates to submit applications by this date.

To apply, send a CV and a research statement by email to Marek Cygan (cygan@mimuw.edu.pl) and arrange two letters of recommendation to be send to this address. Questions and informal inquiries are welcome. Please use
[TOTAL] in the email subject.

University of Warsaw Poland Go Academia