dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. Postdoc positions in TCS at KTH Royal Institute of Technology
(Jakob Nordström)
2. Algorithm Developer Positions at Optym (Ravindra K. Ahuja)
3. PhD positions in TCS at KTH Royal Institute of Technology
(Jakob Nordström)
4. Pre- and Post-Doctoral Positions in Algorithmic and
Enumerative Combinatorics (Christian Krattenthaler)
5. CSR 2017: Last Call for Papers, Extended Deadline
(Edward A. Hirsch)
----------------------------------------------------------------------
Message: 1
Date: Thu, 15 Dec 2016 14:28:05 +0000
From: Jakob Nordström <jakobn@kth.se>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Postdoc positions in TCS at KTH Royal Institute of
Technology
Message-ID: <1481812087326.73976@kth.se>
Content-Type: text/plain; charset="iso-8859-1"
The Theory Group at KTH Royal Institute of Technology invites applications for up to four postdoctoral positions in theoretical computer science.
KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.
The postdoc positions are in the area of computational complexity theory, focusing on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity. Examples of topics of particular interest are the use of linear and semidefinite programming to solve hard combinatorial problems, or of proof complexity to prove that the problems are beyond the reach of such methods. Exciting recent developments have identified the so-called sums of squares hierarchy as a unifying theme for these questions, and one aim of our research is to build and expand on this theme. However, we will also freely explore whatever other methods turn out to be helpful for attacking these and other topics of interest in algorithms and complexity theory.
This research project is led by Johan Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation, the European Research Council, and the Swedish Research Council.
In addition to the PIs, the research project is planned to involve a total of 4-5 postdocs and 5-7 PhD students. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.
Within the overall framework sketched above, the postdoc will be expected and encouraged to contribute to and influence the research agenda. Taking part in teaching graduate seminar courses is encouraged but not required. Travel funding is included, and the group also receives short-term and long-term visitors on a regular basis.
These postdoc positions are full-time employed positions for one year with a possible one-year extension. The expected starting date is in August-September 2017, although this is to some extent negotiable.
The application deadline is January 15, 2017. See http://apc.csc.kth.se/D-2016-0871-Eng.php for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to apc@csc.kth.se.
------------------------------
Message: 2
Date: Thu, 15 Dec 2016 14:45:25 +0000
From: "Ravindra K. Ahuja" <ravindra.ahuja@optym.com>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Algorithm Developer Positions at Optym
Message-ID:
<BL2PR03MB4977F7BA84EDDFF1586CA45869D0@BL2PR03MB497.namprd03.prod.outlook.com>
Content-Type: text/plain; charset="us-ascii"
Algorithm Developer Positions at Optym
*********************************
Optym is developing software solutions for the transportation and logistics industry that will automate operations and replace human decision-making by machine decision-making. Founded in 2000 by a leading researcher and academician, with its headquarter located in Gainesville, FL, and branches in four countries, Optym has over 200 highly qualified professionals worldwide.
Optym is seeking bright, motivated and ambitious individuals which will help us become a leading decision automation and optimization software provider for airlines, railroads and trucking companies worldwide. The company is fully employee-owned and offers competitive salaries and comprehensive benefits package including profit sharing and stock options. Compensation and perks offered are above industry standards, and based on candidates' capability and experience. Learn more at: www.optym.com.
Job Description:
*************
* Data analytics and business intelligence
* Building models (MIP, Network Optimization, Combinatorial Optimization, Discrete Event Simulation)
* Designing and implementing algorithms
* R&D of new upcoming techniques to bring into the company
Qualifications:
************
* Ph.D. degree in Computer Science, Industrial Engineering or Operations Research
* Background in modeling, algorithms, data structures and optimization
* Excellent programming skills
* Excellent problem-solving, analytical and communications skills
Why you should join Optym:
***********************
* Interesting and challenging projects
* Highly educated, intelligent and inspired team
* Culture of innovation and creativity
* Ability to make a big societal impact
Application Process:
*****************
* Please email your resume for consideration to mailto:jobs.us@optym.com along with a cover letter explaining why you would be a great fit for the job and the company.
___________________________________________________________
Ravindra K. Ahuja, Ph.D. | President & CEO
Optym - Live Efficiently | 7600 NW 5th Place, Gainesville, FL 32607 | USA
M: +1-352-870-8401 | mailto:ravindra.ahuja@optym.com
http://www.optym.com/
___________________________________________________________
------------------------------
Message: 3
Date: Thu, 15 Dec 2016 15:22:49 +0000
From: Jakob Nordström <jakobn@kth.se>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] PhD positions in TCS at KTH Royal Institute of
Technology
Message-ID: <1481815371664.89876@kth.se>
Content-Type: text/plain; charset="iso-8859-1"
The Theory Group at KTH Royal Institute of Technology invites applications for up to four PhD positions in theoretical computer science.
KTH Royal Institute of Technology is the leading technical university in Sweden. The Theoretical Computer Science Group at KTH (www.csc.kth.se/tcs) offers a strong research environment spanning a wide range of research topics such as complexity theory and approximation algorithms, computer and network security, cryptography, formal methods and natural language processing. We have one of Europe's most prominent groups in algorithms and complexity theory, and the research conducted here has attracted numerous international awards and grants in recent years.
The PhD positions are in the area of computational complexity theory, focusing on questions at the intersection of approximation algorithms, subexponential algorithms, and proof complexity. Examples of topics of particular interest are the use of linear and semidefinite programming to solve hard combinatorial problems, or of proof complexity to prove that the problems are beyond the reach of such methods. Exciting recent developments have identified the so-called sums of squares hierarchy as a unifying theme for these questions, and one aim of our research is to build and expand on this theme. However, we will also freely explore whatever other methods turn out to be helpful for attacking these and other topics of interest in algorithms and complexity theory. The overarching goal is to understand fundamental properties of efficient computation by proving mathematical theorems about the power and limitations of different computational models.
This research project is led by Johan Hastad, Per Austrin, and Jakob Nordstrom, and is financed by grants from the Knut and Alice Wallenberg Foundation, the European Research Council, and the Swedish Research Council.
In addition to the PIs and the announced PhD positions, the research project will also involve 2-3 existing PhD students and 3-4 postdocs. Thus, this will be a unique opportunity to explore new connections between different subareas of complexity theory within a vibrant and growing research environment.
These are a four-year full-time employed position, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The successful candidates are expected to start at the latest in August-September 2017, although this is to some extent negotiable. The positions are fully funded and come with a competitive salary.
The application deadline is January 15, 2017. See http://apc.csc.kth.se/D-2016-0832-Eng.php for the full announcement with more information and instructions how to apply. Informal enquiries about this position are welcome and may be sent to apc@csc.kth.se .
------------------------------
Message: 4
Date: Thu, 15 Dec 2016 16:59:55 +0100 (CET)
From: Christian Krattenthaler <christian.krattenthaler@univie.ac.at>
To: DMANET <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] Pre- and Post-Doctoral Positions in Algorithmic and
Enumerative Combinatorics
Message-ID: <alpine.LRH.2.11.1612151658270.17270@login.univie.ac.at>
Content-Type: TEXT/PLAIN; format=flowed; charset=US-ASCII
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% PRE- and POST-DOCTORAL POSITIONS in %
% ALGORITHMIC AND ENUMERATIVE COMBINATORICS %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
The Special Research Program (SFB) "ALGORITHMIC AND ENUMERATIVE
COMBINATORICS," a four-year programme (March 1, 2017 - Feb. 28, 2021)
funded by the Austrian Science Foundation FWF, is offering post-
and pre-doctoral positions at each of its five associated research
groups at the University of Vienna, at the Johannes Kepler University
Linz (JKU), at the Vienna University of Technology, and at the Austrian
Academy of Sciences in Linz.
"Algorithmic and Enumerative Combinatorics," as we understand it,
is the general research area which is defined by the interplay
of the fields of Enumerative Combinatorics, Analytic Combinatorics,
and Algorithmics.
The SFB joins the forces of the Combinatorics Group at the University
of Vienna, the Combinatorics and Algorithms Group at the Vienna
University of Technology, and the joint Symbolic Combinatorics Group
in Linz formed by the RISC and the Institute for Algebra at the
Johannes Kepler University Linz, and the RICAM at the Austrian Academy
of Sciences, in order to significantly advance our knowledge
in this branch of Combinatorics and related fields.
The SFB consists of nine project parts, run by:
Michael Drmota (TU Wien)
Ilse Fischer (Universit\"at Wien)
Bernhard Gittenberger (TU Wien)
Manuel Kauers (Institute for Algebra, JKU)
Christoph Koutschan (RICAM Linz)
Christian Krattenthaler (Universit\"at Wien)
Peter Paule (RISC, JKU)
Veronika Pillwein (RISC, JKU)
Carsten Schneider (RISC, JKU)
For more specific information see the SFB WWW Site
https://www.sfb050.risc.jku.at/
We explicitly encourage female researchers to apply for the offered
positions. We guarantee that the selection process, based solely on
the research records, will give equal opportunities to female and
male researchers.
Interested applicants should submit an application with
CV, list of publications, an indication with whom the applicant
would like to work (multiple choice is possible),
and in addition ask 2 (for postdocs), respectively 1 (for pre-docs),
people to send letters of evaluation,
no later than
JANUARY 31, 2017.
The application should be done using the website
https://www.sfb050.risc.jku.at/application
Late applications will be considered until all the positions are filled.
For more detailed information see the SFB WWW Site
https://www.sfb050.risc.jku.at/
General enquiries about the programme and the opportunities it is
offering for early career researchers should be made in the
first instance to the Speaker of the SFB, Christian Krattenthaler
(Christian.Krattenthaler@univie.ac.at).
------------------------------
Message: 5
Date: Fri, 16 Dec 2016 09:58:25 +0300
From: "Edward A\. Hirsch" <hirsch@pdmi.ras.ru>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CSR 2017: Last Call for Papers, Extended Deadline
Message-ID: <1481871505.709311.3413.nullmailer@euclid.pdmi.ras.ru>
Content-Type: text/plain; charset=iso8859-1
Dear Colleagues,
Due to multiple requests we have decided to extend
the deadline for CSR-2017 by six days,
that is, until December 21 (anywhere on Earth).
Please note that this is a firm deadline.
Best regards,
Edward Hirsch
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Last Call for Papers
The 12th International Computer Science Symposium in Russia, CSR-2017
Kazan, Russia
June 8-12, 2017
http://logic.pdmi.ras.ru/csr2017/
---------------------------------
CSR is an annual conference that intends to reflect the broad scope of international cooperation in computer science. The topics covered vary from year to year, but in general try to cover as much of the contemporary computer science as possible.
They include, but are not limited to:
algorithms and data structures
combinatorial optimization
constraint solving
computational complexity
cryptography
combinatorics in computer science
formal languages and automata
algorithms for concurrent and distributed systems, networks
applications of logic to computer science, e.g. proof theory, model
checking and verification
formal and algorithmic aspects of bio-informatics
current challenges such as quantum computing
---------------------------------
Important dates
Deadline for submissions: December 21, 2016 (23:59 anywhere on Earth).
Notification of acceptance: February 15, 2017.
Conference dates: June 8-12, 2017.
---------------------------------
Invited lectures
Thierry Coquand (Chalmers), distinguished opening lecture
Javier Esparza (Munich)
Elham Kashefi (Paris and Edinburgh)
Andrew McGregor (Amherst)
Ronitt Rubenfeld (MIT)
Marc Zeitoun (Bordeaux)
---------------------------------
Submission and publication
Authors are invited to submit papers presenting original research in the conference topics, in electronic form (pdf format) via EasyChair.
Submissions must be unpublished, not under review for publication elsewhere, and provide sufficient information to judge their merits.
Submissions must be in English, and not exceed 12 pages, including the title page, in Springer's LNCS LaTeX style (instructions available here). Additional material, to be read at the discretion of reviewers and PC members, may be provided in a clearly marked appendix or by reference to a manuscript on a web site.
Accepted papers will be published in an LNCS volume by Springer. Instructions for formatting camera-ready versions will be communicated to the authors of accepted papers.
For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference.
Additionally, selected papers will be invited to a special issue of Theory of Computing Systems and will be refereed according to the journal's procedure.
---------------------------------
Yandex Awards
for the best paper and for the best student paper will be given by the PC.
---------------------------------
Organizers and sponsors
CSR is organized by Kazan Federal university (Volga region), with the support of (tentative list):
The Russia Foundation for Basic Research, http://www.rfbr.ru/rffi/eng/info
Kazan Federal University, http://kpfu.ru/eng
Yandex, https://www.yandex.com/
---------------------------------
Organizing committee (tentative)
The organizing committee can be reached at the following address: CSR2017.Kazan@gmail.com
Farid Ablayev (KFU), chair
Aida Gainutdinova (KFU)
Anton Marchenko (KFU)
Daniil Musatov (MIPT)
Alexander Vasiliev (KFU)
Valeria Volkova (KFU)
Mansur Ziatdinov (KFU)
Marsel Sitdikov (KFU)
---------------------------------
Program Committee
Farid Ablayev (Kazan, RU)
Ittai Abraham (Jerusalem, IL)
Isolde Adler (Leeds, UK)
Frédérique Bassino (Paris Nord, FR)
Véronique Bruyère (Mons, BE)
Maike Buchin (Bochum, DE)
Hubie Chen (San Sebastian, ES)
Anuj Dawar (Cambridge, UK)
Stéphanie Delaune (Cachan, FR)
Anna Frid (Marseille, FR)
Elena Grigorescu (Purdue, US)
Krishna S (Mumbai, IN)
K.N. Kumar (Chennai, IN)
Frédéric Magniez (Paris, FR)
Meena Mahajan (Chennai, IN)
Grigory Marshalko (Moscow, RU)
Catuscia Palamidessi (Saclay, FR)
Victor Selivanov (Novosibirsk, RU)
Kavitha Telikepalli (Mumbai, IN)
Thomas Thierauf (Aalen, DE)
Szymon Torunczyk (Warsaw, PL)
Hélène Touzet (Lille, FR)
Mikhail Volkov (Ekaterinburg, RU)
Dorothea Wagner (Karlsruhe, DE)
Pascal Weil (Bordeaux, FR), chair
---------------------------------
Steering Committee for the CSR series
Edward A. Hirsch (St.Petersburg, RU)
Juhani Karhumäki (Turku, FI)
Ernst W. Mayr (Munich, DE)
Alexander Razborov (Chicago, US and Moscow, RU)
Mikhail Volkov (Ekaterinburg, RU)
---------------------------------
Previous CSR conferences
CSR 2016 took place in St.Petersburg, Russia
The list of previous CSR webpages can be found at
http://logic.pdmi.ras.ru/~csr/
UNSUBSCRIPTION: If you do not wish to receive any news
regarding CSR conferences, please reply to this mail
and we will remove you from the mailing list.
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 106, Issue 19
***************************************
No comments:
Post a Comment