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. Full Professur Position of Algorithms and Data Structures at
the Vienna University of Technology (G?nther Raidl)
2. MFCS 2014 (mfcs2014@inf.u-szeged.hu)
3. PhD positions at SUTD (Giacomo Nannicini)
4. [CPAIOR 2014] Final Call for Papers (Yuri Malitsky)
5. KaHIP -- Karlsruhe High Quality Graph Partitioning
(Christian Schulz)
----------------------------------------------------------------------
Message: 1
Date: Tue, 12 Nov 2013 10:17:28 +0100
From: G?nther Raidl <raidl@ads.tuwien.ac.at>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Full Professur Position of Algorithms and Data
Structures at the Vienna University of Technology
Message-ID: <5281F228.2010007@ads.tuwien.ac.at>
Content-Type: text/plain; charset=windows-1252; format=flowed
Announcement of an open position at the Faculty of Informatics,
Vienna University of Technology, Austria
FULL PROFESSOR (TENURED)
of
Algorithms and Data Structures
The Vienna University of Technology invites applications for a Full
Professor position (tenured) at the Faculty of Informatics.
The successful candidate is expected to lead his/her own group
conducting research and teaching in the area of Algorithms and Data
Structures, and to contribute to the faculty?s research area
Computational Intelligence. Ideally, candidates are sought, who are able
to combine theoretical research with novel applications.
Applicants are expected to have an outstanding research and publication
record. Experience in university teaching, as well as experience in
raising funds and in managing scientific research projects, is highly
appreciated.
We offer excellent working conditions in an attractive research
environment in a city with an exceptional quality of life.
A more detailed announcement and information on how to apply can be
found at http://www.informatik.tuwien.ac.at/algodat
Application Deadline: January 8, 2014
------------------------------
Message: 2
Date: Tue, 12 Nov 2013 13:20:06 +0100 (CET)
From: mfcs2014@inf.u-szeged.hu
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] MFCS 2014
Message-ID:
<49352.160.114.55.107.1384258806.squirrel@webmail.inf.u-szeged.hu>
Content-Type: text/plain;charset=utf-8
Call for Papers
39th International Symposium on
Mathematical Foundations of Computer Science
MFCS 2014
Budapest, August 25--29, 2014
www.inf.u-szeged.hu/mfcs2014
*Announcement*
The series of MFCS symposia, organized since 1972, has a long and
well-established tradition. The MFCS conferences encourage high-quality
research in all branches of theoretical computer science. Their broad
scope provides an opportunity to bring together researchers who do not
usually meet at specialized conferences. Quality papers presenting
original research on theoretical aspects of computer science are
solicited.
*Topics*
Principal topics of interest include (but are not limited to):
algorithms and data structures (incl. sequential, parallel,
distributed, randomized, approximation, graph, network, on-line,
parameterized, optimization algorithms),
algorithmic game theory,
algorithmic learning theory,
computational complexity (structural and model-related),
computational geometry,
models of computation,
networks (incl. wireless, sensor, ad-hoc networks),
parallel and distributed computing,
quantum computing,
automata, grammars and formal languages,
combinatorics on words, trees, and other structures,
bioinformatics,
computer-assisted reasoning,
concurrency theory,
cryptography and security,
databases and knowledge-based systems,
formal specifications and program development,
foundations of computing,
logic, algebra and categories in computer science,
types in computer science,
mobile computing,
semantics and verification of programs,
theoretical issues in artificial intelligence.
*Invited Speakers*
Krishnendu Chatterjee (IST Austria, Klosterneuburg, Austria),
Achim Jung (U. of Birmingham, UK),
D\'aniel Marx (Hungarian Academy of Sciences, Budapest, Hungary),
Peter Bro Miltersen (Aarhus U., Denmark),
Cyril Nicaud (U. Paris-Est, Marne-la-Vall\'ee, France),
Alexander Sherstov (UCLA, Los Angeles, USA),
Christian Sohler (TU Dortmund, Germany).
*Program Committee*
Albert Atserias (UPC, Barcelona, Spain),
Giorgio Ausiello (U. ``La Sapienza'', Rome, Italy),
Jos Baeten (CWI, Amsterdam, The Netherlands),
Therese Biedl (U. of Waterloo, Canada),
Miko\laj Boja\'nczyk (Warsaw U., Poland),
Gerth St\olting Brodal (Aarhus U., Denmark),
Christian Choffrut (U. Paris Diderot, France),
Erzs\'ebet Csuhaj-Varj\'u (E\"otv\"os Lor\'and U., Budapest, Hungary,
co-chair),
Rocco De Nicola (IMT Lucca, Italy),
Martin Dietzfelbinger (TU Ilmenau, Germany, co-chair),
Manfred Droste (U. of Leipzig, Germany),
Robert Els\"asser (U. Salzburg, Austria),
Zolt\'an \'Esik (U. of Szeged, Hungary, chair),
Uli Fahrenberg (Irisa/INRIA Rennes, France),
Fedor V. Fomin (U. of Bergen, Norway),
Fabio Gadducci (U. of Pisa, Italy),
Anna G\'al (U. of Texas, Austin, USA),
Dora Giammarresi (U. ``Tor Vergata'', Rome, Italy),
Roberto Grossi (U. of Pisa, Italy),
Anupam Gupta (CMU, Pittsburgh, USA),
Michel Habib (U. Paris Diderot, France),
Kristoffer Arnsfelt Hansen (Aarhus U., Denmark),
Edith Hemaspaandra (RIT, Rochester, USA),
Kazuo Iwama (Kyoto U., Japan),
Yoshihiko Kakutani (U. of Tokyo, Japan),
Juhani Karhum\"aki (U. of Turku, Finland),
Bakhadyr Khoussainov (U. of Auckland, New Zealand),
Elias Koutsoupias (U. of Athens, Greece),
Rastislav Kr\'alovi\v c (Comenius U., Bratislava, Slovakia),
Jan Kratochvil (Charles U., Prague, Czech Republic),
Stefan Kratsch (TU Berlin, Germany),
Amit Kumar (IIT, New Delhi, India),
Kim G. Larsen (Aalborg U., Denmark),
Fr\'ed\'eric Magniez (U. Paris Diderot, Paris, France),
Ralph Matthes (U. Paul Sabatier, Toulouse, France),
Madhavan Mukund (CMI, Chennai, India),
Jean-\'Eric Pin (LIAFA, U. Paris Diderot, and CNRS, Paris, France),
Alexander Rabinovich (Tel Aviv U., Israel),
Peter Rossmanith (RWTH Aachen U., Germany),
Jan Rutten (CWI, Amsterdam, and Radboud U. Nijmegen, The Netherlands),
Wojciech Rytter (Warsaw U., Poland),
Luigi Santocanale (Aix-Marseille U., France),
Christian Scheideler (U. of Paderborn, Germany),
Thomas Schwentick (TU Dortmund, Germany),
Alex Simpson (U. of Edinburgh, UK),
Mohit Singh (Microsoft Research, Redmond, USA),
Klaus Sutner (CMU, Pittsburgh, USA),
G\'abor Tardos (Hungarian Academy of Sciences, Budapest, Hungary),
Gy\"orgy Tur\'an (U. of Illinois, Chicago, USA),
Peter Widmayer (ETH Zurich, Switzerland),
Philipp Woelfel (U. of Calgary, Canada).
*Important dates*
Paper submission deadline: *April 18, 2014.*
Author notification: *June 3, 2014.*
Camera-ready deadline: *June 16, 2014.*
Conference: *August 25--29, 2014.*
*Submission guidelines*
Submissions to MFCS must not exceed 12 pages
(in Springer-Verlag's Lecture Notes style and including bibliography).
If the authors believe that more details are essential to substantiate
the main claims, they may include a clearly marked appendix that will
be read at the discretion of the program committee.
Simultaneous submissions of papers to any other conference with
published proceedings or simultaneous or previous submission of the
same contribution to journals is not allowed. Only electronic submissions
in PDF format are accepted.
Information about the submission procedure will be available on the
conference web page in due time. The proceedings will be published in the
*ARCoSS subline of Lecture Notes in Computer Science by Springer-Verlag*.
*Contact*
Zolt\'an \'Esik:ze@inf.u-szeged.hu or
Erzs\'ebet Csuhaj-Varj\'u:csuhaj@inf.elte.hu or
Martin Dietzfelbinger:martin.dietzfelbinger@tu-ilmenau.de
The conference is organized by the Department of Algorithms and their
Applications, Faculty of Informatics, E\"otv\"os Lor\'and University,
Budapest, and the Department of Foundations of Computer Science,
Faculty of Science and Informatics, University of Szeged,
in cooperation with EATCS.
------------------------------
Message: 3
Date: Tue, 12 Nov 2013 21:04:05 +0800
From: Giacomo Nannicini <giacomo.n@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PhD positions at SUTD
Message-ID:
<CAFy=0d0xeDaqVWku2PXcLb+Ggn8QTXK84K25P80om+9HABr+Tw@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
[Apologies if you receive multiple copies]
The Engineering Systems and Design (ESD) Pillar of the Singapore
University of Technology and Design (SUTD) is looking for bright and
motivated students who want to pursue a PhD in one or more of its
areas of interest. The Pillar expects to have about 10 positions.
SUTD is a research-intensive university, recently established in
collaboration with MIT. Thomas Magnanti, former Dean of Engineering at
MIT and former President of INFORMS, is the President of SUTD. Saif
Benjaafar, Distinguished McKnight University Professor and former
Director of Industrial & Systems Engineering at the University of
Minnesota, is the Head of the ESD Pillar.
ESD is a multidisciplinary department with faculty from the best
universities in the world, including MIT, Stanford, Cambridge, UC
Berkeley, Caltech, and Cornell. The faculty are engaged in numerous
research projects in optimization, operations management, game theory,
applied probability, transportation, energy, environment, and more.
Qualified PhD applicants who are selected for a scholarship are
offered highly attractive financial packages covering tuition, a
monthly stipend and support for conference and workshop travel.
Additional information about SUTD and the ESD Pillar may be found at
esd.sutd.edu.sg. For questions, please contact Giacomo Nannicini at
nannicini@sutd.edu.sg, or phd@esd.sutd.edu.sg for general inquiries.
To receive full consideration, applications should be received before
15 January 2014. Applications submitted after this date will be
considered if positions are still available.
------------------------------
Message: 4
Date: Tue, 12 Nov 2013 17:15:40 +0000
From: Yuri Malitsky <yuri.malitsky@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] [CPAIOR 2014] Final Call for Papers
Message-ID:
<CAPYyYhP=Up8VtLpxD+naqosfyrtpFyBb3OwYzR7-OgnCahshAg@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
Final Call for Papers
CPAIOR 2014
Eleventh International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming
web: http://4c.ucc.ie/cpaior2014/
cpaior series: http://www.andrew.cmu.edu/user/vanhoeve/cpaior/
Cork, Ireland
MAY 19 - 23, 2014
=============================================================================
DEADLINES (note ***CHANGED*** DEADLINE)
=============================================================================
PAPER SUBMISSION (identical for long and short papers):
Abstract due: NOV 20, 2013 11.59 P.M. PST
Paper due: NOV 24, 2013 11.59 P.M. PST
Rebuttal Phase: DEC 20-23, 2013
Final Notification: JAN 10, 2014
Final version due: FEB 10, 2014
=============================================================================
The Eleventh International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming will be held in Cork, Ireland, May 19-23, 2014 with
Workshops on May 19th, a Master Class on Data Mining, Machine Learning
and Constraint Programming on May 20, and the Main Conference on May
21-23, 2014.
The aim of the conference is to bring together interested researchers
from Constraint Programming (CP), Artificial Intelligence (AI), and
Operations Research (OR) to present new techniques or new applications
in combinatorial optimization and to provide an opportunity for
researchers in one area to learn about techniques in the others. A
main objective of this conference series is also to give these
researchers the opportunity to show how the integration of techniques
from different fields can lead to interesting results on large and
complex problems. Therefore papers that actively combine, integrate,
or contrast approaches from more than one of the areas are especially
solicited. High quality papers from a single area are also welcome,
provided that they are of interest to other communities involved.
Finally, application papers showcasing CP/AI/OR techniques on
innovative and challenging applications or experience reports on such
applications are strongly encouraged.
The program committee invites submissions that include but are not
limited to the following topics:
* Inference and relaxation methods: constraint propagation, cutting
planes, global constraints, graph algorithms, dynamic programming,
Lagrangean and convex relaxations, heuristic functions based on
constraint relaxation.
* Search methods: branch and bound, intelligent backtracking,
incomplete search, randomized search, column generation and other
decomposition methods, local search, meta-heuristics.
* Integration methods: static/dynamic problem decomposition, solver
communication, transformations between models and solvers,
collaboration between concurrent methods, models, and solvers.
* Modeling methods: comparison of models, symmetry breaking,
uncertainty, dominance relationships.
* Innovative Applications of CP/AI/OR techniques.
* Implementation of CP/AI/OR techniques and optimization systems.
PAPER SUBMISSION
Paper submissions are of two types: Long papers and short papers.
INSTRUCTION FOR LONG PAPERS:
Long papers should present original unpublished work and be at most 15
pages plus references in length, and should be prepared in the format
used for the Springer Lecture Notes in Computer Science series
(http://www.springer.de/comp/lncs/authors.html). These papers will
undergo rigorous review. The proceedings will be published in the
Springer Lecture Notes in Computer Science series.
NOTE: Unlike previous CPAIOR conferences the page limit for long
papers is 15 LNCS pages *plus references*.
INSTRUCTION FOR SHORT PAPERS: Short papers are also encouraged,
limited to 8 LNCS pages plus references and should be prepared with
the same format as long papers
(http://www.springer.de/comp/lncs/authors.html). Although containing
less material, short papers should describe original unpublished work
and will be reviewed to the same criteria of quality as long papers.
It is also encouraged to submit short papers about work in progress on
ideas that are interesting but for which the practical or theoretical
relevance is not yet fully identified. Short papers will be presented
at the conference and published in the conference proceedings.
SUBMISSION NOTES:
All papers are to be submitted electronically in PDF format by
following the instructions at the URL
http://www.easychair.org/conferences/?conf=cpaior2014
For any queries on the submission process, please contact the Program
Chairs using the email cpaior2014@gmail.com .
PROGRAM CHAIR:
Helmut Simonis
------------------------------
Message: 5
Date: Wed, 13 Nov 2013 11:08:38 +0100
From: Christian Schulz <christian.schulz@kit.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] KaHIP -- Karlsruhe High Quality Graph Partitioning
Message-ID: <52834FA6.6070400@kit.edu>
Content-Type: text/plain; charset=ISO-8859-15; format=flowed
Release of KaHIP v0.53
----------------------
We are proud to announce the release of our graph partitioning framework
KaHIP (Karlsruhe High Quality Graph Partitioning).
KaHIP is a family of high quality graph partitioning programs. It
contains various graph partitioning algorithms:
- KaFFPa (Karlsruhe Fast Flow Partitioner) which is a sequential graph
partitioner that can be configured to either achieve the best known
partitions for many standard benchmark instances or to be a good
tradeoff between partition quality and running time
- KaFFPaE (KaFFPaEvolutionary), a distributed parallel evolutionary
algorithm that uses KaFFPa to provide combine and mutation operations.
It is able to improve the best known partitioning results for many
inputs in a short amount of time
- KaBaPE (Karlsruhe Balanced Partitioner Evolutionary) which extends the
evolutionary algorithm by novel local search algorithms that reduce the
problem of combining local searches to finding negative cycles in a graph
Moreover, the framework provides the possibility to compute a k-way node
separator from a given k-partition of the graph.
The software is released under the GPL 3.0 Licence.
* open source implementation / website
http://algo2.iti.kit.edu/documents/kahip/index.html
We are glad for any comments and error reports (or even bug fixes) that
you send us.
Peter Sanders and Christian Schulz,
Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany
------------------------------
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 69, Issue 11
**************************************
No comments:
Post a Comment