Friday, August 17, 2018

[DMANET] 2-year postdoctoral position in kernelization and preprocessing at HU Berlin (until Sep 2020)

Department of Computer Science
Humboldt-Universität zu Berlin

1 Postdoctoral Position in Kernelization and Preprocessing
Research Assistant (100% TV-L E 13), 2 years (until Sep 20, 2020)

A 2-year postdoctoral position in kernelization and preprocessing is
available in the research group of Prof. Stefan Kratsch at the
Department of Computer Science at Humboldt-Universität zu Berlin. The
intended starting date is November 2018, a later start may be
negotiated. The position is funded until September 30, 2020, and is paid
according to TV-L E 13. (Salary depends on experience and amounts to at
least 3500 Euros per month before taxes.) The position is funded by the
German Research Foundation (DFG) and there is no teaching duty
associated with it.

Ideally, the postdoc should have a research background in kernelization
or other forms of preprocessing. (Here kernelization refers to the term
from parameterized complexity *not* to machine learning. Preprocessing
is broadly interpreted.) At least half of the work time should be
devoted to these topics. Further interests in other branches of
algorithmic research are also welcome.

Berlin offers a strong scientific landscape with plenty of opportunity
for collaborations. There are three universities, the DFG research
training group "Facets of Complexity", the DFG research center MATHEON,
and the Berlin Mathematical School (BMS). Besides sciences, Berlin
offers a rich, international, and multicultural living environment,
which should cater to most interests and hobbies.

The successful candidate should
* hold a PhD in computer science or mathematics
* have a research background in kernelization or preprocessing
* be fluent in English

Interested applicants should send their application containing
* a cover letter
* a CV and list of publications
* a short research plan
* a copy of the PhD diploma
* and names and contact information of two references
* a desired starting date for the position

in pdf format

by

** September 13, 2018. **

to

Prof. Stefan Kratsch
kratsch <at> informatik.hu-berlin.de


Prof. Stefan Kratsch
Department of Computer Science
Humboldt-Universität zu Berlin
Unter den Linden 6
D-10099 Berlin
Germany


p.s.
A short official announcement of the position (in German) can be found at
https://www.personalabteilung.hu-berlin.de/stellenausschreibungen/wissenschaftlicher-mitarbeiter-m-w-d-mit-vorauss-vollzeit-e-13-tv-l-hu-drittmittelfinanzierung-befristet-bis-30-09-2020
**********************************************************
*
* 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, August 16, 2018

[DMANET] Call for Papers - X Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS)

Apologies if you got multiple copies of this email.

--------------------------------------------------------------------------------------
CALL FOR PAPERS
LAGOS'19 - X Latin and American Algorithms, Graphs and Optimization
Symposium


Belo Horizonte, Brazil
June 2nd - 7th, 2019

Web site: http://lagos2019.dcc.ufmg.br


About the conference

LAGOS'2019 will be held in Belo Horizonte, Brazil. The previous editions
were held in Fortaleza, Brazil (GRACO 2001), Santiago, Chile (LACGA 2004),
Angra dos Reis, Brazil (GRACO 2005), Puerto Varas, Chile (LAGOS
2007),Gramado, Brazil (LAGOS 2009), Bariloche, Argentina (LAGOS 2011),
Playa del Carmen, Mexico (LAGOS 2013), Fortaleza, Brazil (LAGOS 2015) and
Marseille, France (LAGOS 2017). As in previous editions, the conference
proceedings will be published in a selected journal, Electronic Notes in
Theoretical Computer Science, and a special edition of Discrete Applied
Mathematics will be devoted to selected full papers after the conference.


Conference themes

Themes include, but are not limited to:

Algorithms and complexity: algorithms and computational complexity;
approximation algorithms; randomized algorithms; computational geometry;
parameterized complexity.

Operations Research and Mathematical Programming: combinatorial
optimization; integer programming; polyhedral combinatorics; operations
research and management science.

