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. Fully-funded PhD studentship in Algorithms and Complexity at
University of Edinburgh (Rahul Santhanam)
2. PANDA: a new software for polyhedral transformations
(Stefan L?rwald)
3. Airport operations and airline scheduling - EURO 2015 -
Glasgow (Daniel Karapetyan)
4. Call for Papers - SPIRE 2015 (Tatiana Starikovskaya)
----------------------------------------------------------------------
Message: 1
Date: Mon, 2 Mar 2015 14:41:28 +0000 (GMT)
From: Rahul Santhanam <rsanthan@inf.ed.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Fully-funded PhD studentship in Algorithms and
Complexity at University of Edinburgh
Message-ID: <alpine.LRH.2.10.1503021437430.18535@bolt.inf.ed.ac.uk>
Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed
A fully funded 3.5 year PhD studentship is available at the School of
Informatics, University of Edinburgh, on the topic of "Exact Algorithms
for NP-hard Problems". The studentship is funded by the ERC
Consolidator Grant ALUnif: "Algorithms and Lower Bounds: A Unified
Approach", and will be supervised by Rahul Santhanam.
The goal of the project is to design and analyze better algorithms for
Satisfiability and other NP-complete problems, guided by
complexity-theoretic ideas. The project belongs to the field of exact
algorithms for NP-hard problems, where we are interested in finding
algorithms for NP-hard problems with worst-case complexity O(2^{cn}),
where c < 1 is as small as possible. Here "n" is the witness size of the
instance. Recently discovered connections between complexity lower bound
techniques and algorithmic analysis suggest new approaches to finding
better exact algorithms, and the student will work with the supervisor in
exploring these new approaches.
The student will join the Algorithms and Complexity Group at the
Laboratory for Foundations of Computer Science (LFCS) in the School of
Informatics. The School of Informatics at Edinburgh is the UK's largest
and strongest research centre for computing and informatics. In the latest
UK Research Excellence Framework in 2014, Informatics at Edinburgh was
adjudged to deliver more world-leading research than any other university
in the UK.
Applicants should have a strong mathematical background, with an
undergraduate degree in Computer Science, Mathematics or a related area.
Prior experience with the theory of algorithms and/or complexity theory is
highly recommended.
The position is available to UK/EU applicants, but exceptional
international applicants may also be considered. The deadline is March
31, 2015. Informal queries may be addressed to Rahul Santhanam
(rsanthan@inf.ed.ac.uk).
To apply, follow the instructions on this web-page:
http://www.ed.ac.uk/schools-departments/informatics/postgraduate/fees/research-grant-funding/algorithmsandlowerbounds
---------------
Rahul Santhanam
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
------------------------------
Message: 2
Date: Mon, 2 Mar 2015 16:03:29 +0100
From: Stefan L?rwald <stefan.loerwald@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] PANDA: a new software for polyhedral transformations
Message-ID:
<CAObMDb2BWEz4TM3EEciqzC=OTOvseFpY=NGfOib05zxaWvFB4w@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Dear colleagues,
we would like to announce PANDA to the general public. Our software package
PANDA (Parallel AdjaceNcy Decomposition Algorithm) allows for
transformation of linear descriptions of polytopes and polyhedra.
The key features of PANDA are:
* Vertex enumeration and facet enumeration of polytopes and polyhedra
* User choice of double description method and adjacency decomposition
* Use of symmetry information for compact representation (input & output)
as well as faster computation
* Use of modern multi-core hardware right out of the box (manual control of
number of concurrent threads possible, but optional)
* Ready for use on clusters (MPI required)
* Compatibility with PORTA format
* Correctness guarantee with arbitrary precision integer type or overflow
guarded integer type
For details on usage of the software, please visit the PANDA
homepage http://comopt.ifi.uni-heidelberg.de/software/PANDA/index.html
We highly value feedback! If you encounter compilation issues or found a
run time bug, please do not hesitate to contact our developer Stefan L?rwald.
Please use the email address provided in the README file of the
downloadable package
and include the version information in your bug report.
The software is available free of charge under the Creative Commons
Attribution-NonCommercial 4.0 International License. You'll find the latest
version on http://comopt.ifi.uni-heidelberg.de
/software/PANDA/index.html#download
Best regards
Stefan L?rwald, Gerhard Reinelt
Research Group Discrete and Combinatorial Optimization
Institut f?r Informatik, Ruprecht-Karls-Universit?t Heidelberg
Im Neuenheimer Feld 368, D-69120 Heidelberg
------------------------------
Message: 3
Date: Mon, 2 Mar 2015 20:59:18 +0000
From: Daniel Karapetyan <daniel.karapetyan@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Airport operations and airline scheduling - EURO
2015 - Glasgow
Message-ID:
<CADkF59D8q2SNiN+oUVZA7wEr39L7fo2OCz1F69wXD_UDsXjQuQ@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
27th European Conference on Operational Research
12-15 July 2015, University of Strathclyde, Glasgow
Dear Colleagues,
We invite you to contribute to one of the following sessions within
the "Airport operations and airline scheduling" stream:
- Airport operations (invitation code: 92eb4ff4)
Session Chairs: Daniel Karapetyan and Jason Atkin
- Airline and Flight operations (invitation code: 178c7a8b)
Session Chairs: Andrew Parkes, Daniel Karapetyan and Jason Atkin
Please submit your abstract to the appropriate session using the
corresponding invitation code via the abstract submission page:
http://www.euro-online.org/conf/euro27.
The deadline for abstract submission is 16 March 2015.
We hope that you are interested in contributing to the stream. If you
have any questions, or wish to organise a session, then please do not
hesitate to contact us.
Best wishes,
Stream Organisers
Daniel Karapetyan and Jason Atkin
ASAP Group, School of Computer Science, University of Nottingham, UK
------------------------------
Message: 4
Date: Tue, 3 Mar 2015 11:10:09 +0000
From: Tatiana Starikovskaya <tat.starikovskaya@gmail.com>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Papers - SPIRE 2015
Message-ID:
<CAAdCTe6mKBk4ciXmWnfDErS8BNEsm8QKryTe_xuZFBHudMptsg@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
=========================================================
================ Call for Papers - SPIRE 2015 ==================
CALL FOR PAPERS
SPIRE 2015
22nd International Symposium on
String Processing and Information Retrieval
Sept. 1 - Sept 3, 2015, London, United Kingdom
http://www.dcs.kcl.ac.uk/events/spire2015/
Submission deadline: ** May 1, 2015 **
Notification: ** June 8, 2015 **
***************************************************************
SCOPE: Papers in all areas related to string processing and
information retrieval and related topics are sought, including,
but not limited to: bioinformatics and computational biology,
high-throughput DNA sequencing, coding and data compression,
compressed data structures, text analysis, data mining, natural
language processing, pattern discovery, string algorithms, string
processing in databases, text searching, information retrieval
models and evaluation, search tasks, efficiency in IR systems.
See: http://www.dcs.kcl.ac.uk/events/spire2015/submissions.html
Both papers reporting on original research unpublished elsewhere
and surveys of important results are welcome.
The proceedings will be published in the Springer-Verlag series
Lecture Notes in Computer Science.
IMPORTANT DATES:
Submission: May 1, 2015
Notification: June 8, 2015
Final version: June 22, 2015
Symposium: September 1- September 3, 2015
Workshops: September 4, 2015
INVITED SPEAKERS:
? Aris Gionis (Aalto University, Finland)
? Mounia Lalmas (Yahoo! Research, United Kingdom)
? Rajeev Raman (University of Leicester, United Kingdom)
PROGRAM COMMITTEE:
? Amihood Amir (Bar-Ilan University, Israel)
? Ismail Sengor Altingovde (METU, Turkey)
? Leif Azzopardi (University of Glasgow, UK)
? Hideo Bannai (Kyushu University, Japan)
? Golnaz Badkobeh (University of Sheffield, UK)
? Philip Bille (Technical University of Denmark, Denmark)
? Christina Boucher (Colorado State University, USA)
? Ben Carterette (University of Delaware, USA)
? Charlie Clarke (University of Waterloo, Canada)
? Gianluca Demartini (University of Sheffield, UK)
? Johannes Fischer (TU Dortmund, Germany)
? Travis Gagie (University of Helsinki, Finland)
? Pawe? Gawrychowski (University of Warsaw, Poland)
? Simon Gog (Karlsruhe Institute of Technology, Germany)
? Danny Hermelin (Ben-Gurion University, Israel)
? Djoerd Hiemstra (University of Twente, The Netherlands)
? Katja Hofmann (Microsoft Research Cambridge, UK)
? Costas Iliopoulos (King's College London, UK, co-chair)
? Juha K?rkk?inen (University of Helsinki, Finland)
? Jaap Kamps (University of Amsterdam, The Netherlands)
? Evangelos Kanoulas (University of Amsterdam, The Netherlands)
? Gabriella Kazai (Lumi, UK)
? Gad Landau (University of Haifa, Israel)
? Susana Ladra (University of A Coru?a, Spain)
? Zsuzsanna Lipt?k (University of Verona, Italy)
? Gonzalo Navarro (University of Chile, Chile)
? Kunsoo Park (Seoul National University, Korea)
? Nadia Pisanti (University of Pisa, Italy)
? Solon Pissis (King's College London, UK)
? Simon J. Puglisi (University of Helsinki, Finland, co-chair)
? Jakub Radoszewski (University of Warsaw, Poland)
? Marinella Sciortino (University of Palermo, Italy)
? Falk Scholer (RMIT University, Australia)
? Torsten Suel (New York University, USA)
? Jouni Sir?n (Wellcome Trust Sanger Institute, UK)
? Tatiana Starikovskaya (University of Bristol, UK)
? Yasuo Tabei (Tokyo Institute of Technology, Japan)
? Rossano Venturini (University of Pisa, Italy)
? Grace Yang (Georgetown University, USA)
? Emine Yilmaz (University College London, UK, co-chair)
ORGANIZING COMMITTEE
? Solon Pissis (King's College London, UK, chair)
? Maxime Crochemore (King's College London, UK)
? Tomasz Radzik (King's College London, UK)
? Carl Barton (Queen Mary College, UK)
STEERING COMMITTEE
? Ricardo Baeza-Yates (Yahoo! Research)
? Maxime Crochemore (King's College London, UK)
? Oren Kerland (Technion, Israel)
? Moshe Lewenstein (Bar-Ilan University, Israel)
? Ely Porat (Bar-Ilan University, Israel)
? Berthier Ribeiro-Neto (Google Inc. and Federal Univ. Minas
Gerais, Brazil)
? Edleno Silva de Moura (Federal University of Amazonas, Brazil)
? Nivio Ziviani (Federal University of Minas Gerais, Brazil)
? Liliana Calder?n-Benavides (Autonomous Univ. Bucaramanga,
Colombia)
? Edgar Ch?vez (Centro de Investigacion Cientifica y de Educacion
Superior de Ensenada, Mexico)
? Cristina N. Gonz?lez-Caro (Autonomous Univ. Bucaramanga, Colombia)
Further details are available at the symposium web site:
http://www.dcs.kcl.ac.uk/events/spire2015/
------------------------------
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 85, Issue 3
*************************************
No comments:
Post a Comment