--------------------------
CTW 2013 - CALL FOR PAPERS
--------------------------
12th Cologne-Twente Workshop on Graphs & Combinatorial Optimization
University of Twente, Enschede, The Netherlands
May 21-23, 2013.
------------------------------------------------------------------
* Website: http://www.math.utwente.nl/~ctw/
* Deadline for submission: February 22, 2013
* Notification of acceptance: April 5, 2013
* Conference dates: May 21-23, 2013
------------------------------------------------------------------
The 12th CTW welcomes contributions on theory and applications of
discrete algorithms, graphs and combinatorial structures in a wide
sense. Following a well established tradition, the 12th edition of the
workhop aims to disseminate scientific results, especially by young
researchers, in a friendly and interactive atmosphere.
If you want to submit a contribution, please prepare an extended
abstract of at most 4 pages by February 22, 2013 following the
guidelines on the conference website at "http://www.math.utwente.nl/~ctw/".
There will be a special issue of Discrete Applied Mathematics,
containing full length papers, refereed according to the high standards
of DAM.
SCIENTIFIC COMMITTEE
Ulrich Faigle (U Cologne)
Johann L. Hurink (U Twente),
Renato de Leone (U di Camerino)
Leo Liberti (École Polytechnique, Paris)
Bodo Manthey (U Twente)
Gaia Nicosia (U Roma Tre)
Andrea Pacifici (U Roma Tor Vergata)
Stefan Pickl (UBw München)
Giovanni Righini (U Milano)
Rainer Schrader (U Cologne)
Rüdiger Schultz (U Duisburg-Essen)
LOCAL ORGANIZATION
Johann Hurink, Bodo Manthey
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Friday, December 21, 2012
[DMANET] Lectureship Position, Operations Research, University of Edinburgh, UK
The School of Mathematics at the University of Edinburgh invites applications
from highly qualified candidates for a temporary 2.5-year lectureship in
Operations Research.
Starting date: April 1, 2013 (or by mutual agreement).
Annual salary: 37,012 GBP - 44,166 GBP (Lecturer, grade EU08).
Application deadline: January 22, 2013
https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=007224
You must have a Ph.D. in mathematics, operations research, or a
related discipline, and have an excellent research record. You should
have well formulated research plans enabling you to contribute
strongly to a highly-rated research-led School. Applicants with
research interests in operations research and optimization and their
modern applications, including modelling in the energy sector or the
digital economy, for example, are particularly welcome.
The School of Mathematics runs very successful MSc programmes in
Operations Research and you will be expected to make imaginative
contributions to these and to the School's undergraduate programmes.
The closing date for applications is January 22, 2013 and interviews
are likely to be held in the week commencing on February 18, 2013.
When submitting your application please attach your curriculum vitae, a
research record, and a brief research plan. Please also arrange for
three referees to send letters of recommendation directly to
hr@maths.ed.ac.uk, fax +44 (0)131 650 6553 by the closing date.
For informal discussion/enquiries contact Professor Jacek Gondzio
(email: J.Gondzio@ed.ac.uk, tel + 44 131 650 8574).
School of Mathematics: http://www.maths.ed.ac.uk/
Edinburgh Research Group in Optimization: http://www.maths.ed.ac.uk/ERGO/
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
**********************************************************
*
* 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 highly qualified candidates for a temporary 2.5-year lectureship in
Operations Research.
Starting date: April 1, 2013 (or by mutual agreement).
Annual salary: 37,012 GBP - 44,166 GBP (Lecturer, grade EU08).
Application deadline: January 22, 2013
https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=007224
You must have a Ph.D. in mathematics, operations research, or a
related discipline, and have an excellent research record. You should
have well formulated research plans enabling you to contribute
strongly to a highly-rated research-led School. Applicants with
research interests in operations research and optimization and their
modern applications, including modelling in the energy sector or the
digital economy, for example, are particularly welcome.
The School of Mathematics runs very successful MSc programmes in
Operations Research and you will be expected to make imaginative
contributions to these and to the School's undergraduate programmes.
The closing date for applications is January 22, 2013 and interviews
are likely to be held in the week commencing on February 18, 2013.
When submitting your application please attach your curriculum vitae, a
research record, and a brief research plan. Please also arrange for
three referees to send letters of recommendation directly to
hr@maths.ed.ac.uk, fax +44 (0)131 650 6553 by the closing date.
For informal discussion/enquiries contact Professor Jacek Gondzio
(email: J.Gondzio@ed.ac.uk, tel + 44 131 650 8574).
School of Mathematics: http://www.maths.ed.ac.uk/
Edinburgh Research Group in Optimization: http://www.maths.ed.ac.uk/ERGO/
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Thursday, December 20, 2012
[DMANET] 4th Workshop on Cooperative Games in Multiagent Systems (CoopMAS'13)
** Call for Papers **
The Fourth Workshop on Cooperative Games in Multiagent Systems (CoopMAS-2013)
https://sites.google.com/site/coopmas2013
Co-located with AAMAS-2013
Saint Paul, Minnesota, USA
** Aims and Focus **
The use of cooperative game theory to study how agents should
cooperate and collaborate, along with the related topic of coalition
formation, has received growing attention from the multiagent systems,
game theory, and electronic commerce communities.
The workshop is intended to focus on topics in cooperation in
multi-agent systems, cooperative game theory and cooperative solution
concepts, formation of coalitions, negotiation between agents, joint
decision making, and voting. We encourage submission of papers
describing original or recently published work (in venues that are not
typically attended by AAMAS participants, i.e., conferences other than
AAMAS/AAAI/IJCAI). We also encourage submission of full version of
short papers accepted at AAMAS. Topics of interest include, but are
not limited to:
* Cooperative game theory
* Coalition formation
* Joint decision making and voting
* Representation issues
* Negotiation
* Collaborative filtering
* Market and economics based cooperation
* Interact with humans (negotiation / collaboration)
The workshop should be of interest to researchers in cooperative game
theory and coalition formation, as well as to those who examine
collaboration between agents, cooperation in multiagent systems and
design and implement collaborating agents. We also welcome
participants who are interested in applications of cooperative game
theory, which include trading agents, sponsored search and recommender
systems.
** Key dates **
* Submission of contributions: 7 Feb 2013
* Acceptance notification: 1 March 2013
* Workshop: 6 or 7 May 2013
**Submission Instructions**
Submission must follow the Springer LNCS format
(see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 for
formatting instructions)
and should be a maximum of 15 pages.
Papers must be submitted in PDF through easychair:
https://www.easychair.org/conferences/?conf=coopmas13
CoopMAS is considered a non-archival venue and there are
no published proceedings,
though informal proceedings will be distributed to all workshop participants.
This means that publishing a paper in CoopMAS
should not prevent one from submitting it to
a conference or a journal. The requirement to use
the LNCS format is only imposed to ensure uniformity.
Organizers:
Haris Aziz (co-chair) (NICTA and UNSW, Sydney, Australia)
Edith Elkind (co-chair) (Nanyang Technological University, Singapore)
Michael Wooldridge (co-chair) (University of Oxford)
Program Committee
Thomas Ågotnes (University of Bergen)
Stephane Airiau (Université Paris-Dauphine)
Haris Aziz (co-chair) (NICTA and UNSW, Sydney, Australia)
Yoram Bachrach (Microsoft Research)
Peter Biro (Institute of Economics, Hungarian Academy of Sciences)
Georgios Chalkiadakis (Technical University of Crete)
Dinko Dimitrov (Saarland University)
Edith Elkind (co-chair) (Nanyang Technological University, Singapore)
Piotr Faliszewski (AGH University of Science and Technology)
Gianluigi Greco (University of Calabria)
Paul Harrenstein (University of Oxford)
Atsushi Iwasaki (Kyushu University)
Wojtek Jamroga (University of Luxembourg)
Sarit Kraus (Bar-Ilan University)
Kate Larson (University of Waterloo)
Reshef Meir (The Hebrew University)
Tomasz Michalak (University of Oxford)
Evangelos Markakis (Athens University of Economics and Business (AUEB))
Daniel Paulusma (Durham University)
Maria Polukarov (University of Southampton)
Wiebe Van Der Hoek (University of Liverpool)
Michael Wooldridge (co-chair) (University of Oxford)
Lirong Xia (Harvard University)
Makoto Yokoo (Kyushu University)
**********************************************************
*
* 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 Fourth Workshop on Cooperative Games in Multiagent Systems (CoopMAS-2013)
https://sites.google.com/site/coopmas2013
Co-located with AAMAS-2013
Saint Paul, Minnesota, USA
** Aims and Focus **
The use of cooperative game theory to study how agents should
cooperate and collaborate, along with the related topic of coalition
formation, has received growing attention from the multiagent systems,
game theory, and electronic commerce communities.
The workshop is intended to focus on topics in cooperation in
multi-agent systems, cooperative game theory and cooperative solution
concepts, formation of coalitions, negotiation between agents, joint
decision making, and voting. We encourage submission of papers
describing original or recently published work (in venues that are not
typically attended by AAMAS participants, i.e., conferences other than
AAMAS/AAAI/IJCAI). We also encourage submission of full version of
short papers accepted at AAMAS. Topics of interest include, but are
not limited to:
* Cooperative game theory
* Coalition formation
* Joint decision making and voting
* Representation issues
* Negotiation
* Collaborative filtering
* Market and economics based cooperation
* Interact with humans (negotiation / collaboration)
The workshop should be of interest to researchers in cooperative game
theory and coalition formation, as well as to those who examine
collaboration between agents, cooperation in multiagent systems and
design and implement collaborating agents. We also welcome
participants who are interested in applications of cooperative game
theory, which include trading agents, sponsored search and recommender
systems.
** Key dates **
* Submission of contributions: 7 Feb 2013
* Acceptance notification: 1 March 2013
* Workshop: 6 or 7 May 2013
**Submission Instructions**
Submission must follow the Springer LNCS format
(see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0 for
formatting instructions)
and should be a maximum of 15 pages.
Papers must be submitted in PDF through easychair:
https://www.easychair.org/conferences/?conf=coopmas13
CoopMAS is considered a non-archival venue and there are
no published proceedings,
though informal proceedings will be distributed to all workshop participants.
This means that publishing a paper in CoopMAS
should not prevent one from submitting it to
a conference or a journal. The requirement to use
the LNCS format is only imposed to ensure uniformity.
Organizers:
Haris Aziz (co-chair) (NICTA and UNSW, Sydney, Australia)
Edith Elkind (co-chair) (Nanyang Technological University, Singapore)
Michael Wooldridge (co-chair) (University of Oxford)
Program Committee
Thomas Ågotnes (University of Bergen)
Stephane Airiau (Université Paris-Dauphine)
Haris Aziz (co-chair) (NICTA and UNSW, Sydney, Australia)
Yoram Bachrach (Microsoft Research)
Peter Biro (Institute of Economics, Hungarian Academy of Sciences)
Georgios Chalkiadakis (Technical University of Crete)
Dinko Dimitrov (Saarland University)
Edith Elkind (co-chair) (Nanyang Technological University, Singapore)
Piotr Faliszewski (AGH University of Science and Technology)
Gianluigi Greco (University of Calabria)
Paul Harrenstein (University of Oxford)
Atsushi Iwasaki (Kyushu University)
Wojtek Jamroga (University of Luxembourg)
Sarit Kraus (Bar-Ilan University)
Kate Larson (University of Waterloo)
Reshef Meir (The Hebrew University)
Tomasz Michalak (University of Oxford)
Evangelos Markakis (Athens University of Economics and Business (AUEB))
Daniel Paulusma (Durham University)
Maria Polukarov (University of Southampton)
Wiebe Van Der Hoek (University of Liverpool)
Michael Wooldridge (co-chair) (University of Oxford)
Lirong Xia (Harvard University)
Makoto Yokoo (Kyushu University)
**********************************************************
*
* 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/Postdoc position in Scheduling Theory in Berlin
Department of Mathematics
Technische Universität Berlin
PhD/Postdoc position in Scheduling Theory
Research Assistant (100% TV-L 13)
A PhD or Postdoc position is available in the DFG-funded Junior Research
Group "Models, algorithms and complexity for scheduling under
uncertainty" led by Nicole Megow at Technische Universität Berlin.
The position is available immediately. There are no teaching obligations.
The junior research group is associated with the "Combinatorial
Optimization and Graph Algorithms Group" at TU Berlin
(http://www.math.tu-berlin.de/coga/) with 20+ researchers interested in
combinatorial optimization, approximation algorithms, integer
programming, network flows, scheduling, online and robust optimization,
graph theory, and their application in practice.
Berlin offers a strong scientific landscape including three
universities, the international graduate program BERLIN MATHEMATICAL
SCHOOL (http://www.math-berlin.de), promoted by the German Excellence
Initiative, a DFG (German Research Foundation) research training group,
called "Methods for Discrete Structures" (MDS) and the DFG research
center MATHEON; these offer opportunities for joint research and support
for PhD students (e.g., meetings, lecture series, summer schools).
Besides sciences, Berlin offers a rich, multicultural living
environment, that should cater to most interests and hobbies.
Candidates should have an excellent academic degree in mathematics,
computer science or a related area, and must have a very good knowledge
in combinatorial optimization and algorithm theory. A background in
scheduling and approximation algorithms is desirable. Good communication
skills and solid English writing skills are necessary.
Applicants should send their application as *a single pdf* file containing:
- cover and motivation letter
- curriculum vitae
- copies of diplomas (when applying for the PhD position)
- summary of thesis (max. 3 pages in english or german)
- names and contact details of two referees (including thesis advisor)
by
January 15, 2013
to
Dr. Nicole Megow
nmegow@math.tu-berlin.de
www.coga.tu-berlin.de/people/megow
Applications arriving by the above date will receive full consideration,
however, the search remains open until the position is filled.
**********************************************************
*
* 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/
*
**********************************************************
Technische Universität Berlin
PhD/Postdoc position in Scheduling Theory
Research Assistant (100% TV-L 13)
A PhD or Postdoc position is available in the DFG-funded Junior Research
Group "Models, algorithms and complexity for scheduling under
uncertainty" led by Nicole Megow at Technische Universität Berlin.
The position is available immediately. There are no teaching obligations.
The junior research group is associated with the "Combinatorial
Optimization and Graph Algorithms Group" at TU Berlin
(http://www.math.tu-berlin.de/coga/) with 20+ researchers interested in
combinatorial optimization, approximation algorithms, integer
programming, network flows, scheduling, online and robust optimization,
graph theory, and their application in practice.
Berlin offers a strong scientific landscape including three
universities, the international graduate program BERLIN MATHEMATICAL
SCHOOL (http://www.math-berlin.de), promoted by the German Excellence
Initiative, a DFG (German Research Foundation) research training group,
called "Methods for Discrete Structures" (MDS) and the DFG research
center MATHEON; these offer opportunities for joint research and support
for PhD students (e.g., meetings, lecture series, summer schools).
Besides sciences, Berlin offers a rich, multicultural living
environment, that should cater to most interests and hobbies.
Candidates should have an excellent academic degree in mathematics,
computer science or a related area, and must have a very good knowledge
in combinatorial optimization and algorithm theory. A background in
scheduling and approximation algorithms is desirable. Good communication
skills and solid English writing skills are necessary.
Applicants should send their application as *a single pdf* file containing:
- cover and motivation letter
- curriculum vitae
- copies of diplomas (when applying for the PhD position)
- summary of thesis (max. 3 pages in english or german)
- names and contact details of two referees (including thesis advisor)
by
January 15, 2013
to
Dr. Nicole Megow
nmegow@math.tu-berlin.de
www.coga.tu-berlin.de/people/megow
Applications arriving by the above date will receive full consideration,
however, the search remains open until the position is filled.
**********************************************************
*
* 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, December 19, 2012
[DMANET] Simons Institute for the Theory of Computing: Research Fellowships [REMINDER]
This is a reminder of the upcoming deadline for applications for
Research Fellowships at the newly created Simons Institute for the
Theory of Computing at UC Berkeley.
Simons-Berkeley Research Fellowships are an opportunity for
outstanding junior scientists (up to 6 years from PhD) to spend one or
two semesters at the Institute in academic year 2013-14, in connection
with one or more of its programs. The programs for 2013-14 are as
follows:
* Real Analysis in Computer Science (Fall 2013)
* Theoretical Foundations of Big Data Analysis (Fall 2013)
* Quantum Hamiltonian Complexity (Spring 2014)
* Evolutionary Biology and the Theory of Computing (Spring 2014)
Applicants who already hold junior faculty or postdoctoral positions
are welcome to apply. In particular, applicants who hold, or expect to
hold, postdoctoral appointments at other institutions are encouraged
to apply to spend one semester as a Simons-Berkeley Fellow subject to
the approval of the postdoctoral institution.
Further details and application instructions can be found at http://simons.berkeley.edu/fellows.html
. Information about the Institute and the above programs can be found
at http://simons.berkeley.edu.
Deadline for applications: 15 January, 2013.
Alistair Sinclair
Associate Director, Simons Institute
**********************************************************
*
* 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/
*
**********************************************************
Research Fellowships at the newly created Simons Institute for the
Theory of Computing at UC Berkeley.
Simons-Berkeley Research Fellowships are an opportunity for
outstanding junior scientists (up to 6 years from PhD) to spend one or
two semesters at the Institute in academic year 2013-14, in connection
with one or more of its programs. The programs for 2013-14 are as
follows:
* Real Analysis in Computer Science (Fall 2013)
* Theoretical Foundations of Big Data Analysis (Fall 2013)
* Quantum Hamiltonian Complexity (Spring 2014)
* Evolutionary Biology and the Theory of Computing (Spring 2014)
Applicants who already hold junior faculty or postdoctoral positions
are welcome to apply. In particular, applicants who hold, or expect to
hold, postdoctoral appointments at other institutions are encouraged
to apply to spend one semester as a Simons-Berkeley Fellow subject to
the approval of the postdoctoral institution.
Further details and application instructions can be found at http://simons.berkeley.edu/fellows.html
. Information about the Institute and the above programs can be found
at http://simons.berkeley.edu.
Deadline for applications: 15 January, 2013.
Alistair Sinclair
Associate Director, Simons Institute
**********************************************************
*
* 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] Ph.D. position in net-centric algorithmics at TU Darmstadt, Germany
The Algorithmics group at TU Darmstadt invites applications for a
Ph.D. position within the collaborative research centre,
"Multi-Mechanism Adaptation for the Future Internet". The research
centre is devoted to the exploration of perspectives for automatic
switches of communication protocols, simultaneously on all layers of
the protocol hierarchy. As a member of a large interdisciplinary team
of professors and Ph.D. students, you will design, implement, and
evaluate discrete algorithms for optimal switch strategies, which are
based on monitoring data from the Internet. At the end, your algorithm
will run in a distributed way as a part of the decentralized network
control. You will be a member of subproject B02, in which two
professors and two Ph.D. candidates collaboratively work on that
challenge.
The first funding phase commences on January 1st, 2013, and will
endure four years. You are expected to write a Ph.D. thesis on the
basis of this project within this time period. For formal reasons,
contracts must be renewed annually.
There is no formal deadline; applications will be considered until the
position is filled.
You should hold a degree in Computer Science, Mathematics, or a
related subject. We expect very good programming skills (Java or C++).
You should have a deep interest in the design of algorithms for
real-world applications. Background knowledge in communication
networks is not mandatory but highly desirable.
More information on the web (German only):
www.maki.tu-darmstadt.de
http://www.maki.tu-darmstadt.de/sfb_maki/teilprojekte/projektbereich_b/tp_b02/tp_b02.de.jsp
http://www.maki.tu-darmstadt.de/sfb_maki/stellenausschreibungen/wissenschaftliche_mitarbeiter_1/jobs_wimis.de.jsp
Please send your application to Prof. Karsten Weihe or contact him if
you have any questions: weihe@cs.tu-darmstadt.de
--
Dr. Mathias Schnee
Algorithmik Fachbereich Informatik
Technische Universität Darmstadt
www.algo.informatik.tu-darmstadt.de
**********************************************************
*
* 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/
*
**********************************************************
Ph.D. position within the collaborative research centre,
"Multi-Mechanism Adaptation for the Future Internet". The research
centre is devoted to the exploration of perspectives for automatic
switches of communication protocols, simultaneously on all layers of
the protocol hierarchy. As a member of a large interdisciplinary team
of professors and Ph.D. students, you will design, implement, and
evaluate discrete algorithms for optimal switch strategies, which are
based on monitoring data from the Internet. At the end, your algorithm
will run in a distributed way as a part of the decentralized network
control. You will be a member of subproject B02, in which two
professors and two Ph.D. candidates collaboratively work on that
challenge.
The first funding phase commences on January 1st, 2013, and will
endure four years. You are expected to write a Ph.D. thesis on the
basis of this project within this time period. For formal reasons,
contracts must be renewed annually.
There is no formal deadline; applications will be considered until the
position is filled.
You should hold a degree in Computer Science, Mathematics, or a
related subject. We expect very good programming skills (Java or C++).
You should have a deep interest in the design of algorithms for
real-world applications. Background knowledge in communication
networks is not mandatory but highly desirable.
More information on the web (German only):
www.maki.tu-darmstadt.de
http://www.maki.tu-darmstadt.de/sfb_maki/teilprojekte/projektbereich_b/tp_b02/tp_b02.de.jsp
http://www.maki.tu-darmstadt.de/sfb_maki/stellenausschreibungen/wissenschaftliche_mitarbeiter_1/jobs_wimis.de.jsp
Please send your application to Prof. Karsten Weihe or contact him if
you have any questions: weihe@cs.tu-darmstadt.de
--
Dr. Mathias Schnee
Algorithmik Fachbereich Informatik
Technische Universität Darmstadt
www.algo.informatik.tu-darmstadt.de
**********************************************************
*
* 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] Ankündigung 65. Theorietag (in German)
Am 14./15. Februar 2013 findet der 65. Theorietag (GI-Workshop über Algorithmen und Komplexität) am Heinz Nixdorf Institut an der Universität Paderborn statt. Der Workshop richtet sich an alle Forschungsinteressierten aus dem Bereich der theoretischen Informatik. Dabei liegt der Schwerpunkt insbesondere auf den Gebieten Komplexität, Algorithmen und Datenstrukturen, sowie parallele und verteilte Algorithmen. Die Teilnahme am Workshop stellt keine Veröffentlichung dar, so dass sowohl laufende als auch abgeschlossene Arbeiten vorgestellt werden können. Ein erklärtes Ziel des Workshops ist es, Kontakt zwischen jungen und etablierten Wissenschaftlern zu ermöglichen. Nähere Informationen finden Sie unter:
http://www.hni.uni-paderborn.de/alg/theorietag/
Anmeldungen bitte per E-Mail an theorietag@lists.uni-paderborn.de senden. Anmeldungen mit Vortragswunsch werden bis zum 18. Januar erbeten. Der Titel sowie ein kurzer Abstract können bis spätestens zum 1. Februar nachgereicht werden. Anmeldungen ohne Vortragswunsch können bis zum 1. Februar erfolgen.
Mit freundlichen Grüßen,
Peter Kling
--
Dipl.-Math. Peter Kling, M.Sc.
Heinz Nixdorf Institute
University of Paderborn
Fürstenallee 11
DE-33102 Paderborn
Office: F1.119
Phone: +49 5251 60-6427
Fax: +49 5251 60-6482
Email: peter.kling@uni-paderborn.de
Homepage: http://wwwhni.uni-paderborn.de/alg/mitarbeiter/peter
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
http://www.hni.uni-paderborn.de/alg/theorietag/
Anmeldungen bitte per E-Mail an theorietag@lists.uni-paderborn.de senden. Anmeldungen mit Vortragswunsch werden bis zum 18. Januar erbeten. Der Titel sowie ein kurzer Abstract können bis spätestens zum 1. Februar nachgereicht werden. Anmeldungen ohne Vortragswunsch können bis zum 1. Februar erfolgen.
Mit freundlichen Grüßen,
Peter Kling
--
Dipl.-Math. Peter Kling, M.Sc.
Heinz Nixdorf Institute
University of Paderborn
Fürstenallee 11
DE-33102 Paderborn
Office: F1.119
Phone: +49 5251 60-6427
Fax: +49 5251 60-6482
Email: peter.kling@uni-paderborn.de
Homepage: http://wwwhni.uni-paderborn.de/alg/mitarbeiter/peter
**********************************************************
*
* 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, December 18, 2012
[DMANET] PostDoc position in Approximation Algorithms at the University of Lugano, Switzerland
The Algorithms and Complexity Group of IDSIA, University of Lugano
(Switzerland), opens one PostDoc position in approximation algorithms,
with a special focus on network design and pricing problems. The
position is supported by the European Research Council Starting Grant
"New Approaches to Network Design".
The appointment is for 2 years, with the possibility of an extension
by 2 years. The starting date will be agreed with the successful
candidate. The salary is roughly 75.000 CHF per year (taxes ~20%).
There are no teaching duties and there is a (very) generous travel
support.
An ideal candidate should have (or be close to obtaining) a PhD in
Computer Science or in a related area, and should have a strong
publication record in top Theoretical Computer Science conferences
such as STOC, FOCS, SODA, ICALP, ESA etc.
Further details about the position can be found at:
www.idsia.ch/~grandoni/ERC2010.html
Applicants should email a detailed CV, including a list of
publications and the email addresses of 3 references, to:
Prof. Fabrizio Grandoni
fabrizio@idsia.ch
The deadline for the application (with moderate flexibility) is
February 28th, 2013. For any question, do not hesitate to contact
Prof. Grandoni.
**********************************************************
*
* 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/
*
**********************************************************
(Switzerland), opens one PostDoc position in approximation algorithms,
with a special focus on network design and pricing problems. The
position is supported by the European Research Council Starting Grant
"New Approaches to Network Design".
The appointment is for 2 years, with the possibility of an extension
by 2 years. The starting date will be agreed with the successful
candidate. The salary is roughly 75.000 CHF per year (taxes ~20%).
There are no teaching duties and there is a (very) generous travel
support.
An ideal candidate should have (or be close to obtaining) a PhD in
Computer Science or in a related area, and should have a strong
publication record in top Theoretical Computer Science conferences
such as STOC, FOCS, SODA, ICALP, ESA etc.
Further details about the position can be found at:
www.idsia.ch/~grandoni/ERC2010.html
Applicants should email a detailed CV, including a list of
publications and the email addresses of 3 references, to:
Prof. Fabrizio Grandoni
fabrizio@idsia.ch
The deadline for the application (with moderate flexibility) is
February 28th, 2013. For any question, do not hesitate to contact
Prof. Grandoni.
**********************************************************
*
* 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] FPT Oman 2013
FPT-Oman 2013
=============
Workshop on FPT Algorithms and Algorithm Engineering (Preferably Not
About Graphs)
When: Feb 18-22, 2013
Where: GUtech, Muscat, Oman (http://www.gutech.edu.om)
Organizers:
Mike Fellows, Charles Darwin University, Darwin
Rudolf Fleischer, GUtech, Muscat
Kurt Mehlhorn, MPI for Informatics, Saarbruecken
Saket Saureb, IMS, Chennai
The goal of this workshop is to explore new research directions
in FPT algorithms with a focus on algorithm engineering,
and to continue the theme of the "Not About Graphs!" workshop
at Charles Darwin University in 2012
(http://www.cdu.edu.au/parameterized-nag/).
We will start with talks and discussions at GUtech on the first two days,
followed by three days of research at a desert camp in Wahiba Sands.
To register, please send email to Rudolf Fleischer
(rudolf.fleischer@gutech.edu.om),
preferably before Jan 10.
More information can be found on the workshop home page
http://staff.gutech.edu.om/fptoman2013
--
Prof Rudolf Fleischer, Head
Department of Applied Information Technology
German University of Technology in Oman
Muscat, Oman
**********************************************************
*
* 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/
*
**********************************************************
=============
Workshop on FPT Algorithms and Algorithm Engineering (Preferably Not
About Graphs)
When: Feb 18-22, 2013
Where: GUtech, Muscat, Oman (http://www.gutech.edu.om)
Organizers:
Mike Fellows, Charles Darwin University, Darwin
Rudolf Fleischer, GUtech, Muscat
Kurt Mehlhorn, MPI for Informatics, Saarbruecken
Saket Saureb, IMS, Chennai
The goal of this workshop is to explore new research directions
in FPT algorithms with a focus on algorithm engineering,
and to continue the theme of the "Not About Graphs!" workshop
at Charles Darwin University in 2012
(http://www.cdu.edu.au/parameterized-nag/).
We will start with talks and discussions at GUtech on the first two days,
followed by three days of research at a desert camp in Wahiba Sands.
To register, please send email to Rudolf Fleischer
(rudolf.fleischer@gutech.edu.om),
preferably before Jan 10.
More information can be found on the workshop home page
http://staff.gutech.edu.om/fptoman2013
--
Prof Rudolf Fleischer, Head
Department of Applied Information Technology
German University of Technology in Oman
Muscat, Oman
**********************************************************
*
* 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] EURO-INFORMS Rome - Telecommunications and Network Optimization stream
Dear friends and colleagues,
We are organizing the stream Telecommunications and Network
Optimization of the forthcoming EURO-INFORMS conference in Rome, July
1-4, 2013.
http://euro2013.org/
The stream is jointly organized by the European Network Optimization
Group (ENOG) and the Telecommunications Section of INFORMS.
If you would like to submit a paper for the stream, please visit
http://www.euro-online.org/conf/euro26/?page=welcome
and use invitation code
dd77dbd5
The deadline for abstract submission is March 1, 2013.
If (even better!) you would like to organize a full session of 3-4
papers, please contact one of us directly.
Best regards,
Walid Ben-Ameur, Bernard Fortz, Luis Gouveia
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
We are organizing the stream Telecommunications and Network
Optimization of the forthcoming EURO-INFORMS conference in Rome, July
1-4, 2013.
http://euro2013.org/
The stream is jointly organized by the European Network Optimization
Group (ENOG) and the Telecommunications Section of INFORMS.
If you would like to submit a paper for the stream, please visit
http://www.euro-online.org/conf/euro26/?page=welcome
and use invitation code
dd77dbd5
The deadline for abstract submission is March 1, 2013.
If (even better!) you would like to organize a full session of 3-4
papers, please contact one of us directly.
Best regards,
Walid Ben-Ameur, Bernard Fortz, Luis Gouveia
**********************************************************
*
* 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 position in TCS at KTH Royal Institute of Technology
The Theory Group at KTH Royal Institute of Technology invites applications
for a PhD position in Theoretical Computer Science.
for a PhD position in Theoretical Computer Science.
KTH Royal Institute of Technology is the leading technical university in
Sweden, with education and research spanning from natural sciences to all
branches of engineering including architecture, industrial management and
urban planning. The Theory Group at KTH (http://www.csc.kth.se/tcs/)
offers a strong research environment covering a wide range of research
topics such as complexity theory and approximation algorithms, computer
and network security, cryptography, formal methods and natural language
processing. The group has a consistent track record of publishing
regularly in the leading theoretical computer science conferences and
journals worldwide, and the research conducted here has attracted numerous
international awards and grants in recent years.
We are seeking a PhD student for the research project "Understanding the
Hardness of Theorem Proving" in the area of proof complexity with
connections to SAT solving.
Proving formulas in propositional logic is a problem of immense importance
both theoretically and practically. On the one hand, this computational
task is believed to be intractable in general, and deciding whether this
is so is one of the famous million dollar Millennium Problems (the P vs.
NP problem). On the other hand, today so-called SAT solvers are routinely
used to solve large-scale real-world problem instances with millions of
variables.
Proof complexity studies formal systems for reasoning about logic
formulas. This field has deep connections to fundamental questions in
computational complexity, but another important motivation is the
connection to SAT solving. All SAT solvers use some kind of method or
system in which proofs are searched for, and proof complexity analyses the
potential and limitations of such proof systems (and thereby of the
algorithms using them).
This project aims to advance the frontiers of proof complexity, and to
leverage this research to shed light on questions related to SAT solving.
This could potentially also involve research in related areas such as, for
example, circuit complexity, communication complexity, or hardness of
approximation.
The project is led by Jakob Nordström (http://www.csc.kth.se/~jakobn) and
is financed by a Breakthrough Research Grant from the Swedish Research
Council and a Starting Independent Researcher Grant from the European
Research Council. The group currently consists of one postdoctoral
researcher and two PhD students (in addition to the project leader).
Travel funding is included, and the group also receives short-term and
long-term visitors on a regular basis.
This is a full-time employed position, normally for five years including
20% teaching, with salary according to KTH PhD student regulations
(internationally very competitive). The successful candidate is expected
to start at the latest in August 2013, although this is to some extent
negotiable.
The application deadline is January 14, 2013. See
http://www.csc.kth.se/~jakobn/openings/D-2012-0439-Eng.php for the full,
formal announcement with more information and instructions for how to
apply. Informal enquiries about this position are welcome and may be sent
to Jakob Nordstrom.
**********************************************************
*
* 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] Seventh Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications (CSGT13)
Seventh Czech-Slovak International Symposium on Graph Theory,
Combinatorics, Algorithms and Applications (CSGT13)
Combinatorics, Algorithms and Applications (CSGT13)
The symposium is organised by P.J. Safarik University in Kosice to
commemorate 50th anniversary of the first (really) international graph
theory conference, the Symposium held in Smolenice, Czechoslovakia, in
1963.
Date: 7th – 13th July 2013
Place: Kosice, Slovakia
Invited speakers: Herbert Fleischner, Jochen Harant, Penny Haxell,
Gareth Jones, Daniela Kuhn, Patrice Ossona de Mendez, Bojan Mohar, Marc
Noy, Andrzej Rucinski, Daniel Stefankovic, Bjarne Toft, Xuding Zhu
Programme Committee: Stanislav Jendrol (chair), Martin Baca, Jiri
Fiala, Miroslav Fiedler, Dalibor Froncek, Pavol Hell, Mirko Hornak,
Tomas Kaiser, Daniel Kral, Jan Kratochvil, Roman Nedela, Jaroslav
Nesetril, Alexander Rosa, Zdenek Ryjacek, Jozef Siran, Martin Skoviera
Organising Committee: Roman Sotak (chair), Igor Fabrici, Andrea
Fenovcikova, Jaroslav Ivanco, Frantisek Kardos, Marian Klesc, Tomas
Madaras, Gabriel Semanisin
Early registration (registration fee 240 EUR) deadline: 15th May 2013
Abstract submission deadline: 15th May 2013
Late registration (registration fee 280 EUR) deadline: 30th June 2013
There will be a special issue of Discrete Mathematics devoted to CSGT13
with submission deadline 31st October 2013.
Symposium webpage: http://csgt13.upjs.sk/
Stanislav Jendrol
Institute of Mathematics
P.J. Safarik University,
Kosice, Slovakia
**********************************************************
*
* 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, December 17, 2012
[DMANET] Seventh Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications (CSGT13)
Seventh Czech-Slovak International Symposium on Graph Theory,
Combinatorics, Algorithms and Applications (CSGT13)
Combinatorics, Algorithms and Applications (CSGT13)
The symposium is organised by P.J. Safarik University in Kosice to
commemorate 50th anniversary of the first (really) international graph
theory conference, the Symposium held in Smolenice, Czechoslovakia, in
1963.
Date: 7th – 13th July 2013
Place: Kosice, Slovakia
Invited speakers: Herbert Fleischner, Jochen Harant, Penny Haxell,
Gareth Jones, Daniela Kuhn, Patrice Ossona de Mendez, Bojan Mohar, Marc
Noy, Andrzej Rucinski, Daniel Stefankovic, Bjarne Toft, Xuding Zhu
Programme Committee: Stanislav Jendrol (chair), Martin Baca, Jiri
Fiala, Miroslav Fiedler, Dalibor Froncek, Pavol Hell, Mirko Hornak,
Tomas Kaiser, Daniel Kral, Jan Kratochvil, Roman Nedela, Jaroslav
Nesetril, Alexander Rosa, Zdenek Ryjacek, Jozef Siran, Martin Skoviera
Organising Committee: Roman Sotak (chair), Igor Fabrici, Andrea
Fenovcikova, Jaroslav Ivanco, Frantisek Kardos, Marian Klesc, Tomas
Madaras, Gabriel Semanisin
Early registration (registration fee 240 EUR) deadline: 15th May 2013
Abstract submission deadline: 15th May 2013
Late registration (registration fee 280 EUR) deadline: 30th June 2013
There will be a special issue of Discrete Mathematics devoted to CSGT13
with submission deadline 31st October 2013.
Symposium webpage: http://csgt13.upjs.sk/
Stanislav Jendrol
Institute of Mathematics
P.J. Safarik University,
Kosice, Slovakia
**********************************************************
*
* 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] Call for papers: Machines, Computations and Universality 2013
Machines, Computations and Universality (MCU) 2013, the 6th conference
in the MCU series, will be hosted at the University of Zurich on
September 9-12, 2013.
in the MCU series, will be hosted at the University of Zurich on
September 9-12, 2013.
SCOPE
MCU explores computation in the setting of various discrete models
(Turing machines, register machines, cellular automata, tile assembly
systems, rewriting systems, neural models etc.) and analog and hybrid
models (BSS machines, infinite time cellular automata, real machines,
quantum computing etc.). There is particular (but not exclusive)
emphasis given towards the following:
1. the search for frontiers between decidability and undecidability in
the various models. (For example, what is the smallest number of pairs
of words for which the Post correspondence problem is undecidable, or
what is the largest state-symbol product for which the halting problem
is decidable for Turing machines.)
2. the search for the simplest universal models (such as small universal
Turing machines, universal rewriting systems with few rules, universal
cellular automata with small neighborhoods and a small number of states,
etc.)
3. the computational complexity of predicting the evolution of
computations in the various models. (For example, is it possible to
predict an arbitrary number of time steps for a model more efficiently
than explicit step by step simulation of the model.)
4. universality and undecidability in continuous models of computation.
IMPORTANT DATES
Submission: March 31, 2013
Notification: May 17, 2013
Final Version: June 14, 2013
Conference: September 9-12, 2013
PROGRAM COMMITTEE
Andrew Adamatzky (University of the West of England, UK)
Matthew Cook (University of Zurich and ETH Zurich) (co-chair)
Erzsébet Csuhaj-Varjú (Eötvös Loránd University, Budapest, Hungary)
Jérôme Durand-Lose (University of Orléans, France)
Rudolf Freund (University of Vienna, Austria)
Gabriel Istrate (Institute e-Austria, Timisoara, Romania)
Jarkko Kari (University of Turku, Finland)
Lila Kari (University of Western Ontario, London, Canada)
Kamala Krithivasan (Indian Institute of Technology, Chennai, India)
Maurice Margenstern (University of Lorraine, France)
Turlough Neary (University of Zurich and ETH Zurich) (co-chair)
Matthew Pattitz (University of Arkansas, Fayetteville, USA)
Igor Potapov (University of Liverpool, UK)
Klaus Sutner (Carnegie Mellon University, Pittsburgh, USA)
Sergey Verlan (University of Paris Est, France)
Damien Woods (California Institute of Technology, USA)
INVITED SPEAKERS
Liesbeth De Mol (Ghent University, Belgium)
Jarkko Kari (University of Turku, Finland)
Kenichi Morita (Hiroshima University, Japan)
Erik Winfree (California Institute of Technology, USA)
Damien Woods (California Institute of Technology, USA)
PAPER PREPARATION AND SUBMISSION
Authors are invited to submit extended abstracts of no more than 12
pages via the EasyChair system at
https://www.easychair.org/conferences/?conf=mcu2013. Submissions should
contain original research that has not previously been published.
Concurrent submissions to other conferences/journals is not permitted.
Supplementary material that exceeds the 12 page limit will be considered
at the committee's discretion. Submissions must be in the form of a PDF
prepared using the EPTCS style file (available at
http://style.eptcs.org/). The title page should include the title of the
paper, the names, affiliations and email addresses of each of the
authors, and an abstract of no more than 300 words.
CONFERENCE PROCEEDINGS
The proceedings will be published in Electronic Proceedings in
Theoretical Computer Science (EPTCS) and will be available at the
conference, and freely available online. For more information see the
EPTCS website at http://about.eptcs.org/.
Following, the conference, authors of selected papers will be invited to
submit an extended version of their work to a special issue of an
international journal.
**********************************************************
*
* 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] Second and last call for nominations: Nerode Prize 2013 in multivariate algorithmics
SECOND AND LAST CALL FOR NOMINATIONS:
The Nerode Prize 2013 for outstanding papers in the area of multivariate
algorithmics.
Deadline for Nominations: January 1, 2013.
Decision: May 1, 2013.
The award is presented annually with the presentation taking place at IPEC
(International Symposium on Parameterized and Exact Computation). IPEC 2013
takes place within ALGO 2013, September 2--6, 2013, Sophia Antipolis, France.
See http://algo2013.inria.fr/
The Prize is named in honor of Anil Nerode in recognition of his major
contributions to mathematical logic, theory of automata, computability, and
complexity theory.
In 2013, the prize is awarded for the first time.
Award Committee.
The winning paper(s) is (are) selected by a committee of three members.
This year's committee consists of the following three people.
Georg Gottlob (Oxford University), georg.gottlob@cs.ox.ac.uk
Rolf Niedermeier (TU Berlin, chair), rolf.niedermeier@tu-berlin.de
Peter Widmayer (ETH Zurich), widmayer@inf.ethz.ch
The Award Committee is solely responsible for the selection of the winner of
the award which may be shared by more than one paper or series of papers. The
Award Committee reserves the right to declare no winner at all.
Eligibility.
Any research paper or series of research papers by a single author or
by a team
of authors published in a recognized refereed journal. The year of publication
should be at least two years and at most ten years before the year of
the award
nomination. The research work nominated for the award should be in the area of
multivariate algorithms and complexity meant in a broad sense, and
encompasses,
but is not restricted to, those areas covered by IPEC. The Award Committee has
the ultimate authority to decide on the eligibility of a nomination. Papers
authored by a member of the Award Committee are not eligible for nomination.
Nominations.
Nominations may be made by any member of the scientific community
including the
members of the Award Committee. A nomination should contain a brief
summary of
the technical content of each nominated paper and a brief explanation of its
significance. Nominations are done by an email to the Award Committee Chair
with copies to the members of the committee.
**********************************************************
*
* 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 Nerode Prize 2013 for outstanding papers in the area of multivariate
algorithmics.
Deadline for Nominations: January 1, 2013.
Decision: May 1, 2013.
The award is presented annually with the presentation taking place at IPEC
(International Symposium on Parameterized and Exact Computation). IPEC 2013
takes place within ALGO 2013, September 2--6, 2013, Sophia Antipolis, France.
See http://algo2013.inria.fr/
The Prize is named in honor of Anil Nerode in recognition of his major
contributions to mathematical logic, theory of automata, computability, and
complexity theory.
In 2013, the prize is awarded for the first time.
Award Committee.
The winning paper(s) is (are) selected by a committee of three members.
This year's committee consists of the following three people.
Georg Gottlob (Oxford University), georg.gottlob@cs.ox.ac.uk
Rolf Niedermeier (TU Berlin, chair), rolf.niedermeier@tu-berlin.de
Peter Widmayer (ETH Zurich), widmayer@inf.ethz.ch
The Award Committee is solely responsible for the selection of the winner of
the award which may be shared by more than one paper or series of papers. The
Award Committee reserves the right to declare no winner at all.
Eligibility.
Any research paper or series of research papers by a single author or
by a team
of authors published in a recognized refereed journal. The year of publication
should be at least two years and at most ten years before the year of
the award
nomination. The research work nominated for the award should be in the area of
multivariate algorithms and complexity meant in a broad sense, and
encompasses,
but is not restricted to, those areas covered by IPEC. The Award Committee has
the ultimate authority to decide on the eligibility of a nomination. Papers
authored by a member of the Award Committee are not eligible for nomination.
Nominations.
Nominations may be made by any member of the scientific community
including the
members of the Award Committee. A nomination should contain a brief
summary of
the technical content of each nominated paper and a brief explanation of its
significance. Nominations are done by an email to the Award Committee Chair
with copies to the members of the committee.
**********************************************************
*
* 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] NetSys 2013 - Call for Participation
*** Please Apologies multiple copies ***
======================================================================
======================= CALL FOR PARTICIPATION
========================
======================================================================
1st International Conference on Networked Systems 2013 (NetSys 2013)
March 11-15, 2013. Stuttgart, Germany
http://www.netsys2013.de/
======================================================================
Registration is open now: www.netsys2013.de/registration.html
Early registration deadline: January 31st, 2013
======================================================================
ABOUT THE CONFERENCE
The Conference on Networked Systems (NetSys 2013) provides an
international forum for engineers and scientists in academia,
industry, and government to discuss innovations in the realm of
networked systems – including aspects of networking, distributed
systems, communications, middleware, and applications.
This biennial international conference is the successor of the
conference series Kommunikation in Verteilten Systemen (KiVS), which
was started more than 30 years ago and developed to the major
scientific event in German-speaking countries in the field of
communications and distributed systems.
======================================================================
CONFERENCE HIGHLIGHTS
This year's conference highlights include an outstanding technical
program on recent advances in computer communications and networking
comprising:
* Keynote addresses by R. Fechner (Member of Board of Alcatel-Lucent
Deutschland AG, President Bell Labs Germany) and A. Rowstron
(Principle Researcher, Microsoft Research Cambridge)
* 16 technical papers reporting original research on networking,
distributed systems middleware, security, and networked applications
* Industry track with 6 invited talks from well-known experts in the
field of cloud computing, network virtualization, and
virtualization of embedded systems
* Four half-day workshops and six half-day tutorials
* Communication software demonstrations
* Doctoral forum with poster sessions
======================================================================
CONFERENCE CHAIRS
* K. Rothermel, University of Stuttgart, Germany
* A. Kirstädter, University of Stuttgart, Germany
* J. Charzinski, HdM Stuttgart, Germany
* M. Matthiesen, University of Stuttgart, Germany
* C. Becker, University of Mannheim, Germany
* K. Wehrle, RWTH Aachen, Germany
======================================================================
Looking forward to seeing you in Stuttgart!
**********************************************************
*
* 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 PARTICIPATION
========================
======================================================================
1st International Conference on Networked Systems 2013 (NetSys 2013)
March 11-15, 2013. Stuttgart, Germany
http://www.netsys2013.de/
======================================================================
Registration is open now: www.netsys2013.de/registration.html
Early registration deadline: January 31st, 2013
======================================================================
ABOUT THE CONFERENCE
The Conference on Networked Systems (NetSys 2013) provides an
international forum for engineers and scientists in academia,
industry, and government to discuss innovations in the realm of
networked systems – including aspects of networking, distributed
systems, communications, middleware, and applications.
This biennial international conference is the successor of the
conference series Kommunikation in Verteilten Systemen (KiVS), which
was started more than 30 years ago and developed to the major
scientific event in German-speaking countries in the field of
communications and distributed systems.
======================================================================
CONFERENCE HIGHLIGHTS
This year's conference highlights include an outstanding technical
program on recent advances in computer communications and networking
comprising:
* Keynote addresses by R. Fechner (Member of Board of Alcatel-Lucent
Deutschland AG, President Bell Labs Germany) and A. Rowstron
(Principle Researcher, Microsoft Research Cambridge)
* 16 technical papers reporting original research on networking,
distributed systems middleware, security, and networked applications
* Industry track with 6 invited talks from well-known experts in the
field of cloud computing, network virtualization, and
virtualization of embedded systems
* Four half-day workshops and six half-day tutorials
* Communication software demonstrations
* Doctoral forum with poster sessions
======================================================================
CONFERENCE CHAIRS
* K. Rothermel, University of Stuttgart, Germany
* A. Kirstädter, University of Stuttgart, Germany
* J. Charzinski, HdM Stuttgart, Germany
* M. Matthiesen, University of Stuttgart, Germany
* C. Becker, University of Mannheim, Germany
* K. Wehrle, RWTH Aachen, Germany
======================================================================
Looking forward to seeing you in Stuttgart!
**********************************************************
*
* 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] application of metaheuristics on large scale problems
Dear Colleague,
On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 9th International Conference on Large
Scale Scientific Computation - LSSC'13, June 3 - 7, 2013, Sozopol,
Bulgaria, with arrival: June 2 and departure: noon June 7.
The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.
Topics
The list of topics includes, but is not limited to:
combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu sepbalapra@mcs.anl.govarch
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc
Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).
Important deadlines
Deadline for submission of abstracts
January 15, 2013
Notification of acceptance of the talks on the basis of the submitted abstract
January 31, 2013
Deadline for submission of full papers
March 15, 2013
Notification of acceptance of full papers
April 30, 2013
Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.
Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).
Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom13.html
After the conference, extended versions of selected number of
accepted and presented papers will be published in special issue of
the International Journal of Metaheuristics.
Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
On behalf of the Organizing Committee, we invite you to participate in
the special session (workshop) on "APPLICATIONS OF METAHEURISTICS TO
LARGE-SCALE PROBLEMS" at the 9th International Conference on Large
Scale Scientific Computation - LSSC'13, June 3 - 7, 2013, Sozopol,
Bulgaria, with arrival: June 2 and departure: noon June 7.
The session is organized by:
Assoc. Prof. Stefka Fidanova (stefka@parallel.bas.bg)
from the Institut of Information and Communication Technologies
(former Institute for Parallel Processing), Bulgarian Academy of
Sciences and
Gabriel Luque (gabriel@lcc.uma.es) from University of Malaga, Spain.
Topics
The list of topics includes, but is not limited to:
combinatorial optimization
global optimization
multiobjective optimization
optimization in dynamic and/or noisy environments
large scale optimization
parallel and distributed approaches in optimization
random search algorithms,
simulated annealing,
tabu sepbalapra@mcs.anl.govarch
other derivative free optimization methods
nature inspired optimization methods (evolutionary algorithms, ant
colony optimization, particle swarm optimization, immune artificial
systems etc)
hybrid optimization algorithms involving natural computing
techniques and other global and local optimization methods
optimization methods for learning processes and data mining
computational optimization methods in statistics, econometrics,
finance, physics, medicine, biology, engineering etc
Proceedings
We plan to continue publishing the proceedings of only refereed and
presented papers as a special volume of Springer Lecture Notes in
Computer Science (LNCS).
Important deadlines
Deadline for submission of abstracts
January 15, 2013
Notification of acceptance of the talks on the basis of the submitted abstract
January 31, 2013
Deadline for submission of full papers
March 15, 2013
Notification of acceptance of full papers
April 30, 2013
Abstracts and contributed papers
The abstracts (up to 1 page stating clearly the originality of the
results) are to be written in standard LaTeX. The length of the
contributed papers is limited up to 8 pages. It is assumed that one
participant will present not more than one talk.
Send the abstracts and papers to special session organizers and
conference organizers, indicating the name of the special session.
After sending the abstract go to the conference web page and fill in
the registration form (personal data of the participants, minimum one
per paper, and the name of the special session).
Information about abstract and paper preparation, accommodation,
transportation, registration form and conference location you can find
at the conference web page
http://parallel.bas.bg/Conferences/SciCom13.html
After the conference, extended versions of selected number of
accepted and presented papers will be published in special issue of
the International Journal of Metaheuristics.
Special session organizers
Prof. Stefka Fidanova
Prof. Gabriel Luque
--
Assoc. Prof. Stefka Fidanova
IICT-BAS
Acad. G. Bonchev str. bl.25A
1113 Sofia Bulgaria
Ph. +359-2-9796642
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] CSEDays 2013: student school on algorithms and complexity
Computer Science E-days (CSEDays)
Algorithms and Complexity
Ekaterinburg, Russia, June 29 -- July 01, 2013
http://www.csedays.ru/theory2013/about
Algorithms and Complexity
Ekaterinburg, Russia, June 29 -- July 01, 2013
http://www.csedays.ru/theory2013/about
ABOUT THE SCHOOL
Computer Science days in Ekaterinburg (CSEdays) is a series of schools organized
by the Ural Federal University, the biggest Russian university outside Moscow.
The first school took place in 2010. Working languages of the school are
English and Russian.
The main objective of the CSEdays is to expose the students in
computer science and
related disciplines to the research topics usually not covered within
the regular
university curricula. Previous editions of the school were focused on various
computer science and software engineering topics such as software reliability,
information security and cryptography, multi-agent systems, computer networks,
and graph theory & applications. The school is addressed to advanced graduate
and PhD students in mathematics, computer science, and software engineering,
as well as young researchers and software developers from industry.
The 6th school will be held in Ekaterinburg, Russia on June 29 -- July 01, 2013.
The topic of the school is "Algorithms and Complexity". The program will
consist of 4 short lecture courses as well as student presentations and
poster sessions. Students are encouraged to submit not only published or
completed research, but also a short summary of work in progress or even a
concise review of a problem area. The primary goal of submitting a paper,
as we see it, is getting feedback from experts in complexity theory as well
as school lecturers and participants.
A submission should include a two page long extended abstract (formatted
in LaTeX, see the template below) plus an arbitrarily long appendix. Such
an appendix may include a full paper (published, submitted, or just
written) and/or some extra material to accompany the abstract: proofs,
tables, graphs, formal description of algorithms, etc. All submissions
will be reviewed by experts and the reviews will be sent to the authors.
The authors of accepted submissions are supposed to give a short talk or
to present a poster at the school. Extended abstracts of accepted
submissions will also be published in the internal proceedings of the
school.
The school will be held right after the 8th International Computer Science
Symposium in Russia (CSR 2013, June 25--29): http://csr2013.urfu.ru/
Any participant of the school may arrive earlier and attend the talks of
the CSR 2013 without paying the conference registration fee.
LECTURERS
Konstantin Makarychev (Microsoft Research, US)
http://www.cs.princeton.edu/~kmakaryc/
Semidefinite programming and approximation algorithms
Alexander Shen (Montpellier Laboratory of Informatics, Robotics,
and Microelectronics and Institute for Information Transmission Problems, RU)
http://www.lirmm.fr/~ashen
Kolmogorov complexity
Mario Szegedy (Rutgers University, US)
http://www.cs.rutgers.edu/~szegedy/
Lovász Local Lemma
Ryan Williams (Stanford University, US)
http://www.stanford.edu/~rrwill/
Connections Between Algorithms and Lower Bounds
HOW TO APPLY
Participation in the school is free of charge and includes school
materials, coffee breaks,
and social events. Organizers will provide a limited number of
accommodation grants for up
to three nights (when distributing the grants, the students who
proposed a talk at the
school will receive higher priority). The school will admit up to 60
participants selected
by the program committee among all applicants. The registration form
will be open
in the end of January.
IMPORTANT DATES
Application deadline: April 10, 2013
Notification of acceptance: May 10, 2013
CSR 2013 conference: June 25--29, 2013
School: June 29 -- July 1, 2013
VENUE
Ekaterinburg is a large city in the heart of Russia, 1600 km (a 2 hour
flight) east from
Moscow. It is the capital city as well as the main financial,
cultural, and scientific
centre of the Ural region. Ekaterinburg is accessible by direct
regular flights of a
number of international airlines including Lufthansa, Aeroflot,
Finnair, Czech Airlines,
Turkish Airlines, and FlyDubai. Ural Federal University is the largest
Russian university
outside Moscow.
FURTHER INFO
Further info will appear on the school webpage:
http://www.csedays.ru/theory2013/about
**********************************************************
*
* 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] Call for Participation - CTIC Workshop on Algebraic Complexity Theory
CTIC Workshop on Algebraic Complexity Theory
On 18-22 March 2013, CTIC Aarhus hosts a Workshop on Algebraic Complexity Theory.
Algebraic Complexity Theory is a classical subfield of computational complexity theory. In recent years, the field has been the subject of an intense revival. The purpose of this workshop is to bring together world leading experts within Algebraic complexity with the aim of discussing the current state of the art and setting the directions for the future.
Confirmed invited speaker are
V. Arvind - The Institute of Mathematical Sciences,
Markus Bläser - Saarland University,
Peter Bürgisser, University of Paderborn
Harry Buhrman - CWI,
Pascal Koiran - ENS Lyon,
Meena Mahajan - The Institute of Mathematical Sciences,
Periklis Papakonstantinou - IIIS, Tsinghua University,
Ran Raz - Weizman,
Amir Sphilka - Technion,
Iddo Tzameret - IIIS, Tsinghua University
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/wact2013/
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 18-22 March 2013, CTIC Aarhus hosts a Workshop on Algebraic Complexity Theory.
Algebraic Complexity Theory is a classical subfield of computational complexity theory. In recent years, the field has been the subject of an intense revival. The purpose of this workshop is to bring together world leading experts within Algebraic complexity with the aim of discussing the current state of the art and setting the directions for the future.
Confirmed invited speaker are
V. Arvind - The Institute of Mathematical Sciences,
Markus Bläser - Saarland University,
Peter Bürgisser, University of Paderborn
Harry Buhrman - CWI,
Pascal Koiran - ENS Lyon,
Meena Mahajan - The Institute of Mathematical Sciences,
Periklis Papakonstantinou - IIIS, Tsinghua University,
Ran Raz - Weizman,
Amir Sphilka - Technion,
Iddo Tzameret - IIIS, Tsinghua University
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/wact2013/
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] IEEE-IPDPS 2013 ALERT: WORKSHOPS, PhD FORUM, AND COMMERCIAL PARTICIPATION
December 15, 2012 Release
---------------------------------------------
IEEE-IPDPS 2013 WORKSHOPS
See submission due dates in December and January
Dates listed below for each workshop
http://www.ipdps.org/ipdps2013/2013_workshops.html
IPDPS 2013 PhD FORUM
Deadline for submissions is January 14, 2013
Call for posters submission requirements posted
See www.ipdps.org and follow link
IPDPS 2013 COMMERCIAL PARTICIPATION
See details at http://www.ipdps.org/ipdps2013/2013_commercial.html
See 2013 Patrons at http://www.ipdps.org/ipdps2013/2013_patrons.html
---------------------------------------------
27th IEEE International Parallel & Distributed Processing Symposium
Boston-Cambridge, USA
20-24 May 2013
www.ipdps.org
----------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
Hosted by Boston University
----------------------------------------------
In response to the IPDPS 2013 Call for Papers, 492 submissions were
received by the October 1, 2012 deadline and are under review. Authors
were invited to submit papers covering all areas of parallel and
distributed processing that address topics of interest in the four
areas of algorithms, applications, architecture and software. The
papers selected will be presented in technical sessions on Tuesday,
Wednesday and Thursday of the conference along with daily keynote
presentations. Author notification is December 23, 2012.
GENERAL CO-CHAIRS
Martin Herbordt (Boston University, USA)
Charles C. (Chip) Weems (University of Massachusetts at Amherst, USA)
PROGRAM CHAIR
Sanjay Ranka (University of Florida, USA)
----------------------------------------------
PhD FORUM CO-CHAIRS
Luc Bougé (ENS Cachan, France)
Bo Hong (Georgia Institute of Technology, USA)
The PhD Forum offers graduate students an opportunity to present a
research poster describing their ongoing dissertation to the entire
IPDPS conference audience and to submit a short paper for publication.
The deadline for submissions is January 14, 2013. See details at
www.ipdps.org.
----------------------------------------------
LOCAL PARTICIPATION & COMMERCIAL CHAIR
Ayse Coskun (Boston University, USA)
IPDPS extends a special invitation to Boston area companies to
consider participation in IPDPS 2013 to share in the benefits of
associating with an international community of top researchers and
practitioners in fields related to parallel processing and distributed
computing.
Details at http://www.ipdps.org/ipdps2013/2013_commercial.html
Current Patrons page at http://www.ipdps.org/ipdps2013/2013_patrons.html
----------------------------------------------
WORKSHOPS CHAIR
Ümit V. Çatalyürek (Ohio State University, USA)
ABOUT IPDPS WORKSHOPS
IPDPS workshops, held on the first and last day of the conference, are
a major part of the IPDPS week-long family of events. These workshops
provide the IPDPS community an opportunity to explore special topics,
and the goal of the workshops is to present work that is more
preliminary and cutting-edge or that has more practical content than
the more mature research presented in the main symposium. Proceedings
of the workshops are published by the IEEE Digital Library and are
distributed at the conference.
Below is the list of workshops planned for 2013 in Boston with the due
dates for submission of manuscripts. Each is linked from the IPDPS
Webpage at http://www.ipdps.org/ipdps2013/2013_workshops.html. Note
that all workshops have their own Website and Call for Papers and may
make changes in their submission requirements and due dates. Note that
most workshops have a due date for submissions later than the author
notification date of December 23rd for regular conference papers.
-------------------------------------------------------
MONDAY WORKSHOPS - May 20th, 2013
-------------------------------------------------------
HCW (7-Jan-2013)
--Heterogeneity in Computing Workshop
RAW (16-Dec-2012)
--Reconfigurable Architectures Workshop
HIPS (30-Dec-2012)
--High-Level Parallel Programming Models & Supportive Environments
NIDISC (6-Jan-2013)
--Nature Inspired Distributed Computing
HiCOMB (28-Dec-2012)
--High Performance Computational Biology
APDCM (26-Dec-2012)
--Advances in Parallel and Distributed Computing Models
CASS (6-Jan-2013)
--Communication Architecture for Scalable Systems
HPPAC (14-Jan-2012)
--High-Performance, Power-Aware Computing
HPGC (7-Jan-13)
--High-Performance Grid and Cloud Computing
ASHES (11-Jan-13)
--Accelerators and Hybrid Exascale Systems
PLC (11-Jan-2013)
--Multicore and GPU Programming Models, Languages and Compilers
EduPar (11-Jan-13)
--Parallel and Distributed Computing Education (NSF/TCPP Workshop)
---------------------------------------------
FRIDAY WORKSHOPS - May 24th
---------------------------------------------
PDSEC (31-Dec-2012)
--Parallel and Distributed Scientific and Engineering Computing
DPDNS (30-Dec-2012)
--Dependable Parallel, Distributed and Network-Centric Systems
MTAAP (13-Jan-2013)
--Multi-Threaded Architectures and Applications
LSPP (6-Jan-2013 )
--Large-Scale Parallel Processing
PCO (4-Jan-2013)
--Parallel Computing and Optimization
ParLearning (13-Jan-2013)
--Parallel and Distributed Computing for Machine Learning and Inference Problems
HPDIC (1-Jan-2013)
--High Performance Data Intensive Computing
CloudFlow (9-Jan-2013 )
--Workflow Models, Systems, Services and Applications in the Cloud
JSSPP (17-Feb-2013)
--Job Scheduling Strategies for Parallel Processing
ViPES (21-Dec-2012)
--Virtual Prototyping of Parallel and Embedded Systems
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
---------------------------------------------
IEEE-IPDPS 2013 WORKSHOPS
See submission due dates in December and January
Dates listed below for each workshop
http://www.ipdps.org/ipdps2013/2013_workshops.html
IPDPS 2013 PhD FORUM
Deadline for submissions is January 14, 2013
Call for posters submission requirements posted
See www.ipdps.org and follow link
IPDPS 2013 COMMERCIAL PARTICIPATION
See details at http://www.ipdps.org/ipdps2013/2013_commercial.html
See 2013 Patrons at http://www.ipdps.org/ipdps2013/2013_patrons.html
---------------------------------------------
27th IEEE International Parallel & Distributed Processing Symposium
Boston-Cambridge, USA
20-24 May 2013
www.ipdps.org
----------------------------------------------
Sponsored by IEEE Computer Society Technical Committee on Parallel Processing
In cooperation with ACM SIGARCH, IEEE Computer Society Technical
Committee on Computer Architecture, and IEEE Computer Society
Technical Committee on Distributed Processing
----------------------------------------------
Hosted by Boston University
----------------------------------------------
In response to the IPDPS 2013 Call for Papers, 492 submissions were
received by the October 1, 2012 deadline and are under review. Authors
were invited to submit papers covering all areas of parallel and
distributed processing that address topics of interest in the four
areas of algorithms, applications, architecture and software. The
papers selected will be presented in technical sessions on Tuesday,
Wednesday and Thursday of the conference along with daily keynote
presentations. Author notification is December 23, 2012.
GENERAL CO-CHAIRS
Martin Herbordt (Boston University, USA)
Charles C. (Chip) Weems (University of Massachusetts at Amherst, USA)
PROGRAM CHAIR
Sanjay Ranka (University of Florida, USA)
----------------------------------------------
PhD FORUM CO-CHAIRS
Luc Bougé (ENS Cachan, France)
Bo Hong (Georgia Institute of Technology, USA)
The PhD Forum offers graduate students an opportunity to present a
research poster describing their ongoing dissertation to the entire
IPDPS conference audience and to submit a short paper for publication.
The deadline for submissions is January 14, 2013. See details at
www.ipdps.org.
----------------------------------------------
LOCAL PARTICIPATION & COMMERCIAL CHAIR
Ayse Coskun (Boston University, USA)
IPDPS extends a special invitation to Boston area companies to
consider participation in IPDPS 2013 to share in the benefits of
associating with an international community of top researchers and
practitioners in fields related to parallel processing and distributed
computing.
Details at http://www.ipdps.org/ipdps2013/2013_commercial.html
Current Patrons page at http://www.ipdps.org/ipdps2013/2013_patrons.html
----------------------------------------------
WORKSHOPS CHAIR
Ümit V. Çatalyürek (Ohio State University, USA)
ABOUT IPDPS WORKSHOPS
IPDPS workshops, held on the first and last day of the conference, are
a major part of the IPDPS week-long family of events. These workshops
provide the IPDPS community an opportunity to explore special topics,
and the goal of the workshops is to present work that is more
preliminary and cutting-edge or that has more practical content than
the more mature research presented in the main symposium. Proceedings
of the workshops are published by the IEEE Digital Library and are
distributed at the conference.
Below is the list of workshops planned for 2013 in Boston with the due
dates for submission of manuscripts. Each is linked from the IPDPS
Webpage at http://www.ipdps.org/ipdps2013/2013_workshops.html. Note
that all workshops have their own Website and Call for Papers and may
make changes in their submission requirements and due dates. Note that
most workshops have a due date for submissions later than the author
notification date of December 23rd for regular conference papers.
-------------------------------------------------------
MONDAY WORKSHOPS - May 20th, 2013
-------------------------------------------------------
HCW (7-Jan-2013)
--Heterogeneity in Computing Workshop
RAW (16-Dec-2012)
--Reconfigurable Architectures Workshop
HIPS (30-Dec-2012)
--High-Level Parallel Programming Models & Supportive Environments
NIDISC (6-Jan-2013)
--Nature Inspired Distributed Computing
HiCOMB (28-Dec-2012)
--High Performance Computational Biology
APDCM (26-Dec-2012)
--Advances in Parallel and Distributed Computing Models
CASS (6-Jan-2013)
--Communication Architecture for Scalable Systems
HPPAC (14-Jan-2012)
--High-Performance, Power-Aware Computing
HPGC (7-Jan-13)
--High-Performance Grid and Cloud Computing
ASHES (11-Jan-13)
--Accelerators and Hybrid Exascale Systems
PLC (11-Jan-2013)
--Multicore and GPU Programming Models, Languages and Compilers
EduPar (11-Jan-13)
--Parallel and Distributed Computing Education (NSF/TCPP Workshop)
---------------------------------------------
FRIDAY WORKSHOPS - May 24th
---------------------------------------------
PDSEC (31-Dec-2012)
--Parallel and Distributed Scientific and Engineering Computing
DPDNS (30-Dec-2012)
--Dependable Parallel, Distributed and Network-Centric Systems
MTAAP (13-Jan-2013)
--Multi-Threaded Architectures and Applications
LSPP (6-Jan-2013 )
--Large-Scale Parallel Processing
PCO (4-Jan-2013)
--Parallel Computing and Optimization
ParLearning (13-Jan-2013)
--Parallel and Distributed Computing for Machine Learning and Inference Problems
HPDIC (1-Jan-2013)
--High Performance Data Intensive Computing
CloudFlow (9-Jan-2013 )
--Workflow Models, Systems, Services and Applications in the Cloud
JSSPP (17-Feb-2013)
--Job Scheduling Strategies for Parallel Processing
ViPES (21-Dec-2012)
--Virtual Prototyping of Parallel and Embedded Systems
**********************************************************
*
* 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