Graph Theory: cliques, dominating and independent sets; colorings; covering
and packing, factorization, matching; digraphs, tournaments; graph
algorithms; graphs and matrices; hypergraphs; perfect graphs; random
graphs; structural characterization of graph classes.

Applications: mathematical programming, combinatorial optimization,
continuous optimization, heuristics, and metaheuristics, applied to
real-world problems.


Invited Speakers

TBA


Important dates

Submission deadline: November 11th, 2018 (23h55 GMT).
Notification of acceptance: February 15th, 2019
Registration opening: TBA
Conference: June 2nd - 7th, 2019

Submission instructions can be found at the conference webpage:
http://www.lagos2019.dcc.ufmg.br/?page_id=93

LAGOS Steering Committee

Guilermo Durán (UBA, Argentina and UChile, Chile)
Celina Herrera de Figueiredo (UFRJ, Brazil)


Scientific Committee

Ahmad Abdi (CMU, USA)
Liliana Alcón (UNLP, Argentina)
Marthe Bonamy (CNRS, LaBRI, France)
Flavia Bonomo (UBA, Argentina)
Julia Böttcher (LSE, UK)
Gabriel Coutinho (UFMG, Brazil)
Alexandre Cunha (UFMG, Brazil)
Simone Dantas (UFF, Brazil)
Mitre Dourado (UFRJ, Brazil)
Luciano Grippo (UNGS, Argentina)
Frederic Havet (CNRS, INRIA, France)
Carlos Hoppen (UFRGS, France)
Felix Joos (Univ. of Birgmingham, UK)
Marcos Kiwi (U. Chile, Chile)
Yoshiharu Kohayakawa (USP, Brazil) (co-chair)
Chun-Hung Liu (Princeton Univ, USA)
Martín Matamala (U. Chile, Chile)
Giuseppe Mazzuoccolo (Univ. degli Studi di Verona, Italy)
Martin Milanič (Univ. of Primorska, Slovenia)
Flavio K. Miyazawa (UNICAMP, Brazil)
Natasha Morrison (Univ. of Cambridge, UK)
Nicolas Nisse (INRIA, France)
Jonathan Noel (Warwick Univ., UK)
Thiago Noronha (UFMG, Brazil)
Daniel Panario (Carleton Univ., Canada)
Miguel Pizaña (Univ. Autónoma Metropolitana, Mexico)
Dieter Rautenbach (Univ. of Ulm, Germany)
Bruce Reed (McGill Univ., Canada)
Bernard Ries (Univ. de Fribourg, Switzerland)
Martín Darío Safe (Univ. Nacional del Sur, Argentina)
Rudini Sampaio (UFC, Brazil)
Vinicius dos Santos (UFMG, Brazil) (co-chair)
Marcone Jamilson Freitas Souza (UFOP, Brazil)
Jayme Szwarcfiter (UFRJ, Brazil)
Sebastián Urrutia (UFMG, Brazil) (co-chair)
Annegret Wagler (Univ. Blaise Pascal, France)
Yoshiko Wakabayashi (USP, Brazil)


Organizing Committee

Gabriel Coutinho (UFMG, Brazil)
Vinicius dos Santos (UFMG, Brazil)
Sebastián Urrutia (UFMG, Brazil)

**********************************************************
*
* 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] Deadline for CFP Extended: ORSI 2018, Mumbai, India

Dear colleagues and friends

The deadline to submit full papers and abstracts for talks for ORSI 2018 has
been extended to 31st August 2018.

Operational Research Society of India (ORSI) - Mumbai Chapter and IIT Bombay
invite you to participate in the 51st Annual Convention of ORSI and
International Conference (ORSI-2018) to be held on 16-19th, December 2018 at
IIT Bombay, Mumbai, India. ORSI-2018 is a leading platform in India for sharing
information, among academia and industry, on the latest theory, methods,
techniques, applications and the practice of OR. The ORSI conference has been
attended by 250+ participants from several countries in the previous years.

