Send dmanet mailing list submissions to
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. Research School on Regularity and Analytic Methods in
Combinatorics (Dan Kral)
2. Deadline Extended --- GABB 2015 co-located with IPDPS 2015
(Aydin Buluc)
3. Postdoc position in Parameterized Complexity at Vienna
University of Technology, Austria (Stefan Szeider)
----------------------------------------------------------------------
Message: 1
Date: Thu, 8 Jan 2015 17:32:16 +0000
From: Dan Kral <D.Kral@warwick.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Research School on Regularity and Analytic Methods
in Combinatorics
Message-ID:
<CAO6OfREgZ4oT8ppagBnC_M9frX-TYDh-bop4Rbs7R2Bq=A2P1Q@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Dear colleagues,
I wanted to draw to your attention the LMS-CMI research school organized by
Peter Keevash, Oleg Pikhurko and myself. The school will take place on the
campus of the University of Warwick from July 1 to July 5, just before the
25th British Combinatorial Conference which starts on July 6.
The three main lecture course topics are:
* Regularity Methods (David Conlon, Oxford)
* Limits of Combinatorial Structures (Christian Borgs and Henry Cohn,
Microsoft)
* Property Testing (Asaf Shapira, Tel-Aviv)
These lecture courses will be supplemented by tutorial sessions.
The school will also include three special more generally focused talks
given by:
* Noga Alon (Tel Aviv)
* Christian Borgs (Microsoft)
* Ben Green (Oxford)
Further informations including the application deadlines can be found at
http://www2.warwick.ac.uk/fac/sci/maths/people/staff/daniel_kral/school15 .
Best regards,
Dan Kral
------------------------------
Message: 2
Date: Thu, 8 Jan 2015 21:27:36 -0800
From: Aydin Buluc <abuluc@lbl.gov>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Deadline Extended --- GABB 2015 co-located with
IPDPS 2015
Message-ID:
<CA+vcEgCQynNPVKG3Nnkx-=oAioamziT_sc730F=m8ALLKYR61Q@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
[Apologies if you received multiple copies of this announcement]
CALL FOR PAPERS
(Extended full paper deadline: January 29, 2015)
Graph Algorithm Building Blocks (GABB) 2015
An IPDPS 2015 Workshop, May 25, 2015, Hyderabad, India
=== Scope and Goals ===
The Basic Linear Algebra Subprograms, introduced over 30 years ago, had a
transformative effect on software for linear algebra. With the BLAS,
researchers spend less time mapping algorithms onto specific features of
hardware platforms and more time on interesting new algorithms.
Would it be practical to define an analogous set of basic building blocks
for graph algorithms? Can we define a core set of mathematical primitives
from which we can build most (if not all) important graph algorithms? If we
can agree on the mathematical foundations, how would these interact with
the data structures used in graph algorithms and result in an API the graph
algorithms research community could support?
These questions will be the topic for the second ?Graph Algorithms Building
Blocks? workshop. Our goal is an interactive workshop where the full range
of issues behind ?Graph Algorithms Building Blocks? will be explored. We
want an interactive ?workshop? so papers that report preliminary results
and unproven but interesting ideas will be considered.
=== Submission and Dates ===
Submitted manuscripts may not exceed ten (10) single-spaced double-column
pages using 10-point size font on 8.5x11 inch pages (IEEE conference
style), including figures, tables, and references (see IPDPS Call for
Papers for
more details). Papers shorter than 10 pages are welcome and even
encouraged. All papers will be reviewed. IEEE CS Press will publish the
IPDPS symposium and workshop abstracts as a printed volume. The complete
symposium and workshop proceedings will also be published by IEEE CS Press
on CD-ROM and will also be available in the IEEE Digital Library.
*- Due dates: *
*full papers due 29 Jan 2015,*
*author notification 14 Feb 2015, *
*camera-ready due 28 Feb 2015.*
- Workshop web page: http://www.graphanalysis.org/workshop2015.html
=== Presentation at the workshop ===
It is expected that each accepted submission will be presented at the
workshop, which will be held (one day) in conjunction with IPDPS 2015, May
25, 2015, in Hyderabad, India.
=== Program Committee ===
Tim Mattson, Intel Corp. (Chair)
David A. Bader, Georgia Institute of Technology
Jonathan Berry, Sandia National Labs
Ayd?n Bulu?, Lawrence Berkeley National Lab
John Gilbert, UC Santa Barbara
Jeremy Kepner, MIT Lincoln Labs
Chris Long, US Department of Defense
Kamesh Madduri, Penn State University
Henning Meyerhenke, Karlsruhe Institute of Technology
Fabrizio Petrini, IBM
------------------------------
Message: 3
Date: Fri, 9 Jan 2015 11:47:59 +0100
From: Stefan Szeider <stefan@szeider.net>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Postdoc position in Parameterized Complexity at
Vienna University of Technology, Austria
Message-ID: <4B05AA6D-1ED3-415C-AB41-039169760143@szeider.net>
Content-Type: text/plain; charset=us-ascii
There is an opening for a fully funded postdoc position for the duration of two years at the Vienna University of Technology within an active research group and a stimulating environment in an attractive city.
The position is within the research project "Exploiting New Types of Structure for Fixed Parameter Tractability" which is funded by the Austrian Science Fund (FWF). The gross salary p.a. is approximately EUR 49.500. In addition, there are ample funds for traveling.
The candidate should have (or expect to have shortly) a PhD degree in Computer Science or related area; research experience at postdoctoral level is of advantage. A successful candidate should have excellent knowledge of algorithms and/or complexity, preferably in the setting of parameterized complexity and fixed-parameter tractability. Strong background in graph theory, combinatorics, satisfiability, or constraint satisfaction is of advantage.
The application should include the candidate's CV, an abstract of their PhD thesis, a motivation letter, and a list of three references. The application should also mention possible starting dates and should be sent to jobs@ads.tuwien.ac.at.
The review of applicants will begin immediately and continue until the position is filled. Applications received by February 28, 2015 will receive full consideration. Informal inquires by email (Stefan Szeider, stefan@szeider.net) are welcome.
------------------------------
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 83, Issue 8
*************************************
No comments:
Post a Comment