25th Canadian Conference on Computational Geometry (CCCG 2013)
August 8-10, 2013, University of Waterloo, Waterloo, Ontario.
----------------------------------------------------
The 25th Canadian Conference on Computational Geometry will be held in
Waterloo, Ontario, on August 8-10, 2013. There will be a reception on
the evening of the 7th.
CCCG has a tradition of being welcoming to students. It is expected
that there will be partial travel support for students and postdocs.
SCOPE
CCCG focuses on the design of efficient algorithms, the development of
software, and the study of the mathematical foundations of
computational problems whose formulations involve geometric
constraints. The field of computational geometry is motivated by
problems from a broad range of application areas, as diverse as
computer graphics and animation, computer vision, computer-aided
design and manufacturing, geographic information systems, pattern
recognition, wireless communications, robotics, protein folding, urban
planning, graph drawing, or statistical analysis to name just a few.
Authors are invited to submit papers describing original research of
theoretical or practical significance in computational, combinatorial
and discrete geometry, as well as related areas.
AUDIENCE
CCCG is an international forum, accessible to a broad community of
researchers, to disseminate and discuss new theoretical and applied
results in discrete and computational geometry. The intended audience
for this conference includes graduate and undergraduate students,
researchers in the area, and members of industry whose work involves
geometric computation.
SUBMISSION DETAILS
Submissions should not exceed six pages, must be submitted
electronically, and must be prepared using LaTeX; the appropriate
template is available from the conference website. Authors who
feel that additional details are necessary should include a clearly
marked appendix, which will be read at the discretion of the Program
Committee. Each submission will be refereed by at least three members
of the Program Committee. Details on the submission procedure are
outlined on the conference website. Six-page papers accepted at CCCG
will appear in the printed proceedings of the conference, provided
that they are presented by a speaker at the conference. Electronic
proceedings without page limits will be hosted at http://cccg.ca.
Selected papers from the conference will be invited for submission to
a special issue of the journal Computational Geometry: Theory and
Applications.
Simultaneous submission to another conference or journal is not allowed.
Submission is now open at EasyChair:
https://www.easychair.org/conferences/?conf=cccg2013
CONFERENCE WEBPAGE
Additional details, including submission instructions and local
information, will be available at the conference webpage:
https://cs.uwaterloo.ca/conferences/cccg2013/
INVITED SPEAKERS
Sue Whitesides (University of Victoria)
Alla Shaffer (UBC)
Peter Widmayer (ETH Zurich) (Erdös memorial lecture)
IMPORTANT DATES
Submissions due: May 6, 2013
Notification of acceptance: June 5, 2013
Final versions due: June 14, 2013
Early registration deadline: July 9th, 2013
Conference: August 8-10 (reception on 7th)
PROGRAM COMMITTEE
Peyman Afshani (MADALGO)
Hee-Kap Ahn (POSTECH)
Greg Aloupis (ULB)
Boaz Ben-Moshe (Ariel University Center)
Mark de Berg (TU Eindhoven)
Therese Biedl (U. Waterloo)
Gruia Calinescu (Illinois Inst. of Tech.)
Jean Cardinal (ULB)
Paz Carmi (Ben-Gurion U.)
Timothy Chan (U. Waterloo)
Mirela Damian (Villanova)
Vida Dujmović (Carleton)
Adrian Dumitrescu (U. Wisconsin-Milwaukee)
Sándor Fekete (TU Braunschweig)
Akitoshi Kawamura (U. Tokyo)
Alejandro López-Ortiz (U. Waterloo) (chair)
Anna Lubiw (U. Waterloo)
Anil Maheshwari (Carleton)
Lata Narayanan (Concordia)
Belén Palop (U. Valladolid)
Michiel Smid (Carleton)
Bettina Speckmann (TU Eindhoven)
Csaba Tóth (U. Calgary)
Ryuhei Uehara (JAIST)
Emo Welzl (ETH Zurich)
Norbert Zeh (Dalhousie)
ORGANIZING COMMITTEE
Therese Biedl (co-chair)
Timothy Chan
Francisco Claude
Hella Hoffmann
Shahin Kamali
Alejandro López-Ortiz (co-chair)
Anna Lubiw (co-chair)
Daniela Maftuleac
Patrick Nicholson
Venkatesh Raman
Alejandro Salinger
Hamideh Vosoughpour
Gelin Zhou
SPONSORS
We thank the following organizations for generously supporting CCCG 2013:
Fields Institute
University of Waterloo
Atlantic Association for Research in the Mathematical Sciences (AARMS)
Thursday, April 11, 2013
[DMANET] CFP: CCCG'13 Canadian Conference on Computational Geometry 2013
25th Canadian Conference on Computational Geometry (CCCG 2013)
August 8-10, 2013, University of Waterloo, Waterloo, Ontario.
----------------------------------------------------
The 25th Canadian Conference on Computational Geometry will be held in
Waterloo, Ontario, on August 8-10, 2013. There will be a reception on
the evening of the 7th.
CCCG has a tradition of being welcoming to students. It is expected
that there will be partial travel support for students and postdocs.
SCOPE
CCCG focuses on the design of efficient algorithms, the development of
software, and the study of the mathematical foundations of
computational problems whose formulations involve geometric
constraints. The field of computational geometry is motivated by
problems from a broad range of application areas, as diverse as
computer graphics and animation, computer vision, computer-aided
design and manufacturing, geographic information systems, pattern
recognition, wireless communications, robotics, protein folding, urban
planning, graph drawing, or statistical analysis to name just a few.
Authors are invited to submit papers describing original research of
theoretical or practical significance in computational, combinatorial
and discrete geometry, as well as related areas.
AUDIENCE
CCCG is an international forum, accessible to a broad community of
researchers, to disseminate and discuss new theoretical and applied
results in discrete and computational geometry. The intended audience
for this conference includes graduate and undergraduate students,
researchers in the area, and members of industry whose work involves
geometric computation.
SUBMISSION DETAILS
Submissions should not exceed six pages, must be submitted
electronically, and must be prepared using LaTeX; the appropriate
template is available from the conference website. Authors who
feel that additional details are necessary should include a clearly
marked appendix, which will be read at the discretion of the Program
Committee. Each submission will be refereed by at least three members
of the Program Committee. Details on the submission procedure are
outlined on the conference website. Six-page papers accepted at CCCG
will appear in the printed proceedings of the conference, provided
that they are presented by a speaker at the conference. Electronic
proceedings without page limits will be hosted at http://cccg.ca.
Selected papers from the conference will be invited for submission to
a special issue of the journal Computational Geometry: Theory and
Applications.
Simultaneous submission to another conference or journal is not allowed.
Submission is now open at EasyChair:
https://www.easychair.org/conferences/?conf=cccg2013
CONFERENCE WEBPAGE
Additional details, including submission instructions and local
information, will be available at the conference webpage:
https://cs.uwaterloo.ca/conferences/cccg2013/
INVITED SPEAKERS
Sue Whitesides (University of Victoria)
Alla Shaffer (UBC)
Peter Widmayer (ETH Zurich) (Erdös memorial lecture)
IMPORTANT DATES
Submissions due: May 6, 2013
Notification of acceptance: June 5, 2013
Final versions due: June 14, 2013
Early registration deadline: July 9th, 2013
Conference: August 8-10 (reception on 7th)
PROGRAM COMMITTEE
Peyman Afshani (MADALGO)
Hee-Kap Ahn (POSTECH)
Greg Aloupis (ULB)
Boaz Ben-Moshe (Ariel University Center)
Mark de Berg (TU Eindhoven)
Therese Biedl (U. Waterloo)
Gruia Calinescu (Illinois Inst. of Tech.)
Jean Cardinal (ULB)
Paz Carmi (Ben-Gurion U.)
Timothy Chan (U. Waterloo)
Mirela Damian (Villanova)
Vida Dujmović (Carleton)
Adrian Dumitrescu (U. Wisconsin-Milwaukee)
Sándor Fekete (TU Braunschweig)
Akitoshi Kawamura (U. Tokyo)
Alejandro López-Ortiz (U. Waterloo) (chair)
Anna Lubiw (U. Waterloo)
Anil Maheshwari (Carleton)
Lata Narayanan (Concordia)
Belén Palop (U. Valladolid)
Michiel Smid (Carleton)
Bettina Speckmann (TU Eindhoven)
Csaba Tóth (U. Calgary)
Ryuhei Uehara (JAIST)
Emo Welzl (ETH Zurich)
Norbert Zeh (Dalhousie)
ORGANIZING COMMITTEE
Therese Biedl (co-chair)
Timothy Chan
Francisco Claude
Hella Hoffmann
Shahin Kamali
Alejandro López-Ortiz (co-chair)
Anna Lubiw (co-chair)
Daniela Maftuleac
Patrick Nicholson
Venkatesh Raman
Alejandro Salinger
Hamideh Vosoughpour
Gelin Zhou
SPONSORS
We thank the following organizations for generously supporting CCCG 2013:
Fields Institute
University of Waterloo
Atlantic Association for Research in the Mathematical Sciences (AARMS)
**********************************************************
*
* 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/
*
**********************************************************
From Hiro Ito: JCDCG^2 2013
The 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2013)
Date: September 17--19, 2013
Conference Site: Tokyo University of Science (Kagurazaka Campus, Tokyo)
http://www.tus.ac.jp/en/campus/kagurazaka.html
Web Site:
http://www.ried.tokai.ac.jp/JCDCGG_2013/
Submission Deadline: June 28, 2013
----
The 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2013) will be held on September 17-19, 2013 at Tokyo University of Science, Tokyo, Japan (a different venue than in the past). The previous conferences were held in Tokyo as JCDCG 1997, 1998, 1999, 2000, 2002, 2004, 2006, 2011 (Japan Conference on Discrete and Computational Geometry; including domestic conferences); in Kyoto as KyotoCGGT 2007 (Kyoto International Conference on Computational Geometry and Graph Theory); and in Kanazawa as JCCGG 2009 (Japan Conference on Computational Geometry and Graphs). Other conferences in this series were also held in the Philippines (2001), Indonesia (2003), China (2005, 2010), and Thailand (2012).
Topics of interest include but are not limited to:
- discrete geometry
- computational geometry
- graph theory
- graph algorithms
- algorithms and data structures
- exact or approximation algorithms
- combinatorial optimization
- randomized algorithms
- recreational mathematics
The collection of abstracts will be distributed on the site of the conference.
Submission format: Authors are required to submit an extended abstract of at most 2 pages in a standard 10-point font on A4-paper through the submission website:
https://www.easychair.org/conferences/?conf=jcdcg22013
Post-conference proceedings: A post-conference proceedings, which consists of full papers of the talks in this conference through rigorous reviews, is under contemplation. A further information will be appeared on the conference website later.
Important Dates:
- Extended-Abstract Submissions Deadline: June 28, 2013 (JST)
- Notification: July 24, 2013
- Early Registration: August 16, 2013 (GMT)
- Conference: September 17 -- 19, 2013
Invited Plenary Speakers:
- Sergey Bereg (University of Texas at Dallas, USA)
- Erik Demaine (MIT, USA)
- Ferran Hurtado (Universitat Politecnics de Catalunya, Spain)
- Ken-ichi Kawarabayashi (NII and JST ERATO Kawarabayashi Large Graph Project, Japan)
- David Kirkpatrick (University of British Columbia, Canada)
- Stefan Langerman (Universite Libre de Bruxelles, Belgium )
- Janos Pach (EPFL, Switzerland and Renyi Institute, Hungary)
- Kokichi Sugihara (Meiji University, Japan)
- Jorge Urrutia (Universidad Nacional Autonoma de Mexico, Mexico)
Conference Chair:
- Jin Akiyama (Tokyo University of Science, Japan)
Program Co-Chairs:
- Hiro Ito (The University of Electro-Communications, Japan)
- Akira Saito (Nihon University, Japan)
Organizing Chair:
- Toshinori Sakai (Tokai University, Japan)
Program Committee:
- Hiro Ito (The University of Electro-Communications, Japan, co-chair)
- Akira Saito (Nihon University, Japan, co-chair)
- Hiroyoshi Miwa (Kwansei Gakuin University, Japan)
- Chie Nara (Tokai University, Japan)
- Yoshio Okamoto (The University of Electro-Communications, Japan)
- Toshinori Sakai (Tokai University, Japan)
- Yushi Uno (Osaka Prefecture University, Japan)
Web Site:
http://www.ried.tokai.ac.jp/JCDCGG_2013/
HIRO ITO and AKIRA SAITO, JCDCG^2 2013 PC co-chairs
Date: September 17--19, 2013
Conference Site: Tokyo University of Science (Kagurazaka Campus, Tokyo)
http://www.tus.ac.jp/en/campus/kagurazaka.html
Web Site:
http://www.ried.tokai.ac.jp/JCDCGG_2013/
Submission Deadline: June 28, 2013
----
The 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCG^2 2013) will be held on September 17-19, 2013 at Tokyo University of Science, Tokyo, Japan (a different venue than in the past). The previous conferences were held in Tokyo as JCDCG 1997, 1998, 1999, 2000, 2002, 2004, 2006, 2011 (Japan Conference on Discrete and Computational Geometry; including domestic conferences); in Kyoto as KyotoCGGT 2007 (Kyoto International Conference on Computational Geometry and Graph Theory); and in Kanazawa as JCCGG 2009 (Japan Conference on Computational Geometry and Graphs). Other conferences in this series were also held in the Philippines (2001), Indonesia (2003), China (2005, 2010), and Thailand (2012).
Topics of interest include but are not limited to:
- discrete geometry
- computational geometry
- graph theory
- graph algorithms
- algorithms and data structures
- exact or approximation algorithms
- combinatorial optimization
- randomized algorithms
- recreational mathematics
The collection of abstracts will be distributed on the site of the conference.
Submission format: Authors are required to submit an extended abstract of at most 2 pages in a standard 10-point font on A4-paper through the submission website:
https://www.easychair.org/conferences/?conf=jcdcg22013
Post-conference proceedings: A post-conference proceedings, which consists of full papers of the talks in this conference through rigorous reviews, is under contemplation. A further information will be appeared on the conference website later.
Important Dates:
- Extended-Abstract Submissions Deadline: June 28, 2013 (JST)
- Notification: July 24, 2013
- Early Registration: August 16, 2013 (GMT)
- Conference: September 17 -- 19, 2013
Invited Plenary Speakers:
- Sergey Bereg (University of Texas at Dallas, USA)
- Erik Demaine (MIT, USA)
- Ferran Hurtado (Universitat Politecnics de Catalunya, Spain)
- Ken-ichi Kawarabayashi (NII and JST ERATO Kawarabayashi Large Graph Project, Japan)
- David Kirkpatrick (University of British Columbia, Canada)
- Stefan Langerman (Universite Libre de Bruxelles, Belgium )
- Janos Pach (EPFL, Switzerland and Renyi Institute, Hungary)
- Kokichi Sugihara (Meiji University, Japan)
- Jorge Urrutia (Universidad Nacional Autonoma de Mexico, Mexico)
Conference Chair:
- Jin Akiyama (Tokyo University of Science, Japan)
Program Co-Chairs:
- Hiro Ito (The University of Electro-Communications, Japan)
- Akira Saito (Nihon University, Japan)
Organizing Chair:
- Toshinori Sakai (Tokai University, Japan)
Program Committee:
- Hiro Ito (The University of Electro-Communications, Japan, co-chair)
- Akira Saito (Nihon University, Japan, co-chair)
- Hiroyoshi Miwa (Kwansei Gakuin University, Japan)
- Chie Nara (Tokai University, Japan)
- Yoshio Okamoto (The University of Electro-Communications, Japan)
- Toshinori Sakai (Tokai University, Japan)
- Yushi Uno (Osaka Prefecture University, Japan)
Web Site:
http://www.ried.tokai.ac.jp/JCDCGG_2013/
HIRO ITO and AKIRA SAITO, JCDCG^2 2013 PC co-chairs
[DMANET] BDA 2013 --- announcement and call for submissions
*** Apologies for multiple messages ***
==================================================
The 1st Workshop on Biological Distributed Algorithms (BDA 2013)
14 October 2013, Jerusalem, Israel – in conjunction with DISC 2013
http://www.disc-conference.org/wp/bda2013/
==================================================
Distributed systems are prevalent in computer science and biology.
Both domains rely on networks of interacting entities to reach joint
decisions, coordinate and respond to inputs. Both also share several
other attributes including the use of randomization, the ability to
successfully handle failures and attacks, and reusing certain
components and ideas in multiple processes or algorithms.
These observations, some dating back to the 60s, have inspired the
development of several computational methods including neural networks
and genetic algorithms. However, until recently little thought has
been given to the specific connections between information processing
in biology and the field of distributed computing.
In this workshop we intend to focus on these connections.
Specifically, our goal is to highlight that thinking computationally
about the settings, requirements and goals of information processing
in biological networks can both, improve our understanding of the
underlying biology and lead to the development of novel computational
methods providing solutions to specific distributed computing
problems. Topics include but are not limited to:
- Communication models inspired by biological systems
- Coordination in cell fate determination
- Interactions in ant colonies
- The design and usage of networks in the brain
- Adaptability of networks to changing environments
- Robustness of networks to attacks and failures
- Synchronization
While we anticipate a wide range of topics, both from the biological
and from the computational point of view, we expect the submitted
papers to identify a specific biological system or process and a
corresponding computational problem on which they base their work.
===========
SUBMISSIONS
===========
We solicit submissions describing recent results relevant to
biological distributed computing. We especially welcome papers
describing new insights and / or case studies regarding the
relationship between distributed computing and biological systems even
if these are not fully formed. Since a major goal of the workshop is
to explore new directions and approaches, we especially encourage the
submission of ongoing work. Selected contributors would be asked to
present, discuss and defend their work at the workshop. Submissions
should be in PDF and include title, author information, and a 4-page
extended abstract.
Please use the following EasyChair submission link:
https://www.easychair.org/conferences/?conf=bda20131
Note: The workshop will not include published proceedings. In
particular, we welcome submissions of papers describing work that has
appeared or is expected to appear in other venues.
===============
IMPORTANT DATES
===============
11 July 2013 – Paper submission deadline
05 August 2013 – Decision notifications
14 October 2013 – Workshop
================
INVITED SPEAKERS
================
Uri Alon – Weizmann Institute
Ziv Bar-Joseph – CMU
Yuval Emek – ETH Zurich
Jasmine Fischer – Microsoft Research UK
Ofer Feinerman – Weizmann Institute
Amos Korman – CNRS and University of Paris Diderot
===================
PROGRAM COMMITTEE
===================
Ziv Bar-Joseph – CMU (Co-chair)
Yuval Emek – ETH Zurich (Co-chair)
Amos Korman – CNRS and University of Paris Diderot (Co-chair)
Naomi Leonard – Princeton
Nancy Lynch – MIT
Saket Navlakha – CMU
Roger Wattenhofer – ETH Zurich
--
Dr. Yuval Emek
Distributed Computing Group
TIK Laboratory, ETH Zurich
Gloriastrasse 35
8092 Zurich
Switzerland
+41 44 632 7974
yuval.emek@tik.ee.ethz.ch
http://www.disco.ethz.ch/members/yuval.html
**********************************************************
*
* 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/
*
**********************************************************
==================================================
The 1st Workshop on Biological Distributed Algorithms (BDA 2013)
14 October 2013, Jerusalem, Israel – in conjunction with DISC 2013
http://www.disc-conference.org/wp/bda2013/
==================================================
Distributed systems are prevalent in computer science and biology.
Both domains rely on networks of interacting entities to reach joint
decisions, coordinate and respond to inputs. Both also share several
other attributes including the use of randomization, the ability to
successfully handle failures and attacks, and reusing certain
components and ideas in multiple processes or algorithms.
These observations, some dating back to the 60s, have inspired the
development of several computational methods including neural networks
and genetic algorithms. However, until recently little thought has
been given to the specific connections between information processing
in biology and the field of distributed computing.
In this workshop we intend to focus on these connections.
Specifically, our goal is to highlight that thinking computationally
about the settings, requirements and goals of information processing
in biological networks can both, improve our understanding of the
underlying biology and lead to the development of novel computational
methods providing solutions to specific distributed computing
problems. Topics include but are not limited to:
- Communication models inspired by biological systems
- Coordination in cell fate determination
- Interactions in ant colonies
- The design and usage of networks in the brain
- Adaptability of networks to changing environments
- Robustness of networks to attacks and failures
- Synchronization
While we anticipate a wide range of topics, both from the biological
and from the computational point of view, we expect the submitted
papers to identify a specific biological system or process and a
corresponding computational problem on which they base their work.
===========
SUBMISSIONS
===========
We solicit submissions describing recent results relevant to
biological distributed computing. We especially welcome papers
describing new insights and / or case studies regarding the
relationship between distributed computing and biological systems even
if these are not fully formed. Since a major goal of the workshop is
to explore new directions and approaches, we especially encourage the
submission of ongoing work. Selected contributors would be asked to
present, discuss and defend their work at the workshop. Submissions
should be in PDF and include title, author information, and a 4-page
extended abstract.
Please use the following EasyChair submission link:
https://www.easychair.org/conferences/?conf=bda20131
Note: The workshop will not include published proceedings. In
particular, we welcome submissions of papers describing work that has
appeared or is expected to appear in other venues.
===============
IMPORTANT DATES
===============
11 July 2013 – Paper submission deadline
05 August 2013 – Decision notifications
14 October 2013 – Workshop
================
INVITED SPEAKERS
================
Uri Alon – Weizmann Institute
Ziv Bar-Joseph – CMU
Yuval Emek – ETH Zurich
Jasmine Fischer – Microsoft Research UK
Ofer Feinerman – Weizmann Institute
Amos Korman – CNRS and University of Paris Diderot
===================
PROGRAM COMMITTEE
===================
Ziv Bar-Joseph – CMU (Co-chair)
Yuval Emek – ETH Zurich (Co-chair)
Amos Korman – CNRS and University of Paris Diderot (Co-chair)
Naomi Leonard – Princeton
Nancy Lynch – MIT
Saket Navlakha – CMU
Roger Wattenhofer – ETH Zurich
--
Dr. Yuval Emek
Distributed Computing Group
TIK Laboratory, ETH Zurich
Gloriastrasse 35
8092 Zurich
Switzerland
+41 44 632 7974
yuval.emek@tik.ee.ethz.ch
http://www.disco.ethz.ch/members/yuval.html
**********************************************************
*
* 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, April 10, 2013
[DMANET] Positions at U Konstanz
We are one of four partners in the ERC Synergy Project NEXUS 1492 which
will receive 15 Mio EUR for research in the Caribbean. Our tasks include
modeling, analyzing, and visualizing networks from archaeological data.
We are therefore hiring doctoral and postdoctoral researchers with a
background in algorithmics, discrete mathematics, statistics, or similar.
http://www.uni-konstanz.de/stellenangebote/?cont=stellausw&seite=2013/067&id=1
Best regards,
B.
--
Prof. Dr. Ulrik Brandes
Department of Computer & | +49 7531 88-4433 (phone)
Information Science, Box 67 | +49 7531 88-3577 (fax)
University of Konstanz | Ulrik.Brandes@uni-konstanz.de
78457 Konstanz, Germany | http://www.inf.uni-konstanz.de/~brandes/
**********************************************************
*
* 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/
*
**********************************************************
will receive 15 Mio EUR for research in the Caribbean. Our tasks include
modeling, analyzing, and visualizing networks from archaeological data.
We are therefore hiring doctoral and postdoctoral researchers with a
background in algorithmics, discrete mathematics, statistics, or similar.
http://www.uni-konstanz.de/stellenangebote/?cont=stellausw&seite=2013/067&id=1
Best regards,
B.
--
Prof. Dr. Ulrik Brandes
Department of Computer & | +49 7531 88-4433 (phone)
Information Science, Box 67 | +49 7531 88-3577 (fax)
University of Konstanz | Ulrik.Brandes@uni-konstanz.de
78457 Konstanz, Germany | http://www.inf.uni-konstanz.de/~brandes/
**********************************************************
*
* 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/
*
**********************************************************
E. W. Beth Dissertation Prize: 2013 call for nominations
E. W. Beth Dissertation Prize: 2013 call for nominations
Since 2002, FoLLI (the Association for Logic, Language, and
Information, http://institucional.us.es/folliweb/) awards the
E.W. Beth Dissertation Prize to outstanding dissertations in the
fields of Logic, Language, and Information. We invite submissions for
the best dissertation which resulted in a Ph.D. degree in the year
2012. The dissertations will be judged on technical depth and
strength, originality, and impact made in at least two of three fields
of Logic, Language, and Computation. Interdisciplinarity is an
important feature of the theses competing for the E.W. Beth
Dissertation Prize.
Who qualifies.
Nominations of candidates are admitted who were awarded a Ph.D. degree
in the areas of Logic, Language, or Information between January 1st,
2012 and December 31st, 2012. There is no restriction on the
nationality of the candidate or the university where the Ph.D. was
granted. After a careful consideration, FoLLI has decided to accept
only dissertations written in English. Dissertations produced in 2012
but not written in English or not translated will be allowed for
submission, after translation, also with the call next year (for
dissertations defended in 2013). The present call for nominations for
the E.W. Beth Disertation Award 2013 will also accept nominations of
full English translations of theses originally written in another
language than English and defended in 2011 or 2012.
Prize.
The prize consists of:
-a certificate
-a donation of 2500 euros provided by the E.W. Beth Foundation
-an invitation to submit the thesis (or a revised version of it) to
the FoLLI Publications on Logic, Language and Information
(Springer). For further information on this series see the FoLLI
site.
How to submit.
Only electronic submissions are accepted. The following documents are
required:
1. The thesis in pdf format (ps/doc/rtf not accepted);
2. A ten page abstract of the dissertation in pdf format;
3. A letter of nomination from the thesis supervisor. Self-nominations
are not admitted: each nomination must be sponsored by the thesis
supervisor. The letter of nomination should concisely describe the
scope and significance of the dissertation and state when the degree
was officially awarded;
4. Two additional letters of support, including at least one letter
from a referee not affiliated with the academic institution that
awarded the Ph.D. degree.
All documents must be submitted electronically (preferably as a zip
file) to buszko@amu.edu.pl. Hard copy submissions are not admitted. In
case of any problems with the email submission or a lack of
notification within three working days, nominators should write to
buszko@amu.edu.pl.
Important dates:
Deadline for Submissions: May 12, 2013.
Notification of Decision: July 14, 2013.
Committee :
Chris Barker (New York)
Wojciech Buszkowski (chair) (Poznan)
Michael Kaminski (Haifa)
Dale Miller (Palaiseau)
Larry Moss (Bloomington)
Ian Pratt-Hartmann (Manchester)
Ruy de Queiroz (Recife)
Giovanni Sambin (Padua)
Rob van der Sandt (Nijmegen)
Rineke Verbrugge (Groningen)
Heinrich Wansing (Bochum)
Since 2002, FoLLI (the Association for Logic, Language, and
Information, http://institucional.us.es/folliweb/) awards the
E.W. Beth Dissertation Prize to outstanding dissertations in the
fields of Logic, Language, and Information. We invite submissions for
the best dissertation which resulted in a Ph.D. degree in the year
2012. The dissertations will be judged on technical depth and
strength, originality, and impact made in at least two of three fields
of Logic, Language, and Computation. Interdisciplinarity is an
important feature of the theses competing for the E.W. Beth
Dissertation Prize.
Who qualifies.
Nominations of candidates are admitted who were awarded a Ph.D. degree
in the areas of Logic, Language, or Information between January 1st,
2012 and December 31st, 2012. There is no restriction on the
nationality of the candidate or the university where the Ph.D. was
granted. After a careful consideration, FoLLI has decided to accept
only dissertations written in English. Dissertations produced in 2012
but not written in English or not translated will be allowed for
submission, after translation, also with the call next year (for
dissertations defended in 2013). The present call for nominations for
the E.W. Beth Disertation Award 2013 will also accept nominations of
full English translations of theses originally written in another
language than English and defended in 2011 or 2012.
Prize.
The prize consists of:
-a certificate
-a donation of 2500 euros provided by the E.W. Beth Foundation
-an invitation to submit the thesis (or a revised version of it) to
the FoLLI Publications on Logic, Language and Information
(Springer). For further information on this series see the FoLLI
site.
How to submit.
Only electronic submissions are accepted. The following documents are
required:
1. The thesis in pdf format (ps/doc/rtf not accepted);
2. A ten page abstract of the dissertation in pdf format;
3. A letter of nomination from the thesis supervisor. Self-nominations
are not admitted: each nomination must be sponsored by the thesis
supervisor. The letter of nomination should concisely describe the
scope and significance of the dissertation and state when the degree
was officially awarded;
4. Two additional letters of support, including at least one letter
from a referee not affiliated with the academic institution that
awarded the Ph.D. degree.
All documents must be submitted electronically (preferably as a zip
file) to buszko@amu.edu.pl. Hard copy submissions are not admitted. In
case of any problems with the email submission or a lack of
notification within three working days, nominators should write to
buszko@amu.edu.pl.
Important dates:
Deadline for Submissions: May 12, 2013.
Notification of Decision: July 14, 2013.
Committee :
Chris Barker (New York)
Wojciech Buszkowski (chair) (Poznan)
Michael Kaminski (Haifa)
Dale Miller (Palaiseau)
Larry Moss (Bloomington)
Ian Pratt-Hartmann (Manchester)
Ruy de Queiroz (Recife)
Giovanni Sambin (Padua)
Rob van der Sandt (Nijmegen)
Rineke Verbrugge (Groningen)
Heinrich Wansing (Bochum)
[DMANET] Call for Participation: CTIC-CFEM Workshop on New Trends in Mechanism Design II
CTIC-CFEM Workshop on New Trends in Mechanism Design II
On June 25-28 2013, CTIC and CFEM will host the Workshop on New Trends in Mechanism Design II in Aarhus.
The workshop is organized by the Center for Research in the Foundations of Electronic Markets (CFEM), and the Sino-Danish Center for the Theory of Interactive Computation (CTIC).
New Trends in Mechanism Design II is a follow-up to the successful workshop New Trends in Mechanism Design that was organized by CFEM at the Copenhagen Business School in 2011. The New Trends in Mechanism Design workshops bring together researchers from economics and computer science working on the design and analysis of economic mechanisms and on applications of such mechanism to solve real-life economic problems for companies, organizations and governments.
A special session on June 27th will concern applications of differential privacy to mechanism design.
Confirmed invited speakers:
Anna Bogomolnaia, Rice
Costis Daskalakis, MIT
David Xiao, CNRS, Université Paris 7
Gustavo Bergantionos, Vigo
Hervé Moulin, Rice
Jason Hartline, Northwestern
Kobbi Nissim, Ben-Gurion University and CRCS/Harvard University
Nicole Immorlica, Microsoft Research
Tim Roughgarden, Stanford University
Yiling Chen, Harvard
There may be slots available for contributed presentations. If you are interested in giving a presentation, you may include an abstract and a link to a paper with your registration.
Participation in the workshop is open for all interested parties for a nominal fee. For more information and for registration, please visit the workshop homepage:
http://ctic.au.dk/workshops-conferences/ntmd-ii/
Med Venlig Hilsen / Kind Regards
Dorthe Haagen Nielsen, MA
Department of Computer Science
Aabogade 34
DK-8200 Aarhus N.
Phone +45 8715 5576
Fax +45 8942 5601
www.cs.au.dk
**********************************************************
*
* 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 June 25-28 2013, CTIC and CFEM will host the Workshop on New Trends in Mechanism Design II in Aarhus.
The workshop is organized by the Center for Research in the Foundations of Electronic Markets (CFEM), and the Sino-Danish Center for the Theory of Interactive Computation (CTIC).
New Trends in Mechanism Design II is a follow-up to the successful workshop New Trends in Mechanism Design that was organized by CFEM at the Copenhagen Business School in 2011. The New Trends in Mechanism Design workshops bring together researchers from economics and computer science working on the design and analysis of economic mechanisms and on applications of such mechanism to solve real-life economic problems for companies, organizations and governments.
A special session on June 27th will concern applications of differential privacy to mechanism design.
Confirmed invited speakers:
Anna Bogomolnaia, Rice
Costis Daskalakis, MIT
David Xiao, CNRS, Université Paris 7
Gustavo Bergantionos, Vigo
Hervé Moulin, Rice
Jason Hartline, Northwestern
Kobbi Nissim, Ben-Gurion University and CRCS/Harvard University
Nicole Immorlica, Microsoft Research
Tim Roughgarden, Stanford University
Yiling Chen, Harvard
There may be slots available for contributed presentations. If you are interested in giving a presentation, you may include an abstract and a link to a paper with your registration.
Participation in the workshop is open for all interested parties for a nominal fee. For more information and for registration, please visit the workshop homepage:
http://ctic.au.dk/workshops-conferences/ntmd-ii/
Med Venlig Hilsen / Kind Regards
Dorthe Haagen Nielsen, MA
Department of Computer Science
Aabogade 34
DK-8200 Aarhus N.
Phone +45 8715 5576
Fax +45 8942 5601
www.cs.au.dk
**********************************************************
*
* 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] LAST CALL FOR PAPERS - conference "Complex Systems Design & Management" 2013
---------------------------------------------------------------------------
LAST CALL FOR PAPERS - 4th INTERNATIONAL CONFERENCE ON COMPLEX SYSTEMS
DESIGN & MANAGEMENT (CSD&M 2013)
December 4-6, 2013 – Cité internationale universitaire de Paris (France)
LAST CALL FOR PAPERS - 4th INTERNATIONAL CONFERENCE ON COMPLEX SYSTEMS
DESIGN & MANAGEMENT (CSD&M 2013)
December 4-6, 2013 – Cité internationale universitaire de Paris (France)
------------------------------------------------------------------------
Website: http://www.csdm2013.csdm.fr/
Call for Papers section: http://www.csdm2013.csdm.fr/-Call-for-paper-.html
Contact: contact@csdm.fr
------------------------------------------------------------------------
LAST CALL FOR PAPERS
The management of large-scale complex industrial systems has a considerable
strategic importance for many enterprises in the world. This spawned
the relatively new academic field of "system architecture & engineering",
producing a body of research that allows engineers to manage the increasing
complexity of the technical systems they design. By its very nature,
this field is at the interface between industry and academia, and requires
its practitioners to be well versed in industrial application-related
as well as theoretical knowledge. The ambition of the CSD&M conference
is to be the meeting point for the industrial and academic environments
working in the design and management of complex industrial systems.
IMPORTANT DATES
• Abstract submission (optional) : April 7, 2013
• Paper submission deadline : April 21, 2013
• Results announcement : June 28, 2013
• Camera-ready paper deadline : July 31, 2013
• Conference : December 4-6, 2013
• Best papers awards : December 6, 2013
SUBMISSION PROCEDURE AND BEST PAPERS AWARDS
As the CSD&M conference is both industrial and academic, the papers' topics
could be industrial, academic or both in transverse.
Selected papers will be presented by their authors either on the format
of a 30-minute talk or as a poster during a special session.
The program committee is pleased to inform you of the following awards
for the best CSD&M 2013 papers in 2 categories : 1 prize of 2.000€ for
the best academic or/and industrial paper and 1 prize of 1.000€ for the best
student paper.
For more details, see http://www.csdm2013.csdm.fr/-Submission-.html
CONFERENCE TOPICS
• Industrial domains: Aeronautics & aerospace, Transport constructors &
operators, Defense &
security, Electronics & robotics, Energy & environment, Health & welfare
services, Media & communications, Software & e-services.
• Scientific and technical topics: Systems fundamentals, Systems modelling,
Systems architecture, Systems engineering, Industrial projects, Systems
metrics, Systems quality, Systemic tools.
• Systems types: Embedded systems, Transportation systems, Software systems,
Information systems, Systems of systems, Artificial eco-systems.
MORE DETAILS
More information can be found on the conference website:
http://www.csdm2013.csdm.fr
For any question or for unsubscribing from the mailing list, please email
to: contact@csdm.fr (with "remove" in email subject for unsubscription).
**********************************************************
*
* 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, April 9, 2013
APEX'13 - SUBMISSION SERVER IS NOW OPEN
International Workshop on Approximation, Parameterized and EXact
algorithms
APEX'2013
http://www.lamsade.dauphine.fr/apex2013
Satellite Workshop of ICALP 2013
July 6-7, 2013, Riga, Latvia
Call for papers
The APEX (Approximation, Parameterized and EXact algorithms) workshop is
supported by the French Agency of National Research (ANR) under the TODO
(Time versus Optimality in Discrete Optimization) ANR project
(http://todo.lamsade.dauphine.fr/). It aims at bringing together
researchers working on the design and analysis of algorithms (exact,
moderately exponential, approximation and low memory) for combinatorial
optimization problems.
Papers are solicited in all areas of approximation and exact algorithms,
including but not limited to:
- Exact and parameterized algorithms
- Moderately exponential and parameterized approximation algorithms -
Approximation, online and reoptimization algorithms
- Massive data computation
- Low memory and streaming algorithms
- Analysis and experimental evaluation of algorithms
The EasyChair system will be used for the abstracts submission. Abstracts
of 2-4 pages must be submitted via
https://www.easychair.org/conferences/?conf=apex13
using a pdf format. APEX submissions will undergo a selection process
based on a light refereeing by the Program Committee. APEX will not
publish proceedings. Hence, presenting your paper at APEX will not prevent
you from submitting it to journals or to other conferences. Similarly, it
is acceptable to submit a paper that has been presented at an earlier
conference. Submissions by PC members are allowed. Most talks will be 20
minutes long. Some submissions will be selected for 30 minutes talks.
APEX'2013 will be held in the University of Latvia, Riga, Latvia on July
6-7, 2013.
Invited speakers
Daniel Marx, Hungarian Academy of Sciences, Hungary
Maxim Sviridenko, University of Warwick, United Kingdom
Important Dates
Submission deadline: APRIL 22, 2013
Notification: MAY 20, 2013
Program Committee
Eric Angel, Université d'Evry Val d'Essone, France
Evripidis Bampis, Université Pierre et Marie Curie, France (Chair) Marc
Demange, ESSEC, France
Bruno Escoffier, Université Paris-Dauphine, France
Aristotelis Giannakos, Université de Picardie Jules Verne, France
Gregory Gutin, Royal Holloway University of London, United Kingdom Michael
R.Fellows, Charles Darwin University, Australia
Fedor V. Fomin, University of Bergen, Norway
Klaus Jansen, University of Kiel, Germany
Christian Laforest, Université Blaise Pascal (Clermont Ferrand), France
Stefano Leonardi, Università di Roma "La Sapienza", Italy
Ioannis Milis, Athens University of Economics and Business, Greece
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Christophe Paul, Université du Montpellier, France
Hadas Schachnai, Technion, Israel
Frits Spieksma, University of Leuven, Netherlands
Local Organizing Committee
Bruno Escoffier, Université Paris-Dauphine, France (Chair)
Katerina Kinta, Université Paris-Dauphine, France
Dimitrios Letsios, Université Pierre et Marie Curie, France
Giorgio Lucarelli, Université Pierre et Marie Curie, France
Cecile Murat, Université Paris-Dauphine, France
Eleni Paléologou, Université Paris-Dauphine, France
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Florian Sikora, Université Paris-Dauphine, France
--
Vangelis Th. Paschos
LAMSADE, CNRS UMR 7243, University Paris-Dauphine and IUF
phone: + 33 1 44 05 45 82
http://www.lamsade.dauphine.fr/~paschos
algorithms
APEX'2013
http://www.lamsade.dauphine.fr/apex2013
Satellite Workshop of ICALP 2013
July 6-7, 2013, Riga, Latvia
Call for papers
The APEX (Approximation, Parameterized and EXact algorithms) workshop is
supported by the French Agency of National Research (ANR) under the TODO
(Time versus Optimality in Discrete Optimization) ANR project
(http://todo.lamsade.dauphine.fr/). It aims at bringing together
researchers working on the design and analysis of algorithms (exact,
moderately exponential, approximation and low memory) for combinatorial
optimization problems.
Papers are solicited in all areas of approximation and exact algorithms,
including but not limited to:
- Exact and parameterized algorithms
- Moderately exponential and parameterized approximation algorithms -
Approximation, online and reoptimization algorithms
- Massive data computation
- Low memory and streaming algorithms
- Analysis and experimental evaluation of algorithms
The EasyChair system will be used for the abstracts submission. Abstracts
of 2-4 pages must be submitted via
https://www.easychair.org/conferences/?conf=apex13
using a pdf format. APEX submissions will undergo a selection process
based on a light refereeing by the Program Committee. APEX will not
publish proceedings. Hence, presenting your paper at APEX will not prevent
you from submitting it to journals or to other conferences. Similarly, it
is acceptable to submit a paper that has been presented at an earlier
conference. Submissions by PC members are allowed. Most talks will be 20
minutes long. Some submissions will be selected for 30 minutes talks.
APEX'2013 will be held in the University of Latvia, Riga, Latvia on July
6-7, 2013.
Invited speakers
Daniel Marx, Hungarian Academy of Sciences, Hungary
Maxim Sviridenko, University of Warwick, United Kingdom
Important Dates
Submission deadline: APRIL 22, 2013
Notification: MAY 20, 2013
Program Committee
Eric Angel, Université d'Evry Val d'Essone, France
Evripidis Bampis, Université Pierre et Marie Curie, France (Chair) Marc
Demange, ESSEC, France
Bruno Escoffier, Université Paris-Dauphine, France
Aristotelis Giannakos, Université de Picardie Jules Verne, France
Gregory Gutin, Royal Holloway University of London, United Kingdom Michael
R.Fellows, Charles Darwin University, Australia
Fedor V. Fomin, University of Bergen, Norway
Klaus Jansen, University of Kiel, Germany
Christian Laforest, Université Blaise Pascal (Clermont Ferrand), France
Stefano Leonardi, Università di Roma "La Sapienza", Italy
Ioannis Milis, Athens University of Economics and Business, Greece
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Christophe Paul, Université du Montpellier, France
Hadas Schachnai, Technion, Israel
Frits Spieksma, University of Leuven, Netherlands
Local Organizing Committee
Bruno Escoffier, Université Paris-Dauphine, France (Chair)
Katerina Kinta, Université Paris-Dauphine, France
Dimitrios Letsios, Université Pierre et Marie Curie, France
Giorgio Lucarelli, Université Pierre et Marie Curie, France
Cecile Murat, Université Paris-Dauphine, France
Eleni Paléologou, Université Paris-Dauphine, France
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Florian Sikora, Université Paris-Dauphine, France
--
Vangelis Th. Paschos
LAMSADE, CNRS UMR 7243, University Paris-Dauphine and IUF
phone: + 33 1 44 05 45 82
http://www.lamsade.dauphine.fr/~paschos
[DMANET] APEX'13 - SUBMISSION SERVER IS NOW OPEN
International Workshop on Approximation, Parameterized and EXact
algorithms
APEX'2013
http://www.lamsade.dauphine.fr/apex2013
Satellite Workshop of ICALP 2013
July 6-7, 2013, Riga, Latvia
Call for papers
The APEX (Approximation, Parameterized and EXact algorithms) workshop is
supported by the French Agency of National Research (ANR) under the TODO
(Time versus Optimality in Discrete Optimization) ANR project
(http://todo.lamsade.dauphine.fr/). It aims at bringing together
researchers working on the design and analysis of algorithms (exact,
moderately exponential, approximation and low memory) for combinatorial
optimization problems.
Papers are solicited in all areas of approximation and exact algorithms,
including but not limited to:
- Exact and parameterized algorithms
- Moderately exponential and parameterized approximation algorithms -
Approximation, online and reoptimization algorithms
- Massive data computation
- Low memory and streaming algorithms
- Analysis and experimental evaluation of algorithms
The EasyChair system will be used for the abstracts submission. Abstracts
of 2-4 pages must be submitted via
https://www.easychair.org/conferences/?conf=apex13
using a pdf format. APEX submissions will undergo a selection process
based on a light refereeing by the Program Committee. APEX will not
publish proceedings. Hence, presenting your paper at APEX will not prevent
you from submitting it to journals or to other conferences. Similarly, it
is acceptable to submit a paper that has been presented at an earlier
conference. Submissions by PC members are allowed. Most talks will be 20
minutes long. Some submissions will be selected for 30 minutes talks.
APEX'2013 will be held in the University of Latvia, Riga, Latvia on July
6-7, 2013.
Invited speakers
Daniel Marx, Hungarian Academy of Sciences, Hungary
Maxim Sviridenko, University of Warwick, United Kingdom
Important Dates
Submission deadline: APRIL 22, 2013
Notification: MAY 20, 2013
Program Committee
Eric Angel, Université d'Evry Val d'Essone, France
Evripidis Bampis, Université Pierre et Marie Curie, France (Chair) Marc
Demange, ESSEC, France
Bruno Escoffier, Université Paris-Dauphine, France
Aristotelis Giannakos, Université de Picardie Jules Verne, France
Gregory Gutin, Royal Holloway University of London, United Kingdom Michael
R.Fellows, Charles Darwin University, Australia
Fedor V. Fomin, University of Bergen, Norway
Klaus Jansen, University of Kiel, Germany
Christian Laforest, Université Blaise Pascal (Clermont Ferrand), France
Stefano Leonardi, Università di Roma "La Sapienza", Italy
Ioannis Milis, Athens University of Economics and Business, Greece
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Christophe Paul, Université du Montpellier, France
Hadas Schachnai, Technion, Israel
Frits Spieksma, University of Leuven, Netherlands
Local Organizing Committee
Bruno Escoffier, Université Paris-Dauphine, France (Chair)
Katerina Kinta, Université Paris-Dauphine, France
Dimitrios Letsios, Université Pierre et Marie Curie, France
Giorgio Lucarelli, Université Pierre et Marie Curie, France
Cecile Murat, Université Paris-Dauphine, France
Eleni Paléologou, Université Paris-Dauphine, France
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Florian Sikora, Université Paris-Dauphine, France
--
Vangelis Th. Paschos
LAMSADE, CNRS UMR 7243, University Paris-Dauphine and IUF
phone: + 33 1 44 05 45 82
http://www.lamsade.dauphine.fr/~paschos
**********************************************************
*
* 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/
*
**********************************************************
algorithms
APEX'2013
http://www.lamsade.dauphine.fr/apex2013
Satellite Workshop of ICALP 2013
July 6-7, 2013, Riga, Latvia
Call for papers
The APEX (Approximation, Parameterized and EXact algorithms) workshop is
supported by the French Agency of National Research (ANR) under the TODO
(Time versus Optimality in Discrete Optimization) ANR project
(http://todo.lamsade.dauphine.fr/). It aims at bringing together
researchers working on the design and analysis of algorithms (exact,
moderately exponential, approximation and low memory) for combinatorial
optimization problems.
Papers are solicited in all areas of approximation and exact algorithms,
including but not limited to:
- Exact and parameterized algorithms
- Moderately exponential and parameterized approximation algorithms -
Approximation, online and reoptimization algorithms
- Massive data computation
- Low memory and streaming algorithms
- Analysis and experimental evaluation of algorithms
The EasyChair system will be used for the abstracts submission. Abstracts
of 2-4 pages must be submitted via
https://www.easychair.org/conferences/?conf=apex13
using a pdf format. APEX submissions will undergo a selection process
based on a light refereeing by the Program Committee. APEX will not
publish proceedings. Hence, presenting your paper at APEX will not prevent
you from submitting it to journals or to other conferences. Similarly, it
is acceptable to submit a paper that has been presented at an earlier
conference. Submissions by PC members are allowed. Most talks will be 20
minutes long. Some submissions will be selected for 30 minutes talks.
APEX'2013 will be held in the University of Latvia, Riga, Latvia on July
6-7, 2013.
Invited speakers
Daniel Marx, Hungarian Academy of Sciences, Hungary
Maxim Sviridenko, University of Warwick, United Kingdom
Important Dates
Submission deadline: APRIL 22, 2013
Notification: MAY 20, 2013
Program Committee
Eric Angel, Université d'Evry Val d'Essone, France
Evripidis Bampis, Université Pierre et Marie Curie, France (Chair) Marc
Demange, ESSEC, France
Bruno Escoffier, Université Paris-Dauphine, France
Aristotelis Giannakos, Université de Picardie Jules Verne, France
Gregory Gutin, Royal Holloway University of London, United Kingdom Michael
R.Fellows, Charles Darwin University, Australia
Fedor V. Fomin, University of Bergen, Norway
Klaus Jansen, University of Kiel, Germany
Christian Laforest, Université Blaise Pascal (Clermont Ferrand), France
Stefano Leonardi, Università di Roma "La Sapienza", Italy
Ioannis Milis, Athens University of Economics and Business, Greece
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Christophe Paul, Université du Montpellier, France
Hadas Schachnai, Technion, Israel
Frits Spieksma, University of Leuven, Netherlands
Local Organizing Committee
Bruno Escoffier, Université Paris-Dauphine, France (Chair)
Katerina Kinta, Université Paris-Dauphine, France
Dimitrios Letsios, Université Pierre et Marie Curie, France
Giorgio Lucarelli, Université Pierre et Marie Curie, France
Cecile Murat, Université Paris-Dauphine, France
Eleni Paléologou, Université Paris-Dauphine, France
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Florian Sikora, Université Paris-Dauphine, France
--
Vangelis Th. Paschos
LAMSADE, CNRS UMR 7243, University Paris-Dauphine and IUF
phone: + 33 1 44 05 45 82
http://www.lamsade.dauphine.fr/~paschos
**********************************************************
*
* 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] MathSport International 2013 – Call for participation
======================================================
MathSport International 2013 – Call for participation
======================================================
The 4th International Conference on Mathematics and Sport
June 5 – 7 , 2013
Leuven, Belgium
http://www.mathsportinternational.com
======================================================
We invite you to participate in the 4th International Conference on Mathematics and Sport, which will be held from June 5-7, 2013 in Leuven (Belgium). The conference is a forum for researchers and practitioners working on topics in all areas where sports and mathematics meet. The term sport is interpreted liberally and includes games, gambling, and lotteries.
Announcements:
1) Registration is open, with an early registration deadline being April 12, 2013. (see http://www.mathsportinternational.com/registration.html)
2) We have blocked a number of rooms in various hotels in Leuven. The deadline for making reservations for these rooms is April 12, 2013. (see http://www.mathsportinternational.com/accommodation.html)
3) We have accepted more than 80 contributions. A list of regular and keynote talks is now available on our website (see http://www.mathsportinternational.com/program.html)
For further information, we refer to the conference website, or info@mathsportinternational.com
======================================================
Keynote speakers:
Prof. Dominique de Werra (Ecole Polytechnique Fédérale de Lausanne)
Prof. David Forrest (University of Salford)
Prof. Mark Glickman (Boston University)
======================================================
Venue:
Leuven is a university town located some 30 km to the east of Brussels. Leuven dates back to the 9th century and has a rich heritage with various historical buildings to be admired. Leuven also provides an excellent environment for relaxation in its numerous bars and restaurants. The Old Market, locally known as 'the largest pub of Europe', is known for its lively nightlife, and a large collection of the famous Belgian beers are served.
======================================================
Social events:
Discovering Leuven: a guided walk through the city center
Bar Quiz: a fine MathSport tradition
Conference dinner: at the Great Beguinage (UNESCO world heritage)
======================================================
Registration fee:
Early registration: 350 € (student: 230€)
All social events are included in the registration fee
======================================================
Scientific Committee:
Anthony Bedford (RMIT University), Ruud Koning (University of Groningen), David Percy (University of Salford), Ray Stefani (CSULB), Celso Ribeiro (Universidade Federal Fluminense), Liam Lenten (LaTrobe University), Dimitris Karlis (Athens University), Guillermo Duran (Universidad de Buenos Aires and Universidad de Chile), Joao Carlos Soares de Mello (Universidade Federal Fluminense), Michael Trick (Carnegie Mellon University), James Cochran (Louisiana Tech University), Ryuhei Miyashiro (Tokyo University of Agriculture and Technology), Ian McHale (University of Salford)
======================================================
Organizing Committee:
Dries Goossens (KU Leuven), Phil Scarf (University of Salford), Frits Spieksma (KU Leuven)
======================================================
**********************************************************
*
* 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/
*
**********************************************************
MathSport International 2013 – Call for participation
======================================================
The 4th International Conference on Mathematics and Sport
June 5 – 7 , 2013
Leuven, Belgium
http://www.mathsportinternational.com
======================================================
We invite you to participate in the 4th International Conference on Mathematics and Sport, which will be held from June 5-7, 2013 in Leuven (Belgium). The conference is a forum for researchers and practitioners working on topics in all areas where sports and mathematics meet. The term sport is interpreted liberally and includes games, gambling, and lotteries.
Announcements:
1) Registration is open, with an early registration deadline being April 12, 2013. (see http://www.mathsportinternational.com/registration.html)
2) We have blocked a number of rooms in various hotels in Leuven. The deadline for making reservations for these rooms is April 12, 2013. (see http://www.mathsportinternational.com/accommodation.html)
3) We have accepted more than 80 contributions. A list of regular and keynote talks is now available on our website (see http://www.mathsportinternational.com/program.html)
For further information, we refer to the conference website, or info@mathsportinternational.com
======================================================
Keynote speakers:
Prof. Dominique de Werra (Ecole Polytechnique Fédérale de Lausanne)
Prof. David Forrest (University of Salford)
Prof. Mark Glickman (Boston University)
======================================================
Venue:
Leuven is a university town located some 30 km to the east of Brussels. Leuven dates back to the 9th century and has a rich heritage with various historical buildings to be admired. Leuven also provides an excellent environment for relaxation in its numerous bars and restaurants. The Old Market, locally known as 'the largest pub of Europe', is known for its lively nightlife, and a large collection of the famous Belgian beers are served.
======================================================
Social events:
Discovering Leuven: a guided walk through the city center
Bar Quiz: a fine MathSport tradition
Conference dinner: at the Great Beguinage (UNESCO world heritage)
======================================================
Registration fee:
Early registration: 350 € (student: 230€)
All social events are included in the registration fee
======================================================
Scientific Committee:
Anthony Bedford (RMIT University), Ruud Koning (University of Groningen), David Percy (University of Salford), Ray Stefani (CSULB), Celso Ribeiro (Universidade Federal Fluminense), Liam Lenten (LaTrobe University), Dimitris Karlis (Athens University), Guillermo Duran (Universidad de Buenos Aires and Universidad de Chile), Joao Carlos Soares de Mello (Universidade Federal Fluminense), Michael Trick (Carnegie Mellon University), James Cochran (Louisiana Tech University), Ryuhei Miyashiro (Tokyo University of Agriculture and Technology), Ian McHale (University of Salford)
======================================================
Organizing Committee:
Dries Goossens (KU Leuven), Phil Scarf (University of Salford), Frits Spieksma (KU Leuven)
======================================================
**********************************************************
*
* 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] PhD positions in Computer Science - Gran Sasso Institute, L'Aquila, Italy
Dear Colleagues,
the Gran Sasso Science Institute (GSSI) is a center for advanced research and higher education in Computer Science, Mathematics and Physics, and recently established nearby L'Aquila (see http://www.gssi.infn.it/index.php/en/). Among its activities, GSSI will offer an international PhD school program, starting this fall. Professors, researchers and students from the above scientific areas will be selected worldwide, following the best international standards.
In view of that, please consider advertising among your best students this new opportunity to apply for a PhD program in Computer Science (http://www.gssi.infn.it/index.php/en/phd/computer-science). Successful students will receive a fellowship to cover all the expenses plus a stipend, and they will get the opportunity to carry on their studies in a stimulating international environment working with leading scientists in the field. Please notice that applicants should fill a pre-application form which can be found herehttp://www.gssi.infn.it/index.php/en/?option=com_rsform&formId=2.
What we provide to our PhD students can be found at
We thank you in advance for your help and support in advertising the program.
Best regards,
Michele Flammini
---------
Department of Computer Engineering, Computer Science, and Mathematics
University of L'Aquila
Italy
[DMANET] Vacancy: Associate Professors in Computer Science at Aarhus University
Associate Professors in Computer Science at Aarhus University
One or more positions as associate professor are available at the Department of Computer Science, Aarhus University (www.cs.au.dk) starting January 1, 2014.
The department has research groups within "Algorithms and Data Structures", "Data-Intensive Systems", "Cryptography and Security", "Mathematical Computer Science", "Logics and Semantics", "Ubiquitous Computing and Interaction", "Computer-Mediated Activity", "Use, Design and Innovation", "Programming Languages", "Computer Graphics and Image Processing" and "Bioinformatics". In addition, we want to build competences within "Software Engineering / Multicore/ Systems", "Machine Learning / Data Mining" and "Quantum Informatics".
Applicants are expected to have several years of experience at the assistant professor level. They must document a strong record of original research and have teaching experience at undergraduate/graduate level.
The department has a staff of 140 people including 28 full and associate professors, 5 assistant professors, 25 PostDocs and 65 PhD students. The number of students is approximately 1,000.
Further information can be obtained from head of department Kurt Jensen (kjensen@cs.au.dk) or vice head of research Mogens Nielsen (mn@cs.au.dk).
Please apply online at http://www.au.dk/en/job/nat/academicpositions/ before August 15, 2013.
Venlig hilsen / Best regards
Jan Frederiksen
Personnel & Communication Manager
Department of Computer Science
Aarhus University
IT-Parken, Aabogade 34
DK-8200 Aarhus N
Phone: 8716 5459
Mail: janfre@cs.au.dk
Office: Nygaard-314
**********************************************************
*
* 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/
*
**********************************************************
One or more positions as associate professor are available at the Department of Computer Science, Aarhus University (www.cs.au.dk) starting January 1, 2014.
The department has research groups within "Algorithms and Data Structures", "Data-Intensive Systems", "Cryptography and Security", "Mathematical Computer Science", "Logics and Semantics", "Ubiquitous Computing and Interaction", "Computer-Mediated Activity", "Use, Design and Innovation", "Programming Languages", "Computer Graphics and Image Processing" and "Bioinformatics". In addition, we want to build competences within "Software Engineering / Multicore/ Systems", "Machine Learning / Data Mining" and "Quantum Informatics".
Applicants are expected to have several years of experience at the assistant professor level. They must document a strong record of original research and have teaching experience at undergraduate/graduate level.
The department has a staff of 140 people including 28 full and associate professors, 5 assistant professors, 25 PostDocs and 65 PhD students. The number of students is approximately 1,000.
Further information can be obtained from head of department Kurt Jensen (kjensen@cs.au.dk) or vice head of research Mogens Nielsen (mn@cs.au.dk).
Please apply online at http://www.au.dk/en/job/nat/academicpositions/ before August 15, 2013.
Venlig hilsen / Best regards
Jan Frederiksen
Personnel & Communication Manager
Department of Computer Science
Aarhus University
IT-Parken, Aabogade 34
DK-8200 Aarhus N
Phone: 8716 5459
Mail: janfre@cs.au.dk
Office: Nygaard-314
**********************************************************
*
* 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] IJRIE-Call for Paper (Vol. 2, No. 2, June 2013)
CALL FOR Paper
Call for Paper of the International Journal of Research in industrial
Engineering (IJRIE).
Greetings and call for paper for Vol. 2, No.2.
International Journal of Research in Industrial Engineering
ISSN: 1925-7805; E-ISSN: 1925-7813
Publisher: Novel Science Inc.
Submissions open for Volume 2, Number 2, June 2013.
Dear researchers
Let me introduce about IJRIE. International Journal of Research in
Industrial Engineering (IJRIE) is an international academic online
journal which publishes global research in the areas of Industrial
Engineering. The journal provides a forum for dispersion of research
and review articles related to all fields of Industrial Engineering.
With an open access publication model of this journal, all interested
readers around the world can freely access articles online without
subscription.
Submitted papers will be reviewed by technical committees of the
journal and association. All submitted articles should report
original, previously unpublished research results, experimental or
theoretical, and will be peer-reviewed. Articles submitted to the
journal should meet these criteria and must not be under consideration
for publication elsewhere. Manuscripts should follow the style of the
journal and are subject to both review and editing.
Frequency: 4 Number per year
Status: published Online
Subject Category: All aspects of Industrial Engineering
The journal provides relevant theoretical frameworks and the latest
empirical research findings in the areas of (not limited to):
Supply Chain Management & Logistic Risk Management
Operations Research Reliability & Maintenance
Manufacturing Systems Project management
Flexible Manufacturing System Application of meta-heuristics
Production Planning & Management Strategic management
Knowledge Management Data Mining
Project Control Scheduling
Mathematical Modeling Telecommunications
Network management Human resources management
Economics Other Related Subject
Kindly Visit our website www.nvlscience.com/index.php/ijrie for more details.
(It is mandatory for authors to submit their papers via above
mentioned website address).
Final paper submission should be done at E-mail: ijrie.admin@nvlscienc.com
Reviewer Response should be done at E-mail: ijrie.editor@nvlscience.com
Any query response should be done at E-mail: ijrie.info@nvlscience.com
We are looking forward to receiving quality submissions from you and
your colleagues in near future.
Please consider forwarding this call for papers to the appropriate groups
or
individuals.
Best Regards
IJRIE Office
www.nvlscience.com/index.php/ijrie
**********************************************************
*
* 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 Paper of the International Journal of Research in industrial
Engineering (IJRIE).
Greetings and call for paper for Vol. 2, No.2.
International Journal of Research in Industrial Engineering
ISSN: 1925-7805; E-ISSN: 1925-7813
Publisher: Novel Science Inc.
Submissions open for Volume 2, Number 2, June 2013.
Dear researchers
Let me introduce about IJRIE. International Journal of Research in
Industrial Engineering (IJRIE) is an international academic online
journal which publishes global research in the areas of Industrial
Engineering. The journal provides a forum for dispersion of research
and review articles related to all fields of Industrial Engineering.
With an open access publication model of this journal, all interested
readers around the world can freely access articles online without
subscription.
Submitted papers will be reviewed by technical committees of the
journal and association. All submitted articles should report
original, previously unpublished research results, experimental or
theoretical, and will be peer-reviewed. Articles submitted to the
journal should meet these criteria and must not be under consideration
for publication elsewhere. Manuscripts should follow the style of the
journal and are subject to both review and editing.
Frequency: 4 Number per year
Status: published Online
Subject Category: All aspects of Industrial Engineering
The journal provides relevant theoretical frameworks and the latest
empirical research findings in the areas of (not limited to):
Supply Chain Management & Logistic Risk Management
Operations Research Reliability & Maintenance
Manufacturing Systems Project management
Flexible Manufacturing System Application of meta-heuristics
Production Planning & Management Strategic management
Knowledge Management Data Mining
Project Control Scheduling
Mathematical Modeling Telecommunications
Network management Human resources management
Economics Other Related Subject
Kindly Visit our website www.nvlscience.com/index.php/ijrie for more details.
(It is mandatory for authors to submit their papers via above
mentioned website address).
Final paper submission should be done at E-mail: ijrie.admin@nvlscienc.com
Reviewer Response should be done at E-mail: ijrie.editor@nvlscience.com
Any query response should be done at E-mail: ijrie.info@nvlscience.com
We are looking forward to receiving quality submissions from you and
your colleagues in near future.
Please consider forwarding this call for papers to the appropriate groups
or
individuals.
Best Regards
IJRIE Office
www.nvlscience.com/index.php/ijrie
**********************************************************
*
* 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, April 8, 2013
[DMANET] Last Mile: SENSORCOMM 2013 || August 25 - 31, 2013 - Barcelona, Spain
INVITATION:
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to SENSORCOMM 2013.
The submission deadline has been extended to April 19, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== SENSORCOMM 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
SENSORCOMM 2013, The Seventh International Conference on Sensor Technologies and Applications
August 25 - 31, 2013 - Barcelona, Spain
General page: http://www.iaria.org/conferences2013/SENSORCOMM13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPSENSORCOMM13.html
- regular papers
- short papers (work in progress)
- posters
- ideas
Submission page: http://www.iaria.org/conferences2013/SubmitSENSORCOMM13.html
Submission deadline: April 19, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
SENSORCOMM 2013 Topics (topics and submission details: see CfP on the site)
APASN: Architectures, protocols and algorithms of sensor networks
Network planning, provisioning and deployment; Network Architectures for Sensor Networks; Network Protocols for Sensor Networks; Structural design; Distributed Sensor Networks; Dynamic sensor networks; Scalable and heterogeneous architectures; Hierarchical clustering architectures; Group-based Architectures; Network topologies; Mesh networking; Device centric sensor networks; Distributed coordination algorithms; Topology construction; Routing protocols; Routing Metrics; Distributed Algorithms; Attribute-based named nets; Mobility and Scalability; Attribute-based named Sensor Networks; Query optimization; Self-organization and self-configuration algorithms; Reconfigurability; Time Synchronization; MAC protocols for sensor networks (801.11, 802.15.4, UWB, etc); Location and time service; Integration with other systems; Distributed inference and fusion; Cross-layer design and optimization; Complexity analysis of algorithms; Sensor networks and the Web; Integration with other!
systems (e.g., Web-based informati
on systems, process control, enterprise software, etc.); Target tracking; RFID tags; Traffic scheduling
MECSN: Energy, management and control of sensor networks
Energy models; Energy optimization; Energy management; Power-aware and energy-efficient design; Power sources in sensor networks; Battery technology; Power management; Algorithms and theories for management; Communication strategies for topology control; Algorithms and theories for supervisory control; Sensor tasking and control; Distributed control and actuation; Location and mobility management; Bandwidth management; Distributed networked sensing; Resource provisioning; Resource management and dynamic resource management; Schemes to maximize accuracy and minimize false alarms; Online self-calibration and self-testing; Handoff and mobility management and seamless internetworking; Distributed actuation and control; Topology control
RASQOFT: Resource allocation, services, QoS and fault tolerance in sensor networks
Algorithms to support quality of service in sensor networks; Protocols to support quality of service in sensor networks; QoS/SLA in sensor networks; Provisioning of QoS in terms of bandwidth and delay assurance; System services and distributed services in sensor networks; Delay tolerant networks and opportunistic networking; Failure resilience and fault isolation; Information assurance in sensor networks; Fault tolerance and reliability; Admission control; Resource allocation and fairness; Real-time resource scheduling; Scheduling and optimisation; Capacity planning
PESMOSN: Performance, simulation and modelling of sensor networks
Performance measurement of sensor networks; Performance evaluation and analysis of sensor networks; Performance comparison on capacity, coverage and connectivity; Modelling techniques of sensor networks; Validation of sensor network architectures; Simulation and theoretical analysis; Simulation software tools and environments; Theoretical performance analysis: complexity, correctness and scalability; Design, simulation and optimization tools for deployment and operation; Platform modelling and analysis tools; Analytical, mobility and validation models; System debugging and testing
SEMOSN: Security and monitoring of sensor networks
Security and privacy in sensor networks; Reliability aspects in sensor networks; Monitoring distributed sensor networks; Mechanisms for authentication; Secure communication in sensor networks; Encryption algorithms for sensor networks; Sensor secure management; Data integrity; Trustworthiness issues in sensor networks; Trade-off analysis
SECSED: Sensor circuits and sensor devices
Methods for sensor deployment; Instrumentation and models for deployment of sensors networks; Sensor architecture; Abstractions for modular design; Design and deployment of embedded system platforms; Embedded architectures and tools; Embedded processors; Embedded chip design; Micro and Nano devices; Biosensors; Optical sensors; Smart sensors; Acoustic Sensors; Microwave sensors; Middleware design; Sensor Prototypes; Sensor node components; Sensor interfaces; Actuators; Independent Component Analysis; Design of cost effective and economical sensors; Smart Material Applications to design sensors; Microfabrication Technologies for Microsystem Integration; Integration of sensors into engineered systems; Hardware platforms; Test-beds incorporating multiple sensors; Operating system and middleware support
RIWISN: Radio issues in wireless sensor networks
Wireless Sensor Communications; Network connectivity & longevity; Tracking objects; Geo-location problems; Network coverage; Algorithms for sensor localization and tracking; Detection, classification and estimation; Physical layer impact on higher level protocols; Directional and smart antennas for sensor networks; Coverage maintenance; Transceiver and antenna design; Ubiquitous wireless connectivity
SAPSN: Software, applications and programming of sensor networks
Applications and demonstrations of sensor networks; Software platforms and development tools; Architectural design and optimization tools for sensor nodes; Computation and programming models of sensor networks; Languages and operating systems of Sensors; Programming and Interfacing; Programming abstraction; Programming models for sensors; Programming methodology for sensor environments; Intelligent sensor theory and applications; Machine learning applications to sensor networks; Wireless sensor applications; Applications for sensor network management; Software tools for chip programming; Application requirements; Application evaluation and comparison; Demos and prototype testing
DAIPSN: Data allocation and information in sensor networks
Techniques for the interpretation and use of sensor data in decision-making processes; Distributed data processing; Distributed signal processing; Array signal processing; Statistical signal processing; Distributed query processing; Distributed information processing; Distributed algorithms for collaborative information and signal processing; Task allocation, reprogramming and reconfiguration; Coding and information theory; In-network processing and aggregation; Data analysis and visualisation; Data storage in sensor networks; Data retrieval; Data dissemination; Data compression and aggregation; Data transport in wireless sensor networks; Data gathering and fusion in wireless sensor networks; Theories and models on fundamental information and communication aspects of sensor networks; Redundancy
DISN: Deployments and implementations of sensor networks
Methods for sensor networks deployment; Practical implementations and real-world experiences; Real-life deployments; System implementation; End-user aspects; Operational experience and test-beds; Industrial and commercial developments and applications; Measurements from experimental systems, test-beds and demonstrations; Intelligent sensors, body sensors and their utilisation; Analysis of real-world systems and fundamental limits; Smart Sensors for building surveillance; Sensing in health care; Games using sensor networks; Peer-to-peer, overlay, and content distribution wireless sensor networks; Use cases (e.g., Automotive, Battlefield, Defense, Construction, Disaster recovery, Environmental, Medical, Security, Biomedical, Unmanned Aerial Vehicles, etc.); Sensor networks for Rural and Agricultural environments; Sensors for railway systems; Pattern Recognition; Machine Intelligence; Sensor-equipped Smart Environment; Deployments in Harsh Environments; Potential application!
areas
UNWAT: Under water sensors and systems
Protocols for underwater sensor networks; Underwater hardware; Underwater wired systems; Underwater wireless sensor networks; Underwater sensors for neutrino telescopes; Acoustic and radio underwater communication; Aquatic environments and applications; Unmanned underwater exploration; Underwater localization and knowledge acquisition; Scalable underwater monitoring and measurement systems; Fixed and mobile underwater wireless sensors; Aquatic surveillance applications; QoS/Performance in underwater communication; Surface-floating and underwater sensor communication; Access control in underwater networks; Latency effects for critical applications and synchronization; Synchronization and delays in underwater sensor networks; Localization in underwater sensor networks; Advanced underwater sensor-based applications
ENOPT: Energy optimization in wireless sensor networks
Energy supply, lifetime and transmission power; Energy efficiency; State-driven energy optimization; Power consumption models; Energy-aware adaptive low power; Optimal energy-aware clustering; Lifetime-oriented energy provisioning; Sensor placement and accessibility; Random sensor deployment and density function; Fixed and adjustable transmission power; Traffic and energy consumption rate; Energy-efficient topology control; Energy optimization in multi-hop communications; Energy harvesting for autonomous sensors
----------------------------
Committee: http://www.iaria.org/conferences2013/ComSENSORCOMM13.html
================================================
**********************************************************
*
* 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/
*
**********************************************************
=================
Please consider to contribute to and/or forward to the appropriate groups the following opportunity to submit and publish original scientific results to SENSORCOMM 2013.
The submission deadline has been extended to April 19, 2013.
Authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals: http://www.iariajournals.org
=================
============== SENSORCOMM 2013 | Call for Papers ===============
CALL FOR PAPERS, TUTORIALS, PANELS
SENSORCOMM 2013, The Seventh International Conference on Sensor Technologies and Applications
August 25 - 31, 2013 - Barcelona, Spain
General page: http://www.iaria.org/conferences2013/SENSORCOMM13.html
Call for Papers: http://www.iaria.org/conferences2013/CfPSENSORCOMM13.html
- regular papers
- short papers (work in progress)
- posters
- ideas
Submission page: http://www.iaria.org/conferences2013/SubmitSENSORCOMM13.html
Submission deadline: April 19, 2013
Sponsored by IARIA, www.iaria.org
Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org
Print proceedings will be available via Curran Associates, Inc.: http://www.proceedings.com/9769.html
Articles will be archived in the free access ThinkMind Digital Library: http://www.thinkmind.org
Please note the Poster and Work in Progress options.
The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards, implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete unpublished papers, which are not under review in any other conference or journal in the following, but not limited to, topic areas.
All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress, Technical/marketing/business presentations, Demos, Tutorials, and Panels.
Before submission, please check and comply with the Editorial rules: http://www.iaria.org/editorialrules.html
SENSORCOMM 2013 Topics (topics and submission details: see CfP on the site)
APASN: Architectures, protocols and algorithms of sensor networks
Network planning, provisioning and deployment; Network Architectures for Sensor Networks; Network Protocols for Sensor Networks; Structural design; Distributed Sensor Networks; Dynamic sensor networks; Scalable and heterogeneous architectures; Hierarchical clustering architectures; Group-based Architectures; Network topologies; Mesh networking; Device centric sensor networks; Distributed coordination algorithms; Topology construction; Routing protocols; Routing Metrics; Distributed Algorithms; Attribute-based named nets; Mobility and Scalability; Attribute-based named Sensor Networks; Query optimization; Self-organization and self-configuration algorithms; Reconfigurability; Time Synchronization; MAC protocols for sensor networks (801.11, 802.15.4, UWB, etc); Location and time service; Integration with other systems; Distributed inference and fusion; Cross-layer design and optimization; Complexity analysis of algorithms; Sensor networks and the Web; Integration with other!
systems (e.g., Web-based informati
on systems, process control, enterprise software, etc.); Target tracking; RFID tags; Traffic scheduling
MECSN: Energy, management and control of sensor networks
Energy models; Energy optimization; Energy management; Power-aware and energy-efficient design; Power sources in sensor networks; Battery technology; Power management; Algorithms and theories for management; Communication strategies for topology control; Algorithms and theories for supervisory control; Sensor tasking and control; Distributed control and actuation; Location and mobility management; Bandwidth management; Distributed networked sensing; Resource provisioning; Resource management and dynamic resource management; Schemes to maximize accuracy and minimize false alarms; Online self-calibration and self-testing; Handoff and mobility management and seamless internetworking; Distributed actuation and control; Topology control
RASQOFT: Resource allocation, services, QoS and fault tolerance in sensor networks
Algorithms to support quality of service in sensor networks; Protocols to support quality of service in sensor networks; QoS/SLA in sensor networks; Provisioning of QoS in terms of bandwidth and delay assurance; System services and distributed services in sensor networks; Delay tolerant networks and opportunistic networking; Failure resilience and fault isolation; Information assurance in sensor networks; Fault tolerance and reliability; Admission control; Resource allocation and fairness; Real-time resource scheduling; Scheduling and optimisation; Capacity planning
PESMOSN: Performance, simulation and modelling of sensor networks
Performance measurement of sensor networks; Performance evaluation and analysis of sensor networks; Performance comparison on capacity, coverage and connectivity; Modelling techniques of sensor networks; Validation of sensor network architectures; Simulation and theoretical analysis; Simulation software tools and environments; Theoretical performance analysis: complexity, correctness and scalability; Design, simulation and optimization tools for deployment and operation; Platform modelling and analysis tools; Analytical, mobility and validation models; System debugging and testing
SEMOSN: Security and monitoring of sensor networks
Security and privacy in sensor networks; Reliability aspects in sensor networks; Monitoring distributed sensor networks; Mechanisms for authentication; Secure communication in sensor networks; Encryption algorithms for sensor networks; Sensor secure management; Data integrity; Trustworthiness issues in sensor networks; Trade-off analysis
SECSED: Sensor circuits and sensor devices
Methods for sensor deployment; Instrumentation and models for deployment of sensors networks; Sensor architecture; Abstractions for modular design; Design and deployment of embedded system platforms; Embedded architectures and tools; Embedded processors; Embedded chip design; Micro and Nano devices; Biosensors; Optical sensors; Smart sensors; Acoustic Sensors; Microwave sensors; Middleware design; Sensor Prototypes; Sensor node components; Sensor interfaces; Actuators; Independent Component Analysis; Design of cost effective and economical sensors; Smart Material Applications to design sensors; Microfabrication Technologies for Microsystem Integration; Integration of sensors into engineered systems; Hardware platforms; Test-beds incorporating multiple sensors; Operating system and middleware support
RIWISN: Radio issues in wireless sensor networks
Wireless Sensor Communications; Network connectivity & longevity; Tracking objects; Geo-location problems; Network coverage; Algorithms for sensor localization and tracking; Detection, classification and estimation; Physical layer impact on higher level protocols; Directional and smart antennas for sensor networks; Coverage maintenance; Transceiver and antenna design; Ubiquitous wireless connectivity
SAPSN: Software, applications and programming of sensor networks
Applications and demonstrations of sensor networks; Software platforms and development tools; Architectural design and optimization tools for sensor nodes; Computation and programming models of sensor networks; Languages and operating systems of Sensors; Programming and Interfacing; Programming abstraction; Programming models for sensors; Programming methodology for sensor environments; Intelligent sensor theory and applications; Machine learning applications to sensor networks; Wireless sensor applications; Applications for sensor network management; Software tools for chip programming; Application requirements; Application evaluation and comparison; Demos and prototype testing
DAIPSN: Data allocation and information in sensor networks
Techniques for the interpretation and use of sensor data in decision-making processes; Distributed data processing; Distributed signal processing; Array signal processing; Statistical signal processing; Distributed query processing; Distributed information processing; Distributed algorithms for collaborative information and signal processing; Task allocation, reprogramming and reconfiguration; Coding and information theory; In-network processing and aggregation; Data analysis and visualisation; Data storage in sensor networks; Data retrieval; Data dissemination; Data compression and aggregation; Data transport in wireless sensor networks; Data gathering and fusion in wireless sensor networks; Theories and models on fundamental information and communication aspects of sensor networks; Redundancy
DISN: Deployments and implementations of sensor networks
Methods for sensor networks deployment; Practical implementations and real-world experiences; Real-life deployments; System implementation; End-user aspects; Operational experience and test-beds; Industrial and commercial developments and applications; Measurements from experimental systems, test-beds and demonstrations; Intelligent sensors, body sensors and their utilisation; Analysis of real-world systems and fundamental limits; Smart Sensors for building surveillance; Sensing in health care; Games using sensor networks; Peer-to-peer, overlay, and content distribution wireless sensor networks; Use cases (e.g., Automotive, Battlefield, Defense, Construction, Disaster recovery, Environmental, Medical, Security, Biomedical, Unmanned Aerial Vehicles, etc.); Sensor networks for Rural and Agricultural environments; Sensors for railway systems; Pattern Recognition; Machine Intelligence; Sensor-equipped Smart Environment; Deployments in Harsh Environments; Potential application!
areas
UNWAT: Under water sensors and systems
Protocols for underwater sensor networks; Underwater hardware; Underwater wired systems; Underwater wireless sensor networks; Underwater sensors for neutrino telescopes; Acoustic and radio underwater communication; Aquatic environments and applications; Unmanned underwater exploration; Underwater localization and knowledge acquisition; Scalable underwater monitoring and measurement systems; Fixed and mobile underwater wireless sensors; Aquatic surveillance applications; QoS/Performance in underwater communication; Surface-floating and underwater sensor communication; Access control in underwater networks; Latency effects for critical applications and synchronization; Synchronization and delays in underwater sensor networks; Localization in underwater sensor networks; Advanced underwater sensor-based applications
ENOPT: Energy optimization in wireless sensor networks
Energy supply, lifetime and transmission power; Energy efficiency; State-driven energy optimization; Power consumption models; Energy-aware adaptive low power; Optimal energy-aware clustering; Lifetime-oriented energy provisioning; Sensor placement and accessibility; Random sensor deployment and density function; Fixed and adjustable transmission power; Traffic and energy consumption rate; Energy-efficient topology control; Energy optimization in multi-hop communications; Energy harvesting for autonomous sensors
----------------------------
Committee: http://www.iaria.org/conferences2013/ComSENSORCOMM13.html
================================================
**********************************************************
*
* 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] Approx and Random 2013 - Call for Papers
APPROX 2013 and RANDOM 2013
16th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2013
17th Intl. Workshop on Randomization and Computation - RANDOM 2013
http://cui.unige.ch/tcs/random-approx/
Aug. 21-23, 2013
Berkeley
Call for papers
IMPORTANT DATES
Submission deadline: April 17, 17:00 PDT
Notifications: June 11
Camera ready: June 18
SCOPE
The 16th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2013), and the 17th.
International Workshop on Randomization and Computation (RANDOM'2013)
will be held in 21-23 August 2013 at Berkeley.
APPROX'2013 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2013 focuses on
applications of randomness to computational and combinatorial problems.
RANDOM'2013 is the seventeenth workshop in the series; APPROX'2013 is
the sixteenth in the series.
TOPICS
Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:
APPROX
" design and analysis of approximation algorithms
" hardness of approximation
" small space, sub-linear time and streaming algorithms
" embeddings and metric space methods
" mathematical programming methods
" combinatorial problems in graphs and networks
" game theory, markets, and economic applications
" geometric problems
" packing, covering, and scheduling
" approximate learning
" other applications
RANDOM
" design and analysis of randomized algorithms
" randomized complexity theory
" pseudorandomness and derandomization
" random combinatorial structures
" random walks/Markov chains
" expander graphs and randomness extractors
" probabilistic proof systems
" random projections and embeddings
" error-correcting codes
" average-case analysis
" property testing
" computational learning theory
SUBMISSIONS
Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx13
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random13
Note: You will be asked to login using an EasyChair account. Directions
on how to register for such an account are available at the submission
servers (you may also have an old account from a previous conference
submission).
The submission must be received by 17:00 (PDT) of April 17 for your
submission to be considered.
Abstract Format: Authors should submit an extended abstract (not a full
paper). An abstract should start with the title of the paper, each
author's name, affiliation, and e-mail address, followed by a
one-paragraph summary of the results to be presented. This should then
be followed by a technical exposition of the main ideas and techniques
used to achieve these results including motivation and a clear
comparison with related work.
The abstract should not exceed 10 single-spaced pages on letter-size
paper, using reasonable margins and at least 11-point font (not
including the references). If the authors believe that more details are
essential to substantiate the main claims of the paper, they may include
a clearly marked appendix that will be read at the discretion of the
program committee.
Simultaneous submission
Simultaneous submission to other conferences with published proceedings
is not allowed.
PROCEEDINGS
Proceedings will be published in the Springer-Verlag series Lecture
Notes in Computer Science.
Previous proceedings of APPROX appeared as LNCS 1444, 1671, 1913, 2129,
2462, 2764, 3122, 3624, 4110 and 4627 while previous proceedings of
RANDOM appeared as LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624,
4110, 4627 and as Proceedings in Informatics 8.
PROGRAM COMMITTEES
Approx
Nikhil Bansal - Eindhoven University
Chandra Chekuri - UIUC
Eden Chlamtac - Ben Gurion University
Nikhil Devanur - Microsoft Research
Uriel Feige - Weizmann Institute
Claire Mathieu - Brown University
Ankur Moitra - Institute of Advanced Study
Seffi Naor - Technion University
Yuval Rabani - Hebrew University
Prasad Raghavendra - University of California, Berkeley (Chair)
Roy Schwartz - Microsoft Research
Mohit Singh - Microsoft Research
Ola Svensson - EPFL
Mohammad Taghi Hajiaghayi - University of Maryland, College Park
Madhur Tulsiani - TTI Chicago
Rico Zenklusen - John Hopkins University
Random
Amit Chakrabarti - Dartmouth College
Nikolaos Fountoulakis - University of Birmingham
Ariel Gabizon - Technion
Parikshit Gopalan - Microsoft Research, Silicon Valley
Dan Gutfreund - IBM Research, Haifa
Prahladh Harsha - Tata Institute of Fundamental Research, India
Tomas Hayes - University of New Mexico
Michael Krivelevich - Tel Aviv University
Shachar Lovett - UCSD
Russell Martin - University of Liverpool
Dieter van Melkebeek - University of Wisconsin--Madison
Sofya Raskhodnikova - Pennsylvania State University (Chair)
Shubhangi Saraf - Rutgers University
Christian Sohler - TU Dortmund University
David P. Woodruff - IBM Research, Almaden
Amir Yehudayoff - Technion
Program Chairs
APPROX
Prasad Raghavendra - University of California, Berkeley
email: prasad@cs.berkeley.edu
RANDOM
Sofya Raskhodnikova - Pennsylvania State University
email:sofya@cse.psu.edu
Workshop Chairs
José Rolim, U. of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen, U. of Kiel
e-mail: kj@informatik.uni-kiel.de
CONFERENCE WEB PAGE
http://cui.unige.ch/tcs/random-approx/
**********************************************************
*
* 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/
*
**********************************************************
CALCO Tools 2013: Deadline Extension
CALL FOR PAPERS: CALCO Tools 2013
--> DEADLINE EXTENSION
5th International Conference on Algebra and Coalgebra in Computer Science,
Tools Workshop
September 3 - 6, 2013
Warsaw, Poland
http://coalg.org/calco13/workshops.html#tools
=========================================================================
Paper submission (extended): April 15, 2013
Author notification: May 13, 2013
Final version due: June 3, 2013
=========================================================================
-- SCOPE --
CALCO aims to bring together researchers and practitioners with
interests in foundational aspects, and both traditional and emerging
uses of algebra and coalgebra in computer science. It is a high-level,
bi-annual conference formed by joining the forces and reputations of
CMCS (the International Workshop on Coalgebraic Methods in Computer
Science), and WADT (the Workshop on Algebraic Development
Techniques). Previous CALCO editions took place in Swansea (Wales,
2005), Bergen (Norway, 2007), Udine (Italy, 2009) and Winchester (UK,
2011). The fifth edition will be held in Warsaw, the capital of
Poland.
As part of CALCO, a workshop dedicated to tools based on algebraic
and/or coalgebraic principles, CALCO Tools, will be held alongside the
main conference. Papers of this workshop will be
included in the CALCO proceedings.
CALCO-Tools will take place on the same dates as the main CALCO
conference, with no overlap between the technical programmes of the
two events. Topics of interest include systems, prototypes, and tools
developed specifically for the design, checking, execution, and
verification of (co)algebraic specifications, but also tools targeting
different application domains while making core or interesting use of
(co)algebraic techniques.
Tool submissions should not exceed 5 pages in LNCS format. The
accepted tool papers will be included in the final proceedings of the
conference. The tools should be made available on the web at the time
of submission. Each submission will be evaluated by at least three
reviewers; one or more of the reviewers will be asked to download and
use the tool. At least one of the authors of each tool paper must
attend the conference to demo the tool. To submit a paper please visit
our easychair submission site at
https://www.easychair.org/conferences/?conf=calcotools2013
-- CALCO 2013 ORGANISING COMMITTEE --
Bartek Klin (University of Warsaw, Poland)
Andrzej Tarlecki (University of Warsaw, Poland)
-- LOCATION --
Warsaw, the capital of Poland, is a lively city with many historic
monuments and sights, but also with a thriving business district. It
is easily accessible via two airports: the main Chopin Airport, used by
most international carriers, and the recently open Warsaw Modlin
Airport (30 minutes away by rail), used by budget airlines.
-- CALCO Tools Dates --
Paper submission: April 8, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013
-- CALCO Tools Programme Committee --
Einar Broch Johnsen, University of Oslo, Norway
Mark Hills, CWI Amsterdam, The Netherlands
Barbara König, University of Duisburg-Essen, Germany
Dorel Lucanu, Alexandru Ioan Cuza University, Romania
Dominik Luecke, CWI Amsterdam, The Netherlands
Till Mossakowski, DFKI, Germany
Lutz Schröder, Friedrich-Alexander Universitat Erlangen-Nürnberg, Germany (chair)
Alexandra Silva, Radboud University Nijmegen and CWI Amsterdam, The Netherlands
-- FURTHER INFORMATION --
Queries related to submission, reviewing, and programme should be sent
to the workshop chair.
Queries related to the organisation should be emailed to
calco2013@mimuw.edu.pl
.
--> DEADLINE EXTENSION
5th International Conference on Algebra and Coalgebra in Computer Science,
Tools Workshop
September 3 - 6, 2013
Warsaw, Poland
http://coalg.org/calco13/workshops.html#tools
=========================================================================
Paper submission (extended): April 15, 2013
Author notification: May 13, 2013
Final version due: June 3, 2013
=========================================================================
-- SCOPE --
CALCO aims to bring together researchers and practitioners with
interests in foundational aspects, and both traditional and emerging
uses of algebra and coalgebra in computer science. It is a high-level,
bi-annual conference formed by joining the forces and reputations of
CMCS (the International Workshop on Coalgebraic Methods in Computer
Science), and WADT (the Workshop on Algebraic Development
Techniques). Previous CALCO editions took place in Swansea (Wales,
2005), Bergen (Norway, 2007), Udine (Italy, 2009) and Winchester (UK,
2011). The fifth edition will be held in Warsaw, the capital of
Poland.
As part of CALCO, a workshop dedicated to tools based on algebraic
and/or coalgebraic principles, CALCO Tools, will be held alongside the
main conference. Papers of this workshop will be
included in the CALCO proceedings.
CALCO-Tools will take place on the same dates as the main CALCO
conference, with no overlap between the technical programmes of the
two events. Topics of interest include systems, prototypes, and tools
developed specifically for the design, checking, execution, and
verification of (co)algebraic specifications, but also tools targeting
different application domains while making core or interesting use of
(co)algebraic techniques.
Tool submissions should not exceed 5 pages in LNCS format. The
accepted tool papers will be included in the final proceedings of the
conference. The tools should be made available on the web at the time
of submission. Each submission will be evaluated by at least three
reviewers; one or more of the reviewers will be asked to download and
use the tool. At least one of the authors of each tool paper must
attend the conference to demo the tool. To submit a paper please visit
our easychair submission site at
https://www.easychair.org/conferences/?conf=calcotools2013
-- CALCO 2013 ORGANISING COMMITTEE --
Bartek Klin (University of Warsaw, Poland)
Andrzej Tarlecki (University of Warsaw, Poland)
-- LOCATION --
Warsaw, the capital of Poland, is a lively city with many historic
monuments and sights, but also with a thriving business district. It
is easily accessible via two airports: the main Chopin Airport, used by
most international carriers, and the recently open Warsaw Modlin
Airport (30 minutes away by rail), used by budget airlines.
-- CALCO Tools Dates --
Paper submission: April 8, 2013
Author notification: May 6, 2013
Final version due: June 3, 2013
-- CALCO Tools Programme Committee --
Einar Broch Johnsen, University of Oslo, Norway
Mark Hills, CWI Amsterdam, The Netherlands
Barbara König, University of Duisburg-Essen, Germany
Dorel Lucanu, Alexandru Ioan Cuza University, Romania
Dominik Luecke, CWI Amsterdam, The Netherlands
Till Mossakowski, DFKI, Germany
Lutz Schröder, Friedrich-Alexander Universitat Erlangen-Nürnberg, Germany (chair)
Alexandra Silva, Radboud University Nijmegen and CWI Amsterdam, The Netherlands
-- FURTHER INFORMATION --
Queries related to submission, reviewing, and programme should be sent
to the workshop chair.
Queries related to the organisation should be emailed to
calco2013@mimuw.edu.pl
.
[DMANET] SAGT 2013 - Second Call for Papers
[Apologies for multiple copies]
-------------------------------
6th INTERNATIONAL SYMPOSIUM ON ALGORITHMIC GAME THEORY
SAGT 2013
http://algo.rwth-aachen.de/sagt2013/
Aachen, October 21-23, 2013
--------------------------------------------------
IMPORTANT DATES
- Submission: May 22, 2013.
- Notification: July 17, 2013.
- Camera Ready: August 9, 2013.
--------------------------------------------------
The 6th International Symposium on Algorithmic Game Theory (SAGT) will
take place in Aachen, Germany, from October 21 to October 23. The
purpose of SAGT is to bring together researchers from Computer Science,
Economics, Physics, Biology and Mathematics to present and discuss
original research at the intersection of Algorithms and Game Theory.
SCOPE
----------------
The program of SAGT will include both invited lectures and
presentations for refereed submissions. Authors are invited to submit
previously unpublished work for possible presentation at the
conference. Foundational work is solicited on topics including but not
limited to:
- Solution Concepts in Game Theory
- Efficiency of Equilibria and Price of Anarchy
- Complexity Classes in Game Theory
- Computational Aspects of Equilibria
- Computational Aspects of Fixed-Point Theorems
- Repeated Games
- Evolution and Learning in Games
- Convergence of Dynamics
- Coalitions, Coordination and Collective Action
- Reputation, Recommendation and Trust Systems
- Network Games and Graph-Theoretic Aspects of Social Networks
- Cost-Sharing Algorithms and Analysis
- Algorithmic Mechanism Design
- Computing with Incentives
- Computational Social Choice
- Decision Theory, and Pricing
- Auction Algorithms and Analysis
- Economic Aspects of Distributed Computing
- Internet Economics and Computational Advertising
Industrial application works and position papers presenting novel
ideas, issues, challenges and directions are also welcome. It is
expected that accepted papers will be presented at the symposium by one
of the authors.
SUBMISSIONS
----------------
Submissions should take the form of an extended abstract of no more
than 12 pages (including title page and references) presenting original
research. They will be evaluated on significance, originality,
technical quality, and exposition.
The abstract must be prepared with Springer LNCS-style. If necessary,
the submission may be supplemented with a clearly marked appendix,
which will be reviewed at the discretion of the program committee.
The symposium proceedings shall be published by Springer in its LNCS
series. Accepted papers are presented in at most 12 pages. In order to
accommodate the publishing traditions of different fields, authors of
accepted papers can ask that only a one page abstract of the paper
appears in the proceedings, along with a URL pointing to the full paper.
This option is available to accommodate subsequent publication in
journals that would not consider results that have been published in
preliminary form in a conference proceedings.
Simultaneous submissions to another conference with published
proceedings is not allowed. Results previously published or presented
at another archival conference prior to SAGT, or published (or accepted
for publication) at a journal prior to the submission deadline, will
not be considered. Simultaneous submission of results to a journal is
allowed only if the author intends to publish the paper as a one page
abstract in SAGT'13. Papers that are accepted and appear as a one page
abstract can be subsequently submitted for publication in a journal but
may not be submitted to any other conference that has published
proceedings.
PROGRAM COMMITTEE
----------------
- Krzysztof R. Apt, CWI Amsterdam
- Moshe Babaioff, Microsoft Research Silicon Valley
- Felix Brandt, TU Munich
- Ioannis Caragiannis, U. Patras
- Shuchi Chawla, U. Wisconsin
- Georgius Christodoulou, Liverpool U.
- Xiaotie Deng, Liverpool U.
- Edith Elkind, NTU Singapore
- Amos Fiat, Tel Aviv U.
- Dimitris Fotakis, NTU Athens
- Tobias Harks, Maastricht U.
- Jochen Koenemann, U. Waterloo
- Annamaria Kovacs, Frankfurt U.
- Dov Monderer, Technion
- Luca Moscardelli, U. Pescara
- Noam Nisan, Hebrew U. Jerusalem and Microsoft Research Silicon Valley
- Michael Schapira, Hebrew U. Jerusalem
- Alexander Skopalik, Paderborn U.
- Berthold Vöcking, RWTH Aachen U. (chair)
STEERING COMMITTEE
----------------
- Elias Koutsoupias, U. Athens
- Marios Mavronicolas, U. Cyprus
- Dov Monderer, Technion
- Burkhard Monien, Paderborn U.
- Christos Papadimitriou, UC Berkeley
- Giuseppe Persiano, U. Salerno
- Paul Spirakis, U. Patras (chair)
- Berthold Vöcking, RWTH Aachen U.
ORGANIZING COMMITTEE
----------------
- Johannes Dams, RWTH Aachen U.
- Oliver Göbel, RWTH
- Martin Hoefer, Saarland U. and MPI (publicity chair)
- Rebecca Reiffenhäuser, RWTH
- Erika Schlebusch, RWTH
- Berthold Vöcking, RWTH (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/
*
**********************************************************
-------------------------------
6th INTERNATIONAL SYMPOSIUM ON ALGORITHMIC GAME THEORY
SAGT 2013
http://algo.rwth-aachen.de/sagt2013/
Aachen, October 21-23, 2013
--------------------------------------------------
IMPORTANT DATES
- Submission: May 22, 2013.
- Notification: July 17, 2013.
- Camera Ready: August 9, 2013.
--------------------------------------------------
The 6th International Symposium on Algorithmic Game Theory (SAGT) will
take place in Aachen, Germany, from October 21 to October 23. The
purpose of SAGT is to bring together researchers from Computer Science,
Economics, Physics, Biology and Mathematics to present and discuss
original research at the intersection of Algorithms and Game Theory.
SCOPE
----------------
The program of SAGT will include both invited lectures and
presentations for refereed submissions. Authors are invited to submit
previously unpublished work for possible presentation at the
conference. Foundational work is solicited on topics including but not
limited to:
- Solution Concepts in Game Theory
- Efficiency of Equilibria and Price of Anarchy
- Complexity Classes in Game Theory
- Computational Aspects of Equilibria
- Computational Aspects of Fixed-Point Theorems
- Repeated Games
- Evolution and Learning in Games
- Convergence of Dynamics
- Coalitions, Coordination and Collective Action
- Reputation, Recommendation and Trust Systems
- Network Games and Graph-Theoretic Aspects of Social Networks
- Cost-Sharing Algorithms and Analysis
- Algorithmic Mechanism Design
- Computing with Incentives
- Computational Social Choice
- Decision Theory, and Pricing
- Auction Algorithms and Analysis
- Economic Aspects of Distributed Computing
- Internet Economics and Computational Advertising
Industrial application works and position papers presenting novel
ideas, issues, challenges and directions are also welcome. It is
expected that accepted papers will be presented at the symposium by one
of the authors.
SUBMISSIONS
----------------
Submissions should take the form of an extended abstract of no more
than 12 pages (including title page and references) presenting original
research. They will be evaluated on significance, originality,
technical quality, and exposition.
The abstract must be prepared with Springer LNCS-style. If necessary,
the submission may be supplemented with a clearly marked appendix,
which will be reviewed at the discretion of the program committee.
The symposium proceedings shall be published by Springer in its LNCS
series. Accepted papers are presented in at most 12 pages. In order to
accommodate the publishing traditions of different fields, authors of
accepted papers can ask that only a one page abstract of the paper
appears in the proceedings, along with a URL pointing to the full paper.
This option is available to accommodate subsequent publication in
journals that would not consider results that have been published in
preliminary form in a conference proceedings.
Simultaneous submissions to another conference with published
proceedings is not allowed. Results previously published or presented
at another archival conference prior to SAGT, or published (or accepted
for publication) at a journal prior to the submission deadline, will
not be considered. Simultaneous submission of results to a journal is
allowed only if the author intends to publish the paper as a one page
abstract in SAGT'13. Papers that are accepted and appear as a one page
abstract can be subsequently submitted for publication in a journal but
may not be submitted to any other conference that has published
proceedings.
PROGRAM COMMITTEE
----------------
- Krzysztof R. Apt, CWI Amsterdam
- Moshe Babaioff, Microsoft Research Silicon Valley
- Felix Brandt, TU Munich
- Ioannis Caragiannis, U. Patras
- Shuchi Chawla, U. Wisconsin
- Georgius Christodoulou, Liverpool U.
- Xiaotie Deng, Liverpool U.
- Edith Elkind, NTU Singapore
- Amos Fiat, Tel Aviv U.
- Dimitris Fotakis, NTU Athens
- Tobias Harks, Maastricht U.
- Jochen Koenemann, U. Waterloo
- Annamaria Kovacs, Frankfurt U.
- Dov Monderer, Technion
- Luca Moscardelli, U. Pescara
- Noam Nisan, Hebrew U. Jerusalem and Microsoft Research Silicon Valley
- Michael Schapira, Hebrew U. Jerusalem
- Alexander Skopalik, Paderborn U.
- Berthold Vöcking, RWTH Aachen U. (chair)
STEERING COMMITTEE
----------------
- Elias Koutsoupias, U. Athens
- Marios Mavronicolas, U. Cyprus
- Dov Monderer, Technion
- Burkhard Monien, Paderborn U.
- Christos Papadimitriou, UC Berkeley
- Giuseppe Persiano, U. Salerno
- Paul Spirakis, U. Patras (chair)
- Berthold Vöcking, RWTH Aachen U.
ORGANIZING COMMITTEE
----------------
- Johannes Dams, RWTH Aachen U.
- Oliver Göbel, RWTH
- Martin Hoefer, Saarland U. and MPI (publicity chair)
- Rebecca Reiffenhäuser, RWTH
- Erika Schlebusch, RWTH
- Berthold Vöcking, RWTH (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/
*
**********************************************************
Approx and Random 2013 - Call for Papers
APPROX 2013 and RANDOM 2013
16th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2013
17th Intl. Workshop on Randomization and Computation - RANDOM 2013
http://cui.unige.ch/tcs/random-approx/
Aug. 21-23, 2013
Berkeley
Call for papers
IMPORTANT DATES
Submission deadline: April 17, 17:00 PDT
Notifications: June 11
Camera ready: June 18
SCOPE
The 16th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2013), and the 17th.
International Workshop on Randomization and Computation (RANDOM'2013)
will be held in 21-23 August 2013 at Berkeley.
APPROX'2013 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2013 focuses on
applications of randomness to computational and combinatorial problems.
RANDOM'2013 is the seventeenth workshop in the series; APPROX'2013 is
the sixteenth in the series.
TOPICS
Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:
APPROX
" design and analysis of approximation algorithms
" hardness of approximation
" small space, sub-linear time and streaming algorithms
" embeddings and metric space methods
" mathematical programming methods
" combinatorial problems in graphs and networks
" game theory, markets, and economic applications
" geometric problems
" packing, covering, and scheduling
" approximate learning
" other applications
RANDOM
" design and analysis of randomized algorithms
" randomized complexity theory
" pseudorandomness and derandomization
" random combinatorial structures
" random walks/Markov chains
" expander graphs and randomness extractors
" probabilistic proof systems
" random projections and embeddings
" error-correcting codes
" average-case analysis
" property testing
" computational learning theory
SUBMISSIONS
Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx13
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random13
Note: You will be asked to login using an EasyChair account. Directions
on how to register for such an account are available at the submission
servers (you may also have an old account from a previous conference
submission).
The submission must be received by 17:00 (PDT) of April 17 for your
submission to be considered.
Abstract Format: Authors should submit an extended abstract (not a full
paper). An abstract should start with the title of the paper, each
author's name, affiliation, and e-mail address, followed by a
one-paragraph summary of the results to be presented. This should then
be followed by a technical exposition of the main ideas and techniques
used to achieve these results including motivation and a clear
comparison with related work.
The abstract should not exceed 10 single-spaced pages on letter-size
paper, using reasonable margins and at least 11-point font (not
including the references). If the authors believe that more details are
essential to substantiate the main claims of the paper, they may include
a clearly marked appendix that will be read at the discretion of the
program committee.
Simultaneous submission
Simultaneous submission to other conferences with published proceedings
is not allowed.
PROCEEDINGS
Proceedings will be published in the Springer-Verlag series Lecture
Notes in Computer Science.
Previous proceedings of APPROX appeared as LNCS 1444, 1671, 1913, 2129,
2462, 2764, 3122, 3624, 4110 and 4627 while previous proceedings of
RANDOM appeared as LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624,
4110, 4627 and as Proceedings in Informatics 8.
PROGRAM COMMITTEES
Approx
Nikhil Bansal - Eindhoven University
Chandra Chekuri - UIUC
Eden Chlamtac - Ben Gurion University
Nikhil Devanur - Microsoft Research
Uriel Feige - Weizmann Institute
Claire Mathieu - Brown University
Ankur Moitra - Institute of Advanced Study
Seffi Naor - Technion University
Yuval Rabani - Hebrew University
Prasad Raghavendra - University of California, Berkeley (Chair)
Roy Schwartz - Microsoft Research
Mohit Singh - Microsoft Research
Ola Svensson - EPFL
Mohammad Taghi Hajiaghayi - University of Maryland, College Park
Madhur Tulsiani - TTI Chicago
Rico Zenklusen - John Hopkins University
Random
Amit Chakrabarti - Dartmouth College
Nikolaos Fountoulakis - University of Birmingham
Ariel Gabizon - Technion
Parikshit Gopalan - Microsoft Research, Silicon Valley
Dan Gutfreund - IBM Research, Haifa
Prahladh Harsha - Tata Institute of Fundamental Research, India
Tomas Hayes - University of New Mexico
Michael Krivelevich - Tel Aviv University
Shachar Lovett - UCSD
Russell Martin - University of Liverpool
Dieter van Melkebeek - University of Wisconsin--Madison
Sofya Raskhodnikova - Pennsylvania State University (Chair)
Shubhangi Saraf - Rutgers University
Christian Sohler - TU Dortmund University
David P. Woodruff - IBM Research, Almaden
Amir Yehudayoff - Technion
Program Chairs
APPROX
Prasad Raghavendra - University of California, Berkeley
email: prasad@cs.berkeley.edu
RANDOM
Sofya Raskhodnikova - Pennsylvania State University
email:sofya@cse.psu.edu
Workshop Chairs
José Rolim, U. of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen, U. of Kiel
e-mail: kj@informatik.uni-kiel.de
CONFERENCE WEB PAGE
http://cui.unige.ch/tcs/random-approx/
16th Intl. Workshop on Approximation Algorithms for Combinatorial
Optimization Problems - APPROX 2013
17th Intl. Workshop on Randomization and Computation - RANDOM 2013
http://cui.unige.ch/tcs/random-approx/
Aug. 21-23, 2013
Berkeley
Call for papers
IMPORTANT DATES
Submission deadline: April 17, 17:00 PDT
Notifications: June 11
Camera ready: June 18
SCOPE
The 16th. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX'2013), and the 17th.
International Workshop on Randomization and Computation (RANDOM'2013)
will be held in 21-23 August 2013 at Berkeley.
APPROX'2013 focuses on algorithmic and complexity theoretic issues
relevant to the development of efficient approximate solutions to
computationally difficult problems, while RANDOM'2013 focuses on
applications of randomness to computational and combinatorial problems.
RANDOM'2013 is the seventeenth workshop in the series; APPROX'2013 is
the sixteenth in the series.
TOPICS
Papers are solicited in all research areas related to randomization and
approximation, including, but not limited to:
APPROX
" design and analysis of approximation algorithms
" hardness of approximation
" small space, sub-linear time and streaming algorithms
" embeddings and metric space methods
" mathematical programming methods
" combinatorial problems in graphs and networks
" game theory, markets, and economic applications
" geometric problems
" packing, covering, and scheduling
" approximate learning
" other applications
RANDOM
" design and analysis of randomized algorithms
" randomized complexity theory
" pseudorandomness and derandomization
" random combinatorial structures
" random walks/Markov chains
" expander graphs and randomness extractors
" probabilistic proof systems
" random projections and embeddings
" error-correcting codes
" average-case analysis
" property testing
" computational learning theory
SUBMISSIONS
Abstract Format: Electronic submissions are solicited. Please consult
the following servers:
For submission of APPROX papers:
http://www.easychair.org/conferences/?conf=approx13
For submission of RANDOM papers:
http://www.easychair.org/conferences/?conf=random13
Note: You will be asked to login using an EasyChair account. Directions
on how to register for such an account are available at the submission
servers (you may also have an old account from a previous conference
submission).
The submission must be received by 17:00 (PDT) of April 17 for your
submission to be considered.
Abstract Format: Authors should submit an extended abstract (not a full
paper). An abstract should start with the title of the paper, each
author's name, affiliation, and e-mail address, followed by a
one-paragraph summary of the results to be presented. This should then
be followed by a technical exposition of the main ideas and techniques
used to achieve these results including motivation and a clear
comparison with related work.
The abstract should not exceed 10 single-spaced pages on letter-size
paper, using reasonable margins and at least 11-point font (not
including the references). If the authors believe that more details are
essential to substantiate the main claims of the paper, they may include
a clearly marked appendix that will be read at the discretion of the
program committee.
Simultaneous submission
Simultaneous submission to other conferences with published proceedings
is not allowed.
PROCEEDINGS
Proceedings will be published in the Springer-Verlag series Lecture
Notes in Computer Science.
Previous proceedings of APPROX appeared as LNCS 1444, 1671, 1913, 2129,
2462, 2764, 3122, 3624, 4110 and 4627 while previous proceedings of
RANDOM appeared as LNCS 1269, 1518, 1671, 2129, 2483, 2764, 3122, 3624,
4110, 4627 and as Proceedings in Informatics 8.
PROGRAM COMMITTEES
Approx
Nikhil Bansal - Eindhoven University
Chandra Chekuri - UIUC
Eden Chlamtac - Ben Gurion University
Nikhil Devanur - Microsoft Research
Uriel Feige - Weizmann Institute
Claire Mathieu - Brown University
Ankur Moitra - Institute of Advanced Study
Seffi Naor - Technion University
Yuval Rabani - Hebrew University
Prasad Raghavendra - University of California, Berkeley (Chair)
Roy Schwartz - Microsoft Research
Mohit Singh - Microsoft Research
Ola Svensson - EPFL
Mohammad Taghi Hajiaghayi - University of Maryland, College Park
Madhur Tulsiani - TTI Chicago
Rico Zenklusen - John Hopkins University
Random
Amit Chakrabarti - Dartmouth College
Nikolaos Fountoulakis - University of Birmingham
Ariel Gabizon - Technion
Parikshit Gopalan - Microsoft Research, Silicon Valley
Dan Gutfreund - IBM Research, Haifa
Prahladh Harsha - Tata Institute of Fundamental Research, India
Tomas Hayes - University of New Mexico
Michael Krivelevich - Tel Aviv University
Shachar Lovett - UCSD
Russell Martin - University of Liverpool
Dieter van Melkebeek - University of Wisconsin--Madison
Sofya Raskhodnikova - Pennsylvania State University (Chair)
Shubhangi Saraf - Rutgers University
Christian Sohler - TU Dortmund University
David P. Woodruff - IBM Research, Almaden
Amir Yehudayoff - Technion
Program Chairs
APPROX
Prasad Raghavendra - University of California, Berkeley
email: prasad@cs.berkeley.edu
RANDOM
Sofya Raskhodnikova - Pennsylvania State University
email:sofya@cse.psu.edu
Workshop Chairs
José Rolim, U. of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen, U. of Kiel
e-mail: kj@informatik.uni-kiel.de
CONFERENCE WEB PAGE
http://cui.unige.ch/tcs/random-approx/
[DMANET] Computer Science and Mathematics Outreach, August, Darwin, Australia
COMPUTER SCIENCE AND MATHEMATICS OUTREACH
The School of Engineering and Information Technology, Parameterized Complexity Research Unit at Charles Darwin University presents the
First International Conference on Creative Mathematical Sciences Communication
Join a visionary, catalytic mix of educators, mathematical science researchers and others in interesting discussions about key issues in mathematics communication and outreach.
** Examine how mathematical THINKING strategies nurture 21st Century competencies.
** Look at the process of sharing unsolved maths problems and the FRONTIERS of computer science and maths.
** Determine methods of fostering CURIOSITY and perseverance in maths.
** Design CULTURAL and whole body activities that show understanding and relevance to INDIGENOUS peoples, and connect math with the inner self and community.
**Cultivate RELATIONSHIPS between educators, mathematicians, computer science researchers and government to enhance math curiosity and enthusiasm.
--------------------MAKE A DIFFERENCE IN THE WORLD----------------------------
DATES: Conference starts at 1pm Friday, 2 August and continues to Saturday, 10 August, 2013 at Charles Darwin University, Australia, with some days in the Outback.
WEBSITE and REGISTRATION: www.cdu.edu.au/conference/csmaths
CONTACT: Frances.Rosamond@cdu.edu.au or Michael.Fellows@cdu.edu.au
This conference looks at the new paradigm of mathematics outreach in the world. It has a monumental impact that is just beginning to evolve. The website gives the bios of a brilliant line-up of keynote speakers. We value your participation.
** Share successful activities with colleagues, including instances where outreach has inspired new research questions or directions. For example, Mike Fellows will describe how "Kid Crypto" inspired the new research direction of Polly Cracker crypto systems.
** Discuss with Tim Bell and others the future directions of Computer Science Unplugged! which started as a grass-roots movement and now is translated into 17 languages.
World-wide, Google supports CS4HS which uses the activities and philosophy, as does the Computational Thinking Institute at Carnegie Mellon. The materials are recommended by the ACM K-12 Curriculum and CSTA (Computer Science Teachers Association).
The activities are kinaesthetic, cooperative and do not require any computers (unplugged). They are described on an extensive website and dedicated YouTube channel (www.csunplugged.org).
** Increase maths and computer science interest among Indigenous learners. Examine outreach with Chris Matthews, Griffith Univ and Terry Dunbar, CDU (Aboriginal learners); R.Ramanujam (Jam), Chennai Institute Mathematical Sciences (Tamil Nadu); Ulrike Stege, UVIC and Geri Lorway, Alberta (Native People of Canada), Judith Montgomery, Univ Santa Barbara (Latinos), and others.
---------------------------------------------------------------------------------------------------------
A computer science research workshop, PARAMETERIZED COMPLEXITY 'NEW IDEAS' WORKSHOP will take place the two days preceding (31 July--01 Aug). This may enable justification of travel for researchers interested in both areas. We will share new insights on parameterized Bayes Theorem, Nash Equilibria, Incrementalization and other parameterized problems. The workshop will be broad, and we look forward to hearing your ideas. Please contact Frances.Rosamond@cdu.edu.au if you would like a letter of invitation or have any questions.
Frances A. Rosamond, Ph.D.
Professorial Research Fellow
Parameterized Complexity Research Unit
Engineering and IT
Charles Darwin University
Darwin, Northern Territory 0909 Australia
Mobile. 0402473323
Anita Pettit, Admin T. +61 8-8946-6457
F. +61 8-8946-6680
CRICOS Provider No. 00300K | RTO Provider No. 0373
**********************************************************
*
* 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/
*
**********************************************************
The School of Engineering and Information Technology, Parameterized Complexity Research Unit at Charles Darwin University presents the
First International Conference on Creative Mathematical Sciences Communication
Join a visionary, catalytic mix of educators, mathematical science researchers and others in interesting discussions about key issues in mathematics communication and outreach.
** Examine how mathematical THINKING strategies nurture 21st Century competencies.
** Look at the process of sharing unsolved maths problems and the FRONTIERS of computer science and maths.
** Determine methods of fostering CURIOSITY and perseverance in maths.
** Design CULTURAL and whole body activities that show understanding and relevance to INDIGENOUS peoples, and connect math with the inner self and community.
**Cultivate RELATIONSHIPS between educators, mathematicians, computer science researchers and government to enhance math curiosity and enthusiasm.
--------------------MAKE A DIFFERENCE IN THE WORLD----------------------------
DATES: Conference starts at 1pm Friday, 2 August and continues to Saturday, 10 August, 2013 at Charles Darwin University, Australia, with some days in the Outback.
WEBSITE and REGISTRATION: www.cdu.edu.au/conference/csmaths
CONTACT: Frances.Rosamond@cdu.edu.au or Michael.Fellows@cdu.edu.au
This conference looks at the new paradigm of mathematics outreach in the world. It has a monumental impact that is just beginning to evolve. The website gives the bios of a brilliant line-up of keynote speakers. We value your participation.
** Share successful activities with colleagues, including instances where outreach has inspired new research questions or directions. For example, Mike Fellows will describe how "Kid Crypto" inspired the new research direction of Polly Cracker crypto systems.
** Discuss with Tim Bell and others the future directions of Computer Science Unplugged! which started as a grass-roots movement and now is translated into 17 languages.
World-wide, Google supports CS4HS which uses the activities and philosophy, as does the Computational Thinking Institute at Carnegie Mellon. The materials are recommended by the ACM K-12 Curriculum and CSTA (Computer Science Teachers Association).
The activities are kinaesthetic, cooperative and do not require any computers (unplugged). They are described on an extensive website and dedicated YouTube channel (www.csunplugged.org).
** Increase maths and computer science interest among Indigenous learners. Examine outreach with Chris Matthews, Griffith Univ and Terry Dunbar, CDU (Aboriginal learners); R.Ramanujam (Jam), Chennai Institute Mathematical Sciences (Tamil Nadu); Ulrike Stege, UVIC and Geri Lorway, Alberta (Native People of Canada), Judith Montgomery, Univ Santa Barbara (Latinos), and others.
---------------------------------------------------------------------------------------------------------
A computer science research workshop, PARAMETERIZED COMPLEXITY 'NEW IDEAS' WORKSHOP will take place the two days preceding (31 July--01 Aug). This may enable justification of travel for researchers interested in both areas. We will share new insights on parameterized Bayes Theorem, Nash Equilibria, Incrementalization and other parameterized problems. The workshop will be broad, and we look forward to hearing your ideas. Please contact Frances.Rosamond@cdu.edu.au if you would like a letter of invitation or have any questions.
Frances A. Rosamond, Ph.D.
Professorial Research Fellow
Parameterized Complexity Research Unit
Engineering and IT
Charles Darwin University
Darwin, Northern Territory 0909 Australia
Mobile. 0402473323
Anita Pettit, Admin T. +61 8-8946-6457
F. +61 8-8946-6680
CRICOS Provider No. 00300K | RTO Provider No. 0373
**********************************************************
*
* 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] 2nd Call for Papers MeCBIC 2013 -- workshop ICALP, Riga, 7th July
2nd Call for Papers
MeCBIC 2013
7th Workshop on Membrane Computing
and Biologically Inspired Process Calculi
7th July 2013, Riga, Latvia
http://profs.info.uaic.ro/~mecbic/mecbic2013/
================================================================
*** Paper Submission: 22nd April, 2013
The 7th Workshop on Membrane Computing and Biologically Inspired Process
Calculi (MeCBIC 2013) will take place in Riga on 7th July 2013 as a
related event of ICALP 2013, the 40th International Colloquium on
Automata, Languages and Programming. (http://www.icalp2013.lu.lv/)
If your work is related to MeCBIC topics, it is now a good opportunity to
submit a paper (of about 16 pages), using the web page
http://www.easychair.org/conferences/?conf=mecbic2013.
The modeling and the analysis of biological systems has attracted the
interest of several research communities. The main aim of the workshop is
to bring together researchers in concurrency theory, formal methods, and
related fields that are interested to present recent results and to
discuss new ideas concerning such formalisms, their properties and
relationships. We welcome contributions that address both theoretical and
applied contributions related to the relevance and potential of formal
methods in biology. Topics of interest include (but not limited to):
- Biologically inspired models and calculi (rewrite systems, process
calculi, Petri nets, etc.);
- Theoretical links and comparison of different biological inspired formal
models;
- Qualitative biological modeling;
- Quantitative formal methods;
- Modelling, analysis and simulation tools for biologically inspired systems.
The workshop proceedings will be published in the Electronic Proceedings
in Theoretical Computer Science. After the event, papers presented at the
workshop will be invited to be furtherly extended and submitted to a
special issue of a visible journal (indexed by DBLP, SCOPUS, Web of
Science, etc)
More details at http://profs.info.uaic.ro/~mecbic/mecbic2013/
Program Committee
Bogdan Aman (co-chair) - Romanian Academy, Iasi, RO
Roberto Barbuti - University of Pisa, Italy
Luca Cardelli - Microsoft, Cambridge, UK
Gabriel Ciobanu (co-chair) - Romanian Academy, Iasi, RO
Erik de Vink - TU Eindhoven, NL
Marian Gheorghe - Sheffield, UK
Paola Giannini - University Piemonte Orientale, Italy
Jean-Louis Giavitto - IRCAM CNRS, Paris, France
Jane Hillston - University of Edinburgh, UK
Jetty Kleijn - Leiden University, NL
Maciej Koutny - Newcastle University, UK
Emanuela Merelli - University of Camerino, Italy
Paolo Milazzo - University of Pisa, Italy
Gethin Norman - University of Glasgow, UK
Anna Philippou - University of Cyprus, Cyprus
Franck Pommereau - University of Evry, France
Jason Steggles - Newcastle University, UK
Angelo Troina - University of Torino, Italy
--
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.
**********************************************************
*
* 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/
*
**********************************************************
MeCBIC 2013
7th Workshop on Membrane Computing
and Biologically Inspired Process Calculi
7th July 2013, Riga, Latvia
http://profs.info.uaic.ro/~mecbic/mecbic2013/
================================================================
*** Paper Submission: 22nd April, 2013
The 7th Workshop on Membrane Computing and Biologically Inspired Process
Calculi (MeCBIC 2013) will take place in Riga on 7th July 2013 as a
related event of ICALP 2013, the 40th International Colloquium on
Automata, Languages and Programming. (http://www.icalp2013.lu.lv/)
If your work is related to MeCBIC topics, it is now a good opportunity to
submit a paper (of about 16 pages), using the web page
http://www.easychair.org/conferences/?conf=mecbic2013.
The modeling and the analysis of biological systems has attracted the
interest of several research communities. The main aim of the workshop is
to bring together researchers in concurrency theory, formal methods, and
related fields that are interested to present recent results and to
discuss new ideas concerning such formalisms, their properties and
relationships. We welcome contributions that address both theoretical and
applied contributions related to the relevance and potential of formal
methods in biology. Topics of interest include (but not limited to):
- Biologically inspired models and calculi (rewrite systems, process
calculi, Petri nets, etc.);
- Theoretical links and comparison of different biological inspired formal
models;
- Qualitative biological modeling;
- Quantitative formal methods;
- Modelling, analysis and simulation tools for biologically inspired systems.
The workshop proceedings will be published in the Electronic Proceedings
in Theoretical Computer Science. After the event, papers presented at the
workshop will be invited to be furtherly extended and submitted to a
special issue of a visible journal (indexed by DBLP, SCOPUS, Web of
Science, etc)
More details at http://profs.info.uaic.ro/~mecbic/mecbic2013/
Program Committee
Bogdan Aman (co-chair) - Romanian Academy, Iasi, RO
Roberto Barbuti - University of Pisa, Italy
Luca Cardelli - Microsoft, Cambridge, UK
Gabriel Ciobanu (co-chair) - Romanian Academy, Iasi, RO
Erik de Vink - TU Eindhoven, NL
Marian Gheorghe - Sheffield, UK
Paola Giannini - University Piemonte Orientale, Italy
Jean-Louis Giavitto - IRCAM CNRS, Paris, France
Jane Hillston - University of Edinburgh, UK
Jetty Kleijn - Leiden University, NL
Maciej Koutny - Newcastle University, UK
Emanuela Merelli - University of Camerino, Italy
Paolo Milazzo - University of Pisa, Italy
Gethin Norman - University of Glasgow, UK
Anna Philippou - University of Cyprus, Cyprus
Franck Pommereau - University of Evry, France
Jason Steggles - Newcastle University, UK
Angelo Troina - University of Torino, Italy
--
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.
**********************************************************
*
* 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