The theme of the ORSI-2018 conference is Emerging Trends in Operations Research
and Management Science (OR/MS). The details of the conference tracks and areas
are available on the conference website:
www.ieor.iitb.ac.in/orsi2018

We invite papers (extended abstract/ full paper) from academicians,
practitioners and industry professionals to share their theoretical
contributions, real-life applications, case studies, review and discussion
papers on the conference theme and related areas of OR. The conference also
features tutorials on basic and advanced topics in OR. ORSI recognises
outstanding work including Best Paper Awards, Best Practice Award, M.C.Puri
Memorial Award, Distinguished Educator Award, ORSI Fellowship, and more at the
conference.

Important dates and deadlines:
The deadline for paper (extended abstracts/ full paper) submission is 31st August 2018
The deadline for application for ORSI Competition on Practice of Management
Science and Analytics is 31st July 2018
PreConference Workshop: 16th December 2018
Main Conference: 17th-19th December 2018

Visit www.ieor.iitb.ac.in/orsi2018 for latest information about the conference,
paper formats, registration procedures, etc.

Thank you and looking forward to meeting you at the conference.
--
Regards
Ashutosh Mahajan
http://www.ieor.iitb.ac.in/amahajan

**********************************************************
*
* 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, August 15, 2018

[DMANET] PhD Position in Algorithmic Game Theory/Machine Learning at University of Zurich, Switzerland

The Computation and Economics Research Group at the University of
Zurich is inviting applications for

**1 fully funded PhD position in Computer Science (Algorithmic
Game Theory + Machine Learning).**

The position will be funded by a new **ERC Starting Grant** on
"Machine Learning-based Market Design" led by Prof. Dr. Sven Seuken.
The successful applicant will join a team of 3 PhD students and
1 PostDoc jointly working on this research project over a time period
of 4-5 years.

Market design is a research field that combines techniques from
computer science, game theory, operations research, and other fields.
Its goal is to design new, well-functioning marketplaces or repair
ones that are broken. In our research group, we study foundational
market design questions from an algorithmic and game-theoretic
perspective. Current group members work on a variety of projects
including combinatorial auctions, data markets, cloud computing
markets, financial markets, and equilibrium finding algorithms. The
focus of this position will be on the intersection of machine learning,
market design, and algorithmic game theory. We publish our research in
the top international conferences and journals in the areas of AI and
Economics and Computation. In some projects, we also collaborate with
industrial partners such as Google and Microsoft.

We offer:
- a team of young and highly motivated colleagues who are passionate
about topics at the intersection of computer science and game theory
(in particular: market design)
- a competitive salary of approximately 53,000 Euro per year
- generous support for professional travel and research needs
- an opportunity to take graduate level courses at the University of
Zurich and ETH Zurich
- an opportunity to gain teaching and mentoring experience
- strong support for your professional/career development (including
research internships)
- an attractive work environment both within the research group and
beyond: the University of Zurich is one of Switzerland's leading
universities in the middle of a vibrant, cosmopolitan city that
regularly ranks as one of the cities with the highest quality of life
in the world.


You have:
- a master's degree in computer science or a related field (e.g.,
mathematics, economics, or operations research). Highly qualified
students with a bachelor's degree may also apply.
- an interest in topics at the intersection of computer science and
game theory
- strong mathematical skills and a good background in
theoretical computer science
- excellent communication skills in English (German speaking skills
are not necessary)
- prior knowledge in game theory, machine learning, or optimization
is desirable but not required.

If you fit this profile, like challenging tasks, and are passionate
about research, then we would love to hear from you. Women are
particularly encouraged to apply. To submit your application,
please go to: http://www.ifi.uzh.ch/en/ce/jobs/phd.html

All applications received by August 28, 2018 will be considered.
Applications received afterwards will be considered until both
positions are filled. The preferred starting date is September 17,
but the exact starting date is negotiable. Further
information about the research group is available online at:
http://www.ifi.uzh.ch/ce.


Best,
Sven Seuken

