CSR-2014: First Call for Papers
The 9th International Computer Science Symposium in Russia
June 6-12, 2014, Moscow, Russia
http://logic.pdmi.ras.ru/csr2014
Program Committee Chair:
Jean-Eric Pin (CNRS and U. Paris-Diderot)
Program Committee:
Eric Allender (Rutgers)
Andris Ambainis (U. of Latvia)
Christel Baier (TU Dresden)
Petra Berenbrink (Simon Fraser U.)
Mikolaj Bojanczyk (U. of Warsaw)
Andrei Bulatov (Simon Fraser U.)
Victor Dalmau (U. Pompeu Fabra)
Manfred Droste (U. of Leipzig)
Zoltan Esik (U. of Szeged)
Fedor Fomin (U. of Bergen)
Edward A. Hirsch (Steklov Inst./St.Petersburg)
Gregory Kucherov (CNRS and U. Marne-la-Vallee)
Michal Kunc (Masaryk U.)
Leonid Libkin (U. of Edinburgh)
Konstantin Makarychev (Microsoft Research)
Kurt Mehlhorn (Max-Planck Inst.)
Georg Moser (U. of Innsbruck)
Alexander Okhotin (U. of Turku)
Giovanni Pighizzini (U. of Milano)
Alexander Razborov (U. of Chicago and Steklov Inst./Moscow)
Michel Rigo (U. of Liege)
Nicole Schweikardt (U. of Frankfurt)
Jacobo Toran (U. of Ulm)
Mikhail Volkov (Ural Federal U.)
Carsten Witt (TU Denmark)
Distinguished opening lecture:
Shafi Goldwasser (MIT)
Invited Speakers include:
Mark Braverman (Princeton)
Volker Diekert (Stuttgart)
Martin Grohe (RWTH Aachen)
Benjamin Rossman (National Institute of Informatics, Tokyo)
Alexei Semenov (Moscow)
Igor Walukiewicz (Bordeaux)
Important Dates:
Submission: December 9, 2013
Notification: February 12, 2014
Topics: include, but are not limited to:
algorithms and data structures
algorithms for concurrent and distributed systems, networks
computational complexity
proof complexity
Kolmogorov complexity
combinatorial optimization
constraint solving
cryptography
combinatorics in computer science
automata theory and formal languages
computational models and concepts
database theory
applications of logic to computer science
proof theory
model checking
automated reasoning
deductive methods
Submission:
Authors are invited to submit original (and not previously published)
research. Submissions consist of two parts: the main paper and an appendix
(which might be empty). The main paper must be at most 14 pages in length,
including references. All proofs omitted from the main paper due to space
constraints should be given in the appendix or made accessible through a
reliable link to a freely available electronic preprint. The papers must
be submitted in English, in the LNCS format (LaTeX, as pdf; final version
with source) with page numbering turned on using the \pagestyle{plain}
command; instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Simultaneous submission to journals or to other conferences with published
proceedings is not allowed. The proceedings of the symposium will be
published in Springer's LNCS series. Accepted papers MUST be presented
at the symposium.
Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2014
Yandex Awards
for the best paper and for the best student paper will be given by the PC.
Conference co-Chairs:
Nikolay Vereshchagin (Moscow)
Edward A. Hirsch (St.Petersburg)
Sergey O. Kuznetsov (Moscow)
Organized by
Moscow Center for Continuous Mathematical Education,
Higher School of Economics,
Steklov Institute of Mathematics at St.Petersburg of Russian Academy of Sciences
Sponsored by
Yandex
Russian Foundation for Basic Research
Further information and contacts:
Web: http://logic.pdmi.ras.ru/csr2014
Email: csr2014 "at" googlegroups.com
UNSUBSCRIPTION: If you do not wish to receive any news
regarding CSR conferences, please reply to this mail
and I will remove you from the mailing list.
Saturday, October 26, 2013
Friday, October 25, 2013
[DMANET] CfP EvoCOP 2014: submission deadline extension
** Apologies for multiple copies **
EvoCOP 2014 - 14th European Conference on Evolutionary Computation in
Combinatorial Optimisation
********************************************************
** SUBMISSION DEADLINE EXTENDED TO: NOVEMBER 11, 2013 **
********************************************************
April 23-25, 2014
Granada, Spain
Part of EVO* 2014 (http://www.evostar.org) including: EuroGP, EvoCOP,
EvoBIO, EvoMUSART and EvoApplications
The 14th European Conference on Evolutionary Computation in
Combinatorial Optimisation is a multidisciplinary conference that brings
together researchers working on metaheuristics for solving difficult
combinatorial optimization problems appearing in various industrial,
economic, and scientific domains. Prominent examples of metaheuristics
include: evolutionary algorithms, simulated annealing, tabu search,
scatter search and path relinking, memetic algorithms, ant colony and
bee colony optimization, particle swarm optimization, variable
neighbourhood search, iterated local search, greedy randomized adaptive
search procedures, estimation of distribution algorithms, and
hyperheuristics. Successfully solved problems include scheduling,
timetabling, network design, transportation and distribution problems,
vehicle routing, travelling salesman, graph problems, satisfiability,
energy optimization problems, packing problems, planning problems, and
general mixed integer programming.
The EvoCOP 2014 conference will be held in Granada located in the south
of Spain. It will be held in conjunction with EuroGP (the 17th European
Conference on Genetic Programming), EvoBio (the 12th European Conference
on Evolutionary Computation, Machine Learning and Data Mining in
Computational Biology), EvoMUSART (12th European conference on
evolutionary and biologically inspired music, sound, art and design) and
EvoApplications (specialist events on a range of evolutionary
computation topics and applications), in a joint event collectively
known as EVO*.
For more information see the EvoCOP 2014 webpage
http://www.evostar.org/cfpEvoCOP.html
Areas of Interest and Contributions
Topics of interest include, but are not limited to:
Applications of metaheuristics to combinatorial optimization problems
Novel application domains for metaheuristic optimisation methods
Representation techniques
Neighborhoods and efficient algorithms for searching them
Variation operators for stochastic search methods
Constraint-handling techniques
Hybrid methods and hybridization techniques
Parallelization
Theoretical developments
Search space and landscape analyses
Comparisons between different (also exact) techniques
Metaheuristics and machine learning
Ant colony optimisation
Artificial immune systems
Bee colony optimization
Genetic programming and Genetic algorithms
(Meta-)heuristics
Scatter search
Particle swarm optimisation
Tabu search, iterated local search and variable neighborhood search
Memetic algorithms and hyperheuristics
Estimation of distribution algorithms
String processing
Scheduling and timetabling
Network design
Vehicle routing
Graph problems
Satisfiability
Packing and cutting problems
Energy optimization problems
Practical solving of NP-hard problems
Mixed integer programming
Multi-objective optimisation
Grid computing
Combinatorial optimisation
Nature and Bio-inspired methods
Quantum computing and quantum annealing
Optimization in Cloud computing
Search-based software engineering
Publication Details
All accepted papers will be presented orally at the conference and
printed in the proceedings published by Springer in the LNCS series (see
LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022,
6622, 7245 and 7832 for the previous proceedings).
Submission Details
Submissions must be original and not published elsewhere. The
submissions will be peer reviewed by members of the program committee.
The authors of accepted papers will have to improve their paper on the
basis of the reviewers comments and will be asked to send a camera ready
version of their manuscripts. At least one author of each accepted work
has to register for the conference, attend the conference and present
the work.
The reviewing process will be double-blind, please omit information
about the authors in the submitted paper. Submit your manuscript in
Springer LNCS format.
Submission link: http://myreview.csregistry.org/evocop14/
Page limit: 12 pages
Important Dates
Submission deadline (extended): November 11, 2013
EVO* event: April 23-25, 2014
Programme Chairs
Christian Blum (Ikerbasque, Basque Foundation for Science, Spain)
christian.c.blum(at)gmail.com
Gabriela Ochoa (University of Stirling, Scotland, UK)
gabriela.ochoa(at)cs.stir.ac.uk
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
EvoCOP 2014 - 14th European Conference on Evolutionary Computation in
Combinatorial Optimisation
********************************************************
** SUBMISSION DEADLINE EXTENDED TO: NOVEMBER 11, 2013 **
********************************************************
April 23-25, 2014
Granada, Spain
Part of EVO* 2014 (http://www.evostar.org) including: EuroGP, EvoCOP,
EvoBIO, EvoMUSART and EvoApplications
The 14th European Conference on Evolutionary Computation in
Combinatorial Optimisation is a multidisciplinary conference that brings
together researchers working on metaheuristics for solving difficult
combinatorial optimization problems appearing in various industrial,
economic, and scientific domains. Prominent examples of metaheuristics
include: evolutionary algorithms, simulated annealing, tabu search,
scatter search and path relinking, memetic algorithms, ant colony and
bee colony optimization, particle swarm optimization, variable
neighbourhood search, iterated local search, greedy randomized adaptive
search procedures, estimation of distribution algorithms, and
hyperheuristics. Successfully solved problems include scheduling,
timetabling, network design, transportation and distribution problems,
vehicle routing, travelling salesman, graph problems, satisfiability,
energy optimization problems, packing problems, planning problems, and
general mixed integer programming.
The EvoCOP 2014 conference will be held in Granada located in the south
of Spain. It will be held in conjunction with EuroGP (the 17th European
Conference on Genetic Programming), EvoBio (the 12th European Conference
on Evolutionary Computation, Machine Learning and Data Mining in
Computational Biology), EvoMUSART (12th European conference on
evolutionary and biologically inspired music, sound, art and design) and
EvoApplications (specialist events on a range of evolutionary
computation topics and applications), in a joint event collectively
known as EVO*.
For more information see the EvoCOP 2014 webpage
http://www.evostar.org/cfpEvoCOP.html
Areas of Interest and Contributions
Topics of interest include, but are not limited to:
Applications of metaheuristics to combinatorial optimization problems
Novel application domains for metaheuristic optimisation methods
Representation techniques
Neighborhoods and efficient algorithms for searching them
Variation operators for stochastic search methods
Constraint-handling techniques
Hybrid methods and hybridization techniques
Parallelization
Theoretical developments
Search space and landscape analyses
Comparisons between different (also exact) techniques
Metaheuristics and machine learning
Ant colony optimisation
Artificial immune systems
Bee colony optimization
Genetic programming and Genetic algorithms
(Meta-)heuristics
Scatter search
Particle swarm optimisation
Tabu search, iterated local search and variable neighborhood search
Memetic algorithms and hyperheuristics
Estimation of distribution algorithms
String processing
Scheduling and timetabling
Network design
Vehicle routing
Graph problems
Satisfiability
Packing and cutting problems
Energy optimization problems
Practical solving of NP-hard problems
Mixed integer programming
Multi-objective optimisation
Grid computing
Combinatorial optimisation
Nature and Bio-inspired methods
Quantum computing and quantum annealing
Optimization in Cloud computing
Search-based software engineering
Publication Details
All accepted papers will be presented orally at the conference and
printed in the proceedings published by Springer in the LNCS series (see
LNCS volumes 2037, 2279, 2611, 3004, 3448, 3906, 4446, 4972, 5482, 6022,
6622, 7245 and 7832 for the previous proceedings).
Submission Details
Submissions must be original and not published elsewhere. The
submissions will be peer reviewed by members of the program committee.
The authors of accepted papers will have to improve their paper on the
basis of the reviewers comments and will be asked to send a camera ready
version of their manuscripts. At least one author of each accepted work
has to register for the conference, attend the conference and present
the work.
The reviewing process will be double-blind, please omit information
about the authors in the submitted paper. Submit your manuscript in
Springer LNCS format.
Submission link: http://myreview.csregistry.org/evocop14/
Page limit: 12 pages
Important Dates
Submission deadline (extended): November 11, 2013
EVO* event: April 23-25, 2014
Programme Chairs
Christian Blum (Ikerbasque, Basque Foundation for Science, Spain)
christian.c.blum(at)gmail.com
Gabriela Ochoa (University of Stirling, Scotland, UK)
gabriela.ochoa(at)cs.stir.ac.uk
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] Postdoc position in the Discrete Optimization group at EPFL
The "Discrete Optimization Group" at EPFL, Switzerland
http://disopt.epfl.ch/ invites applications for a Postdoc position.
The appointment is for 12 months.
The research interests of the group are in integer programming,
approximation algorithms, network design, computational and discrete
geometry and applied optimization. We are looking for a candidate
whose research interests lie in at least one of the fields above.
The Postdoc position comes with teaching obligations. This either
means that the prospective holder of the position serves as a teaching
assistant or teaches one 2h-course per semester at the doctoral level.
Applications (including curriculum vitae, list of publications,
research plan, names of three references with their e-mail addresses,
and intended period of stay) should be sent to Friedrich Eisenbrand
( friedrich.eisenbrand@epfl.ch ). Electronic applications are welcome
and should consist of one single PDF-file.
The deadline for applications is November 30, 2013. The earliest starting
date is February 1, 2013.
Friedrich Eisenbrand
**********************************************************
*
* 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://disopt.epfl.ch/ invites applications for a Postdoc position.
The appointment is for 12 months.
The research interests of the group are in integer programming,
approximation algorithms, network design, computational and discrete
geometry and applied optimization. We are looking for a candidate
whose research interests lie in at least one of the fields above.
The Postdoc position comes with teaching obligations. This either
means that the prospective holder of the position serves as a teaching
assistant or teaches one 2h-course per semester at the doctoral level.
Applications (including curriculum vitae, list of publications,
research plan, names of three references with their e-mail addresses,
and intended period of stay) should be sent to Friedrich Eisenbrand
( friedrich.eisenbrand@epfl.ch ). Electronic applications are welcome
and should consist of one single PDF-file.
The deadline for applications is November 30, 2013. The earliest starting
date is February 1, 2013.
Friedrich Eisenbrand
**********************************************************
*
* 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, October 24, 2013
Call: Postdoc & MSc grants in Comp. Creativity (project ConCreTe)
[apologies for cross posting, please distribute]
We invite applications for a 3-year, full time post-doctoral research associateship, based in University of Coimbra, Portugal, focused on concept creation technology. The position forms part of an European Union Framework Programme 7 grant, collaborative with 5 other academic institutions. The project has a duration of 36 months.
As a whole, the project, ConCreTe, will investigate computational models for the representation and production of previously unseen concepts, and apply them in context of various forms of creativity (e.g., design, narrative, poetry). It will also investigate evaluation methods for creative systems, including comparison with humans via neuroscientific approaches. The project revolves around the central framework of a simulated cognitive architecture, making explicit the relationship between creativity and consciousness, and forming an environment within which different kinds of concept generator can work in competitive parallel and be compared.
University of Coimbra will maily contribute to the workpackages on Conceptual Representations (particularly by exploring representations based in Regulated Activation Networks), on Concept Creation (e.g., by exploring Conceptual Blending and Bio-inspired concept generation mechanisms), on the development of Applications of the framework (e.g., for Design and for Text Processing) and on the Evaluation of Creativity.
The successful applicant will have a strong background in artificial intelligence, and will be a competent programmer. They will be willing to co-supervise PhD and MSc students working in themes of the project. They will be competent communicators, both formally and informally, and they will be prepared to collaborate with and travel to partner institutions for extended working periods (not normally longer than 2 weeks).
We have one Post-doc and 2 MSc grants available within the 3-years FP7 project ConCreTe:
Postdoc: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39612 (Deadline: 31-10-2013)
MSc 1: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39611 (Deadline: 31-10-2013)
MSc 2: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39569 (Deadline: 30-10-2013)
More about ConCreTe:
https://www.cisuc.uc.pt/projects/show/172
Applications should be sent to:
machado(at)dei.uc.pt
and
amilcar(at)dei.uc.pt
Best regards,
Penousal machado
We invite applications for a 3-year, full time post-doctoral research associateship, based in University of Coimbra, Portugal, focused on concept creation technology. The position forms part of an European Union Framework Programme 7 grant, collaborative with 5 other academic institutions. The project has a duration of 36 months.
As a whole, the project, ConCreTe, will investigate computational models for the representation and production of previously unseen concepts, and apply them in context of various forms of creativity (e.g., design, narrative, poetry). It will also investigate evaluation methods for creative systems, including comparison with humans via neuroscientific approaches. The project revolves around the central framework of a simulated cognitive architecture, making explicit the relationship between creativity and consciousness, and forming an environment within which different kinds of concept generator can work in competitive parallel and be compared.
University of Coimbra will maily contribute to the workpackages on Conceptual Representations (particularly by exploring representations based in Regulated Activation Networks), on Concept Creation (e.g., by exploring Conceptual Blending and Bio-inspired concept generation mechanisms), on the development of Applications of the framework (e.g., for Design and for Text Processing) and on the Evaluation of Creativity.
The successful applicant will have a strong background in artificial intelligence, and will be a competent programmer. They will be willing to co-supervise PhD and MSc students working in themes of the project. They will be competent communicators, both formally and informally, and they will be prepared to collaborate with and travel to partner institutions for extended working periods (not normally longer than 2 weeks).
We have one Post-doc and 2 MSc grants available within the 3-years FP7 project ConCreTe:
Postdoc: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39612 (Deadline: 31-10-2013)
MSc 1: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39611 (Deadline: 31-10-2013)
MSc 2: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39569 (Deadline: 30-10-2013)
More about ConCreTe:
https://www.cisuc.uc.pt/projects/show/172
Applications should be sent to:
machado(at)dei.uc.pt
and
amilcar(at)dei.uc.pt
Best regards,
Penousal machado
[DMANET] Call: Postdoc & MSc grants in Comp. Creativity (project ConCreTe)
[apologies for cross posting, please distribute]
We invite applications for a 3-year, full time post-doctoral research
associateship, based in University of Coimbra, Portugal, focused on
concept creation technology. The position forms part of an European
Union Framework Programme 7 grant, collaborative with 5 other academic
institutions. The project has a duration of 36 months.
As a whole, the project, ConCreTe, will investigate computational
models for the representation and production of previously unseen
concepts, and apply them in context of various forms of creativity
(e.g., design, narrative, poetry). It will also investigate
evaluation methods for creative systems, including comparison with
humans via neuroscientific approaches. The project revolves around the
central framework of a simulated cognitive architecture, making
explicit the relationship between creativity and consciousness, and
forming an environment within which different kinds of concept
generator can work in competitive parallel and be compared.
University of Coimbra will maily contribute to the workpackages on
Conceptual Representations (particularly by exploring representations
based in Regulated Activation Networks), on Concept Creation (e.g., by
exploring Conceptual Blending and Bio-inspired concept generation
mechanisms), on the development of Applications of the framework
(e.g., for Design and for Text Processing) and on the Evaluation of
Creativity.
The successful applicant will have a strong background in artificial
intelligence, and will be a competent programmer. They will be willing
to co-supervise PhD and MSc students working in themes of the project.
They will be competent communicators, both formally and informally,
and they will be prepared to collaborate with and travel to partner
institutions for extended working periods (not normally longer than 2
weeks).
We have one Post-doc and 2 MSc grants available within the 3-years FP7
project ConCreTe:
Postdoc: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39612
(Deadline: 31-10-2013)
MSc 1: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39611
(Deadline: 31-10-2013)
MSc 2: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39569
(Deadline: 30-10-2013)
More about ConCreTe:
https://www.cisuc.uc.pt/projects/show/172
Applications should be sent to:
machado(at)dei.uc.pt
and
amilcar(at)dei.uc.pt
Best regards,
Penousal machado
**********************************************************
*
* 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 invite applications for a 3-year, full time post-doctoral research
associateship, based in University of Coimbra, Portugal, focused on
concept creation technology. The position forms part of an European
Union Framework Programme 7 grant, collaborative with 5 other academic
institutions. The project has a duration of 36 months.
As a whole, the project, ConCreTe, will investigate computational
models for the representation and production of previously unseen
concepts, and apply them in context of various forms of creativity
(e.g., design, narrative, poetry). It will also investigate
evaluation methods for creative systems, including comparison with
humans via neuroscientific approaches. The project revolves around the
central framework of a simulated cognitive architecture, making
explicit the relationship between creativity and consciousness, and
forming an environment within which different kinds of concept
generator can work in competitive parallel and be compared.
University of Coimbra will maily contribute to the workpackages on
Conceptual Representations (particularly by exploring representations
based in Regulated Activation Networks), on Concept Creation (e.g., by
exploring Conceptual Blending and Bio-inspired concept generation
mechanisms), on the development of Applications of the framework
(e.g., for Design and for Text Processing) and on the Evaluation of
Creativity.
The successful applicant will have a strong background in artificial
intelligence, and will be a competent programmer. They will be willing
to co-supervise PhD and MSc students working in themes of the project.
They will be competent communicators, both formally and informally,
and they will be prepared to collaborate with and travel to partner
institutions for extended working periods (not normally longer than 2
weeks).
We have one Post-doc and 2 MSc grants available within the 3-years FP7
project ConCreTe:
Postdoc: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39612
(Deadline: 31-10-2013)
MSc 1: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39611
(Deadline: 31-10-2013)
MSc 2: http://www.eracareers.pt/opportunities/index.aspx?task=global&jobId=39569
(Deadline: 30-10-2013)
More about ConCreTe:
https://www.cisuc.uc.pt/projects/show/172
Applications should be sent to:
machado(at)dei.uc.pt
and
amilcar(at)dei.uc.pt
Best regards,
Penousal machado
**********************************************************
*
* 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] DAM special issue: Distance Geometry and Applications
Call for Papers
Discrete Applied Mathematics
Special Issue: Distance Geometry and Applications
---------------------------------
Distance Geometry (DG) is an area of research that is already
consolidated, where Mathematics and Computer Science are the key areas
at its foundation. The concept of distance is essential to the human
experience and DG puts this concept as the main object in a given
geometric structure. The fundamental problem of DG is to find a set of
points in a given geometric space whose distances between some of these
points are known.
All interested researchers are invited to contribute to this special
issue. The topics of submitted papers should be related to the themes of
the Workshop on Distance Geometry and Applications, that was held in
Manaus, Amazonas, Brazil, on June 24-27, 2013. Submissions of
contributions not presented at the workshop are also welcome. All
articles will be thoroughly refereed according to the high standards of
Discrete Applied Mathematics.
The full papers must be submitted through the Elsevier Editorial System
(http://ees.elsevier.com/dam). When submitting your paper, be sure to
specify that the paper is a contribution for the Special Issue, and
select the article type "Special Issue: DGA13" so that your paper is
assigned to the guest editors. Please see the Author Instructions on the
site if you have not yet submitted a paper through this web-based system.
The deadline for submission is December 31st, 2013. All accepted papers
will be published online individually, before print publication. We are
looking forward to receiving your contribution.
The Guest Editors,
Antonio Mucherino
Rosiane de Freitas
Carlile Lavor
**********************************************************
*
* 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/
*
**********************************************************
Discrete Applied Mathematics
Special Issue: Distance Geometry and Applications
---------------------------------
Distance Geometry (DG) is an area of research that is already
consolidated, where Mathematics and Computer Science are the key areas
at its foundation. The concept of distance is essential to the human
experience and DG puts this concept as the main object in a given
geometric structure. The fundamental problem of DG is to find a set of
points in a given geometric space whose distances between some of these
points are known.
All interested researchers are invited to contribute to this special
issue. The topics of submitted papers should be related to the themes of
the Workshop on Distance Geometry and Applications, that was held in
Manaus, Amazonas, Brazil, on June 24-27, 2013. Submissions of
contributions not presented at the workshop are also welcome. All
articles will be thoroughly refereed according to the high standards of
Discrete Applied Mathematics.
The full papers must be submitted through the Elsevier Editorial System
(http://ees.elsevier.com/dam). When submitting your paper, be sure to
specify that the paper is a contribution for the Special Issue, and
select the article type "Special Issue: DGA13" so that your paper is
assigned to the guest editors. Please see the Author Instructions on the
site if you have not yet submitted a paper through this web-based system.
The deadline for submission is December 31st, 2013. All accepted papers
will be published online individually, before print publication. We are
looking forward to receiving your contribution.
The Guest Editors,
Antonio Mucherino
Rosiane de Freitas
Carlile Lavor
**********************************************************
*
* 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] 25th Annual Symposium on Combinatorial Pattern Matching: call for papers
*************************************************************
CPM 2014
25th Annual Symposium on Combinatorial Pattern Matching
June 16-18, 2014, Moscow, Russia
http://cpm2014.hse.ru/
CPM 2014
25th Annual Symposium on Combinatorial Pattern Matching
June 16-18, 2014, Moscow, Russia
http://cpm2014.hse.ru/
Submission deadline: ** January 10, 2014 **
Notification: ** February 20, 2014 **
*************************************************************
The year 2014 marks the quarter-of-a-century milestone for
the CPM symposium series. This special edition will celebrate
the many contributions made by the CPM Community to the vast
area of algorithms and perhaps more importantly to break-
throughs in applications ranging from document searching to
bioinformatics and computational biology. CPM-2014 will fea-
ture special sessions and lectures offering a retrospective
as well as help in identifying the most promising future di-
rections for this uniquely vibrant and useful specialty.
SCOPE: Papers in all areas related to combinatorial pattern
matching and its applications are sought, including, but not
limited to: bioinformatics and computational biology, coding
and data compression, combinatorics on words, data mining,
information retrieval, natural language processing, pattern
discovery, string algorithms, string processing in databases,
and text searching.
Both papers reporting on original research unpublished else-
where and surveys of important results are welcome. The pro-
ceedings will be published in the Springer-Verlag series Lec-
ture Notes in Computer Science.
KEYNOTE SPEAKERS:
Alberto Apostolico (Georgia Tech and IASI-CNR)
Maxime Crochemore (King's College London)
Zvi Galil (Georgia Tech)
ANNIVERSARY LECTURE:
Gene Myers (Max Planck Institute)
IMPORTANT DATES:
Submission: January 10, 2014
Notification: February 20, 2014
Final version: March 5, 2014
Symposium: June 16-18, 2014
PROGRAM COMMITTEE:
Max Alekseyev (University of South Carolina, USA)
Amihood Amir (Bar-Ilan University, Israel)
Maxim Babenko (Moscow State University, Russia)
Dan Gusfield (University of California, Davis, USA)
Martin Farach-Colton (Rutgers, USA)
Paolo Ferragina (University of Pisa, Italy)
Johannes Fischer (KIT, Germany)
Juha Karkkainen (University of Helsinki, Finland)
Roman Kolpakov (Moscow State University, Russia)
Gregory Kucherov (Université Paris-Est Marne-la-Vallée, France)
Alexander Kulikov (Steklov Math. Institute, Russia, co-chair)
Gad Landau (University of Haifa, Israel)
Stefano Lonardi (University of California, Riverside, USA)
Ian Munro (University of Waterloo, Canada)
Muthu Muthukrishnan (Rutgers, USA)
Gonzalo Navarro (University of Chile)
Kunsoo Park (Seoul National University, South Korea)
Pavel Pevzner (University of California San Diego, USA, co-chair)
Nadia Pisanti (University of Pisa, Italy)
Mikhail A. Roytberg (Higher School of Economics, Russia)
Tatiana Starikovskaya (Higher School of Economics, Russia)
Jim Storer (Brandeis University, USA)
Jens Stoye (University of Bielefeld, Germany)
Esko Ukkonen (University of Helsinki, Finland)
ORGANIZING COMMITTEE:
Stepan Artamonov (Moscow State University, Russia)
Maxim Babenko (Moscow State University, Russia)
Dmitry Ignatov (Higher School of Economics, Russia)
Dmitry Ilvovsky (Higher School of Economics, Russia)
Alexander Kulikov (Steklov Math. Institute, Russia)
Sergei Kuznetsov (Higher School of Economics, Russia, chair)
Dmitry Morozov (Higher School of Economics, Russia)
Kamil Salihov (Moscow State University, Russia)
Ruslan Savchenko (Moscow State University, Russia)
Tatiana Starikovskaya (Higher School of Economics, Russia)
Further details and a full printable pdf version of this call
for papers is maintained at the symposium web site:
http://cpm2014.hse.ru/
**********************************************************
*
* 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, October 23, 2013
[DMANET] NSF Workshop on Self-Organizing Particle Systems (with SODA'14)
Registration is now open at http://sops2014.cs.upb.de/registration.html
======================================================
SOPS 2014
NSF Workshop on Self-Organizing Particle Systems
January 8, 2014, co-located with SODA
http://sops2014.cs.upb.de/
======================================================
The goal of this NSF-sponsored workshop is to bring together people from the
theory and practice of self-organizing physical and biological systems in
order to report on recent advances in this area and to identify directions
for interdisciplinary research that may help shape the future of the field.
The one-day meeting will consist of several invited talks and discussion
sessions around four major research areas, namely
- amorphous computing,
- self-organizing robotic systems,
- self-organizing biological systems, and
- self-assembling DNA
Invited speakers:
Bernard Chazelle (Princeton U.) Nikolaus Correll (U. Colorado Boulder)
Eric Klavins (U. of Washington) John Reif (Duke University)
Andrea Richa (Arizona State U.) Rebecca Schulman (Johns Hopkins U.)
Erik Winfree (Caltech) Mark Yim (U. Pennsylvania)
Organizers:
Andrea W. Richa Arizona State University, USA
Christian Scheideler University of Paderborn, Germany
For more information, including the workshop program, please consult
http://sops2014.cs.upb.de/
Early registration deadline: December 2, 2013
NSF-funded travel grants are available for PhD students, postdocs, women,
and under-represented minorities. Application deadline: November 17, 2013
**********************************************************
*
* 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/
*
**********************************************************
======================================================
SOPS 2014
NSF Workshop on Self-Organizing Particle Systems
January 8, 2014, co-located with SODA
http://sops2014.cs.upb.de/
======================================================
The goal of this NSF-sponsored workshop is to bring together people from the
theory and practice of self-organizing physical and biological systems in
order to report on recent advances in this area and to identify directions
for interdisciplinary research that may help shape the future of the field.
The one-day meeting will consist of several invited talks and discussion
sessions around four major research areas, namely
- amorphous computing,
- self-organizing robotic systems,
- self-organizing biological systems, and
- self-assembling DNA
Invited speakers:
Bernard Chazelle (Princeton U.) Nikolaus Correll (U. Colorado Boulder)
Eric Klavins (U. of Washington) John Reif (Duke University)
Andrea Richa (Arizona State U.) Rebecca Schulman (Johns Hopkins U.)
Erik Winfree (Caltech) Mark Yim (U. Pennsylvania)
Organizers:
Andrea W. Richa Arizona State University, USA
Christian Scheideler University of Paderborn, Germany
For more information, including the workshop program, please consult
http://sops2014.cs.upb.de/
Early registration deadline: December 2, 2013
NSF-funded travel grants are available for PhD students, postdocs, women,
and under-represented minorities. Application deadline: November 17, 2013
**********************************************************
*
* 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] Fwd: Vacancy for a doctoral student in the area of Production Planning in the (petro)chemical industry
The Faculty of Applied Economics of the University of Antwerp
(Belgium) has a vacancy for a doctoral student in the area of
Production Planning in the (petro)chemical industry.
More information can be found here:
https://www.uantwerp.be/en/jobs/vacancies/ap/2013bapftewex182/
Application deadline is November 22.
**********************************************************
*
* 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/
*
**********************************************************
(Belgium) has a vacancy for a doctoral student in the area of
Production Planning in the (petro)chemical industry.
More information can be found here:
https://www.uantwerp.be/en/jobs/vacancies/ap/2013bapftewex182/
Application deadline is November 22.
**********************************************************
*
* 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, October 22, 2013
[DMANET] Scientific assitant at UMIT (Austria)
For a project funded by the Tiroler Wissenschaftsfonds (TWF), we are
seeking for a scientific assistant at PhD or Master level. This position
is available for the duration of 6 months only.
The applicant must have the following essential skills:
- PhD or Master degree in computer science, statistics or mathematics
- Strong programming skills in R/python/Java/C and database knowledge
preferably in a Linux environment.
- Skills in discrete mathematics, computer science and preferably
algorithmic modeling
Knowledge in graph theory is desired but not absolutely required.
Moreover, good communication- and English skills are also necessary.
The ideal candidate would enjoy working in a multidisciplinary environment.
Interested applicants should e-mail a full curriculum vitae, a cover
letter expressing research interests, and the contact information of two
references to Matthias Dehmer (matthias.dehmer@umit.at).
Contact:
Prof. Dr. habil. Matthias Dehmer
UMIT
Institute for Bioinformatics and Translational Research
Hall in Tyrol, Austria
Tel.: 0043/(0)50/8648-3851
Fax: 0043/(0)50/8648-673851
**********************************************************
*
* 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/
*
**********************************************************
seeking for a scientific assistant at PhD or Master level. This position
is available for the duration of 6 months only.
The applicant must have the following essential skills:
- PhD or Master degree in computer science, statistics or mathematics
- Strong programming skills in R/python/Java/C and database knowledge
preferably in a Linux environment.
- Skills in discrete mathematics, computer science and preferably
algorithmic modeling
Knowledge in graph theory is desired but not absolutely required.
Moreover, good communication- and English skills are also necessary.
The ideal candidate would enjoy working in a multidisciplinary environment.
Interested applicants should e-mail a full curriculum vitae, a cover
letter expressing research interests, and the contact information of two
references to Matthias Dehmer (matthias.dehmer@umit.at).
Contact:
Prof. Dr. habil. Matthias Dehmer
UMIT
Institute for Bioinformatics and Translational Research
Hall in Tyrol, Austria
Tel.: 0043/(0)50/8648-3851
Fax: 0043/(0)50/8648-673851
**********************************************************
*
* 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] FUN 2014 (preliminary CFP)
FUN 2014
Preliminary CALL FOR PAPERS
http://www.di.unipi.it/fun14
Seventh International Conference on FUN WITH ALGORITHMS
July 1-3, 2014, Lipari Island, Sicily, Italy
The Seventh International conference on Fun with Algorithms (FUN 2014)
is dedicated to the use, design, and analysis of algorithms and data
structures, focusing on results that provide amusing, witty but
nonetheless original and scientifically profound contributions to the
area. The previous FUNs were held in Elba Island, Italy; in
Castiglioncello, Tuscany, Italy; in Ischia Island, Italy; and in San
Servolo Island, Venice, Italy. Special issues of Theoretical Computer
Science, Discrete Applied Mathematics, and Theory of Computing Systems
were dedicated to them.
TOPICS OF INTEREST include (but are not limited to):
FUN with biological algorithms
FUN with combinatorial algorithms
FUN with cryptographic algorithms
FUN with distributed algorithms
FUN with game-theoretic algorithms
FUN with geometrical algorithms
FUN with graph algorithms
FUN with internet algorithms
FUN with mobile algorithms
FUN with optimization algorithms
FUN with parallel algorithms
FUN with randomized algorithms
FUN with robotics algorithms
FUN with space-conscious algorithms
FUN with string algorithms
FUN with visualization of algorithms
IMPORTANT DATES
Paper Submission: January 15, 2014
Acceptance Notification: February 28, 2014
Hotel reservation: March 31, 2014
Final version due: March 31, 2014
Conference: July 1-3, 2014
SUBMISSION DETAILS
A full paper should be submitted by January 15, 2014 following
the submission link given at the FUN 2014 web site. Manuscripts
should not exceed 12 pages. Authors of accepted papers are
expected to present their work at the conference.
PUBLICATIONS
Conference proceedings will be published by Springer in the LNCS
series. A special issue of Theoretical Computer Science will be
dedicated to a selected set of papers.
ADDITIONAL DETAILS
Additional details can be found in the conference web page:
http://www.di.unipi.it/fun14
Conference Chairs: Alfredo Ferro and Fabrizio Luccio
PC Chair: Peter Widmayer
**********************************************************
*
* 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/
*
**********************************************************
Preliminary CALL FOR PAPERS
http://www.di.unipi.it/fun14
Seventh International Conference on FUN WITH ALGORITHMS
July 1-3, 2014, Lipari Island, Sicily, Italy
The Seventh International conference on Fun with Algorithms (FUN 2014)
is dedicated to the use, design, and analysis of algorithms and data
structures, focusing on results that provide amusing, witty but
nonetheless original and scientifically profound contributions to the
area. The previous FUNs were held in Elba Island, Italy; in
Castiglioncello, Tuscany, Italy; in Ischia Island, Italy; and in San
Servolo Island, Venice, Italy. Special issues of Theoretical Computer
Science, Discrete Applied Mathematics, and Theory of Computing Systems
were dedicated to them.
TOPICS OF INTEREST include (but are not limited to):
FUN with biological algorithms
FUN with combinatorial algorithms
FUN with cryptographic algorithms
FUN with distributed algorithms
FUN with game-theoretic algorithms
FUN with geometrical algorithms
FUN with graph algorithms
FUN with internet algorithms
FUN with mobile algorithms
FUN with optimization algorithms
FUN with parallel algorithms
FUN with randomized algorithms
FUN with robotics algorithms
FUN with space-conscious algorithms
FUN with string algorithms
FUN with visualization of algorithms
IMPORTANT DATES
Paper Submission: January 15, 2014
Acceptance Notification: February 28, 2014
Hotel reservation: March 31, 2014
Final version due: March 31, 2014
Conference: July 1-3, 2014
SUBMISSION DETAILS
A full paper should be submitted by January 15, 2014 following
the submission link given at the FUN 2014 web site. Manuscripts
should not exceed 12 pages. Authors of accepted papers are
expected to present their work at the conference.
PUBLICATIONS
Conference proceedings will be published by Springer in the LNCS
series. A special issue of Theoretical Computer Science will be
dedicated to a selected set of papers.
ADDITIONAL DETAILS
Additional details can be found in the conference web page:
http://www.di.unipi.it/fun14
Conference Chairs: Alfredo Ferro and Fabrizio Luccio
PC Chair: Peter Widmayer
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] PhD positions at the University of Bristol, UK
PhD positions at the University of Bristol, UK
We are looking for PhD students in the general areas of Algorithms and
the Theory of Computing, to start in October 2014. The positions will
be suitable for those who have a strong background in theoretical
computer science and/or mathematics, and are interested in any of our
research areas. There may also be the possibility of an immediate
start for the right applicant.
For further information on our research areas, please see
http://www.cs.bris.ac.uk/Research/Algorithms/
http://www.cs.bris.ac.uk/~montanar/
http://www.cs.bris.ac.uk/Research/QuantumComputing/
Subject to eligibility rules (see
http://www.bris.ac.uk/engineering/graduate-school/pg-open/funding-pdfs/epsrcdta.pdf
) these are fully funded positions. They are competitive and early
application is preferred.
For further details or to apply, in the first instance please contact
Raphael Clifford (clifford@cs.bris.ac.uk) or Ashley Montanaro
(ashley@cs.bris.ac.uk).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
We are looking for PhD students in the general areas of Algorithms and
the Theory of Computing, to start in October 2014. The positions will
be suitable for those who have a strong background in theoretical
computer science and/or mathematics, and are interested in any of our
research areas. There may also be the possibility of an immediate
start for the right applicant.
For further information on our research areas, please see
http://www.cs.bris.ac.uk/Research/Algorithms/
http://www.cs.bris.ac.uk/~montanar/
http://www.cs.bris.ac.uk/Research/QuantumComputing/
Subject to eligibility rules (see
http://www.bris.ac.uk/engineering/graduate-school/pg-open/funding-pdfs/epsrcdta.pdf
) these are fully funded positions. They are competitive and early
application is preferred.
For further details or to apply, in the first instance please contact
Raphael Clifford (clifford@cs.bris.ac.uk) or Ashley Montanaro
(ashley@cs.bris.ac.uk).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
[DMANET] permanent and postdoctoral positions in LIAFA, Paris, France
The Algorithms and Complexity group of LIAFA (CNRS and University Paris Diderot, Paris, France) is seeking excellent candidates for permanent and postdoctoral positions in classical and quantum computing. Topics of interest include (but are not limited to): algorithms, online algorithms, streaming algorithms, approximation algorithms, communication complexity, cryptography, computational game theory, quantum computing, computational applications of logic, randomness in computing, privacy.
Interested candidates should consult the group webpage ( http://www.liafa.univ-paris-diderot.fr/algocomp/ ) for details on the positions available and the application process.
**********************************************************
*
* 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/
*
**********************************************************
Interested candidates should consult the group webpage ( http://www.liafa.univ-paris-diderot.fr/algocomp/ ) for details on the positions available and the application process.
**********************************************************
*
* 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, October 21, 2013
[DMANET] Symposium on Discrete Mathematics 2014, Frankfurt, May 9-10, 2014
First announcement:
Symposium on Discrete Mathematics 2014
Goethe University Frankfurt, May 9-10, 2014
The Symposium on Discrete Mathematics, the biannual meeting of the
Discrete Mathematics Section of the DMV (German Mathematical Society),
will take place on May 9-10, 2014 at Goethe University Frankfurt.
Main speakers:
- Michael Drmota (TU Wien)
- Jacob Fox (MIT)
- Monique Laurent (CWI Amsterdam)
- Jiri Matousek (Prague)
- Francisco Santos (Santander)
On the occasion of the symposium, the Richard-Rado-Prize 2014 for a
dissertation in Discrete Mathematics will be awarded. The prize is
funded by a donation of Springer-Verlag.
Executive committee of the Discrete Mathematics Section:
Christian Krattenthaler, Martin Skutella, Tibor Szabo, Thorsten Theobald
Local organization: Martina Kubitzke, Thorsten Theobald
For more information see http://www.math.uni-frankfurt.de/dm2014/
**********************************************************
*
* 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/
*
**********************************************************
Symposium on Discrete Mathematics 2014
Goethe University Frankfurt, May 9-10, 2014
The Symposium on Discrete Mathematics, the biannual meeting of the
Discrete Mathematics Section of the DMV (German Mathematical Society),
will take place on May 9-10, 2014 at Goethe University Frankfurt.
Main speakers:
- Michael Drmota (TU Wien)
- Jacob Fox (MIT)
- Monique Laurent (CWI Amsterdam)
- Jiri Matousek (Prague)
- Francisco Santos (Santander)
On the occasion of the symposium, the Richard-Rado-Prize 2014 for a
dissertation in Discrete Mathematics will be awarded. The prize is
funded by a donation of Springer-Verlag.
Executive committee of the Discrete Mathematics Section:
Christian Krattenthaler, Martin Skutella, Tibor Szabo, Thorsten Theobald
Local organization: Martina Kubitzke, Thorsten Theobald
For more information see http://www.math.uni-frankfurt.de/dm2014/
**********************************************************
*
* 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] I-CORE in Algorithms and the Simons Institute for the Theory of Computing in Berkeley - a joint postdoctoral program
I-CORE in Algorithms and the Simons Institute for the Theory of
Computing in Berkeley - a joint postdoctoral program
-----------------------------------------------------------------------------------------------------------------------------
I-CORE Algo – Israeli Center of Research Excellence in algorithms, and
the Simons Institute for the Theory of
Computing are seeking excellent candidates for a joint postdoctoral
program starting in the academic year 2014-2015.
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program, initiated by the
Government of Israel and adopted by Israel's Council of Higher
Education, in order to reinforce Israel's
intellectual capacities and promote synergy among Israel's leading
research centers. The members of the center
are some of Israel's most exceptional computer scientists, from The
Blavatnik School of Computer Science in Tel
Aviv University, The Rachel and Selim Benin School of Computer Science
and Engineering in The Hebrew University
of Jerusalem, and the Faculty of Mathematics and Computer Science in
Weizmann Institute of Science.
The Simons Institute for the Theory of Computing is an exciting new
venue for collaborative research in
theoretical computer science and related fields. The Institute is
housed in a dedicated building on the UC
Berkeley campus, and acts as a vibrant and welcoming environment for
visiting researchers. In each academic
semester the activities of the Institute are largely focused on
specific research programs, each of which
attracts thirty to forty participants ranging from senior scientists
to graduate students. The Simons Institute
for the Theory of Computing was created in 2012 through a ten-year
grant from the Simons Foundation (more
information can be found at: http://simons.berkeley.edu/fellows2014).
The joint postdoctoral position would start in Fall 2014. The joint
post-doctoral fellow will first spend a
semester (Fall 2014) at the Simons Institute, and then will continue
at the I-Core in Algorithms for the
remainder of the academic year. The topics of the research programs
for Fall 2014 in the Simons Institute are
"Algorithmic Spectral Graph Theory" and "Algorithms & Complexity in
Algebraic Geometry". The topics of research
in I-CORE in Algorithms include (but are not limited to): all variety
of algorithms (optimization, online,
streaming, approximation, randomized, geometric and more),
cryptography, security and privacy, algorithmic game
theory, quantum computing, networking and distributed computing,
databases, machine learning and computer
vision. The research interests of potential candidates should match
the research interests of both institutions.
Salaries and benefits are competitive and assistance with visas and
housing will be provided.
We particularly encourage applications from outstanding women and
minority candidates. In addition, the I-CORE
in Algorithms would provide some support to travel to and from Israel.
In some circumstances, the fellowship maybe be awarded for more than
one year, up to a maximum of two years.
APPLICATION INSTRUCTIONS
Each applicant should submit the following documents (as pdf files) in
a single email to
icorealgo@cs.tau.ac.il.
- cover letter, including current institution and employment status,
(expected) date of PhD, and a statement indicating the Simons
Institute program (or programs) in which you wish
to participate, and why. For the I-CORE Algo please indicate which
institute you would like to perform the
research at (can be more than one);
- curriculum vitae, including full list of publications;
- research statement;
- names and email addresses of at least three recommenders.
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the
email address above, with the subject line "<candidate_name>:
recommendation". (It is the applicant's
responsibility to ensure that the letters are sent; I-CORE will not
solicit letters directly.)
The deadline for receipt of all application materials, including
letters, is December 15, 2013.
**********************************************************
*
* 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/
*
**********************************************************
Computing in Berkeley - a joint postdoctoral program
-----------------------------------------------------------------------------------------------------------------------------
I-CORE Algo – Israeli Center of Research Excellence in algorithms, and
the Simons Institute for the Theory of
Computing are seeking excellent candidates for a joint postdoctoral
program starting in the academic year 2014-2015.
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program, initiated by the
Government of Israel and adopted by Israel's Council of Higher
Education, in order to reinforce Israel's
intellectual capacities and promote synergy among Israel's leading
research centers. The members of the center
are some of Israel's most exceptional computer scientists, from The
Blavatnik School of Computer Science in Tel
Aviv University, The Rachel and Selim Benin School of Computer Science
and Engineering in The Hebrew University
of Jerusalem, and the Faculty of Mathematics and Computer Science in
Weizmann Institute of Science.
The Simons Institute for the Theory of Computing is an exciting new
venue for collaborative research in
theoretical computer science and related fields. The Institute is
housed in a dedicated building on the UC
Berkeley campus, and acts as a vibrant and welcoming environment for
visiting researchers. In each academic
semester the activities of the Institute are largely focused on
specific research programs, each of which
attracts thirty to forty participants ranging from senior scientists
to graduate students. The Simons Institute
for the Theory of Computing was created in 2012 through a ten-year
grant from the Simons Foundation (more
information can be found at: http://simons.berkeley.edu/fellows2014).
The joint postdoctoral position would start in Fall 2014. The joint
post-doctoral fellow will first spend a
semester (Fall 2014) at the Simons Institute, and then will continue
at the I-Core in Algorithms for the
remainder of the academic year. The topics of the research programs
for Fall 2014 in the Simons Institute are
"Algorithmic Spectral Graph Theory" and "Algorithms & Complexity in
Algebraic Geometry". The topics of research
in I-CORE in Algorithms include (but are not limited to): all variety
of algorithms (optimization, online,
streaming, approximation, randomized, geometric and more),
cryptography, security and privacy, algorithmic game
theory, quantum computing, networking and distributed computing,
databases, machine learning and computer
vision. The research interests of potential candidates should match
the research interests of both institutions.
Salaries and benefits are competitive and assistance with visas and
housing will be provided.
We particularly encourage applications from outstanding women and
minority candidates. In addition, the I-CORE
in Algorithms would provide some support to travel to and from Israel.
In some circumstances, the fellowship maybe be awarded for more than
one year, up to a maximum of two years.
APPLICATION INSTRUCTIONS
Each applicant should submit the following documents (as pdf files) in
a single email to
icorealgo@cs.tau.ac.il.
- cover letter, including current institution and employment status,
(expected) date of PhD, and a statement indicating the Simons
Institute program (or programs) in which you wish
to participate, and why. For the I-CORE Algo please indicate which
institute you would like to perform the
research at (can be more than one);
- curriculum vitae, including full list of publications;
- research statement;
- names and email addresses of at least three recommenders.
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the
email address above, with the subject line "<candidate_name>:
recommendation". (It is the applicant's
responsibility to ensure that the letters are sent; I-CORE will not
solicit letters directly.)
The deadline for receipt of all application materials, including
letters, is December 15, 2013.
**********************************************************
*
* 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] I-CORE in Algorithms postdoctoral program
I-CORE in Algorithms postdoctoral program
http://www.icore-algo.org.il/content/post-doc-programs
------------------------------------------------------------
We are seeking excellent candidates for postdoctoral positions at the
I-CORE ALGO (Israeli center of research
excellence in algorithms) institutes. The positions are supported by
the Israeli Science Foundation (ISF).
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program, initiated by the
Government of Israel and adopted by Israel's Council of Higher
Education, in order to reinforce Israel's
intellectual capacities and promote synergy among Israel's leading
research centers. The institutes
participating in the center are:
* The Blavatnik School of Computer Science, Tel Aviv University
* The Rachel and Selim Benin School of Computer Science and
Engineering, The Hebrew University of Jerusalem,
* Faculty of Mathematics and Computer Science, Weizmann Institute of Science.
Topics of interest include (but are not limited to): all variety of
algorithms (optimization, online, streaming,
approximation, randomized, geometric and more), cryptography, security
and privacy, algorithmic game theory,
quantum computing, networking and distributed computing, databases,
machine learning and computer vision.
To apply please send the following to icorealgo@cs.tau.ac.il
(deadline: 15/12/13)
* A CV of the applicant including the list of publications.
* A short research statement.
* The preferable I-CORE ALGO fellow to work with (if already known)
and institution in I-CORE ALGO. (There is a
possibility of more than one fellow and/or institution.)
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the
email address above, with the subject line "<candidate_name>:
recommendation". (It is the applicant's
responsibility to ensure that the letters are sent; the Institute will
not solicit letters directly.)
The deadline is 15th December 2013, 24:00 (at GMT+1)
**********************************************************
*
* 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.icore-algo.org.il/content/post-doc-programs
------------------------------------------------------------
We are seeking excellent candidates for postdoctoral positions at the
I-CORE ALGO (Israeli center of research
excellence in algorithms) institutes. The positions are supported by
the Israeli Science Foundation (ISF).
The Israeli Center of Research Excellence in Algorithms is part of the
I-CORE program, initiated by the
Government of Israel and adopted by Israel's Council of Higher
Education, in order to reinforce Israel's
intellectual capacities and promote synergy among Israel's leading
research centers. The institutes
participating in the center are:
* The Blavatnik School of Computer Science, Tel Aviv University
* The Rachel and Selim Benin School of Computer Science and
Engineering, The Hebrew University of Jerusalem,
* Faculty of Mathematics and Computer Science, Weizmann Institute of Science.
Topics of interest include (but are not limited to): all variety of
algorithms (optimization, online, streaming,
approximation, randomized, geometric and more), cryptography, security
and privacy, algorithmic game theory,
quantum computing, networking and distributed computing, databases,
machine learning and computer vision.
To apply please send the following to icorealgo@cs.tau.ac.il
(deadline: 15/12/13)
* A CV of the applicant including the list of publications.
* A short research statement.
* The preferable I-CORE ALGO fellow to work with (if already known)
and institution in I-CORE ALGO. (There is a
possibility of more than one fellow and/or institution.)
In addition, all applicants should ensure that their recommenders
email their letters (as pdf files) to the
email address above, with the subject line "<candidate_name>:
recommendation". (It is the applicant's
responsibility to ensure that the letters are sent; the Institute will
not solicit letters directly.)
The deadline is 15th December 2013, 24:00 (at GMT+1)
**********************************************************
*
* 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] Leonardo Fibonacci fellowships - a joint postdoctoral program of I-CORE Algo, CNR and ENEA
Leonardo Fibonacci fellowships - a joint postdoctoral program of
I-CORE Algo, CNR and ENEA
http://www.icore-algo.org.il/content/post-doc-programs
----------------------------------------------------------------------------------------------------------------------------
I-CORE Algo – the Israeli Center of Research Excellence in algorithms, CNR –
the National Research Council of Italy and ENEA – the Italian National agency
for new technologies, Energy and sustainable economic development
are seeking excellent candidates for postdoctoral fellowships.
The joint program is supported by the Italian Ministry of Foreign Affairs,
and one of its objectives is strengthening the bi-national cooperation
in science
and technology between Italy and Israel, under the auspices of the
Italian-Israeli Agreement on Industrial,
Scientific and Technological Cooperation. CNR and ENEA participate in
the program to help open new
paths towards excellence for young researchers, some of whom will
eventually join the Italian research system.
The Leonardo Fibonacci fellowships are named after the Italian
mathematician Leonardo Fibonacci,
arguably the greatest European mathematician of the middle ages.
I-CORE Algo is part of the I-CORE program, initiated by the Government
of Israel and adopted by Israel's
Council of Higher Education in order to reinforce Israel's
intellectual capacities and promote synergy among Israel's
leading research centers. The members of the center are some of
Israel's most exceptional computer scientists,
from The Blavatnik School of Computer Science in Tel Aviv University,
The Rachel and Selim Benin School of
Computer Science and Engineering in The Hebrew University of
Jerusalem, and the Faculty of Mathematics and
Computer Science in Weizmann Institute of Science.
SELECTION PROCESS
Researches of any nationality can apply to the program, given that
they obtained their PhD (Dottorato di
Ricerca) from an institution in Italy no longer than 2 years before
the date of the application, or will obtain
it within 3 months after the application. EU nationals can apply
independently of where they have obtained their
degree, within the same temporal frame. Equal opportunity is a
principle underlying the whole selection process.
Key criteria for the selection will be
1. the scientific potential of the candidates, as assessed by their
academic record and thesis, by publications,
if any, by previous research experience and by any previous awards and honors.
2. the expected benefits of the fellowship for the trainees, as
indicated also by a short research statement (or
tentative project) submitted with the application.
Reference letters are requested from at least three recommenders and
will contribute to assess both criteria.
The Fellowships will be awarded initially for a period of up to twelve
months, and they may be prolonged, after
consideration, within the same program or other programs of the I-CORE center.
The Leonardo Fibonacci fellows will perform their postdoctoral
research in one of the I-CORE in Algorithms
institutions. Salaries and benefits are competitive and assistance
with visas and housing will be provided.
The selection Committee (3 members, from the CNR, the I-CORE in
Algorithms and the Embassy of Italy in Israel)
will choose between applicants, on the basis of the above criteria.
The selected candidates will submit a brief activity report to the
Committee every three months.
RESEARCH SCOPE
The topics of research in I-CORE in Algorithms include (but are not
limited to): all variety of algorithms
(optimization, online, streaming, approximation, randomized, geometric
and more), cryptography, security and
privacy, algorithmic game theory, quantum computing, networking and
distributed computing, databases, machine
learning and computer vision.
The selected candidates will be able to choose which of the center
members will be their advisor.
APPLICATION PROCEDURE
To apply, please send the attached form (as .pdf) by e-mail to both
icorealgo@cs.tau.ac.il and lucilla.alagna @esteri.it
In addition, applicants should ensure that their recommenders email
their letters (as pdf files) to the email
addresses above, with the subject line "<candidate_name>:
recommendation". (It is the applicant's responsibility
to ensure that the letters are sent; letters will not be solicited directly.)
The deadline is 15th December 2013, 24:00 (at GMT+1)
**********************************************************
*
* 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/
*
**********************************************************
I-CORE Algo, CNR and ENEA
http://www.icore-algo.org.il/content/post-doc-programs
----------------------------------------------------------------------------------------------------------------------------
I-CORE Algo – the Israeli Center of Research Excellence in algorithms, CNR –
the National Research Council of Italy and ENEA – the Italian National agency
for new technologies, Energy and sustainable economic development
are seeking excellent candidates for postdoctoral fellowships.
The joint program is supported by the Italian Ministry of Foreign Affairs,
and one of its objectives is strengthening the bi-national cooperation
in science
and technology between Italy and Israel, under the auspices of the
Italian-Israeli Agreement on Industrial,
Scientific and Technological Cooperation. CNR and ENEA participate in
the program to help open new
paths towards excellence for young researchers, some of whom will
eventually join the Italian research system.
The Leonardo Fibonacci fellowships are named after the Italian
mathematician Leonardo Fibonacci,
arguably the greatest European mathematician of the middle ages.
I-CORE Algo is part of the I-CORE program, initiated by the Government
of Israel and adopted by Israel's
Council of Higher Education in order to reinforce Israel's
intellectual capacities and promote synergy among Israel's
leading research centers. The members of the center are some of
Israel's most exceptional computer scientists,
from The Blavatnik School of Computer Science in Tel Aviv University,
The Rachel and Selim Benin School of
Computer Science and Engineering in The Hebrew University of
Jerusalem, and the Faculty of Mathematics and
Computer Science in Weizmann Institute of Science.
SELECTION PROCESS
Researches of any nationality can apply to the program, given that
they obtained their PhD (Dottorato di
Ricerca) from an institution in Italy no longer than 2 years before
the date of the application, or will obtain
it within 3 months after the application. EU nationals can apply
independently of where they have obtained their
degree, within the same temporal frame. Equal opportunity is a
principle underlying the whole selection process.
Key criteria for the selection will be
1. the scientific potential of the candidates, as assessed by their
academic record and thesis, by publications,
if any, by previous research experience and by any previous awards and honors.
2. the expected benefits of the fellowship for the trainees, as
indicated also by a short research statement (or
tentative project) submitted with the application.
Reference letters are requested from at least three recommenders and
will contribute to assess both criteria.
The Fellowships will be awarded initially for a period of up to twelve
months, and they may be prolonged, after
consideration, within the same program or other programs of the I-CORE center.
The Leonardo Fibonacci fellows will perform their postdoctoral
research in one of the I-CORE in Algorithms
institutions. Salaries and benefits are competitive and assistance
with visas and housing will be provided.
The selection Committee (3 members, from the CNR, the I-CORE in
Algorithms and the Embassy of Italy in Israel)
will choose between applicants, on the basis of the above criteria.
The selected candidates will submit a brief activity report to the
Committee every three months.
RESEARCH SCOPE
The topics of research in I-CORE in Algorithms include (but are not
limited to): all variety of algorithms
(optimization, online, streaming, approximation, randomized, geometric
and more), cryptography, security and
privacy, algorithmic game theory, quantum computing, networking and
distributed computing, databases, machine
learning and computer vision.
The selected candidates will be able to choose which of the center
members will be their advisor.
APPLICATION PROCEDURE
To apply, please send the attached form (as .pdf) by e-mail to both
icorealgo@cs.tau.ac.il and lucilla.alagna @esteri.it
In addition, applicants should ensure that their recommenders email
their letters (as pdf files) to the email
addresses above, with the subject line "<candidate_name>:
recommendation". (It is the applicant's responsibility
to ensure that the letters are sent; letters will not be solicited directly.)
The deadline is 15th December 2013, 24:00 (at GMT+1)
**********************************************************
*
* 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] 3rd Dutch Day on Computational Game Theory
After the first two workshops held at CWI and the University of Twente, the
3rd Dutch Day on Computational Game Theory
will take place on Friday, November 29th, 2013, at Maastricht University
(see http://homepages.cwi.nl/~schaefer/DNetCG/Overview.html).
The program consists of two invited talks by Martin Hoefer (Max-Planck-Insitute Saarbrücken) and Arno Riedl (Maastricht University) and contributed presentations.
If you want to give a talk at the workshop, please send an email with title and abstract to a.berger@maastrichtuniversity.nl before Sunday, November 3rd.
Participation in the workshop is free and lunch and coffee will be provided.
For organizational purposes, please send an email to a.berger@maastrichtuniversity.nl before Sunday, November 3rd, if you plan to attend.
We will also organize a dinner if there is enough interest from the participants. Please also let us know in your registration email if you are interested in joining the dinner.
We hope to welcome many of you in Maastricht.
Best regards ,
Andre Berger, Tobias Harks, Rudolf Müller
**********************************************************
*
* 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/
*
**********************************************************
3rd Dutch Day on Computational Game Theory
will take place on Friday, November 29th, 2013, at Maastricht University
(see http://homepages.cwi.nl/~schaefer/DNetCG/Overview.html).
The program consists of two invited talks by Martin Hoefer (Max-Planck-Insitute Saarbrücken) and Arno Riedl (Maastricht University) and contributed presentations.
If you want to give a talk at the workshop, please send an email with title and abstract to a.berger@maastrichtuniversity.nl before Sunday, November 3rd.
Participation in the workshop is free and lunch and coffee will be provided.
For organizational purposes, please send an email to a.berger@maastrichtuniversity.nl before Sunday, November 3rd, if you plan to attend.
We will also organize a dinner if there is enough interest from the participants. Please also let us know in your registration email if you are interested in joining the dinner.
We hope to welcome many of you in Maastricht.
Best regards ,
Andre Berger, Tobias Harks, Rudolf Müller
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Sunday, October 20, 2013
[DMANET] TAMC2014 in Chennai, India, April 11-13, 2014
**********************************************************************
CALL FOR PAPERS:
11th Annual Conference on Theory and Applications of Models of Computation
[TAMC 2014]
11- 13 April 2014
Vivekananda Auditorium, Anna University, Chennai, India
http://www.annauniv.edu/tamc2014/
Important Dates:
Submission Deadline: 15 November 2013, 11:59pm EST.
Notification of Acceptance: 15 December 2013
Final Camera Ready Version Due: 15 January 2014
Proceedings:
Springer Lecture Notes in Computer Science
**********************************************************************
Scope and Topics
TAMC 2014 aims at bringing together a wide range of researchers with
interests in computational theory and applications. The main themes of the
conference are computability, complexity, algorithms, models of
computation and systems theory. Typical but not exclusive topics of
interest include:
algebraic computation
algorithmic coding theory
algorithmic number theory
approximation algorithms
automata theory
circuit complexity
combinatorial algorithms
computability
computational biology, and biological computing
computational complexity [including circuits, communication,
derandomization, PCPs, proof complexity, structural complexity]
computational game theory
computational logic
computational geometry
continuous and real computation
cryptography
data structures
design and analysis of algorithms
distributed algorithms
domain models [Assets, Price of Abstraction, frameworks]
fixed parameter tractability
geometric algorithms
graph algorithms
information and communication complexity
learning theory
memory hierarchy tradeoffs
model theory for computing [modal and temporal logics, specification,
verification, synthesis or automated software construction, aesthetics,
software behavior,
transformation of models]
natural computation
nature inspired computing
network algorithms
networks in nature and society
online algorithms
optimization
parallel algorithms
philosophy of computing [emerging paradigms, morality, intentionality]
privacy and security
property testing
proof complexity
process models [for software construction, validating software under
construction, supply - chain]
quantum computing
randomness, pseudo-randomness
randomized algorithms
space - time tradeoffs
streaming algorithms
systems theory [Concurrent, Timed, Hybrid and Secure systems]
VLSI Models of Computation [Models for Hardware - Software Codesign]
Paper Submission
The format of the papers should confirm to the ACM Guidelines (option 2)
available at:
http://www.acm.org/sigs/publications/proceedings-templates
For submitting your papers, please visit:
http://senldogo0039.springer-sbm.com/ocs/home/TAMC2014
Steering Committee
Manindra Agrawal (Indian Institute of Technology, Kanpur, India)
Jin-Yi Cai (University of Wisconsin - Madison, USA)
S. Barry Cooper (University of Leeds, Leeds, UK)
John Hopcroft (Cornell University)
Angsheng Li (Chinese Academy of Sciences)
Zhiyong Liu (Institute of Computing Technology, Chinese Academy of Sciences)
Programme Committee
Aaron D. Jaggard,U.S. Naval Research Laboratory, USA
Ajith Abraham, Machine Intelligence Research Labs (MIR Labs), USA
Bakhadyr Khoussainov, University of Auckland, New Zealand
Carlo Alberto Furia, ETH Zurich, Switzerland
Chaitanya K Baru, University of California, San Diego, USA
Christel Baier, Technische Universitat Dresden, Germany
Cristian S. Calude, University of Auckland, New Zealand
Dimitris Fotakis, National Technical University of Athens, Greece
Dipti Deodhare, Centre for Artificial Intelligence and Robotics (CAIR),India
Hongan Wang, State Key Laboratory for Computer Science (LCS), China
Jacques Sakarovitch, Ecole nationale superieure des telecommunications,
France &
Chair: International Federation for Information Processing (IFIP)
TC-1-Foundations of Computer Science
Jianxin Wang, Central South University (CSU), China
Jose R. Correa, Universidad de Chile, Chile
Kamal Lodaya, Institute of Mathematical Sciences, India
Kazuhisa Makino, University of Tokyo, Japan
R Nadarajan, PSG College of Technology, India
Y Narahari, Indian Institute of Science, India
Naijun Zhan, State Key Laboratory for Computer Science (LCS), China
Navin Goyal, Microsoft Research, India
Pan Peng, Institute of Software, Chinese Academy of Sciences, China
C Pandurangan, Indian Institute of Technology, Madras, India
Rajagopal Srinivasan,Tata Consultancy Services,India
Rajeeva Karandikar, Chennai Mathematical Institute, India
Richard Banach, University of Manchester, UK
R K Shyamasundar, Tata Institute of Fundamental Research (TIFR), India
Somenath Biswas, Indian Institute of Technology, Kanpur, India
Toshihiro Fujito,Toyohashi University of Technology, Japan
Venkat Chakaravarthy, IBM Research, India
Vincent Duffy, Purdue University, USA
Wenhui Zhang, State Key Laboratory of Computer Science, China
Xiaoming Sun, Institute of Computing Technology, China Academy of
Sciences, China
For any further Clarifications, please contact:
Dr. T V Gopal
Conference Chair - TAMC 2014 & Professor
Department of Computer Science and Engineering
College of Engineering
Anna University
Chennai - 600 025, INDIA
E-mail: gopal@annauniv.edu ; gayamadhgop@hotmail.com
Ph : (Off) 22351723 Extn. 3340 ; (Res) 24454753
http://www.csi-india.org/web/software/home
**********************************************************************
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
CALL FOR PAPERS:
11th Annual Conference on Theory and Applications of Models of Computation
[TAMC 2014]
11- 13 April 2014
Vivekananda Auditorium, Anna University, Chennai, India
http://www.annauniv.edu/tamc2014/
Important Dates:
Submission Deadline: 15 November 2013, 11:59pm EST.
Notification of Acceptance: 15 December 2013
Final Camera Ready Version Due: 15 January 2014
Proceedings:
Springer Lecture Notes in Computer Science
**********************************************************************
Scope and Topics
TAMC 2014 aims at bringing together a wide range of researchers with
interests in computational theory and applications. The main themes of the
conference are computability, complexity, algorithms, models of
computation and systems theory. Typical but not exclusive topics of
interest include:
algebraic computation
algorithmic coding theory
algorithmic number theory
approximation algorithms
automata theory
circuit complexity
combinatorial algorithms
computability
computational biology, and biological computing
computational complexity [including circuits, communication,
derandomization, PCPs, proof complexity, structural complexity]
computational game theory
computational logic
computational geometry
continuous and real computation
cryptography
data structures
design and analysis of algorithms
distributed algorithms
domain models [Assets, Price of Abstraction, frameworks]
fixed parameter tractability
geometric algorithms
graph algorithms
information and communication complexity
learning theory
memory hierarchy tradeoffs
model theory for computing [modal and temporal logics, specification,
verification, synthesis or automated software construction, aesthetics,
software behavior,
transformation of models]
natural computation
nature inspired computing
network algorithms
networks in nature and society
online algorithms
optimization
parallel algorithms
philosophy of computing [emerging paradigms, morality, intentionality]
privacy and security
property testing
proof complexity
process models [for software construction, validating software under
construction, supply - chain]
quantum computing
randomness, pseudo-randomness
randomized algorithms
space - time tradeoffs
streaming algorithms
systems theory [Concurrent, Timed, Hybrid and Secure systems]
VLSI Models of Computation [Models for Hardware - Software Codesign]
Paper Submission
The format of the papers should confirm to the ACM Guidelines (option 2)
available at:
http://www.acm.org/sigs/publications/proceedings-templates
For submitting your papers, please visit:
http://senldogo0039.springer-sbm.com/ocs/home/TAMC2014
Steering Committee
Manindra Agrawal (Indian Institute of Technology, Kanpur, India)
Jin-Yi Cai (University of Wisconsin - Madison, USA)
S. Barry Cooper (University of Leeds, Leeds, UK)
John Hopcroft (Cornell University)
Angsheng Li (Chinese Academy of Sciences)
Zhiyong Liu (Institute of Computing Technology, Chinese Academy of Sciences)
Programme Committee
Aaron D. Jaggard,U.S. Naval Research Laboratory, USA
Ajith Abraham, Machine Intelligence Research Labs (MIR Labs), USA
Bakhadyr Khoussainov, University of Auckland, New Zealand
Carlo Alberto Furia, ETH Zurich, Switzerland
Chaitanya K Baru, University of California, San Diego, USA
Christel Baier, Technische Universitat Dresden, Germany
Cristian S. Calude, University of Auckland, New Zealand
Dimitris Fotakis, National Technical University of Athens, Greece
Dipti Deodhare, Centre for Artificial Intelligence and Robotics (CAIR),India
Hongan Wang, State Key Laboratory for Computer Science (LCS), China
Jacques Sakarovitch, Ecole nationale superieure des telecommunications,
France &
Chair: International Federation for Information Processing (IFIP)
TC-1-Foundations of Computer Science
Jianxin Wang, Central South University (CSU), China
Jose R. Correa, Universidad de Chile, Chile
Kamal Lodaya, Institute of Mathematical Sciences, India
Kazuhisa Makino, University of Tokyo, Japan
R Nadarajan, PSG College of Technology, India
Y Narahari, Indian Institute of Science, India
Naijun Zhan, State Key Laboratory for Computer Science (LCS), China
Navin Goyal, Microsoft Research, India
Pan Peng, Institute of Software, Chinese Academy of Sciences, China
C Pandurangan, Indian Institute of Technology, Madras, India
Rajagopal Srinivasan,Tata Consultancy Services,India
Rajeeva Karandikar, Chennai Mathematical Institute, India
Richard Banach, University of Manchester, UK
R K Shyamasundar, Tata Institute of Fundamental Research (TIFR), India
Somenath Biswas, Indian Institute of Technology, Kanpur, India
Toshihiro Fujito,Toyohashi University of Technology, Japan
Venkat Chakaravarthy, IBM Research, India
Vincent Duffy, Purdue University, USA
Wenhui Zhang, State Key Laboratory of Computer Science, China
Xiaoming Sun, Institute of Computing Technology, China Academy of
Sciences, China
For any further Clarifications, please contact:
Dr. T V Gopal
Conference Chair - TAMC 2014 & Professor
Department of Computer Science and Engineering
College of Engineering
Anna University
Chennai - 600 025, INDIA
E-mail: gopal@annauniv.edu ; gayamadhgop@hotmail.com
Ph : (Off) 22351723 Extn. 3340 ; (Res) 24454753
http://www.csi-india.org/web/software/home
**********************************************************************
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Saturday, October 19, 2013
[DMANET] [IJRIE]-Call for paper (Vol. 3, No. 1, 2014)
Call for Paper
Greetings and call for paper for Vol. 3, No.1.
International Journal of Research in Industrial Engineering
ISSN: 1925-7805; E-ISSN: 1925-7813
Publisher: Novel Science Inc.
Submissions open for Volume 3, Number 1, March 2014.
Dear researchers
Let me introduce about IJRIE. International Journal of Research in
Industrial Engineering (IJRIE) is an international academic online
journal which publishes global research in the areas of Industrial
Engineering. The journal provides a forum for dispersion of research
and review articles related to all fields of Industrial Engineering.
With an open access publication model of this journal, all interested
readers around the world can freely access articles online without
subscription.
Submitted papers will be reviewed by technical committees of the
journal and association. All submitted articles should report
original, previously unpublished research results, experimental or
theoretical, and will be peer-reviewed. Articles submitted to the
journal should meet these criteria and must not be under consideration
for publication elsewhere. Manuscripts should follow the style of the
journal and are subject to both review and editing.
Frequency: 4 Number per year
Status: published Online
Subject Category: All aspects of Industrial Engineering
The journal provides relevant theoretical frameworks and the latest
empirical research findings in the areas of (not limited to):
Supply Chain Management & Logistic Risk Management
Operations Research Reliability & Maintenance
Manufacturing Systems Project management
Flexible Manufacturing System Application of meta-heuristics
Production Planning & Management Strategic management
Knowledge Management Data Mining
Project Control Scheduling
Mathematical Modeling Telecommunications
Network management Human resources management
Economics Other Related Subject
Kindly Visit our website www.nvlscience.com/index.php/ijrie for more details.
(It is mandatory for authors to submit their papers via above
mentioned website address).
We are looking forward to receiving quality submissions from you and
your colleagues in near future.
Sincerely,
IJRIE Office,
www.nvlscience.com/index.php/ijrie
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Greetings and call for paper for Vol. 3, No.1.
International Journal of Research in Industrial Engineering
ISSN: 1925-7805; E-ISSN: 1925-7813
Publisher: Novel Science Inc.
Submissions open for Volume 3, Number 1, March 2014.
Dear researchers
Let me introduce about IJRIE. International Journal of Research in
Industrial Engineering (IJRIE) is an international academic online
journal which publishes global research in the areas of Industrial
Engineering. The journal provides a forum for dispersion of research
and review articles related to all fields of Industrial Engineering.
With an open access publication model of this journal, all interested
readers around the world can freely access articles online without
subscription.
Submitted papers will be reviewed by technical committees of the
journal and association. All submitted articles should report
original, previously unpublished research results, experimental or
theoretical, and will be peer-reviewed. Articles submitted to the
journal should meet these criteria and must not be under consideration
for publication elsewhere. Manuscripts should follow the style of the
journal and are subject to both review and editing.
Frequency: 4 Number per year
Status: published Online
Subject Category: All aspects of Industrial Engineering
The journal provides relevant theoretical frameworks and the latest
empirical research findings in the areas of (not limited to):
Supply Chain Management & Logistic Risk Management
Operations Research Reliability & Maintenance
Manufacturing Systems Project management
Flexible Manufacturing System Application of meta-heuristics
Production Planning & Management Strategic management
Knowledge Management Data Mining
Project Control Scheduling
Mathematical Modeling Telecommunications
Network management Human resources management
Economics Other Related Subject
Kindly Visit our website www.nvlscience.com/index.php/ijrie for more details.
(It is mandatory for authors to submit their papers via above
mentioned website address).
We are looking forward to receiving quality submissions from you and
your colleagues in near future.
Sincerely,
IJRIE Office,
www.nvlscience.com/index.php/ijrie
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Subscribe to:
Posts (Atom)
Posts
