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. 2017-2018 IBM Herman Goldstine Postdoctoral Fellowship in
Mathematical Sciences (Chai Wu)
2. Post-doc position in Combinatorics / Discrete Mathematics at
Tel Aviv University (Wojciech Samotij)
3. ToTo: an open database for computation, storage and retrieval
of tree decompositions (Kelk Steven (DKE))
4. Second Announcement : Third STAR workshop on Random Graphs
(Ben Hansen)
----------------------------------------------------------------------
Message: 1
Date: Thu, 3 Nov 2016 10:08:42 -0500
From: "Chai Wu" <cwwu@us.ibm.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] 2017-2018 IBM Herman Goldstine Postdoctoral
Fellowship in Mathematical Sciences
Message-ID:
<OF562BCC12.5B4DE186-ON85258060.00530C6D-85258060.00532CD0@notes.na.collabserv.com>
Content-Type: text/plain; charset="US-ASCII"
The Mathematical Sciences department of the IBM Thomas J. Watson Research
Center invites applications for its 2017-2018 Herman Goldstine Memorial
Postdoctoral Fellowship for research in the mathematical and computer
sciences. The fellowship provides scientists of outstanding ability an
opportunity to advance their scholarship as resident department members at
the Research Center. The Research Center is located in Westchester County,
less than an hour north of New York City.
The department provides an atmosphere in which basic research is combined
with work on technical problems arising in industry. Our permanent
members, academic visitors, and post-doctoral fellows pursue research in
pure and applied mathematics and in theoretical and exploratory computer
science. Areas of research include: algorithms (approximation, randomized,
and on-line); complex systems; data mining (machine learning, pattern
recognition, computational statistics); dynamical systems;
high-performance computing (scientific computing, parallel computing,
big-data); inverse problems; numerical analysis; optimization (discrete,
continuous, global and stochastic); operations research; probability
theory (stochastic models, risk management, queues & queuing networks,
simulation); and statistics (time-series, multivariate analysis,
spatiotemporal analysis, design of experiments & reliability).
Close interaction with permanent department members is expected and
encouraged, but fellows are free to pursue their own research interests.
Up to two fellowships will be awarded. Candidates must have received a
Ph.D. degree after September 2012 or should expect to receive one before
the fellowship commences in the second half of 2017 (usually in
September). The fellowship has a period of one year, and may be extended
another year by mutual agreement. The stipend is expected to be between
$105,000 and $130,000, depending on the length of experience. An
additional allowance for moving expenses will be provided.
The application form will be available at
http://www.research.ibm.com/goldstine/ beginning November 15, 2016 and
applications must be received by January 17, 2017. Final decisions will be
conveyed by the end of March 2017.
Application process
Upon submitting the form, applicants will receive a confirmation message
via email along with instructions on supporting materials that the
candidate will need to furnish. These include the following:
- Full CV.
- Abstract of your Ph.D. dissertation.
- A 2-3 page research statement describing your current research and the
research plan that you would like to pursue if offered the fellowship.
- 3 or more letters of recommendation, including one from the thesis
advisor. (Emails requesting letters of recommendation will be directly
sent to the references listed by the applicant in their application form)
- Finally, you may attach up to three of your most important papers.
A cover letter is not required. We strongly prefer all documents in PDF
format, but Word or PostScript documents will be accepted if you
absolutely cannot generate them in PDF.
Questions can be addressed to goldpost@us.ibm.com with "2017 Goldstine
Query" in the subject line.
IBM is committed to work-place diversity, and is proud to be an
equal-opportunity employer.
------------------------------
Message: 2
Date: Thu, 3 Nov 2016 18:29:03 +0200
From: Wojciech Samotij <samotij@post.tau.ac.il>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Post-doc position in Combinatorics / Discrete
Mathematics at Tel Aviv University
Message-ID: <E0206AA3-B8E1-446A-9AE2-7AC3997836B1@post.tau.ac.il>
Content-Type: text/plain; charset=us-ascii
The School of Mathematical Sciences at Tel Aviv University invites applications for Post-doctoral Fellowships in Combinatorics and Discrete Mathematics for one year, with a possibility of extension for an additional year, starting October 1, 2017 (the starting date is negotiable).
The School of Mathematical Sciences is a leading international research institution in mathematics. It has a large and very active research group in Combinatorics (five faculty members, two post-docs, and many research students), with a weekly research seminar.
Further information about the School, including a list of our faculty, is available on our web site http://www.math.tau.ac.il <http://www.math.tau.ac.il/>.
We welcome applications from candidates specializing in Combinatorics, who have completed a Ph. D. degree in Mathematics or Computer Science by September 30, 2017 (but not earlier than October 1, 2013). Preference will be given to applicants whose research interests are compatible with those of the relevant faculty in the School.
Post-doctoral Fellowships are strictly research positions and do not carry any teaching responsibilities.
Stipends for a one year fellowship are approximately 137,000 Israeli Shekels and are commensurable with entry level academic salaries in Israel. Additional funds for research related travel will also be available.
Candidates should arrange the following application materials to be sent to Ms. Nurit Liberman at nuritl@tauex.tau.ac.il <mailto:nuritl@tauex.tau.ac.il> (with a cc sent to asafico@post.tau.ac.il <mailto:asafico@post.tau.ac.il> and samotij@post.tau.ac.il <mailto:samotij@post.tau.ac.il>):
- CV
- List of Publications
- Research statement
- Three letters of recommendation
The deadline for applications is December 31, 2016.
Applications received after the deadline will be considered if positions remain open.
--
Noga Alon, Michael Krivelevich, Doron Puder, Wojciech Samotij, and Asaf Shapira
------------------------------
Message: 3
Date: Fri, 4 Nov 2016 09:05:02 +0000
From: "Kelk Steven (DKE)" <steven.kelk@maastrichtuniversity.nl>
To: "DMANET@zpr.uni-koeln.de" <DMANET@zpr.uni-koeln.de>
Subject: [DMANET] ToTo: an open database for computation, storage and
retrieval of tree decompositions
Message-ID: <6c20bb670b8b40cfb826d98c93222d59@UM-MAIL3215.unimaas.nl>
Content-Type: text/plain; charset="us-ascii"
Dear DMANET colleagues,
Recently Rim van Wersch en myself launched ToTo, an open database for computation, storage and retrieval of tree decompositions.
A short description of its functionality is provided below. (See also the accompanying article in Discrete Applied Mathematics).
The website can be accessed at the following URL:
- http://treedecompositions.com
We are naturally keen to receive feedback of any kind from the discrete mathematics and graph theory communities. This will help us improve the database in the future. Should the database prove popular we will seek funding to improve the computational power and storage capacity of the server that sits behind ToTo.
Please send any feedback to both Rim (rim@treedecompositions.com) and myself (steven.kelk@maastrichtuniversity.nl).
Kind regards,
Steven Kelk
http://skelk.sdf-eu.org
Assistant Professor, Department of Data Science and Knowledge Engineering (DKE)
Maastricht University, Netherlands
Announcing ToTo, an open database for computation, storage and retrieval of tree decompositions.
At Toto we host an open collection of graphs and their tree decompositions. Its main feature is an automated treewidth webservice, which users can query to obtain a reasonable tree decomposition for their input graph. If the graph is known in the database, its corresponding tree decomposition is returned. If it's a new graph, a heuristic decomposition is computed on-the-fly and returned to the user, while the graph and this composition are added to the database for future reference and improvement.
Users can also submit improved tree decompositions for graphs to the database (in PACE16 TD format). If the submitted decomposition improves upon the current best width, it is stored as the new upper bound for the graph. The submitted decomposition is also mapped to the canonical isomorphism of the graph and stored, so any future queries to isomorphic graphs benefit from the canonized submission. The database can be used as a quick lookup tool as well as a repository for tree decompositions. New graphs are made available to other users by simply looking them up, while the database can be queried for interesting instances e.g. graphs where the gap between the best known lower bound and upper bound is large.
- More information on ToTo and its functionalities is given in:
"ToTo: An open database for computation, storage and retrieval of tree decompositions"
Discrete Applied Mathematics, Article in Press
Available online: http://dx.doi.org/10.1016/j.dam.2016.09.023
- A preprint is available here:
http://treedecompositions.com/TotoTreewidthDatabase_VanWersch_Kelk.pdf
- ToTo itself can be accessed at: http://treedecompositions.com/
------------------------------
Message: 4
Date: Fri, 4 Nov 2016 12:05:01 +0100
From: Ben Hansen <benhansen09@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Second Announcement : Third STAR workshop on Random
Graphs
Message-ID:
<CAGLdUZaAPou_8vHVdXVaUtPKt=a0L_sqqhBC3PcZq9dZusa91g@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Second Announcement : Third STAR workshop on Random Graphs
The workshop will take place on Thursday 26 and Friday 27 January 2017
on the campus of the University of Utrecht (more details of the
location and schedule will be added later).
This will be the 3rd STAR Workshop on Random Graphs. The first took
place in 2012 and the second in 2015.
We are very pleased to announce the following prominent researchers
have agreed to deliver plenary talks:
- Marián Boguñá (Barcelona)
- Mihyun Kang (Graz)
- Vincent Tassion (Geneva/Zürich)
- Nick Wormald (Melbourne)
A limited number of slots for contributed talks are available. If you
would like to propose a short talk, please let us know by e-mailing
Ben Hansen at benhansen09@gmail.com. (In case of too much interest,
selection will be based on relevance of the talk and the career stage
of the speaker.)
The workshop is open to all and free of charge, but
please register to let us know that you are coming by sending an
e-mail to: benhansen09@gmail.com
The website of the workshop can be found at the address :
http://www.math.uu.nl/stochsem/WorkshopRGs2017/
------------------------------
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 105, Issue 5
**************************************
No comments:
Post a Comment