--
Sven Seuken, PhD
Associate Professor of Computation and Economics
Department of Informatics
University of Zurich
http://www.ifi.uzh.ch/ce

**********************************************************
*
* 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, August 14, 2018

[DMANET] University of Edinburgh: Postdoctoral Research Associate in Data-Driven Portfolio Risk Management

Applications are invited for a 20-month postdoctoral position in the areas =
of computational mathematical finance, machine learning and optimization wi=
th a particular focus on probabilistic and optimization data-driven methods=
used in portfolio theory.

The successful candidate will join a team of four mathematicians: Sergio Ga=
rc=EDa Quiles, Jacek Gondzio, Joerg Kalcsics and Sotirios Sabanis who bridg=
e between the Edinburgh Research Group in Optimization<https://www.maths.ed=
.ac.uk/ERGO/> and the Probability group<https://www.maths.ed.ac.uk/school-o=
f-mathematics/research/psa
>.

The project is funded by the EPSRC Impact Acceleration Account and Standard=
Life Investments<http://www.standardlifeinvestments.com/> and will involve=
research in data-driven portfolio construction approaches to optimal diver=
sification. The project is a step towards a strategic partnership between E=
dinburgh University and Standard Life Investments (SLI) focused on quantita=
tive portfolio and investment research. There will be opportunities to inte=
ract with SLI in order to enhance understanding of practical research impli=
cations and aid further career development.

The position should be taken up in October 2018 or soon after.

The starting salary will be in the range of =A332,548 - =A338,833 per annum=
, depending on experience.

Please include a CV and research statement with your application and arrang=
e for two referees to send letters of recommendation to hr@maths.ed.ac.uk b=
y the closing date.

Informal enquiries:
Prof Gondzio: +44 131 650 8574, J.Gondzio@ed.ac.uk
Dr Sabanis: +44 131 650 5084, S.Sabanis@ed.ac.uk

The closing date is Friday 7th September 2018 at 5pm (GMT).

For more information, please see: https://www.vacancies.ed.ac.uk/pls/corehr=
recruit/erq_jobspec_version_4.jobspec?p_id=3D044741

The University of Edinburgh promotes equality and diversity, holds a Bronze=
Athena SWAN award and supports the LMS Good Practice Scheme. We strive for=
a family-friendly School of Mathematics.


----------------------------------------------
Joerg Kalcsics
Lecturer in Operational Research
School of Mathematics
University of Edinburgh

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

Monday, August 13, 2018

[DMANET] 1 PhD Position in control of connected and autonomous vehicles at the University College Dublin

*One Ph.D. position* is available at the Systems and Control Group within
the School of Electric and Electronic Engineering of the *University
College Dublin*. The Ph.D. student will work under the supervision of Dr.
Giovanni Russo (email: giovanni.russo1@ucd.ie).

For this position, we are seeking candidates for our mobility work with the
Science Foundation Ireland Research Center Lero (
https://www.sfi.ie/sfi-research-centres/lero/). The project seeks to *develop
closed loop strategies, leveraging Distributed Ledger Technology, for the
control of autonomous and connected vehicles.* The work will be aimed at
developing novel tools from nonlinear dynamics, distributed optimization
and AI to design collaborative services within vehicles. The research will
have both a theoretical and applied, hands-on, aspect.

The ideal candidate should have a background in:
1. nonlinear dynamics and complex systems;
2. intelligent transportation;
3. optimization;
4. statistics.

*To apply:*
send a cover letter stating your interest in the position and your CV to
giovanni.russo1@ucd.ie. Pre-applications and informal inquiries can be made
to Dr Giovanni Russo.The positions are available starting from September
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] Ph.D. and TA position in operations management (Ghent University)

The department of Business Informatics and Operations Management at Ghent University is currently looking for a candidate as a teaching assistant. The candidate is also expected to do a Ph.D. in the area of logistics and supply chain management.

The student will be supervised by Prof. Veronique Limère and undergo a training program in the program Doctor of Business Economics.
It is a full-time position and the student is expected to spend at least 50% of the time on his/her research.

