**********************************************************************
ALENEX 2013 - MEETING ON ALGORITHM ENGINEERING & EXPERIMENTS
January 7, 2013
Astor Crowne Plaza Hotel
New Orleans, Lousiana, USA
http://www.siam.org/meetings/alenex13
**********************************************************************
- SCOPE -
The aim of ALENEX is to provide a forum for the presentation of
original research in the design, implementation, and experimental
evaluation of algorithms and data structures. Typical submissions will
include an extensive experimental analysis of nontrivial algorithmic
results, ideally bridging the gap between theory and practice. We also
invite submissions that address methodological issues and standards in
the experimental evaluation of algorithms and data structures. Some
possible areas of applied algorithmic research include but are not
limited to databases; networks, including web applications; operations
research; and computational problems in the natural sciences or
engineering. Submissions are encouraged that address algorithms and
data structures for advanced models of computing including memory
hierarchies and parallel computing, ranging from instruction
parallelism over multicore computing to exascale and cloud computing.
ALENEX is co-located with the ACM-SIAM Symposium on Discrete
Algorithms (SODA13), and Analytic Algorithmics and Combinatorics
(ANALCO13). Since researchers in all fields are approaching the
problem of learning detailed information about the performance of
particular algorithms, we expect that interesting synergies will
develop.
Proceedings of ALENEX and ANALCO will be published openly and
electronically in December 2012. A special issue of the ACM Journal of
Experimental Algorithmics will be dedicated to selected papers from
ALENEX13.
A paper that has been reviewed and accepted for presentation at SODA
is not eligible for submission to ALENEX. We recognize, however, that
some research projects spawn multiple papers that elaborate on
different aspects of the work, and are willing to respond to inquiries
about SODA, ALENEX, and ANALCO papers that may overlap. regarding
ALENEX may be sent to ALENEX co-chairs Peter Sanders (sanders@kit.edu)
or Norbert Zeh (nzeh@cs.dal.ca).
ALENEX is supported by SIAM (Society for Industrial and Applied
Mathematics) and SIGACT (ACM Special Interest Group on Algorithms and
Computation Theory).
- SPECIAL NOTICE OF CHANGES FOR 2013 -
ALENEX will be offered as a fourth "track" on the second day of SODA
(January 7, 2013). The ANALCO and ALENEX programs will be integrated
with the SODA program and all papers will be available online before
the conference. The integration of ALENEX into the SODA programme
leads to a tight time line after acceptance of papers. Thus, there
are two deadlines for accepted papers: one for submission of final
title and abstract of the paper for inclusion in the programme booklet
and one for submission of the final version of the paper to be included
in the electronic proceedings.
- IMPORTANT DATES -
Submission: September 25, 2012 (11:59 EDT)
Notification of authors: October 22, 2012
Final version of title and abstracts: October 29, 2012
Camera-ready paper: November 13, 2012
- SUBMISSIONS -
Authors are invited to submit a 10-page extended abstract. Authors may
include a clearly marked appendix, which will be read at the discretion
of the programme commitee.
Papers should begin with the title of the paper, each author's name,
affiliation, and e-mail address, followed by a clear statement of the
problem considered, a succinct summary of the results obtained, a
brief discussion of the significance and novelty of the research, and
a clear comparison with related work. The remainder of the extended
abstract should provide sufficient detail to allow the program
committee to evaluate the validity, quality, and relevance of the
contribution.
Submissions should be typeset in single column format, using 11-point
or larger font, with reasonable margins and line spacing. Excluding
the title page and bibliography, the extended abstract must not exceed
ten pages. Supplementary material may be included in the appendix and
will be read at the discretion of the reviewers.
Authors of accepted papers are strongly encouraged to submit publicly
available code and data to the ACM Journal of Experimental
Algorithmics Research Code Repository via
http://www.jea.acm.org/repository/.
- PROGRAMME COMMITTEE -
Graham Cormode, AT&T Labs Research, USA
Daniel Delling, Microsoft Research, USA
Rolf Fagerberg, University of Southern Denmark, Denmark
Irene Finocchi, University of Rome "La Sapienza," Italy
Bruce Hendrickson, Sandia National Laboratories, USA
Alejandro López-Ortiz, University of Waterloo, Canada
Gonzalo Navarro, University of Chile, Chile
Knut Reinert, Freie Universität Berlin, Germany
Peter Sanders, Karlsruhe Institute of Technology, Germany (co-chair)
Martin Skutella, Technische Universität Berlin, Germany
Kavitha Telikepalli, Tata Institute of Fundamental Research, India
Takeaki Uno, National Institute of Informatics, Japan
Ke Yi, Hong Kong University of Science and Technology, Hong Kong
Norbert Zeh, Dalhousie University, Canada (co-chair)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Friday, September 21, 2012
[DMANET] PhD studentship in Algorithmic Game Theory at Teesside University, UK
Applications are invited for a fully funded PhD studentship in
Algorithmic Game Theory at Teesside University, UK.
The studentship is open to UK or EU students in the first instance.
More details, including application procedure, can be found at
http://www.tees.ac.uk/docs/DocRepo/Research/studentship17.doc.
The deadline for the application is Oct 19, 2012.
Prospective applicants are welcome to contact myself for informal enquiries.
Carmine Ventre
School of Computing, Teesside University
http://www.scm.tees.ac.uk/c.ventre/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Algorithmic Game Theory at Teesside University, UK.
The studentship is open to UK or EU students in the first instance.
More details, including application procedure, can be found at
http://www.tees.ac.uk/docs/DocRepo/Research/studentship17.doc.
The deadline for the application is Oct 19, 2012.
Prospective applicants are welcome to contact myself for informal enquiries.
Carmine Ventre
School of Computing, Teesside University
http://www.scm.tees.ac.uk/c.ventre/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Thursday, September 20, 2012
[DMANET] Maryland Theory Day, one day after FOCS 2012
We are delighted to announce the Maryland Theory Day on Wed., Oct 24, one
day after FOCS 2012. The University of Maryland is conveniently reachable
from the FOCS location. Registration is free and required by October 7th.
The problem will include talks by Distinguished Invited Speakers Julia
Chuzhoy and Venkataesan Guruswami, short talks by Bill Gasarch,
MohammadTaghi Hajiaghayi, Jonathan Katz, Samir Khuller, David Mount,
Elaine (Runting) Shi, and Aravind Srinivasan, as well as a poster session.
Please see http://www.cs.umd.edu/~srin/tday12.html for the event's
homepage and the (simple) registration details.
We look forward to welcoming many of you.
Sincerely,
Aravind Srinivasan Email: srin@cs.umd.edu
Professor Web: http://www.cs.umd.edu/~srin
Dept. of Computer Science Phone: 301-405-2695
University of Maryland Fax: 301-405-6707
College Park, MD 20742
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
day after FOCS 2012. The University of Maryland is conveniently reachable
from the FOCS location. Registration is free and required by October 7th.
The problem will include talks by Distinguished Invited Speakers Julia
Chuzhoy and Venkataesan Guruswami, short talks by Bill Gasarch,
MohammadTaghi Hajiaghayi, Jonathan Katz, Samir Khuller, David Mount,
Elaine (Runting) Shi, and Aravind Srinivasan, as well as a poster session.
Please see http://www.cs.umd.edu/~srin/tday12.html for the event's
homepage and the (simple) registration details.
We look forward to welcoming many of you.
Sincerely,
Aravind Srinivasan Email: srin@cs.umd.edu
Professor Web: http://www.cs.umd.edu/~srin
Dept. of Computer Science Phone: 301-405-2695
University of Maryland Fax: 301-405-6707
College Park, MD 20742
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] SPIRE 2012 - CALL FOR PARTICIPATION
CALL FOR PARTICIPATION
19th International Symposium on String Processing and Information Retrieval
(SPIRE 2012)
October 21 - 25, 2012 -- Cartagena de Indias, Colombia
http://spire2012.unab.edu.co
***********************************************************************************
Save on your registration fee by registering by October 11, 2012
***********************************************************************************
******* SPONSORED BY
* Departamento Administrativo de Ciencia, Tecnología e Innovación, COLCIENCIAS
* Secretaría de Tecnologías de Información de Santander
* Google
* Yahoo! Research
* ElectroSoftware
* Red Universitaria Mutis
* Universidad Autónoma de Bucaramanga
******* AIMS OF THE CONFERENCE
You are cordially invited to participate in SPIRE 2012, the 19th
International Symposium on String Processing and Information
Retrieval. The scope of the SPIRE series of symposia includes not only
fundamental algorithms in string processing and information retrieval,
but also SP and IR techniques as applied to areas such as
computational biology, DNA sequencing, and Web mining. Given its
interdisciplinary nature, SPIRE offers a unique opportunity for
researchers from these different areas to meet and network.
Typical topics of interest include, but are not limited to:
* String Processing: Dictionary algorithms, Text searching, Pattern
matching, Text and sequence compression, Succinct and compressed
indexing, Automata-based string processing;
* Biological Sequence Processing: Analysis of DNA and RNA sequencing
data, Molecular sequence processing, Recognition of genes and
regulatory elements, Comparative genomics and population genetics;
* Information Retrieval: Information retrieval models, Indexing,
Ranking and filtering, Interface design for IR, Evaluation issues in
IR, Text analysis, Text mining, Text classification and clustering,
Information extraction, Language models and topic models for search
related-tasks, Efficient implementation of IR systems, Algorithms and
data structures for IR;
* Search-related tasks: Cross-lingual information retrieval,
Multimedia / multi-modal information retrieval, Recommendation and
collaborative filtering, Semi-structured data retrieval, Blog
retrieval.
******* REGISTRATION
Detailed registration information can be found at
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=16&Itemid=16
******* PROGRAM
The SPIRE 2012 program features
* the SPIRE 2012 Tutorials day (Oct 21)
* the SPIRE 2012 Workshops day (Oct 22)
* the SPIRE 2012 Main Conference (Oct 23-25)
For the detailed program of the entire conference see:
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=26&Itemid=26
******* MAIN CONFERENCE
The SPIRE 2012 main conference features three invited talks:
* Amihood Amir: Approximate Period Detection and Correction
* Ricardo Baeza-Yates: Usage Data in Web Search: Benefits and Limitations
* Ian Witten: Semantic document representation: do it with Wikification
Plus 26 long papers and 9 short papers.
For the list of accepted papers see:
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=24&Itemid=24
******* TUTORIALS
The SPIRE 2012 Tutorials day (Oct 121 -- see
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=19&Itemid=19
for details) features the following half-day tutorials:
* Information Dissemination in Social Networks, by Aristides Gionis -
Yahoo! Research, Barcelona
* Evaluation Metrics for Information Access, by Enrique Amigó and
Julio Gonzalo - UNED, Madrid
* Space-Efficient Data Structures, by Francisco Claude - University
of Waterloo and Gonzalo Navarro - Univ. of Chile
Tutorial attendance is free for everyone registered for the SPIRE 2012
main conference.
******* WORKSHOPS
The SPIRE 2012 Workshops day (Oct 22 -- see
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=21&Itemid=21
for details ) features two full-day workshops:
* Workshop on the Algorithmic Analysis of Biological Data (WAABD
2012), organized by Nadia Pisanti (Univ. of Pisa, Italy), et al.
* Workshop On Compression, Text, And Algorithms (WCTA 2012),
organized by Gonzalo Navarro, (University of Chile)
Workshop attendance is free for everyone registered for the SPIRE 2012
main conference.
******* LATIN AMERICAN WEB CONFERENCE
This year, the last day of SPIRE will hold joint-sessions along with
LA-WEB 2012. For more information about LA-WEB 2012 see:
http://laweb2012.unab.edu.co
******* PROGRAM COMMITTEE
Giambattista Amati, Fundazione Ugo Bordoni, Italy
Amihood Amir, Bar Ilan U., Israel
Ricardo Baeza-Yates, Yahoo! Research
Paolo Boldi, U. Degli Studi di Milano, Italy
Liliana Calderón-Benavides, U. Autónoma de Bucaramanga, Colombia
Jamie Callan, Carnegie Mellon, USA
Edgar Chavez, U. Michoacana, Mexico (co-chair)
Francisco Claude, University of Waterloo
Cesar A. Collazos, U. Del Cauca, Colombia
Fabio Crestani, UNISI, Switzerland
Marco Cristo, U. Amazonas, Brazil
Maxime Crochemore, King's College, UK
Bruce Croft, U. Massachusets, USA
Edleno Silva De Moura, U. Amazonas, Brazil
Marcos Goncalves, U. Minas Gerais, Brazil
Cristina González-Caro, U. Autónoma de Bucaramanga, Colombia
Concettina Guerra, Georgia Tech, USA
Jan Holub, Technical University in Prague, Czech Republic
Lucian Ilie, U. of Western Ontario, Canada
Costas Iliopoulos, King's College London, UK
Shen Jialie, SMU, Singapore
Gregory Kucherov, Univ. Paris-Est Marne-la-Vallée
Alberto Laender, U. Minas Gerais, Brazil
Mounia Lalmas, Yahoo! Research
Moshe Lewenstein, Bar Ilan U., Israel
Alistair Moffat, U. Melbourne, Australia
Veli Mäkinen, U. Helsinki, Finland
Gonzalo Navarro, U. Chile, Chile
Laxmi Parida, IBM, USA
Kunsoo Park, Seoul National University, Korea
Marco Pellegrini, IIT CNR, Italy
Yoan Pinzon, U. Nacional, Colombia
Simon Puglisi, RMIT, Australia
Berthier Ribeiro-Neto, Google & UFMG
Luis M. S. Russo, U. Nova de Lisboa, Portugal
Rahul Shah, Lousiana State U., USA
Torsten Suel, NYU-POLY, USA
Esko Ukkonen, U. Helsinki, Finland
Adriano Veloso, U. Minas Gerais, Brazil
Jeff Vitter, The University of Kansas, USA
Nivio Ziviani, U. Minas Gerais, Brazil (co-chair)
******* ORGANIZING COMMITTEE
Liliana Calderón-Benavides
Cristina González-Caro
Universidad Autónoma de Bucaramanga, Colombia
(General Chairs)
Edgar Chávez, Universidad Michoacana, México
Nivio Ziviani, Federal University of Minas Gerais, Brazil
(Program Committee Chairs)
Fabrizio Silvestri, ISTI-CNR, Italy
(Tutorials Chair)
Gonzalo Navarro, University of Chile, Chile
(Workshops Chair)
******* CONTACT INFORMATION
Address any further inquiry to:
Liliana Calderón Benavides / Cristina González-Caro
Universidad Autónoma de Bucaramanga
Avenida 42 No. 48 - 11. PC. 680003
Bucaramanga, Colombia
Phone: +57 7 6436111 ext. 617 - 345
Fax: +57 7 6436111 ext. 428
E-mail: spire2012@unab.edu.co
--
19th Symposium on String Processing and Information Retrieval - SPIRE 2012
Cartagena de Indias, Colombia
October 21 - 25, 2012
Website: http://spire2012.unab.edu.co
e-mail: spire2012@unab.edu.co
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
19th International Symposium on String Processing and Information Retrieval
(SPIRE 2012)
October 21 - 25, 2012 -- Cartagena de Indias, Colombia
http://spire2012.unab.edu.co
***********************************************************************************
Save on your registration fee by registering by October 11, 2012
***********************************************************************************
******* SPONSORED BY
* Departamento Administrativo de Ciencia, Tecnología e Innovación, COLCIENCIAS
* Secretaría de Tecnologías de Información de Santander
* Yahoo! Research
* ElectroSoftware
* Red Universitaria Mutis
* Universidad Autónoma de Bucaramanga
******* AIMS OF THE CONFERENCE
You are cordially invited to participate in SPIRE 2012, the 19th
International Symposium on String Processing and Information
Retrieval. The scope of the SPIRE series of symposia includes not only
fundamental algorithms in string processing and information retrieval,
but also SP and IR techniques as applied to areas such as
computational biology, DNA sequencing, and Web mining. Given its
interdisciplinary nature, SPIRE offers a unique opportunity for
researchers from these different areas to meet and network.
Typical topics of interest include, but are not limited to:
* String Processing: Dictionary algorithms, Text searching, Pattern
matching, Text and sequence compression, Succinct and compressed
indexing, Automata-based string processing;
* Biological Sequence Processing: Analysis of DNA and RNA sequencing
data, Molecular sequence processing, Recognition of genes and
regulatory elements, Comparative genomics and population genetics;
* Information Retrieval: Information retrieval models, Indexing,
Ranking and filtering, Interface design for IR, Evaluation issues in
IR, Text analysis, Text mining, Text classification and clustering,
Information extraction, Language models and topic models for search
related-tasks, Efficient implementation of IR systems, Algorithms and
data structures for IR;
* Search-related tasks: Cross-lingual information retrieval,
Multimedia / multi-modal information retrieval, Recommendation and
collaborative filtering, Semi-structured data retrieval, Blog
retrieval.
******* REGISTRATION
Detailed registration information can be found at
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=16&Itemid=16
******* PROGRAM
The SPIRE 2012 program features
* the SPIRE 2012 Tutorials day (Oct 21)
* the SPIRE 2012 Workshops day (Oct 22)
* the SPIRE 2012 Main Conference (Oct 23-25)
For the detailed program of the entire conference see:
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=26&Itemid=26
******* MAIN CONFERENCE
The SPIRE 2012 main conference features three invited talks:
* Amihood Amir: Approximate Period Detection and Correction
* Ricardo Baeza-Yates: Usage Data in Web Search: Benefits and Limitations
* Ian Witten: Semantic document representation: do it with Wikification
Plus 26 long papers and 9 short papers.
For the list of accepted papers see:
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=24&Itemid=24
******* TUTORIALS
The SPIRE 2012 Tutorials day (Oct 121 -- see
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=19&Itemid=19
for details) features the following half-day tutorials:
* Information Dissemination in Social Networks, by Aristides Gionis -
Yahoo! Research, Barcelona
* Evaluation Metrics for Information Access, by Enrique Amigó and
Julio Gonzalo - UNED, Madrid
* Space-Efficient Data Structures, by Francisco Claude - University
of Waterloo and Gonzalo Navarro - Univ. of Chile
Tutorial attendance is free for everyone registered for the SPIRE 2012
main conference.
******* WORKSHOPS
The SPIRE 2012 Workshops day (Oct 22 -- see
http://spire2012.unab.edu.co/index.php?option=com_content&view=category&layout=blog&id=21&Itemid=21
for details ) features two full-day workshops:
* Workshop on the Algorithmic Analysis of Biological Data (WAABD
2012), organized by Nadia Pisanti (Univ. of Pisa, Italy), et al.
* Workshop On Compression, Text, And Algorithms (WCTA 2012),
organized by Gonzalo Navarro, (University of Chile)
Workshop attendance is free for everyone registered for the SPIRE 2012
main conference.
******* LATIN AMERICAN WEB CONFERENCE
This year, the last day of SPIRE will hold joint-sessions along with
LA-WEB 2012. For more information about LA-WEB 2012 see:
http://laweb2012.unab.edu.co
******* PROGRAM COMMITTEE
Giambattista Amati, Fundazione Ugo Bordoni, Italy
Amihood Amir, Bar Ilan U., Israel
Ricardo Baeza-Yates, Yahoo! Research
Paolo Boldi, U. Degli Studi di Milano, Italy
Liliana Calderón-Benavides, U. Autónoma de Bucaramanga, Colombia
Jamie Callan, Carnegie Mellon, USA
Edgar Chavez, U. Michoacana, Mexico (co-chair)
Francisco Claude, University of Waterloo
Cesar A. Collazos, U. Del Cauca, Colombia
Fabio Crestani, UNISI, Switzerland
Marco Cristo, U. Amazonas, Brazil
Maxime Crochemore, King's College, UK
Bruce Croft, U. Massachusets, USA
Edleno Silva De Moura, U. Amazonas, Brazil
Marcos Goncalves, U. Minas Gerais, Brazil
Cristina González-Caro, U. Autónoma de Bucaramanga, Colombia
Concettina Guerra, Georgia Tech, USA
Jan Holub, Technical University in Prague, Czech Republic
Lucian Ilie, U. of Western Ontario, Canada
Costas Iliopoulos, King's College London, UK
Shen Jialie, SMU, Singapore
Gregory Kucherov, Univ. Paris-Est Marne-la-Vallée
Alberto Laender, U. Minas Gerais, Brazil
Mounia Lalmas, Yahoo! Research
Moshe Lewenstein, Bar Ilan U., Israel
Alistair Moffat, U. Melbourne, Australia
Veli Mäkinen, U. Helsinki, Finland
Gonzalo Navarro, U. Chile, Chile
Laxmi Parida, IBM, USA
Kunsoo Park, Seoul National University, Korea
Marco Pellegrini, IIT CNR, Italy
Yoan Pinzon, U. Nacional, Colombia
Simon Puglisi, RMIT, Australia
Berthier Ribeiro-Neto, Google & UFMG
Luis M. S. Russo, U. Nova de Lisboa, Portugal
Rahul Shah, Lousiana State U., USA
Torsten Suel, NYU-POLY, USA
Esko Ukkonen, U. Helsinki, Finland
Adriano Veloso, U. Minas Gerais, Brazil
Jeff Vitter, The University of Kansas, USA
Nivio Ziviani, U. Minas Gerais, Brazil (co-chair)
******* ORGANIZING COMMITTEE
Liliana Calderón-Benavides
Cristina González-Caro
Universidad Autónoma de Bucaramanga, Colombia
(General Chairs)
Edgar Chávez, Universidad Michoacana, México
Nivio Ziviani, Federal University of Minas Gerais, Brazil
(Program Committee Chairs)
Fabrizio Silvestri, ISTI-CNR, Italy
(Tutorials Chair)
Gonzalo Navarro, University of Chile, Chile
(Workshops Chair)
******* CONTACT INFORMATION
Address any further inquiry to:
Liliana Calderón Benavides / Cristina González-Caro
Universidad Autónoma de Bucaramanga
Avenida 42 No. 48 - 11. PC. 680003
Bucaramanga, Colombia
Phone: +57 7 6436111 ext. 617 - 345
Fax: +57 7 6436111 ext. 428
E-mail: spire2012@unab.edu.co
--
19th Symposium on String Processing and Information Retrieval - SPIRE 2012
Cartagena de Indias, Colombia
October 21 - 25, 2012
Website: http://spire2012.unab.edu.co
e-mail: spire2012@unab.edu.co
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CfP: CPAIOR 2013 (papers due Nov. 2, 2012)
Call for Papers
CPAIOR 2013
Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming
web: http://www.cis.cornell.edu/ics/cpaior2013/
cpaior series: http://www.andrew.cmu.edu/user/vanhoeve/cpaior/
IBM Research, Yorktown Heights, NY, USA
MAY 18 - 22, 2013
=============================================================================
DEADLINES (beware EARLIER than usual)
=============================================================================
PAPER SUBMISSION (identical for long and short papers):
Abstract due: OCT 29, 2012 11.59 P.M. PST
Paper due: NOV 2, 2012 11.59 P.M. PST
Notification: NOV 28, 2012
Rebuttal due: NOV 30, 2012
Final Notification:DEC 14, 2012
Final version due: JAN 11, 2013
PRESENTATION-ONLY ABSTRACT SUBMISSIONS:
Abstract due: Feb 1, 2013 11.59 P.M. PST
Notification: Feb 22, 2013
=============================================================================
The Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming will be held in Yorktown Heights, NY, USA, May 18-22, 2013
with a Master Class on CP and OR on May 18, Workshops on May 19 and
Main Program on May 20-22, 2013.
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 5 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=cpaior2013
PRESENTATION-ONLY ABSTRACT SUBMISSION
An abstract of no more than 200 words should be submitted through the
submission page. Names and affiliations of all authors should be
provided, with the presenting author listed first. All accepted
presentation-only abstracts will be printed in the conference program.
For any queries on the submission process, please contact the Program
Chairs using the email cpaior2013@gmail.com .
PROGRAM CHAIRS:
Carla Gomes
Meinolf Sellmann
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CPAIOR 2013
Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming
web: http://www.cis.cornell.edu/ics/cpaior2013/
cpaior series: http://www.andrew.cmu.edu/user/vanhoeve/cpaior/
IBM Research, Yorktown Heights, NY, USA
MAY 18 - 22, 2013
=============================================================================
DEADLINES (beware EARLIER than usual)
=============================================================================
PAPER SUBMISSION (identical for long and short papers):
Abstract due: OCT 29, 2012 11.59 P.M. PST
Paper due: NOV 2, 2012 11.59 P.M. PST
Notification: NOV 28, 2012
Rebuttal due: NOV 30, 2012
Final Notification:DEC 14, 2012
Final version due: JAN 11, 2013
PRESENTATION-ONLY ABSTRACT SUBMISSIONS:
Abstract due: Feb 1, 2013 11.59 P.M. PST
Notification: Feb 22, 2013
=============================================================================
The Tenth International Conference on Integration of Artificial
Intelligence and Operations Research Techniques in Constraint
Programming will be held in Yorktown Heights, NY, USA, May 18-22, 2013
with a Master Class on CP and OR on May 18, Workshops on May 19 and
Main Program on May 20-22, 2013.
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 5 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=cpaior2013
PRESENTATION-ONLY ABSTRACT SUBMISSION
An abstract of no more than 200 words should be submitted through the
submission page. Names and affiliations of all authors should be
provided, with the presenting author listed first. All accepted
presentation-only abstracts will be printed in the conference program.
For any queries on the submission process, please contact the Program
Chairs using the email cpaior2013@gmail.com .
PROGRAM CHAIRS:
Carla Gomes
Meinolf Sellmann
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] LSSC conference
Dear Colleague,
On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 9th International Conference on Large
Scale Scientific Computation - LSSC'13, June 3 - 7, 2013, Sozopol,
Bulgaria, with arrival: June 2 and departure: noon June 7.
The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.
Topics
The list of topics includes, but is not limited to:
combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc
Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).
Important deadlines
Deadline for submission of abstracts
January 15, 2013
Notification of acceptance of the talks on the basis of the submitted abstract
January 31, 2013
Deadline for submission of full papers
March 15, 2013
Notification of acceptance of full papers
April 30, 2013
Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.
Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).
Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom13.html
Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 9th International Conference on Large
Scale Scientific Computation - LSSC'13, June 3 - 7, 2013, Sozopol,
Bulgaria, with arrival: June 2 and departure: noon June 7.
The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.
Topics
The list of topics includes, but is not limited to:
combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu search
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc
Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).
Important deadlines
Deadline for submission of abstracts
January 15, 2013
Notification of acceptance of the talks on the basis of the submitted abstract
January 31, 2013
Deadline for submission of full papers
March 15, 2013
Notification of acceptance of full papers
April 30, 2013
Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.
Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).
Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom13.html
Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CTW 2013 - Call for Papers - 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
--------------------------
CTW 2013 - CALL FOR PAPERS
--------------------------
12th Cologne-Twente Workshop on Graphs & Combinatorial Optimization
University of Twente, Enschede, The Netherlands
May 21-23, 2013.
http://www.math.utwente.nl/~ctw/
------------------------------------------------------------------
* Deadline for submission: February 22, 2013
* Notification of acceptance: April 5, 2013
* Conference dates: May 21-23, 2013
------------------------------------------------------------------
The 12th CTW welcomes contributions on theory and applications of
discrete algorithms, graphs and combinatorial structures in a wide sense.
Authors wishing to submit a contribution, should prepare an extended
abstract of at most 4 pages by February 22, 2013 following the
guidelines on the conference website.
A special proceedings volume of Discrete Applied Mathematics, containing
full length papers, refereed according to the high standards of DAM, is
planned.
Further details are available on the conference website at
http://www.math.utwente.nl/~ctw/.
SCIENTIFIC COMMITTEE
Ulrich Faigle (U Cologne)
Johann L. Hurink (U Twente),
Renato de Leone (U di Camerino)
Leo Liberti (École Polytechnique, Paris)
Bodo Manthey (U Twente)
Gaia Nicosia (U Roma Tre)
Andrea Pacifici (U Roma Tor Vergata)
Stefan Pickl (UBw München)
Giovanni Righini (U Milano)
Rainer Schrader (U Cologne)
Rüdiger Schultz (U Duisburg-Essen)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CTW 2013 - CALL FOR PAPERS
--------------------------
12th Cologne-Twente Workshop on Graphs & Combinatorial Optimization
University of Twente, Enschede, The Netherlands
May 21-23, 2013.
http://www.math.utwente.nl/~ctw/
------------------------------------------------------------------
* Deadline for submission: February 22, 2013
* Notification of acceptance: April 5, 2013
* Conference dates: May 21-23, 2013
------------------------------------------------------------------
The 12th CTW welcomes contributions on theory and applications of
discrete algorithms, graphs and combinatorial structures in a wide sense.
Authors wishing to submit a contribution, should prepare an extended
abstract of at most 4 pages by February 22, 2013 following the
guidelines on the conference website.
A special proceedings volume of Discrete Applied Mathematics, containing
full length papers, refereed according to the high standards of DAM, is
planned.
Further details are available on the conference website at
http://www.math.utwente.nl/~ctw/.
SCIENTIFIC COMMITTEE
Ulrich Faigle (U Cologne)
Johann L. Hurink (U Twente),
Renato de Leone (U di Camerino)
Leo Liberti (École Polytechnique, Paris)
Bodo Manthey (U Twente)
Gaia Nicosia (U Roma Tre)
Andrea Pacifici (U Roma Tor Vergata)
Stefan Pickl (UBw München)
Giovanni Righini (U Milano)
Rainer Schrader (U Cologne)
Rüdiger Schultz (U Duisburg-Essen)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Wednesday, September 19, 2012
[DMANET] Winter School Netopt2013
The 3rd Winter School on Network Optimization
(http://NetOpt2013.fc.ul.pt) will take place at the Hotel Sana,
Estoril, from the 14th to the 18th of January, 2013. Its main objective
is to provide an opportunity for PhD students to get together
and attend high level courses in the field of Network Optimization.
Non-PhD students are welcome to attend the school,
but the number of participants is limited and priority will be given
to PhD students.
Since the first edition in 2009, the school has been part of the
activities of the Centro de Investigação Operacional, University
of Lisbon as well as of the European Network Optimization Group
(ENOG).
The event is also endorsed by the EURO – the Association
of European Societies – and APDIO – the Portuguese OR society.
School Lecturers
Antonio Frangioni Università di Pisa
Decomposition in multicommodity flows: old ideas
and new developments
Michel Gendreau CIRRELT and MAGI, École Polytechnique de Montréal
Stochastic network design problems
Arie Koster RWTH Aachen University
Network design under demand uncertainty by robust optimization
Martine Labbé Université Libre de Bruxelles
Combinatorial optimization problems in biology and medicine:
haplotyping and phylogeny
Paolo Toth Alma Mater Studiorum Università di Bologna
Algorithms and formulations for the asymmetric
salesman problem
Organizing Committee
Luis Gouveia (chair) CIO – University of Lisbon
Walid Ben-Ameur TELECOM SudParis
Miguel Constantino CIO – University of Lisbon
Maria Conceição Fonseca CIO – University of Lisbon
Bernard Fortz Computer Science Department – Université Libre de Bruxelles
Rodrigo Marques CIO
Marta Mesquita CIO & ISA – Technical University of Lisbon
Pedro Moura CIO – University of Lisbon
Maria Cândida Mourão CIO & ISEG – Technical University of Lisbon
Margarida Moz CIO & ISEG – Technical University of Lisbon
Ana Paias CIO – University of Lisbon
João Telhada CIO – University of Lisbon
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
(http://NetOpt2013.fc.ul.pt) will take place at the Hotel Sana,
Estoril, from the 14th to the 18th of January, 2013. Its main objective
is to provide an opportunity for PhD students to get together
and attend high level courses in the field of Network Optimization.
Non-PhD students are welcome to attend the school,
but the number of participants is limited and priority will be given
to PhD students.
Since the first edition in 2009, the school has been part of the
activities of the Centro de Investigação Operacional, University
of Lisbon as well as of the European Network Optimization Group
(ENOG).
The event is also endorsed by the EURO – the Association
of European Societies – and APDIO – the Portuguese OR society.
School Lecturers
Antonio Frangioni Università di Pisa
Decomposition in multicommodity flows: old ideas
and new developments
Michel Gendreau CIRRELT and MAGI, École Polytechnique de Montréal
Stochastic network design problems
Arie Koster RWTH Aachen University
Network design under demand uncertainty by robust optimization
Martine Labbé Université Libre de Bruxelles
Combinatorial optimization problems in biology and medicine:
haplotyping and phylogeny
Paolo Toth Alma Mater Studiorum Università di Bologna
Algorithms and formulations for the asymmetric
salesman problem
Organizing Committee
Luis Gouveia (chair) CIO – University of Lisbon
Walid Ben-Ameur TELECOM SudParis
Miguel Constantino CIO – University of Lisbon
Maria Conceição Fonseca CIO – University of Lisbon
Bernard Fortz Computer Science Department – Université Libre de Bruxelles
Rodrigo Marques CIO
Marta Mesquita CIO & ISA – Technical University of Lisbon
Pedro Moura CIO – University of Lisbon
Maria Cândida Mourão CIO & ISEG – Technical University of Lisbon
Margarida Moz CIO & ISEG – Technical University of Lisbon
Ana Paias CIO – University of Lisbon
João Telhada CIO – University of Lisbon
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoc positions at the Universitaet of Vienna
DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF VIENNA
POST-DOCTORAL RESEARCH ASSISTANT POSITION
A post-doctoral research assistant position are available in the research
group of Professor Dr. Monika Henzinger, who is leading the research
group "Theory and Applications of Algorithms" at the University of Vienna
and is co-director of the Computational Science Center. Her research areas
are efficient algorithms and algorithmic game theory, as well as data
analysis and data mining.
See
http://informatik.univie.ac.at/forschung/forschungsgruppen/theory-and-applications-of-algorithms/
for more information on the research group.
The position is available starting December 1, 2012 and will be of 12
months with possible extension. Applicants should have or expect shortly
to obtain a PhD in computer science or some other relevant discipline,
with a strong background in theoretical computer science. Experience in
the analysis of algorithms or in algorithmic game theory is a plus.
Successful applicants are expected to perform independent research as well
as collaborative research with the research group of Prof. Henzinger. They
are also expected to teach.
To apply, please send your CV, letter of motivation, and names of at least
two references to monika.henzinger@univie.ac.at.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] IEEE-IPDPS 2013 - CfP (Abstracts due Sept 24th; submissions due Oct 1st)
September 18, 2012 Release
----------------------------------------------
SUBMISSION PORTAL IS OPEN AT WWW.IPDPS.ORG
• Abstracts due.....September 24, 2012
• Submissions due.....October 1, 2012
(All deadlines are 11:59 PM Hawaii Time)
• Rebuttal period.....November 14-18, 2012
• Author final notification.....December 23, 2012
• Camera-ready due.....February 1, 2013
• Conference dates.....May 20-24, 2013
---------------------------------------------
IEEE IPDPS 2013 CALL FOR PAPERS
27th IEEE International Parallel & Distributed Processing Symposium
Boston-Cambridge, USA
20-24 May 2012
www.ipdps.org
----------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
IPDPS 2013 CALL FOR PARTICIPATION
In 2013, IPDPS will be held along the banks of the Charles River at
the Hyatt Regency Cambridge with great views of the Boston skyline.
The Boston-Cambridge venue offers an exciting multicultural setting
where visitors from around the world mingle in the midst of world
renowned educational institutions and landmarks of America's founding.
The Greater Boston Metropolitan Area with many historic and tourist
attractions is easily navigable by foot and public transit. Check the
IPDPS Web pages for updates and information on workshops, the PhD
Forum, and other events as the full program develops.
----------------------------------------------
GENERAL CO-CHAIRS
Martin Herbordt, Boston University, USA
Charles C. (Chip) Weems, University of Massachusetts at Amherst, USA
************************************
************************************
IEEE IPDPS 2013 CALL FOR PAPERS
http://www.ipdps.org/ipdps2013/2013_call_for_papers.html
************************************
PLEASE NOTE:
• Authors must register their paper and submit an abstract, typically
a paragraph or two, by September 24, 2012.
• Authors must then submit full versions of registered papers by
October 1, 2012.
• All deadlines are 11:59 PM Hawaii Time
•Before submitting, review the information under WHAT/WHERE TO SUBMIT below.
SCOPE
Authors are invited to submit manuscripts that present original
unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies is especially welcome.
Topics of interest include, but are not limited to:
•Parallel and distributed algorithms, focusing on issues such as:
stability, scalability, and fault-tolerance of algorithms and data
structures for parallel and distributed systems, communication and
synchronization protocols, network algorithms, scheduling, and load
balancing.
•Applications of parallel and distributed computing, including web
applications, peer-to-peer computing, parallel crowd sourcing, social
network analysis, management of big data, cloud and grid computing,
scientific applications, and mobile computing. Papers focusing on
applications using novel commercial or research architectures, or
discussing scalability toward the exascale level are encouraged.
•Parallel and distributed architectures, including architectures for
instruction-level and thread-level parallelism; petascale and exascale
systems designs; special-purpose architectures, including graphics
processors, signal processors, network processors, media accelerators,
and other special purpose processors and accelerators; impact of
technology on architecture; network and interconnect architectures;
parallel I/O and storage systems; architecture of the memory
hierarchy; power-efficient and green computing architectures;
dependable architectures; and performance modeling and evaluation.
•Parallel and distributed software, including parallel and multicore
programming languages and compilers, runtime systems, operating
systems, resource management including green computing, middleware for
grids, clouds, and data centers, libraries, performance modeling and
evaluation, parallel programming paradigms, and programming
environments and tools.
BEST PAPERS AWARDS
Awards will be given for one best paper in each of the four conference
technical tracks: algorithms, applications, architectures, and
software. Selected papers will be considered for possible publication
in a special issue of the Journal of Parallel and Distributed
Computing.
WHAT/WHERE TO SUBMIT
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.
(*Note: Authors who have already been preparing manuscripts according
to the IPDPS historical page limit of 12 pages will be included for
review without prejudice, and the publication limit for accepted
papers will be 12 pages. IPDPS plans to fully transition to the
shorter 10 page limit next year.)
See style templates for details:
•LaTex Package (ZIP) -
http://www.ipdps.org/templates/IEEECS_CPS_LaTeX_Letter_2Col.zip
•Word Template (ZIP) - http://www.ipdps.org/templates/IEEECS_CPS_8.5x11x2.zip
REVIEW OF MANUSCRIPTS
All submitted manuscripts will be reviewed. The review process is not
double blind, i.e., authors will be known to reviewers. All submitted
manuscripts will be reviewed. Submissions will be judged on
correctness, originality, technical strength, significance, quality of
presentation, and interest and relevance to the conference scope.
Submitted papers may NOT have appeared in or be under consideration
for another conference, workshop or journal. Abstracts are due
September 24, 2012, and full manuscripts must be received by October
1, 2012. This is a final, hard deadline; to ensure fairness, no
extensions will be given. Initial reviews will be returned to authors
by end of day November 13th, and there will be a rebuttal period from
November 14-18, 2012. Notification of final decisions will be mailed
by December 23, 2012, and camera-ready papers will be due February 1,
2013.
PROGRAM CHAIR
Sanjay Ranka (University of Florida, USA)
PROGRAM VICE-CHAIRS
ALGORITHMS: Frédéric Vivien (INRIA, France)
APPLICATIONS: Assaf Schuster (Technion – Israel Institute of Technology, Israel)
ARCHITECTURE: David Kaeli (Northeastern University, USA)
SOFTWARE: David Padua (University of Illinois at Urbana-Champaign, USA)
PROGRAM COMMITTEE*
(17 September 2012)
Tor AAMODT (University of British Columbia) Canada
Tarek S. ABDELRAHMAN (EECG, Toronto) Canada
David ABRAMSON (Monash) Australia
Mark ADAMS (Columbia University) USA
Orna AGMON BEN-YEHUDA (Technion) Israel
Kunal AGRAWAL (Washington University in St. Louis) USA
Gagan AGRAWAL (CSE Ohio State) USA
Emmanuel AGULLO (INRIA) France
Shoukat ALI (IBM Research - Ireland) Ireland
Srinivas ALURU (Iowa State University) USA
Emmanuel ARZUAGA (UPRM) Puerto Rico
Rafael ASENJO PLAZA (University of Málaga) Spain
Zaks AYAL (Intel) Israel
Eduard AYGUADE (Technical University of Catalunya -UPC) Spain
Cevdet AYKANAT (Bilkent University) Turkey
David A. BADER (Georgia Institute of Technology) USA
Amitabha BAGCHI (Indian Institute of Technology Delhi) India
Zhaojun BAI (University of California, Davis) USA
Ioana BALDINI [BURCEA] (IBM Research) USA
Denis BARTHOU (University of Bordeaux) France
Olivier BEAUMONT (INRIA) France
Michael A. BENDER (State University of New York at Stony Brook) USA
Anne BENOIT (ENS Lyon) France
Yitzhak (Tsahi) BIRK (Technion) Israel
Rob BISSELING (U. Utrecht) The Netherlands
George BOSILCA (University of Tennessee, Knoxville) USA
Marin BOUGERET (Université de Montpellier) France
Aurélien BOUTEILLER (University of Tennessee, Knoxville) USA
Hinde BOUZIANE (University of Montpellier) France
Michael J. BRIM (ORNL) USA
Mats BRORSSON (KTH Royal Institute of Technology) Sweden
Aydin BULUÇ (Lawrence Berkeley National Laboratory) USA
Darius BUNTINAS (MCS - Argonne National Laboratory) USA
Michael BURKE (Rice University) USA
Ramon CANAL (UPC Spain) Spain
Franck CAPPELLO (University of Illinois at Urbana-Champaign) USA
Eddy CARON (ENS Lyon) France
Chris CAROTHERS (Rensselaer Polytechnic Institute) USA
Paul CARPENTER (BSC) Spain
Henri CASANOVA (University of Hawaii at Manoa) USA
Yuval CASSUTO (Technion) Israel
Claris CASTILLO (IBM T.J. Watson Research Center) USA
Bryan CATANZARO (NVIDIA) USA
Rezaul A. CHOWDHURY (Stony Brook University) USA
Marcelo CINTRA (The University of Edinburgh) UK
Mark CLEMENT (Brigham Young University) USA
Ayse COSKUN (Boston University) USA
Neal CRAGO (Intel, VSSAD) USA
Dilma DA SILVA (Qualcomm) USA
Anthony DANALIS (University of Tennessee at Knoxville) USA
Alain DARTE (École Normale Supérieure de Lyon) France
Sajal DAS (UT Arlington) USA
Michel DAYDÉ (Université de Toulouse) France
Bronis DE SUPINSKI (LLNL) USA
Frédéric DESPREZ (INRIA) France
Gregory DIAMOS (NVIDIA) USA
Phillip DICKENS (University of Maine) USA
Danny DIG (University of Illinois at Urbana-Champaign) USA
Chen DING (University of Rochester) USA
Shlomi DOLEV (Ben Gurion University of the Negev) Israel
Fanny DUFOSSÉ (University of Nice) France
Pierre-François DUTOT (University of Grenoble) France
Rudolf EIGENMANN (Purdue University) USA
Natalie ENRIGHT-JERGER (Univ. of Toronto) Canada
Mattan EREZ (Univ. of Texas) USA
Yoav ETSION (Technion) Israel
Lionel EYRAUD-DUBOIS (INRIA) France
Michael FACTOR (IBM) Israel
Babek FALSAFI (EPFL) Switzerland
John FEO (Pacific Northwest National Laboratory) USA
Michael FERDMAN (Stony Brook University) USA
Christof FETZER (TU-DRESDEN) Germany
Peirfrancesco FOGLIA (University of Pisa) Italy
Liana L FONG (IBM T.J. Watson Research Center) USA
Eitan FRACHTENBERG (Facebook) USA
Basilio FRAGUELA (University of A Coruna) Spain
Pierre FRAIGNAUD (CNRS) France
Franz FRANCHETTI (Carnegie Mellon University) USA
Davide FREY (INRIA) France
Arik FRIEDMAN (NICTA) Australia
Xin FU (University of Kansas) USA
Grigori FURSIN (INRIA) France
Kyle GALLIVAN (Florida State University) USA
Eftratios GALLOPOULOS (University of Patras) Greece
Guang GAO (University of Delaware) USA
Michale GARLAND (NVIDIA) USA
María Jesús GARZARÁN (University of Illinois at Urbana-Champaign) USA
Leszek GASIENIEC (University of Liverpool) UK
Cyril GAVOILLE (University of Bordeaux) France
Issac GELADO (BSC) Spain
Michael GERNDT (Technische Universität München) Germany
Ran GILAD-BACHRACH (MSR) USA
Luc GIRAUD (INRIA) France
Alfredo GOLDMAN (University of São Paulo) Brazil
María Angeles GONZÁLEZ NAVARRO (University of Málaga) Spain
Horacio GONZÁLEZ-VÉLEZ (National College of Ireland) Ireland
Laura GRIGORI (INRIA) France
Thomas GROSS (ETH Zurich) Switzerland
Isabelle GUÉRIN LASSOUS (Université Lyon 1) France
Abdou GUERMOUCHE (U. of Brodeaux) France
Rachid GUERRAOUI (EPFL) Switzerland
Rajiv GUPTA (University of California Riverside) USA
Haldun HADIMIOGLU (Polytechnic Institute of NYU) USA
Phillip HATCHER (University of New Hampshire) USA
Yuxiong HE (Microsoft) USA
Thomas HERAULT (LRI) France
Bo HONG (Georgia Institute of Technology) USA
Paul HOVLAND (Argonne National Laboratory) USA
Kevin HUCK (ParaTools) USA
Liviu IFTODE (Rutgers) USA
Francois IRIGOIN (MINES ParisTech/CRI) France
Ayal ITZKOVITZ (Oracle Communications) Israel
Mathias JACQUELIN (INRIA) France
Byunghyun JANG (University of Mississippi) USA
Emmanuel JEANNOT (INRIA) France
Sven KARLSSON (DTU) Denmark
Paul KELLY (Imperial College) UK
Nakajima KENGO (University of Tokyo) Japan
Christoph KESSLER (Linköping University) Sweden
Omer KHAN (University of Connecticut) USA
Thilo KIELMANN (Vrije Universiteit) Netherlands
Volodymyr KINDRATENKO (UIUC/NCSA) USA
Gabriel KLIOT (MSR) USA
Miroslaw KORZENIOWSKI (Wroclaw University of Technology) Poland
Harald KOSCH (Passau University) Germany
Milind KULKARNI (Purdue University) USA
Sameer KUMAR (IBM T.J. Watson Research Center) USA
Julien LANGOU (University of Colorado Denver) USA
Fernando LATORRE (Intel-Barcelona) Spain
Jaejin LEE (Seoul National University) Korea
Jenq-Kuen LEE (National Tsing Hua University) Taiwan
Miriam LEESER (Northeastern University) USA
Arnaud LEGRAND (CNRS) France
Pierre LEMARINIER (IBM) Ireland
Xiaoming LI (University of Delaware) USA
Xiaoye Sherry LI (Lawrence Berkeley National Laboratory) USA
Zhiyuan LI (Purdue University) USA
Calvin LIN (The University of Texas at Austin) USA
David LOWENTHAL (The University of Arizona) USA
Robert F. LUCAS (University of Southern California) USA
Mikel LUJAN (University of Manchester) UK
Steven LUMETTA (University of Illinois at Urbana-Champaign) USA
Andrew LUMSDAINE (Indiana University) USA
Kamesh MADDURI (PennState University) USA
Grigorio MAGKLIS (Intel-Barcelona) Spain
Fredrik MANNE (University of Bergen) Norway
Pierre MANNEBACK (University of Mons) Belgium
Loris MARCHAL (CNRS) France
Tomàs MARGALEF (Universitat Autònoma de Barcelona) Spain
Naoya MARUYAMA (RIKEN) Japan
Niko MATSAKIS (MIT) USA
Satoshi MATSUOKA (TITECH) Japan
Jean-Francois MEHAUT (Ensimag) France
Rami MELHEM (University of Pittsburgh) USA
Avi MENDELSON (Microsoft) Israel
Duane MERRILL (NVIDIA) USA
Henning MEYERHENKE (Karlsruhe Institute of Technology - KIT) Germany
Samuel MIDKIFF (Purdue University) USA
Jose MOREIRA (IBM T.J. Watson Research Center) USA
J. Eliot B. MOSS (University of Massachusetts) USA
Abdullah MUZAHID (University of Texas at San Antonio) USA
Esmond NG (Lawrence Berkeley National Laboratory) USA
Alex NICOLAU (University of California Irvine) USA
Dimitris NIKOLOPOULOS (QUB, Belfast) UK
Yun PAEK (Seoul National University) Korea
Dhabaleswar K. PANDA (Ohio State University) USA
Santosh PANDE (Georgia Tech) USA
Victor PANKRATIUS (MIT) USA
Yale PATT (Univ. of Texas) USA
Jih-Kwon PEIR (CISE – University of Florida) USA
Miquel PERICÀS (Tokyo Institute of Technology) Japan
Salvador PETIT (DISCA-UPV) Spain
Laurent PHILIPPE (University of Franche-Comté) France
Michael PHILIPPSEN (University of Erlangen-Nuremberg) Germany
Cynthia A. PHILLIPS (Sandia National Labs) USA
Ali PINAR (Sandia National Laboratories) USA
Don PORTER (Stony Brook University) USA
Sushil K. PRASAD (Georgia State University) USA
Susanne Cech PREVITALI (ETH Zurich) Switzerland
Kirk PRUHS (University of Pittsburgh) USA
Markus PÜSCHEL (ETH Zurich) Switzerland
Martin QUINSON (University of Nancy) France
Padma RAGHAVAN (The Pennsylvania State University) USA
Sanjay RAJOPADHYE (Colorado State University) USA
Smruti RANJAN SARANGI (IIT Delhi) India
Thomas RAUBER (University of Bayreuth) Germany
Lawrence RAUCHWERGER (Texas A&M University) USA
Alistair RENDELL (Australian National University) Australia
Jason RIEDY (Georgia Institute of Technology) USA
Rolf RIESEN (IBM, Dublin) Ireland
Étienne RIVIÈRE (University of Neuchâtel) Switzerland
Chris ROSSBACH (MSR) USA
Larry RUDOLPH (CSAIL-MIT) USA
Gudula RÜNGER (Technische Universität Chemnitz) Germany
Krzysztof RZADCA (University of Warsaw) Poland
Yogish SABHARWAL (IBM Research) India
P. SADAYAPPAN (Ohio State University) USA
Rizos SAKELLARIOU (U. of Manchester) UK
Beverly SANDERS (University of Florida) USA
Mitsuhisa SATO (University of Tsukuba) Japan
Erik SAULE (Ohio State University) USA
André SCHIPER (EPFL) Switzerland
Gunar SCHIRNER (Northeastern University) USA
Stefan SCHMID (Deutsche Telekom Laboratories and TU Berlin) Germany
Martin SCHULZ (LLNL) USA
Uwe SCHWIEGELSHOHN (TU Dortmund) Germany
Resit SENDAG (University of Rhone Island) USA
Pierre SENS (University Paris 6) France
Xipeng SHEN (College of William & Mary) USA
Weidong SHI (University of Houston) USA
Mark SILBERSTEIN (UT Austin) USA
Francesco SILVESTRI (University of Padova) Italy
Yogesh SIMMHAN (University of Southern California) USA
Oliver SINNEN (University of Auckland) New Zealand
Quinn SNELL (Brigham Young University) USA
Veronika SONIGO (IUT Besançon-Vesoul) France
Leonel SOUSA (INESC-ID/IST, Technical University of Lisbon) Portugal
Evan SPEIGHT (IBM Research) USA
Thomas STERLING (Indiana University) USA
Mark STILLWELL (Cranfield University) UK
Jeff STUECHELI (IBM Research) USA
Jaspal SUBHLOK (University of Houston) USA
Frédéric SUTER (CNRS, IN2P3 Computing Center) France
Douglas THAIN (University of Notre Dame) USA
Samuel THIBAULT (University of Bordeaux) France
Sivan TOLEDO (Tel Aviv University) Israel
Pedro TRANCOSO (University of Cyprus) Cyprus
Denis TRYSTRAM (ENSIMAG) France
Dan TSAFRIR (Technion) Israel
Philippas TSIGAS (Chalmers University) Sweden
Rafael UBAL (Northeastern University) USA
Bora UÇAR (ENS Lyon) France
Alex VEIDENBAUM (University of California Irvine) USA
Guru VENKARTARAMANI (George Washington University) USA
Jeff VETTER (Oak Ridge National Laboratory and Georgia Tech) USA
Carlos VILLAVIEJA (University of Texas) USA
C.L. WANG (HKU) Hong Kong
Charles C. (Chip) WEEMS (University of Massachusetts at Amherst) USA
Jon WEISSMAN (University of Minnesota, Twin Cities) USA
Bernard WONG (University of Waterloo) Canada
David WONNACOTT (Haverford College) USA
Carole-Jean WU (Arizona State University) USA
Peng WU (IBM TJ watson Research Center) USA
Quing YI (University of Texas at San Antonio) USA
Rio YOKOTA (King Abdullah University) Saudi Arabia
Hu YU (ICT - Chinese Academy of Sciences) China
Eitan ZAHAVI (Mellanox) Israel
Antonia ZHAI (University of Minnesota) USA
(*Requests for corrections or changes should be sent to contact@ipdps.org.)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
----------------------------------------------
SUBMISSION PORTAL IS OPEN AT WWW.IPDPS.ORG
• Abstracts due.....September 24, 2012
• Submissions due.....October 1, 2012
(All deadlines are 11:59 PM Hawaii Time)
• Rebuttal period.....November 14-18, 2012
• Author final notification.....December 23, 2012
• Camera-ready due.....February 1, 2013
• Conference dates.....May 20-24, 2013
---------------------------------------------
IEEE IPDPS 2013 CALL FOR PAPERS
27th IEEE International Parallel & Distributed Processing Symposium
Boston-Cambridge, USA
20-24 May 2012
www.ipdps.org
----------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
IPDPS 2013 CALL FOR PARTICIPATION
In 2013, IPDPS will be held along the banks of the Charles River at
the Hyatt Regency Cambridge with great views of the Boston skyline.
The Boston-Cambridge venue offers an exciting multicultural setting
where visitors from around the world mingle in the midst of world
renowned educational institutions and landmarks of America's founding.
The Greater Boston Metropolitan Area with many historic and tourist
attractions is easily navigable by foot and public transit. Check the
IPDPS Web pages for updates and information on workshops, the PhD
Forum, and other events as the full program develops.
----------------------------------------------
GENERAL CO-CHAIRS
Martin Herbordt, Boston University, USA
Charles C. (Chip) Weems, University of Massachusetts at Amherst, USA
************************************
************************************
IEEE IPDPS 2013 CALL FOR PAPERS
http://www.ipdps.org/ipdps2013/2013_call_for_papers.html
************************************
PLEASE NOTE:
• Authors must register their paper and submit an abstract, typically
a paragraph or two, by September 24, 2012.
• Authors must then submit full versions of registered papers by
October 1, 2012.
• All deadlines are 11:59 PM Hawaii Time
•Before submitting, review the information under WHAT/WHERE TO SUBMIT below.
SCOPE
Authors are invited to submit manuscripts that present original
unpublished research in all areas of parallel and distributed
processing, including the development of experimental or commercial
systems. Work focusing on emerging technologies is especially welcome.
Topics of interest include, but are not limited to:
•Parallel and distributed algorithms, focusing on issues such as:
stability, scalability, and fault-tolerance of algorithms and data
structures for parallel and distributed systems, communication and
synchronization protocols, network algorithms, scheduling, and load
balancing.
•Applications of parallel and distributed computing, including web
applications, peer-to-peer computing, parallel crowd sourcing, social
network analysis, management of big data, cloud and grid computing,
scientific applications, and mobile computing. Papers focusing on
applications using novel commercial or research architectures, or
discussing scalability toward the exascale level are encouraged.
•Parallel and distributed architectures, including architectures for
instruction-level and thread-level parallelism; petascale and exascale
systems designs; special-purpose architectures, including graphics
processors, signal processors, network processors, media accelerators,
and other special purpose processors and accelerators; impact of
technology on architecture; network and interconnect architectures;
parallel I/O and storage systems; architecture of the memory
hierarchy; power-efficient and green computing architectures;
dependable architectures; and performance modeling and evaluation.
•Parallel and distributed software, including parallel and multicore
programming languages and compilers, runtime systems, operating
systems, resource management including green computing, middleware for
grids, clouds, and data centers, libraries, performance modeling and
evaluation, parallel programming paradigms, and programming
environments and tools.
BEST PAPERS AWARDS
Awards will be given for one best paper in each of the four conference
technical tracks: algorithms, applications, architectures, and
software. Selected papers will be considered for possible publication
in a special issue of the Journal of Parallel and Distributed
Computing.
WHAT/WHERE TO SUBMIT
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.
(*Note: Authors who have already been preparing manuscripts according
to the IPDPS historical page limit of 12 pages will be included for
review without prejudice, and the publication limit for accepted
papers will be 12 pages. IPDPS plans to fully transition to the
shorter 10 page limit next year.)
See style templates for details:
•LaTex Package (ZIP) -
http://www.ipdps.org/templates/IEEECS_CPS_LaTeX_Letter_2Col.zip
•Word Template (ZIP) - http://www.ipdps.org/templates/IEEECS_CPS_8.5x11x2.zip
REVIEW OF MANUSCRIPTS
All submitted manuscripts will be reviewed. The review process is not
double blind, i.e., authors will be known to reviewers. All submitted
manuscripts will be reviewed. Submissions will be judged on
correctness, originality, technical strength, significance, quality of
presentation, and interest and relevance to the conference scope.
Submitted papers may NOT have appeared in or be under consideration
for another conference, workshop or journal. Abstracts are due
September 24, 2012, and full manuscripts must be received by October
1, 2012. This is a final, hard deadline; to ensure fairness, no
extensions will be given. Initial reviews will be returned to authors
by end of day November 13th, and there will be a rebuttal period from
November 14-18, 2012. Notification of final decisions will be mailed
by December 23, 2012, and camera-ready papers will be due February 1,
2013.
PROGRAM CHAIR
Sanjay Ranka (University of Florida, USA)
PROGRAM VICE-CHAIRS
ALGORITHMS: Frédéric Vivien (INRIA, France)
APPLICATIONS: Assaf Schuster (Technion – Israel Institute of Technology, Israel)
ARCHITECTURE: David Kaeli (Northeastern University, USA)
SOFTWARE: David Padua (University of Illinois at Urbana-Champaign, USA)
PROGRAM COMMITTEE*
(17 September 2012)
Tor AAMODT (University of British Columbia) Canada
Tarek S. ABDELRAHMAN (EECG, Toronto) Canada
David ABRAMSON (Monash) Australia
Mark ADAMS (Columbia University) USA
Orna AGMON BEN-YEHUDA (Technion) Israel
Kunal AGRAWAL (Washington University in St. Louis) USA
Gagan AGRAWAL (CSE Ohio State) USA
Emmanuel AGULLO (INRIA) France
Shoukat ALI (IBM Research - Ireland) Ireland
Srinivas ALURU (Iowa State University) USA
Emmanuel ARZUAGA (UPRM) Puerto Rico
Rafael ASENJO PLAZA (University of Málaga) Spain
Zaks AYAL (Intel) Israel
Eduard AYGUADE (Technical University of Catalunya -UPC) Spain
Cevdet AYKANAT (Bilkent University) Turkey
David A. BADER (Georgia Institute of Technology) USA
Amitabha BAGCHI (Indian Institute of Technology Delhi) India
Zhaojun BAI (University of California, Davis) USA
Ioana BALDINI [BURCEA] (IBM Research) USA
Denis BARTHOU (University of Bordeaux) France
Olivier BEAUMONT (INRIA) France
Michael A. BENDER (State University of New York at Stony Brook) USA
Anne BENOIT (ENS Lyon) France
Yitzhak (Tsahi) BIRK (Technion) Israel
Rob BISSELING (U. Utrecht) The Netherlands
George BOSILCA (University of Tennessee, Knoxville) USA
Marin BOUGERET (Université de Montpellier) France
Aurélien BOUTEILLER (University of Tennessee, Knoxville) USA
Hinde BOUZIANE (University of Montpellier) France
Michael J. BRIM (ORNL) USA
Mats BRORSSON (KTH Royal Institute of Technology) Sweden
Aydin BULUÇ (Lawrence Berkeley National Laboratory) USA
Darius BUNTINAS (MCS - Argonne National Laboratory) USA
Michael BURKE (Rice University) USA
Ramon CANAL (UPC Spain) Spain
Franck CAPPELLO (University of Illinois at Urbana-Champaign) USA
Eddy CARON (ENS Lyon) France
Chris CAROTHERS (Rensselaer Polytechnic Institute) USA
Paul CARPENTER (BSC) Spain
Henri CASANOVA (University of Hawaii at Manoa) USA
Yuval CASSUTO (Technion) Israel
Claris CASTILLO (IBM T.J. Watson Research Center) USA
Bryan CATANZARO (NVIDIA) USA
Rezaul A. CHOWDHURY (Stony Brook University) USA
Marcelo CINTRA (The University of Edinburgh) UK
Mark CLEMENT (Brigham Young University) USA
Ayse COSKUN (Boston University) USA
Neal CRAGO (Intel, VSSAD) USA
Dilma DA SILVA (Qualcomm) USA
Anthony DANALIS (University of Tennessee at Knoxville) USA
Alain DARTE (École Normale Supérieure de Lyon) France
Sajal DAS (UT Arlington) USA
Michel DAYDÉ (Université de Toulouse) France
Bronis DE SUPINSKI (LLNL) USA
Frédéric DESPREZ (INRIA) France
Gregory DIAMOS (NVIDIA) USA
Phillip DICKENS (University of Maine) USA
Danny DIG (University of Illinois at Urbana-Champaign) USA
Chen DING (University of Rochester) USA
Shlomi DOLEV (Ben Gurion University of the Negev) Israel
Fanny DUFOSSÉ (University of Nice) France
Pierre-François DUTOT (University of Grenoble) France
Rudolf EIGENMANN (Purdue University) USA
Natalie ENRIGHT-JERGER (Univ. of Toronto) Canada
Mattan EREZ (Univ. of Texas) USA
Yoav ETSION (Technion) Israel
Lionel EYRAUD-DUBOIS (INRIA) France
Michael FACTOR (IBM) Israel
Babek FALSAFI (EPFL) Switzerland
John FEO (Pacific Northwest National Laboratory) USA
Michael FERDMAN (Stony Brook University) USA
Christof FETZER (TU-DRESDEN) Germany
Peirfrancesco FOGLIA (University of Pisa) Italy
Liana L FONG (IBM T.J. Watson Research Center) USA
Eitan FRACHTENBERG (Facebook) USA
Basilio FRAGUELA (University of A Coruna) Spain
Pierre FRAIGNAUD (CNRS) France
Franz FRANCHETTI (Carnegie Mellon University) USA
Davide FREY (INRIA) France
Arik FRIEDMAN (NICTA) Australia
Xin FU (University of Kansas) USA
Grigori FURSIN (INRIA) France
Kyle GALLIVAN (Florida State University) USA
Eftratios GALLOPOULOS (University of Patras) Greece
Guang GAO (University of Delaware) USA
Michale GARLAND (NVIDIA) USA
María Jesús GARZARÁN (University of Illinois at Urbana-Champaign) USA
Leszek GASIENIEC (University of Liverpool) UK
Cyril GAVOILLE (University of Bordeaux) France
Issac GELADO (BSC) Spain
Michael GERNDT (Technische Universität München) Germany
Ran GILAD-BACHRACH (MSR) USA
Luc GIRAUD (INRIA) France
Alfredo GOLDMAN (University of São Paulo) Brazil
María Angeles GONZÁLEZ NAVARRO (University of Málaga) Spain
Horacio GONZÁLEZ-VÉLEZ (National College of Ireland) Ireland
Laura GRIGORI (INRIA) France
Thomas GROSS (ETH Zurich) Switzerland
Isabelle GUÉRIN LASSOUS (Université Lyon 1) France
Abdou GUERMOUCHE (U. of Brodeaux) France
Rachid GUERRAOUI (EPFL) Switzerland
Rajiv GUPTA (University of California Riverside) USA
Haldun HADIMIOGLU (Polytechnic Institute of NYU) USA
Phillip HATCHER (University of New Hampshire) USA
Yuxiong HE (Microsoft) USA
Thomas HERAULT (LRI) France
Bo HONG (Georgia Institute of Technology) USA
Paul HOVLAND (Argonne National Laboratory) USA
Kevin HUCK (ParaTools) USA
Liviu IFTODE (Rutgers) USA
Francois IRIGOIN (MINES ParisTech/CRI) France
Ayal ITZKOVITZ (Oracle Communications) Israel
Mathias JACQUELIN (INRIA) France
Byunghyun JANG (University of Mississippi) USA
Emmanuel JEANNOT (INRIA) France
Sven KARLSSON (DTU) Denmark
Paul KELLY (Imperial College) UK
Nakajima KENGO (University of Tokyo) Japan
Christoph KESSLER (Linköping University) Sweden
Omer KHAN (University of Connecticut) USA
Thilo KIELMANN (Vrije Universiteit) Netherlands
Volodymyr KINDRATENKO (UIUC/NCSA) USA
Gabriel KLIOT (MSR) USA
Miroslaw KORZENIOWSKI (Wroclaw University of Technology) Poland
Harald KOSCH (Passau University) Germany
Milind KULKARNI (Purdue University) USA
Sameer KUMAR (IBM T.J. Watson Research Center) USA
Julien LANGOU (University of Colorado Denver) USA
Fernando LATORRE (Intel-Barcelona) Spain
Jaejin LEE (Seoul National University) Korea
Jenq-Kuen LEE (National Tsing Hua University) Taiwan
Miriam LEESER (Northeastern University) USA
Arnaud LEGRAND (CNRS) France
Pierre LEMARINIER (IBM) Ireland
Xiaoming LI (University of Delaware) USA
Xiaoye Sherry LI (Lawrence Berkeley National Laboratory) USA
Zhiyuan LI (Purdue University) USA
Calvin LIN (The University of Texas at Austin) USA
David LOWENTHAL (The University of Arizona) USA
Robert F. LUCAS (University of Southern California) USA
Mikel LUJAN (University of Manchester) UK
Steven LUMETTA (University of Illinois at Urbana-Champaign) USA
Andrew LUMSDAINE (Indiana University) USA
Kamesh MADDURI (PennState University) USA
Grigorio MAGKLIS (Intel-Barcelona) Spain
Fredrik MANNE (University of Bergen) Norway
Pierre MANNEBACK (University of Mons) Belgium
Loris MARCHAL (CNRS) France
Tomàs MARGALEF (Universitat Autònoma de Barcelona) Spain
Naoya MARUYAMA (RIKEN) Japan
Niko MATSAKIS (MIT) USA
Satoshi MATSUOKA (TITECH) Japan
Jean-Francois MEHAUT (Ensimag) France
Rami MELHEM (University of Pittsburgh) USA
Avi MENDELSON (Microsoft) Israel
Duane MERRILL (NVIDIA) USA
Henning MEYERHENKE (Karlsruhe Institute of Technology - KIT) Germany
Samuel MIDKIFF (Purdue University) USA
Jose MOREIRA (IBM T.J. Watson Research Center) USA
J. Eliot B. MOSS (University of Massachusetts) USA
Abdullah MUZAHID (University of Texas at San Antonio) USA
Esmond NG (Lawrence Berkeley National Laboratory) USA
Alex NICOLAU (University of California Irvine) USA
Dimitris NIKOLOPOULOS (QUB, Belfast) UK
Yun PAEK (Seoul National University) Korea
Dhabaleswar K. PANDA (Ohio State University) USA
Santosh PANDE (Georgia Tech) USA
Victor PANKRATIUS (MIT) USA
Yale PATT (Univ. of Texas) USA
Jih-Kwon PEIR (CISE – University of Florida) USA
Miquel PERICÀS (Tokyo Institute of Technology) Japan
Salvador PETIT (DISCA-UPV) Spain
Laurent PHILIPPE (University of Franche-Comté) France
Michael PHILIPPSEN (University of Erlangen-Nuremberg) Germany
Cynthia A. PHILLIPS (Sandia National Labs) USA
Ali PINAR (Sandia National Laboratories) USA
Don PORTER (Stony Brook University) USA
Sushil K. PRASAD (Georgia State University) USA
Susanne Cech PREVITALI (ETH Zurich) Switzerland
Kirk PRUHS (University of Pittsburgh) USA
Markus PÜSCHEL (ETH Zurich) Switzerland
Martin QUINSON (University of Nancy) France
Padma RAGHAVAN (The Pennsylvania State University) USA
Sanjay RAJOPADHYE (Colorado State University) USA
Smruti RANJAN SARANGI (IIT Delhi) India
Thomas RAUBER (University of Bayreuth) Germany
Lawrence RAUCHWERGER (Texas A&M University) USA
Alistair RENDELL (Australian National University) Australia
Jason RIEDY (Georgia Institute of Technology) USA
Rolf RIESEN (IBM, Dublin) Ireland
Étienne RIVIÈRE (University of Neuchâtel) Switzerland
Chris ROSSBACH (MSR) USA
Larry RUDOLPH (CSAIL-MIT) USA
Gudula RÜNGER (Technische Universität Chemnitz) Germany
Krzysztof RZADCA (University of Warsaw) Poland
Yogish SABHARWAL (IBM Research) India
P. SADAYAPPAN (Ohio State University) USA
Rizos SAKELLARIOU (U. of Manchester) UK
Beverly SANDERS (University of Florida) USA
Mitsuhisa SATO (University of Tsukuba) Japan
Erik SAULE (Ohio State University) USA
André SCHIPER (EPFL) Switzerland
Gunar SCHIRNER (Northeastern University) USA
Stefan SCHMID (Deutsche Telekom Laboratories and TU Berlin) Germany
Martin SCHULZ (LLNL) USA
Uwe SCHWIEGELSHOHN (TU Dortmund) Germany
Resit SENDAG (University of Rhone Island) USA
Pierre SENS (University Paris 6) France
Xipeng SHEN (College of William & Mary) USA
Weidong SHI (University of Houston) USA
Mark SILBERSTEIN (UT Austin) USA
Francesco SILVESTRI (University of Padova) Italy
Yogesh SIMMHAN (University of Southern California) USA
Oliver SINNEN (University of Auckland) New Zealand
Quinn SNELL (Brigham Young University) USA
Veronika SONIGO (IUT Besançon-Vesoul) France
Leonel SOUSA (INESC-ID/IST, Technical University of Lisbon) Portugal
Evan SPEIGHT (IBM Research) USA
Thomas STERLING (Indiana University) USA
Mark STILLWELL (Cranfield University) UK
Jeff STUECHELI (IBM Research) USA
Jaspal SUBHLOK (University of Houston) USA
Frédéric SUTER (CNRS, IN2P3 Computing Center) France
Douglas THAIN (University of Notre Dame) USA
Samuel THIBAULT (University of Bordeaux) France
Sivan TOLEDO (Tel Aviv University) Israel
Pedro TRANCOSO (University of Cyprus) Cyprus
Denis TRYSTRAM (ENSIMAG) France
Dan TSAFRIR (Technion) Israel
Philippas TSIGAS (Chalmers University) Sweden
Rafael UBAL (Northeastern University) USA
Bora UÇAR (ENS Lyon) France
Alex VEIDENBAUM (University of California Irvine) USA
Guru VENKARTARAMANI (George Washington University) USA
Jeff VETTER (Oak Ridge National Laboratory and Georgia Tech) USA
Carlos VILLAVIEJA (University of Texas) USA
C.L. WANG (HKU) Hong Kong
Charles C. (Chip) WEEMS (University of Massachusetts at Amherst) USA
Jon WEISSMAN (University of Minnesota, Twin Cities) USA
Bernard WONG (University of Waterloo) Canada
David WONNACOTT (Haverford College) USA
Carole-Jean WU (Arizona State University) USA
Peng WU (IBM TJ watson Research Center) USA
Quing YI (University of Texas at San Antonio) USA
Rio YOKOTA (King Abdullah University) Saudi Arabia
Hu YU (ICT - Chinese Academy of Sciences) China
Eitan ZAHAVI (Mellanox) Israel
Antonia ZHAI (University of Minnesota) USA
(*Requests for corrections or changes should be sent to contact@ipdps.org.)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Tuesday, September 18, 2012
[DMANET] CFP, Special Issue MPB (ISCO 2012)
(Apologies in advance for multiple postings)
CALL FOR PAPERS
MATHEMATICAL PROGRAMMING B
Special Issue on Combinatorial Optimization
We invite submissions of novel research articles for a forthcoming issue
of Mathematical Programming B on Combinatorial Optimization.
This special issue is associated with the International Symposium on
Combinatorial Optimization (ISCO 2012) that was held in Athens, Greece, April 19-21, 2012.
However it is also open to papers which have not been presented at the conference.
High quality research papers are solicited to address theoretical as
well as practical issues of Combinatorial Optimization.
Topics of interest include, but are notlimited to:
Approximation algorithms
Cutting planes algorithms
Polyhedral combinatorics
Branch-and-cut-and-price algorithms
Graph and network algorithms
Linear and nonlinear (mixed-) integer programming
Randomized algorithms
Scheduling algorithms
The deadline for submission of full papers is September 30, 2012.
We aim at completing a first review of all papers by January 31, 2012.
For their submissions, the authors should follow the following steps
in the Editorial Manager at http://mapr.edmgr.com/.
Register in Editorial Manager
Click on 'Submit A Manuscript' button at the top of the site
Click on 'Submit New Manuscript' in Author Main Menu
Select Full Length Paper Series B as article type and follow the next steps
Type in the name of the special issue at the Additional Information step
and follow the next steps.
The name of the special issue is Combinatorial Optimization.
Approve your manuscript.
Papers will be refereed to the standard of Mathematical Programming,
Series A. Due to limits in page volume, we are requesting that all papers
be submitted using MP style files, and conform to the 25 page maximum.
The necessary LaTeX files can be downloaded at
www.eng.cam.ac.uk/~dr241/MPB/MPB-Springer-latex-style-files.zip."
The special issue will be limited to around 9 papers. We therefore may
be obliged to either return some papers to authors without review or,
later, with authors' consent, transfer some papers to MPA.
Additional information about the special issue can be obtained from the
guest editors.
Guest Editors:
A. Ridha Mahjoub, mahjoub@lamsade.dauphine.fr
Giovanni Rinaldi rinaldi@iasi.cnr.it
Gerhard J. Woeginger gwoegi@win.tue.nl
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CALL FOR PAPERS
MATHEMATICAL PROGRAMMING B
Special Issue on Combinatorial Optimization
We invite submissions of novel research articles for a forthcoming issue
of Mathematical Programming B on Combinatorial Optimization.
This special issue is associated with the International Symposium on
Combinatorial Optimization (ISCO 2012) that was held in Athens, Greece, April 19-21, 2012.
However it is also open to papers which have not been presented at the conference.
High quality research papers are solicited to address theoretical as
well as practical issues of Combinatorial Optimization.
Topics of interest include, but are notlimited to:
Approximation algorithms
Cutting planes algorithms
Polyhedral combinatorics
Branch-and-cut-and-price algorithms
Graph and network algorithms
Linear and nonlinear (mixed-) integer programming
Randomized algorithms
Scheduling algorithms
The deadline for submission of full papers is September 30, 2012.
We aim at completing a first review of all papers by January 31, 2012.
For their submissions, the authors should follow the following steps
in the Editorial Manager at http://mapr.edmgr.com/.
Register in Editorial Manager
Click on 'Submit A Manuscript' button at the top of the site
Click on 'Submit New Manuscript' in Author Main Menu
Select Full Length Paper Series B as article type and follow the next steps
Type in the name of the special issue at the Additional Information step
and follow the next steps.
The name of the special issue is Combinatorial Optimization.
Approve your manuscript.
Papers will be refereed to the standard of Mathematical Programming,
Series A. Due to limits in page volume, we are requesting that all papers
be submitted using MP style files, and conform to the 25 page maximum.
The necessary LaTeX files can be downloaded at
www.eng.cam.ac.uk/~dr241/MPB/MPB-Springer-latex-style-files.zip."
The special issue will be limited to around 9 papers. We therefore may
be obliged to either return some papers to authors without review or,
later, with authors' consent, transfer some papers to MPA.
Additional information about the special issue can be obtained from the
guest editors.
Guest Editors:
A. Ridha Mahjoub, mahjoub@lamsade.dauphine.fr
Giovanni Rinaldi rinaldi@iasi.cnr.it
Gerhard J. Woeginger gwoegi@win.tue.nl
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Monday, September 17, 2012
[DMANET] Two RA positions
Royal Holloway, University of London
Department of Computer Science
Research Assistant - Two Posts
Salary is in the range £32,256 to £38,072 per annum inclusive of London
Allowance
Many business processes (or workflows) can be modelled as a set of
computational tasks or steps. There will usually be some flexibility in the
order in which those steps may be completed, and restrictions on the users
who can perform each step. Whilst it is comparatively easy to ensure that
such policies are enforced, we may wish to impose more complex rules on the
business process. We might require, for example, that the same user does not
perform a particularly sensitive combination of steps. The Workflow
Satisfiability Problem (WSP) asks whether it is possible to allocate users
to
steps in such a way that all constraints are satisfied. For almost all types
of constraints of interest, WSP is NP-hard. Given that it is important to
know whether a workflow can be scheduled we require algorithms for the WSP
that run in a reasonable amount of time. The project will focus on designing
and implementing efficient algorithms for the WSP, focusing on techniques
from fixed-parameter algorithmics.
The successful candidates will work with Gregory Gutin, David Cohen and
Jason
Crampton developing,analysing and implementing such algorithms. Applicants
must have a background in a relevant mathematical discipline and have a
track
record of publishing original research at high quality venues. They must
have
good working knowledge of design and analysis of algorithms. They should
have
interest in information security. They should be happy to work independently
and as part of a team and be willing to attend international conferences,
meetings and workshops.
The first Research Assistant must have good working knowledge of
parameterized algorithmics. Basic knowledge of constraint satisfaction and
exponential algorithms is desirable.
The second Research Assistant must have significant experience in algorithms
engineering, and have interest in working on problems motivated by the
information security industry. Basic knowledge of constraint satisfaction
and
parameterized algorithms is desirable.
These are full time posts available from the 1st February 2013 or as soon as
possible thereafter for a fixed term period of three years. These posts are
based in Egham, Surrey in the United Kingdom.
For further details of these posts, please view and apply online at
https://rhul.engageats.co.uk.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Department of Computer Science
Research Assistant - Two Posts
Salary is in the range £32,256 to £38,072 per annum inclusive of London
Allowance
Many business processes (or workflows) can be modelled as a set of
computational tasks or steps. There will usually be some flexibility in the
order in which those steps may be completed, and restrictions on the users
who can perform each step. Whilst it is comparatively easy to ensure that
such policies are enforced, we may wish to impose more complex rules on the
business process. We might require, for example, that the same user does not
perform a particularly sensitive combination of steps. The Workflow
Satisfiability Problem (WSP) asks whether it is possible to allocate users
to
steps in such a way that all constraints are satisfied. For almost all types
of constraints of interest, WSP is NP-hard. Given that it is important to
know whether a workflow can be scheduled we require algorithms for the WSP
that run in a reasonable amount of time. The project will focus on designing
and implementing efficient algorithms for the WSP, focusing on techniques
from fixed-parameter algorithmics.
The successful candidates will work with Gregory Gutin, David Cohen and
Jason
Crampton developing,analysing and implementing such algorithms. Applicants
must have a background in a relevant mathematical discipline and have a
track
record of publishing original research at high quality venues. They must
have
good working knowledge of design and analysis of algorithms. They should
have
interest in information security. They should be happy to work independently
and as part of a team and be willing to attend international conferences,
meetings and workshops.
The first Research Assistant must have good working knowledge of
parameterized algorithmics. Basic knowledge of constraint satisfaction and
exponential algorithms is desirable.
The second Research Assistant must have significant experience in algorithms
engineering, and have interest in working on problems motivated by the
information security industry. Basic knowledge of constraint satisfaction
and
parameterized algorithms is desirable.
These are full time posts available from the 1st February 2013 or as soon as
possible thereafter for a fixed term period of three years. These posts are
based in Egham, Surrey in the United Kingdom.
For further details of these posts, please view and apply online at
https://rhul.engageats.co.uk.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CFP: Special Issue of TCS on "Combinatorial Optimization: Theory of algorithms and complexity"
[Apologies in advance for multiple postings]
CALL FOR PAPERS
THEORETICAL COMPUTER SCIENCE
Special Issue on "Combinatorial Optimization: Theory of algorithms and
complexity"
We invite submissions of research articles for a special issue in the
journal "Theoretical Computer Science" (TCS) on "Combinatorial
Optimization: Theory of algorithms and complexity".
This special issue is associated with the 2nd International Symposium on
Combinatorial Optimization (ISCO 2012) that took place in Athens,
Greece, April 19-21, 2012. However, the invitation for submissions is
not restricted to the papers presented at the conference. It is open to
all relevant articles in combinatorial optimization with emphasis on
aspects regarding theory of algorithms and complexity.
With this special issue, we wish to present current research on
algorithmic and complexity issues of combinatorial optimization. This
has been an overly active field in the last decades and the purpose of
the special issue would be to identify new techniques and problem
domains, expose new results and indicate directions for further
research. High quality research papers are solicited to address both
theoretical issues as well as questions arising in application domains.
Potential topics include (but are not limited to) the following:
algorithms and data structures,
approximation and on-line algorithms,
randomness in computing,
computational complexity,
exact and parameterized algorithms,
computational geometry,
algorithmic game theory,
graph theory and combinatorics,
parallel and distributed algorithms,
computational algebra and coding theory,
combinatorial aspects in computational biology.
The deadline for submissions is September 28, 2012.
To ensure that all manuscripts are correctly identified for inclusion
into the Special Issue, it is important that during the online
submission at the TCS website, the authors select "TCS-A Comb Opt
(Paschos/Milis/Mark)".
Papers will be refereed according to the standards of TCS and we will do
our best to have the refereeing procedure timely finished. The tentative
schedule for this procedure is:
Notification of acceptance: January 15, 2013
Submission of revisions: February 28, 2013
Final Decision: April 17, 2013.
Additional information about the special issue can be obtained from the
guest editors.
Guest Editors:
Vangelis Markakis,markakis@gmail.com
Department of Informatics,
Athens University of Economics and Business
Ioannis Milis,milis@aueb.gr
Department of Informatics,
Athens University of Economics and Business
Vangelis Th. Paschos,vangelis.Paschos@dauphine.fr
LAMSADE, CNRS and Université Paris-Dauphine
Institut Universitaire de France
----------------------------------------------------------------------------------------
This call is available
at:http://www.journals.elsevier.com/theoretical-computer-science/call-for-papers/special-issue-on-combinatorial-optimization/
----------------------------------------------------------------------------------------
________________________________________________________
Ioannis Milis, Professor,
Department of Informatics,
Athens University of Economics and Business,
76, Patission str., 104 34 Athens, Greece.
Phone: + 30 210 8203537, Fax: + 30 210 8226105
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CALL FOR PAPERS
THEORETICAL COMPUTER SCIENCE
Special Issue on "Combinatorial Optimization: Theory of algorithms and
complexity"
We invite submissions of research articles for a special issue in the
journal "Theoretical Computer Science" (TCS) on "Combinatorial
Optimization: Theory of algorithms and complexity".
This special issue is associated with the 2nd International Symposium on
Combinatorial Optimization (ISCO 2012) that took place in Athens,
Greece, April 19-21, 2012. However, the invitation for submissions is
not restricted to the papers presented at the conference. It is open to
all relevant articles in combinatorial optimization with emphasis on
aspects regarding theory of algorithms and complexity.
With this special issue, we wish to present current research on
algorithmic and complexity issues of combinatorial optimization. This
has been an overly active field in the last decades and the purpose of
the special issue would be to identify new techniques and problem
domains, expose new results and indicate directions for further
research. High quality research papers are solicited to address both
theoretical issues as well as questions arising in application domains.
Potential topics include (but are not limited to) the following:
algorithms and data structures,
approximation and on-line algorithms,
randomness in computing,
computational complexity,
exact and parameterized algorithms,
computational geometry,
algorithmic game theory,
graph theory and combinatorics,
parallel and distributed algorithms,
computational algebra and coding theory,
combinatorial aspects in computational biology.
The deadline for submissions is September 28, 2012.
To ensure that all manuscripts are correctly identified for inclusion
into the Special Issue, it is important that during the online
submission at the TCS website, the authors select "TCS-A Comb Opt
(Paschos/Milis/Mark)".
Papers will be refereed according to the standards of TCS and we will do
our best to have the refereeing procedure timely finished. The tentative
schedule for this procedure is:
Notification of acceptance: January 15, 2013
Submission of revisions: February 28, 2013
Final Decision: April 17, 2013.
Additional information about the special issue can be obtained from the
guest editors.
Guest Editors:
Vangelis Markakis,markakis@gmail.com
Department of Informatics,
Athens University of Economics and Business
Ioannis Milis,milis@aueb.gr
Department of Informatics,
Athens University of Economics and Business
Vangelis Th. Paschos,vangelis.Paschos@dauphine.fr
LAMSADE, CNRS and Université Paris-Dauphine
Institut Universitaire de France
----------------------------------------------------------------------------------------
This call is available
at:http://www.journals.elsevier.com/theoretical-computer-science/call-for-papers/special-issue-on-combinatorial-optimization/
----------------------------------------------------------------------------------------
________________________________________________________
Ioannis Milis, Professor,
Department of Informatics,
Athens University of Economics and Business,
76, Patission str., 104 34 Athens, Greece.
Phone: + 30 210 8203537, Fax: + 30 210 8226105
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PODC 2013 - first Call for Papers
apologies for multiple copies
======================================================
PODC 2013 First Call for Papers
======================================================
The 32nd ACM SIGACT-SIGOPS
Symposium on Principles of Distributed Computing (PODC 2013)
July 22-24, 2013
Montreal, Quebec, Canada
http://www.podc.org
This year PODC will be co-located with the
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
======================================================
Deadlines:
Submission: February 10, 2013
Notification: April 20, 2013
Camera-ready: May 13, 2013
All times refer to 23:59 in Honolulu, Hawai (time zone HAST).
======================================================
Original contributions to the theory, design, analysis, implementation, or
application of distributed systems and networks are solicited. Topics of
interest include, but are not limited to:
- distributed algorithms and their complexity
- concurrent programming, synchronization, shared and transactional memory
- multiprocessor and multi-core architectures and algorithms
- fault tolerance, reliability, availability
- self-stabilizing, self-organizing, and autonomic systems
- communication networks: protocols, architectures, services, applications
- sensor, mobile, ad-hoc, peer-to-peer networks
- cryptographic and security protocols and system security
- semantics, models, verification, debugging, and tool support
- Internet applications, social networks, recommendation systems
- distributed operating systems, databases and programming languages
- game-theoretic approaches to distributed computing
- cluster, cloud and grid computing
Conference presentations will have two formats:
Regular presentations of 25 minutes accompanied by papers of up to 10
pages in the proceedings. This form is intended for contributions reporting
on original research, submitted exclusively to this conference. Brief
announcements of 5 to 10 minutes accompanied by two page abstracts in
the proceedings. This format is a forum for brief communications, which
may be published in other conferences.
Submission:
Papers are to be submitted electronically, following the guidelines
available on the conference web page. Authors unable to submit
electronically should contact the program chair to receive instructions.
Every submission should be in English, in .ps or .pdf format, and begin
with a cover page including: (1) the title, (2) the names of all authors and
their affiliations, (3) contact author's email address and telephone number,
(4) a brief, one paragraph abstract of the paper, (5) information whether
the paper is a regular submission, or a brief announcement submission,
(6) information whether the submission should be considered for the best
student paper award.
A regular submission should be no longer than 4500 words and must not
exceed 10 pages using at least 11 point font and reasonable margins
(excluding cover page and references). Additional necessary details may
be included in a clearly marked appendix that will be read at the discretion
of the program committee. A brief announcement submission must not
exceed 3 pages using at least 11 point font and reasonable margins.
Submissions deviating from these guidelines will be rejected without
consideration of their merits.
It is recommended that a regular submission begins with a succinct
statement of the problem or the issue being addressed, a summary of the
main results or conclusions, a brief explanation of their significance, a
brief statement of the key ideas, and a comparison with related work, all
tailored to a non-specialist. Technical development of the work, directed
to the specialist, should follow. Papers outside of the conference scope
will be rejected without review.
If requested by the authors on the cover page, a regular submission that is
not selected for a regular presentation can also be considered for the brief
announcement format. Such a request will not affect consideration of the
paper for a regular presentation.
Publication:
Regular papers and brief announcements will be included in the
conference proceedings. Extended and revised versions of selected papers
will be considered for a special issue of the Distributed Computing journal.
Two papers will be considered for publication in JACM.
Best paper and best student paper awards:
Prizes will be given to the best paper, the best student paper and the best
presentation. A paper is eligible for the best student paper award if at
least one of its authors is a full-time student at the time of submission.
This must be indicated in the cover page. The program committee may
decline to offer the awards or may split each one of them.
======================================================
Program Committee:
James Anderson (UNC at Chapel Hill, USA)
James Aspnes (Yale, USA)
Roberto Baldoni (Sapienza Univ., Italy)
Carole Delporte-Gallet (Univ. Paris Diderot, France)
Keren Censor-Hillel (MIT, USA)
Shlomi Dolev (Ben Gurion Univ., Israel)
Panagiota Fatourou (Univ. of Crete, Greece)
Antonio Fernandez Anta (Inst. IMDEA Networks, Spain)
Cyril Gavoille (Univ. of Bordeaux, France)
Chryssis Georgiou (Univ. of Cyprus, Cyprus)
Phil Gibbons (Intel Research Pittsburgh, USA)
Seth Gilbert (National Univ. of Singapore, Singapore)
Tim Harris (Oracle Labs in Cambridge, UK)
Danny Hendler (Ben Gurion Univ., Israel)
Prasad Jayanti (Dartmouth College, USA)
Flavio Junqueira (Yahoo Research, Spain)
Amos Korman (CNRS & Univ. Paris Diderot, France)
Dariusz Kowalski (Univ. of Liverpool, UK)
Fabian Kuhn (Univ. of Freiburg, Germany)
Sergio Rajsbaum (UNAM, Mexico)
Michel Raynal (IUF & IRISA (Univ. Rennes), France)
Luis Rodrigues (INESC-ID, IST, Portugal)
Eric Ruppert (York Univ., Canada)
Gadi Taubenfeld, Chair (IDC Herzliya, Israel)
Sebastien Tixeuil (Univ. of Paris 6, France)
Mark Tuttle (Intel, USA)
Philipp Woelfel (Univ. of Calgary, Canada)
Haifeng Yu (National Univ. of Singapore, Singapore)
======================================================
Conference Committee:
Panagiota Fatourou, general (Univ. of Crete, Greece)
Magnus Halldorsson, treasurer (Reykjavik Univ., Iceland)
Christoph Lenzen, publicity (Weizmann Institute, Israel)
Lata Narayanan, organizing (Concordia Univ., Canada)
Jarda Opatrny, organizing (Concordia Univ., Canada)
Gadi Taubenfeld, program committee (IDC, Israel)
Mark Tuttle, publicity (Intel, USA)
======================================================
Steering Committee:
Panagiota Fatourou (Univ. of Crete, Greece)
Pierre Fraigniaud (CNRS & Univ. Paris Diderot, France)
Magnus Halldorsson (Reykjavik Univ., Iceland)
Alessandro Panconesi (Sapienza Univ., Italy)
Alexander Shvartsman ((Chair) Univ. of Connecticut, USA)
Gadi Taubenfeld (IDC, Israel)
Nitin Vaidya (Univ. of Illinois, USA)
======================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
======================================================
PODC 2013 First Call for Papers
======================================================
The 32nd ACM SIGACT-SIGOPS
Symposium on Principles of Distributed Computing (PODC 2013)
July 22-24, 2013
Montreal, Quebec, Canada
http://www.podc.org
This year PODC will be co-located with the
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
======================================================
Deadlines:
Submission: February 10, 2013
Notification: April 20, 2013
Camera-ready: May 13, 2013
All times refer to 23:59 in Honolulu, Hawai (time zone HAST).
======================================================
Original contributions to the theory, design, analysis, implementation, or
application of distributed systems and networks are solicited. Topics of
interest include, but are not limited to:
- distributed algorithms and their complexity
- concurrent programming, synchronization, shared and transactional memory
- multiprocessor and multi-core architectures and algorithms
- fault tolerance, reliability, availability
- self-stabilizing, self-organizing, and autonomic systems
- communication networks: protocols, architectures, services, applications
- sensor, mobile, ad-hoc, peer-to-peer networks
- cryptographic and security protocols and system security
- semantics, models, verification, debugging, and tool support
- Internet applications, social networks, recommendation systems
- distributed operating systems, databases and programming languages
- game-theoretic approaches to distributed computing
- cluster, cloud and grid computing
Conference presentations will have two formats:
Regular presentations of 25 minutes accompanied by papers of up to 10
pages in the proceedings. This form is intended for contributions reporting
on original research, submitted exclusively to this conference. Brief
announcements of 5 to 10 minutes accompanied by two page abstracts in
the proceedings. This format is a forum for brief communications, which
may be published in other conferences.
Submission:
Papers are to be submitted electronically, following the guidelines
available on the conference web page. Authors unable to submit
electronically should contact the program chair to receive instructions.
Every submission should be in English, in .ps or .pdf format, and begin
with a cover page including: (1) the title, (2) the names of all authors and
their affiliations, (3) contact author's email address and telephone number,
(4) a brief, one paragraph abstract of the paper, (5) information whether
the paper is a regular submission, or a brief announcement submission,
(6) information whether the submission should be considered for the best
student paper award.
A regular submission should be no longer than 4500 words and must not
exceed 10 pages using at least 11 point font and reasonable margins
(excluding cover page and references). Additional necessary details may
be included in a clearly marked appendix that will be read at the discretion
of the program committee. A brief announcement submission must not
exceed 3 pages using at least 11 point font and reasonable margins.
Submissions deviating from these guidelines will be rejected without
consideration of their merits.
It is recommended that a regular submission begins with a succinct
statement of the problem or the issue being addressed, a summary of the
main results or conclusions, a brief explanation of their significance, a
brief statement of the key ideas, and a comparison with related work, all
tailored to a non-specialist. Technical development of the work, directed
to the specialist, should follow. Papers outside of the conference scope
will be rejected without review.
If requested by the authors on the cover page, a regular submission that is
not selected for a regular presentation can also be considered for the brief
announcement format. Such a request will not affect consideration of the
paper for a regular presentation.
Publication:
Regular papers and brief announcements will be included in the
conference proceedings. Extended and revised versions of selected papers
will be considered for a special issue of the Distributed Computing journal.
Two papers will be considered for publication in JACM.
Best paper and best student paper awards:
Prizes will be given to the best paper, the best student paper and the best
presentation. A paper is eligible for the best student paper award if at
least one of its authors is a full-time student at the time of submission.
This must be indicated in the cover page. The program committee may
decline to offer the awards or may split each one of them.
======================================================
Program Committee:
James Anderson (UNC at Chapel Hill, USA)
James Aspnes (Yale, USA)
Roberto Baldoni (Sapienza Univ., Italy)
Carole Delporte-Gallet (Univ. Paris Diderot, France)
Keren Censor-Hillel (MIT, USA)
Shlomi Dolev (Ben Gurion Univ., Israel)
Panagiota Fatourou (Univ. of Crete, Greece)
Antonio Fernandez Anta (Inst. IMDEA Networks, Spain)
Cyril Gavoille (Univ. of Bordeaux, France)
Chryssis Georgiou (Univ. of Cyprus, Cyprus)
Phil Gibbons (Intel Research Pittsburgh, USA)
Seth Gilbert (National Univ. of Singapore, Singapore)
Tim Harris (Oracle Labs in Cambridge, UK)
Danny Hendler (Ben Gurion Univ., Israel)
Prasad Jayanti (Dartmouth College, USA)
Flavio Junqueira (Yahoo Research, Spain)
Amos Korman (CNRS & Univ. Paris Diderot, France)
Dariusz Kowalski (Univ. of Liverpool, UK)
Fabian Kuhn (Univ. of Freiburg, Germany)
Sergio Rajsbaum (UNAM, Mexico)
Michel Raynal (IUF & IRISA (Univ. Rennes), France)
Luis Rodrigues (INESC-ID, IST, Portugal)
Eric Ruppert (York Univ., Canada)
Gadi Taubenfeld, Chair (IDC Herzliya, Israel)
Sebastien Tixeuil (Univ. of Paris 6, France)
Mark Tuttle (Intel, USA)
Philipp Woelfel (Univ. of Calgary, Canada)
Haifeng Yu (National Univ. of Singapore, Singapore)
======================================================
Conference Committee:
Panagiota Fatourou, general (Univ. of Crete, Greece)
Magnus Halldorsson, treasurer (Reykjavik Univ., Iceland)
Christoph Lenzen, publicity (Weizmann Institute, Israel)
Lata Narayanan, organizing (Concordia Univ., Canada)
Jarda Opatrny, organizing (Concordia Univ., Canada)
Gadi Taubenfeld, program committee (IDC, Israel)
Mark Tuttle, publicity (Intel, USA)
======================================================
Steering Committee:
Panagiota Fatourou (Univ. of Crete, Greece)
Pierre Fraigniaud (CNRS & Univ. Paris Diderot, France)
Magnus Halldorsson (Reykjavik Univ., Iceland)
Alessandro Panconesi (Sapienza Univ., Italy)
Alexander Shvartsman ((Chair) Univ. of Connecticut, USA)
Gadi Taubenfeld (IDC, Israel)
Nitin Vaidya (Univ. of Illinois, USA)
======================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Sunday, September 16, 2012
[DMANET] CFP: IEEE TPDS SI on Trust, Security and Privacy - submission deadline extended to Oct. 1st, 2012
Call for Papers for
IEEE Transactions on Parallel and Distributed Systems Special Issue on
"Trust, Security and Privacy in Parallel and Distributed Systems"
NEW submission deadline: Oct. 1st, 2012
In modern computing paradigms, most computing systems, e.g. cluster
computing, grid computing, cloud computing, the Internet, telecommunication
networks, Cyber-Physical Systems (CPS), and Machine-to-Machine
communication networks (M2M), are parallel and distributed systems. While
providing improved expandability, manageability, efficiency and
reliability, parallel and distributed systems increase their security
weaknesses to an unprecedented scale. As the system devices are widely
connected, their vulnerabilities are shared by the entire system. Because
tasks are allocated to, and information is exchanged among the system
devices that may belong to different users, trust, security and privacy
issues have yet to be resolved. The purpose of the proposed Special Issue
of IEEE Transactions on Parallel and Distributed Systems is to publish
recent advances in trust, security and privacy for emerging parallel and
distributed systems, with emphasis on the following aspects, but certainly
not limited to:
(1) Trust: policy semantics, metrics and models; trusted computing
platform; trusted network computing; trusted operating systems; trusted
software and applications; trust in cloud computing/CPS/M2M/social
networks; trust in e-commerce and e-government; trust in mobile and
wireless communications; risk and reputation management; survivable
computer systems/networks; and trust management.
(2) Security related issues: computer security; network security; database
security; Web applications security; security policy, model and
architecture; authentication, authorization and accounting; security in
cloud computing/CPS/M2M/social networks; security in mobile and wireless
communications; security in parallel and distributed systems; and
miscellaneous security issues.
(3) Privacy related issues: privacy in Web-based applications and services;
privacy in database systems; privacy in e-commerce and e-government;
privacy in network deployment and management; privacy in cloud computing/
CPS/M2M/social networks; privacy in mobile and wireless communications;
privacy in parallel and distributed systems; and miscellaneous privacy
issues.
Submission Guidelines
Submitted articles must not have been previously published or currently
under review elsewhere. As an author, you are responsible for understanding
and adhering to our submission guidelines. You can access them by clicking
on the following web link:
http://www.computer.org/portal/web/peerreviewjournals/author .
Please thoroughly read these before submitting your manuscript. Please
submit your paper to Manuscript Central at
https://mc.manuscriptcentral.com/tpds-cs .
Deadlines
Manuscript Submission Deadline: October 1, 2012
Notification of Initial Decision: November 18, 2012
Minor Revisions due (if needed): December 15, 2012
Notification of Final Decision: January 26, 2013
Final Manuscripts Due: February 03, 2013
Publication Date: September 2013
Guest Editors
Xu Li, Inria Lille - Nord Europe, France (xu.li@inria.fr)
Patrick McDaniel, Pennsylvania State University, USA (mcdaniel@cse.psu.edu)
Radha Poovendran, University of Washington, USA (RP3@UW.edu)
Guojun Wang, Central South University, China (csgjwang@gmail.com)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
IEEE Transactions on Parallel and Distributed Systems Special Issue on
"Trust, Security and Privacy in Parallel and Distributed Systems"
NEW submission deadline: Oct. 1st, 2012
In modern computing paradigms, most computing systems, e.g. cluster
computing, grid computing, cloud computing, the Internet, telecommunication
networks, Cyber-Physical Systems (CPS), and Machine-to-Machine
communication networks (M2M), are parallel and distributed systems. While
providing improved expandability, manageability, efficiency and
reliability, parallel and distributed systems increase their security
weaknesses to an unprecedented scale. As the system devices are widely
connected, their vulnerabilities are shared by the entire system. Because
tasks are allocated to, and information is exchanged among the system
devices that may belong to different users, trust, security and privacy
issues have yet to be resolved. The purpose of the proposed Special Issue
of IEEE Transactions on Parallel and Distributed Systems is to publish
recent advances in trust, security and privacy for emerging parallel and
distributed systems, with emphasis on the following aspects, but certainly
not limited to:
(1) Trust: policy semantics, metrics and models; trusted computing
platform; trusted network computing; trusted operating systems; trusted
software and applications; trust in cloud computing/CPS/M2M/social
networks; trust in e-commerce and e-government; trust in mobile and
wireless communications; risk and reputation management; survivable
computer systems/networks; and trust management.
(2) Security related issues: computer security; network security; database
security; Web applications security; security policy, model and
architecture; authentication, authorization and accounting; security in
cloud computing/CPS/M2M/social networks; security in mobile and wireless
communications; security in parallel and distributed systems; and
miscellaneous security issues.
(3) Privacy related issues: privacy in Web-based applications and services;
privacy in database systems; privacy in e-commerce and e-government;
privacy in network deployment and management; privacy in cloud computing/
CPS/M2M/social networks; privacy in mobile and wireless communications;
privacy in parallel and distributed systems; and miscellaneous privacy
issues.
Submission Guidelines
Submitted articles must not have been previously published or currently
under review elsewhere. As an author, you are responsible for understanding
and adhering to our submission guidelines. You can access them by clicking
on the following web link:
http://www.computer.org/portal/web/peerreviewjournals/author .
Please thoroughly read these before submitting your manuscript. Please
submit your paper to Manuscript Central at
https://mc.manuscriptcentral.com/tpds-cs .
Deadlines
Manuscript Submission Deadline: October 1, 2012
Notification of Initial Decision: November 18, 2012
Minor Revisions due (if needed): December 15, 2012
Notification of Final Decision: January 26, 2013
Final Manuscripts Due: February 03, 2013
Publication Date: September 2013
Guest Editors
Xu Li, Inria Lille - Nord Europe, France (xu.li@inria.fr)
Patrick McDaniel, Pennsylvania State University, USA (mcdaniel@cse.psu.edu)
Radha Poovendran, University of Washington, USA (RP3@UW.edu)
Guojun Wang, Central South University, China (csgjwang@gmail.com)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] VTM 2012 - First International Workshop on Vehicular Traffic Management for Smart Cities [Deadline Extended]
[Due to several requests we received from potential authors, the VTM 2012
Technical and Organizing Committees decided to extend the paper
submission deadline to September 22, 2012 (FIRM)]
Technical and Organizing Committees decided to extend the paper
submission deadline to September 22, 2012 (FIRM)]
[Apologies if you receive multiple copies]
------------------------------------------------------------------------
CALL FOR PAPERS
VTM 2012
First International Workshop on
Vehicular Traffic Management for Smart Cities
November 20, 2012, Dublin, Ireland
http://www.wireless-days.org/vtm.html
IEEE and IFIP Technical Co-sponsorship
Workshop proceedings will be included in IEEE Xplore
------------------------------------------------------------------------
Important Dates:
================
Extended submission deadline: September 22, 2012 (Final extension)
Notification of acceptance: October 10, 2012
Camera-ready version: October 20, 2012
VTM 2012 is part of Dublin Wireless Week (November 19-23) and is co-located with the 2012 Wireless Days conference
------------------------------------------------------------------------
Scope:
======
The rapid growth of the number of cars on the roads has created a plethora of challenges for road traffic management authorities such as, traffic congestion, increasing number of accidents, air pollution, etc. Over the last years, researchers from both industry and academia were focusing their efforts on exploiting the advances in sensing and communication technologies to make the existing road traffic management systems more efficient. Their main goal is to improve the traveler's safety, shorten the travel time and reduce the environmental impact.
Road traffic management for smart cities involves monitoring the actual traffic situation in real-time (including volumes, speeds, incidents, etc.) and then controlling or influencing the flow using that information in order to reduce traffic congestion, deal efficiently with incidents and provide accurate and reliable traffic information and prediction to both drivers and authorities.
This workshop aims at bringing together researchers, scientists and engineers from various research communities, as well as practitioners and administrators who face the challenges of traffic management in smart cities. They are all welcome to present their latest research findings, ideas, simulation tools and applications at the 2012 VTM workshop.
Topics of interest include, but are not limited to:
• Vehicular traffic management
• V2V and V2I protocols for smart cities
• Data collection techniques in urban environment
• Data acquisition for traffic management (techniques, algorithms, data types, etc.)
• Data integration in traffic management systems (semantics, interoperability, linked data, etc.)
• Traffic data maintenance (privacy, provenance, security, etc.)
• Distributed simulations for large scale urban environments
• Vehicular routing protocols and road traffic prediction mechanisms
• Wireless Sensor Networks, Wireless mesh Networks and VANETs applications for traffic management in smart cities
• Mobility and vehicular traffic measurement, modeling, and simulation
• Security and QoS issues for ITS applications
• V2X feasibility over LTE Networks
• M2M communication for data collection in road environment
• Mobile applications for intelligent traffic management
• Vehicular Sensor Networks (VSNs) applications for road traffic management
• Decision making tools for road traffic management
Keynote speakers:
===============
Prof. Falko Dressler (http://www.ccs-labs.org/~dressler/)
University of Innsbruck, Austria
Talk title:" Tawards Adaptive Inter-Vehicular Communications Protocols"
Daniel Krajzewicz, DLR, Germany
Talk title:" Notes on simulating V2X-based traffic management"
Main Sponsor:
===========
Lero, The Irish Software Engineering Research Centre
Papers Submission:
=============
Submissions should be original and limited to 6 double-column pages and should follow IEEE paper templates. Papers are to be submitted electronically on the EDAS web site of the workshop in PDF format.
General Chairs:
==========
Georgios Theodoropoulos, IBM Research, Ireland
Siobhan Clarke, Trinity College Dublin, Ireland
T. Russell Hsing, Peking University, China, and Jiao Tung University, Taiwan
TPC Chairs:
========
Soufiene Djahel, University College Dublin, Ireland
Piotr Szczechowiak , Telcordia/Ericsson, Poland
Anthony Ventresque, University College Dublin, Ireland
Organizing Committee:
================
John Fitzpatrick, University College Dublin, Ireland
Yacine Ghamri-Doudane, University Paris-Est Marne-la-Vallée and ENSIIE, France
Hamid Nafaa, University College Dublin, Ireland
John Murphy, University College Dublin, Ireland
Liam Murphy, University College Dublin, Ireland
Tentative list of TPC members:
=====================
Zonghua Zhang, Institute Telecom Lille1, France
Yassine Hadjadj Aoul, IRISA, France
Mélanie Bouroche, TCD, Ireland
Krzysztof Wesołowski, PUT, Poland
Mourad Amad, University of Bejaia, Algeria
Onur Altintas, Toyota ITC, Japan
Dalil Moad, City Passenger, France
Mohamed Hamdi, Sup'Com, Tunisia
Ghalem Boudour, LIG-CNRS, France
Yacine Ghamri Doudane, ENSIIE, France
Raquel Morera, Verizon, USA
Lyes Khoukhi, University of Troyes, France
Oscar Lazaro, Innovalia, Spain
Nabil Nouri Abdelkader, University of Djelfa, Algeria
T. Russell Hsing, National Chiao Tung University, Taiwan
Saïd Gharout, Orange Labs, France
Djamel Djenouri, CERIST Research Center, Algeria
Xiang Cheng, Peking University, China
Toyotaro Suzumura, IBM Research - Tokyo/Tokyo Institute of Technology, Japan
Elvis Sze-Yeung Liu, University of Birmingham, UK
Intesab Hussain, LIPADE, France
Mikael Asplund, Trinity College Dublin, Ireland
Francesco Calabrese, Smarter Urban Dynamics, IBM Research, Ireland
Razvan stanica, IRIT, ENSEEIHT, France
Nafaâ Jabeur, Dhofar University, Oman
Seehttp://www.wireless-days.org/vtm.html
--
Dr. Soufiene Djahel
Research Fellow
Performance Engineering Lab
University College Dublin
http://www.ensiie.fr/~soufiene.djahel/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Saturday, September 15, 2012
[DMANET] second announcement: workshop on random graphs
Dear DMANET-subscribers,
On Thursday 1 and Friday 2 November 2012 there will be a workshop on
random graphs on the campus of the University of Utrecht.
Utrecht is a picturesque old city in the middle of the Netherlands.
The webpage of the workshop is: http://www.math.uu.nl/~Muell001/workshopRGs/
We are very pleased that the following eminent researchers have agreed to
deliver plenary talks:
Amin Coja-Oghlan (Frankfurt)
Remco van der Hofstad (Eindhoven)
Svante Janson (Uppsala)
Michael Krivelevich (Tel Aviv)
Nelly Litvak (Twente)
Piet van Mieghem (Delft)
Marc Noy (Barcelona)
In addition to these lectures, there will be a number of shorter talks
by researchers in the early stages of their career.
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: tobias@cwi.nl
Best regards,
Tobias Mueller
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
On Thursday 1 and Friday 2 November 2012 there will be a workshop on
random graphs on the campus of the University of Utrecht.
Utrecht is a picturesque old city in the middle of the Netherlands.
The webpage of the workshop is: http://www.math.uu.nl/~Muell001/workshopRGs/
We are very pleased that the following eminent researchers have agreed to
deliver plenary talks:
Amin Coja-Oghlan (Frankfurt)
Remco van der Hofstad (Eindhoven)
Svante Janson (Uppsala)
Michael Krivelevich (Tel Aviv)
Nelly Litvak (Twente)
Piet van Mieghem (Delft)
Marc Noy (Barcelona)
In addition to these lectures, there will be a number of shorter talks
by researchers in the early stages of their career.
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: tobias@cwi.nl
Best regards,
Tobias Mueller
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Friday, September 14, 2012
[DMANET] CFP: Jorge Urrutia's Fest
=======================================================================
CALL FOR PAPERS
MEXICAN CONFERENCE ON DISCRETE MATHEMATICS AND COMPUTATIONAL GEOMETRY
Honoring Jorge Urrutia on the occasion of his 60th birthday
Oaxaca, Mexico.
November 11-15, 2013.
http://www.matem.unam.mx/jorgefest/
=======================================================================
- We apologize for multiple postings -
The Mexican Conference on Discrete Mathematics and Computational Geometry
will be held on November 11-15, 2013, in the beautiful city of Oaxaca, Mexico.
The main theme of the conference will be Computational and
Combinatorial Geometry.
However, all areas of Discrete Mathematics are welcome.
During this event the Mexican Discrete Mathematics community and all attendees
will celebrate Jorge Urrutia's 60th Birthday.
SUBMISSIONS
Authors are invited to submit an extended abstract (in English)
of at most 10 pages of original research. A booklet of abstracts will
be delivered
at the conference. Authors of selected papers will be invited to
submit a full version
to a special issue of the journal "Graphs and Combinatorics"; all
papers will be refereed
according to the usual high standards of this journal.
While submissions will be reviewed for scope and correctness,
the booklet will not be a formal publication. Papers not submitted to
the special issue of G&C
may be published at other conferences or journals,
as the distributed booklet of abstracts does not constitute formal proceedings.
Submissions will be handled by EasyChair.
IMPORTANT DATES
•Submissions Deadline: June 14, 2013.
•Acceptance Notification: July 15, 2013.
•Submission of final version of extended abstract: September 20, 2013.
•Early Registration Deadline: September 27, 2013.
•Meeting: November 11-15, 2013.
INVITED SPEAKERS
•Oswin Aichholzer.
•Jin Akiyama.
•Ferran Hurtado.
•Evangelos Kranakis.
•Luis Montejano.
•János Pach.
•Gelasio Salazar.
SCIENTIFIC COMMITTEE
•Manuel Abellanas.
•Oswin Aichholzer.
•Sergey Bereg.
•Jesús de Loera.
•José Miguel Díaz-Bañez.
•Ruy Fabila-Monroy (co-chair).
•Silvia Fernández-Merchant.
•Alfredo García.
•Ferran Hurtado.
•Mikio Kano.
•David G. Kirkpatrick.
•Evangelos Kranakis (co-chair).
•Stefan Langerman.
•Alberto Márquez.
•Jaroslav Opatrny.
•Sergio Rajsbaum.
•Jorge Ramírez-Alfonsín.
•Pedro Ramos (co-chair).
•Eduardo Rivera-Campo.
•Toshinori Sakai.
•Gelasio Salazar.
•Csaba D. Tóth.
•Godfried T. Toussaint.
•David R. Wood.
ORGANIZING COMMITTEE
•Ruy Fabila-Monroy (chair).
•David Flores-Peñaloza.
•Hernán González.
•Isabel Hubard.
•Dolores Lara.
•Marcelino Ramírez.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CALL FOR PAPERS
MEXICAN CONFERENCE ON DISCRETE MATHEMATICS AND COMPUTATIONAL GEOMETRY
Honoring Jorge Urrutia on the occasion of his 60th birthday
Oaxaca, Mexico.
November 11-15, 2013.
http://www.matem.unam.mx/jorgefest/
=======================================================================
- We apologize for multiple postings -
The Mexican Conference on Discrete Mathematics and Computational Geometry
will be held on November 11-15, 2013, in the beautiful city of Oaxaca, Mexico.
The main theme of the conference will be Computational and
Combinatorial Geometry.
However, all areas of Discrete Mathematics are welcome.
During this event the Mexican Discrete Mathematics community and all attendees
will celebrate Jorge Urrutia's 60th Birthday.
SUBMISSIONS
Authors are invited to submit an extended abstract (in English)
of at most 10 pages of original research. A booklet of abstracts will
be delivered
at the conference. Authors of selected papers will be invited to
submit a full version
to a special issue of the journal "Graphs and Combinatorics"; all
papers will be refereed
according to the usual high standards of this journal.
While submissions will be reviewed for scope and correctness,
the booklet will not be a formal publication. Papers not submitted to
the special issue of G&C
may be published at other conferences or journals,
as the distributed booklet of abstracts does not constitute formal proceedings.
Submissions will be handled by EasyChair.
IMPORTANT DATES
•Submissions Deadline: June 14, 2013.
•Acceptance Notification: July 15, 2013.
•Submission of final version of extended abstract: September 20, 2013.
•Early Registration Deadline: September 27, 2013.
•Meeting: November 11-15, 2013.
INVITED SPEAKERS
•Oswin Aichholzer.
•Jin Akiyama.
•Ferran Hurtado.
•Evangelos Kranakis.
•Luis Montejano.
•János Pach.
•Gelasio Salazar.
SCIENTIFIC COMMITTEE
•Manuel Abellanas.
•Oswin Aichholzer.
•Sergey Bereg.
•Jesús de Loera.
•José Miguel Díaz-Bañez.
•Ruy Fabila-Monroy (co-chair).
•Silvia Fernández-Merchant.
•Alfredo García.
•Ferran Hurtado.
•Mikio Kano.
•David G. Kirkpatrick.
•Evangelos Kranakis (co-chair).
•Stefan Langerman.
•Alberto Márquez.
•Jaroslav Opatrny.
•Sergio Rajsbaum.
•Jorge Ramírez-Alfonsín.
•Pedro Ramos (co-chair).
•Eduardo Rivera-Campo.
•Toshinori Sakai.
•Gelasio Salazar.
•Csaba D. Tóth.
•Godfried T. Toussaint.
•David R. Wood.
ORGANIZING COMMITTEE
•Ruy Fabila-Monroy (chair).
•David Flores-Peñaloza.
•Hernán González.
•Isabel Hubard.
•Dolores Lara.
•Marcelino Ramírez.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Computational Geometry Postdoc Vacancy at TU Braunschweig
The Algorithms Group in the Department of Computer Science at Braunschweig University of Technology, Germany, has a vacancy for a computer scientist or mathematician, starting in November (exact date negotiable).
We are looking for
a scientific employee / postdoctoral research associate
(TV-L13 = about 2800 Euros gross per month; DFG project "Kunst!").
The position will be for one year.
Project "Kunst!" combines methods from computational geometry, mathematical programming, and algorithm engineering in an exciting way. The goal is to solve problems from the art gallery family (almost) exactly, and to design efficient algorithms with efficient implementations. See the paper
Kroeller, Baumgartner, Fekete, Schmidt: Exact solutions and bounds for general art gallery problems. ACM Journal of Experimental Algorithmics 17(1)-2.3, 2012.
http://dl.acm.org/citation.cfm?id=2184449
to get an idea on the subject. There will be a focus on the efficient computation of visibility-related data structures (visibility polygons, graphs, etc.).
We are looking for applicants with an above-average Ph.D. in mathematics or computer science, who have a solid knowledge in optimization and algorithms, an interest in and a capability for a wide range of scientific work (from developing ideas all the way to their practical realization), an open mind for the other activities of our department, and a healthy team spirit.
Some topics that may arise during the project are the following:
- Computational geometry, esp. the art gallery problem and its variants.
- Modelling and abstraction of real-world problems.
- Implementing geometric algorithms (e.g., CGAL).
Proficiency in English is a must. Implementing algorithms in C++ will be a part of the project, so familarity with C++ development is required.
There are no teaching obligations, but researchers will have the opportunity to interact with students in the context of their projects.
We are offering an opportunity to participate in exciting interdisciplinary projects that span all the way from basic research in algorithms to its practical and technical application. As a member of our group, you will be part of a motivated team that maintains various interdisciplinary and international contacts and activities. Among applicants with equal qualifications, handicapped persons will be given a preference. The Braunschweig University of Technology is an equal-opportunity employer and encourages women to apply.
Please send your detailed application by
October 5, 2012
with the usual documents to:
Alexander Kroeller
Technische Universitaet Braunschweig
Institut für Betriebssysteme und Rechnerverbund
Abteilung Algorithmik
Muehlenpfordtstrasse 23
38106 Braunschweig
Germany
fax: +49 531 391 3109
Electronic applications are preferred - even more if they come in a single PDF file. If there are questions, please contact Alexander Kroeller via mail (a.kroeller "at" tu-bs.de) or phone (+49 531 391 3112).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
We are looking for
a scientific employee / postdoctoral research associate
(TV-L13 = about 2800 Euros gross per month; DFG project "Kunst!").
The position will be for one year.
Project "Kunst!" combines methods from computational geometry, mathematical programming, and algorithm engineering in an exciting way. The goal is to solve problems from the art gallery family (almost) exactly, and to design efficient algorithms with efficient implementations. See the paper
Kroeller, Baumgartner, Fekete, Schmidt: Exact solutions and bounds for general art gallery problems. ACM Journal of Experimental Algorithmics 17(1)-2.3, 2012.
http://dl.acm.org/citation.cfm?id=2184449
to get an idea on the subject. There will be a focus on the efficient computation of visibility-related data structures (visibility polygons, graphs, etc.).
We are looking for applicants with an above-average Ph.D. in mathematics or computer science, who have a solid knowledge in optimization and algorithms, an interest in and a capability for a wide range of scientific work (from developing ideas all the way to their practical realization), an open mind for the other activities of our department, and a healthy team spirit.
Some topics that may arise during the project are the following:
- Computational geometry, esp. the art gallery problem and its variants.
- Modelling and abstraction of real-world problems.
- Implementing geometric algorithms (e.g., CGAL).
Proficiency in English is a must. Implementing algorithms in C++ will be a part of the project, so familarity with C++ development is required.
There are no teaching obligations, but researchers will have the opportunity to interact with students in the context of their projects.
We are offering an opportunity to participate in exciting interdisciplinary projects that span all the way from basic research in algorithms to its practical and technical application. As a member of our group, you will be part of a motivated team that maintains various interdisciplinary and international contacts and activities. Among applicants with equal qualifications, handicapped persons will be given a preference. The Braunschweig University of Technology is an equal-opportunity employer and encourages women to apply.
Please send your detailed application by
October 5, 2012
with the usual documents to:
Alexander Kroeller
Technische Universitaet Braunschweig
Institut für Betriebssysteme und Rechnerverbund
Abteilung Algorithmik
Muehlenpfordtstrasse 23
38106 Braunschweig
Germany
fax: +49 531 391 3109
Electronic applications are preferred - even more if they come in a single PDF file. If there are questions, please contact Alexander Kroeller via mail (a.kroeller "at" tu-bs.de) or phone (+49 531 391 3112).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