Further information on the position and application process can be found under the following link:
https://career5.successfactors.eu/career?career_ns=job_listing&company=C0000956575P&navBarLevel=JOB_SEARCH&rcm_site_locale=nl_NL&site=VjItRG9OVktVYS9CQ3J3RmtmaHoxaFpSQT09&career_job_req_id=11524&selected_lang=nl_NL&jobAlertController_jobAlertId=&jobAlertController_jobAlertName=&_s.crb=NKWuA7jAUdBVaembMcoyLLHlmxY%3d


**********************************************************
*
* 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, August 10, 2018

[DMANET] KaHyPar - Karlsruhe Hypergraph Partitioning

KaHyPar - Karlsruhe Hypergraph Partitioning
------------------------------------------------------------

We are pleased to announce the release of KaHyPar (Karlsruhe Hypergraph Partitioning).
KaHyPar is a multilevel hypergraph partitioning framework for optimizing the cut- and the (? ? 1)-metric.
It supports both recursive bisection and direct k-way partitioning. As a multilevel algorithm, it consists
of three phases: In the coarsening phase, the hypergraph is coarsened to obtain a hierarchy of smaller
hypergraphs. After applying an initial partitioning algorithm to the smallest hypergraph in the second phase,
coarsening is undone and, at each level, a local search method is used to improve the partition induced by
the coarser level.

KaHyPar instantiates the multilevel approach in its most extreme version, removing only a single vertex in
every level of the hierarchy. By using this very fine grained n-level approach combined with strong local
search heuristics, it computes solutions of very high quality.

KaHyPar contains fast coarsening schemes that incorporate global information about the community structure
into the coarsening process. It uses a portfolio-based approach to initial partitioning and employs highly
engineered refinement algorithms (including max-flow computations) for both bipartitioning and direct k-way
partitioning that are specifically tailored to the n-level approach. Additional features include a memetic algorithm,
partitioning with variable block weights, and partitioning with fixed vertices.

The software is released under the GPL 3.0 license.

Website: http://www.kahypar.org

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

--
Karlsruhe Institute of Technology (KIT)
Institute of Theoretical Informatics - Algorithms II

Sebastian Schlag, M.Sc.
Doctoral Researcher

Am Fasanengarten 5, Gebäude 50.34
76131 Karlsruhe, Germany

Phone: +49 721 608-45270
Fax: +49 721 608-43088
Email: sebastian.schlag@kit.edu<mailto:sebastian.schlag@kit.edu>
Web: http://www.kit.edu/

KIT - University of the State of Baden-Wuerttemberg and
National Research Center of the Helmholtz Association ?

**********************************************************
*
* 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, August 8, 2018

[DMANET] WEPA 2018 2nd Call for Papers

WEPA 2018 2nd CALL FOR PAPERS

WEPA 2018: Second Workshop on Enumeration Problems and Applications
November 5-8, Department of Computer Science, University of Pisa, Pisa
Submission Deadline: Sep 3, 2018 (AoE)
Notification: Sep 25, 2018

The WEPA 2018 conference is the Second Workshop on Enumeration Problems and
Applications. It will take place at Department of Computer Science of
University of Pisa, in Pisa (Italy). The conference will take place from
Monday November 5 to Tuesday November 8, 2018.


IMPORTANT DATES

Submission of papers: Sep 3, 2018 (AoE)
Acceptance notification: Sep 25, 2018
Registration: Oct 15, 2018
Conference: Nov 5-8, 2018

WEBSITE: wepa2018.di.unipi.it


AIMS AND SCOPE

WEPA is a new international forum for researchers in the area of design,
analysis, experimental evaluation and engineering of algorithms for
enumeration problems. The objective of the workshop is to gather
researchers working in enumeration algorithms, including their applications
in Biology, Data Mining, Logic, and Database. The goal is to present recent
results, identify and explore directions for future research, and foster
collaborations.

For this reason, along with the sessions for the presentation of
established results, this year WEPA will introduce new sessions that are
devoted to ideas, sketches, and open problems: hopefully this will put in
touch senior researchers with junior researchers and graduate students to
investigate problems of theoretical and practical interest. These new
sessions will be informal, with no scheduled presentations, entirely
devoted to the interactions among the participants. The workshop will be
accommodated some rooms to allow space for the parallel working groups.

Submissions to WEPA should describe results in any area of enumeration
problems and including, but not restricted to:
- Applications in Biology, Data Mining, Logic, and Database
- Approximate enumeration and counting
- Combinatorial enumeration and counting (hypergraph dualization, lattices,
functional dependencies,...)
- Input-sensitive algorithms
- Output-sensitive algorithms

There is no registration fee for WEPA this year. However, it is mandatory
to register before 20 October 2018 by sending a message to
wepa2018nov@gmail.com


SUBMISSIONS AND PROCEEDINGS

Contributors are invited to submit an extended abstract of at most 2 pages
(excluding the references) to be submitted electronically using EasyChair
at the link https://easychair.org/conferences/?conf=wepa2018. Invited
papers and accepted contributions will be invited to contribute to a
special issue in a journal.


INVITED SPEAKERS

Endre Boros (Rutgers University)
Fedor Fomin (University of Bergen)
Benny Kimelfeld (Technion - Israel Institute of Technology)
Shin-ichi Minato (Kyoto University)
Marie-France Sagot (Inria & Laboratoire de Biométrie et Biologie Évolutive,
Lyon)


PROGRAM COMMITTEE

Hiroki Arimura (Hokkaido University)
Endre Boros (Rutgers University)
Alessio Conte (National Institute of Informatics, Tokyo)
Nadia Creignou (Aix-Marseille Université)
Fedor Fomin (University of Bergen)
Petr Golovach (University of Bergen)
Benny Kimelfeld (Technion - Israel Institute of Technology)
Andrea Marino - PC Chair (University of Pisa)
Arnaud Mary (Laboratoire de Biométrie et Biologie Évolutive, Lyon)
Shin-ichi Minato (Kyoto University)
Lhouari Nourine (University Blaise Pascal, Aubiere)
Romeo Rizzi (University of Verona)
Marie-France Sagot (Inria & Laboratoire de Biométrie et Biologie Évolutive,
Lyon)
Takeaki Uno - PC Chair (National Institute of Informatics, Tokyo)
Kunihiro Wasa (National Institute of Informatics, Tokyo)

LOCAL ORGANIZING COMMITTEE

Alessio Conte
Roberto Grossi - Chair
Shima Moghtasedi
Luca Versari

**********************************************************
*
* 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 on Speeding up Algorithms with Machine Learning (TU Wien, Vienna, Austria)

There is an opening for a fully funded PhD position on the topic of Speeding up Algorithms with Machine Learning (ML) Methods at TU Wien, Vienna, Austria. The PhD student will join Prof. Stefan Szeider's research group (https://www.ac.tuwien.ac.at) to develop and implement new methods for leveraging Machine Learning algorithms for improving the efficiency of algorithms for hard combinatorial problems. Possible research topics include: (i) ML-based algorithm selection and algorithm tuning, (ii) ML-based heuristics, and (iii) ML-based problem encodings to SAT/SMT/QBF/ILP solvers. Applicants are expected to have solid programming skills as well as interest in theoretical computer science. Background in ML and/or discrete algorithms and/or SAT-solving is of advantage.

The successful candidate will be part of the Doctoral Program on Logical Methods in Computer Science (http://logic-cs.at/phd/) and will have all the benefits from this program (including special courses and seminars, guest lectures, soft skill and career training courses, an international cohort of fellow students).

Informal inquiries to Prof. Szeider <sz@ac.tuwien.ac.at> are welcome. The next deadline for applications is September 1st, 2018. Sending applications earlier, with cc to Prof. Szeider, is encouraged.


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