The joint Ottawa-Carleton Discrete Mathematics Days 2011 will beheld May 13-14, 2011, at the University of Ottawa.

The invited speakers are: Ed Bender, University of California at San Diego Jim Geelen, University of Waterloo William Martin, Worcester Polytechnic Institute Wendy Myrvold, University of Victoria Leonard Soicher, Queen Mary University of London

We will be accepting 25-minute contributed talks in any area ofdiscrete mathematics. Titles and abstracts (text or LaTex onlyplease) should be sent to Jason Gao (zgao at math.carleton.ca)and Mike Newman (mnewman at uottawa.ca) by April 13.

We may be able to offer partial travel support to graduatestudents and postdocs. Applications should be sent to Jason Gao(zgao at math.carleton.ca) and Mike Newman (mnewman atuottawa.ca) by April 13.

Jason GaoMike Newman(organizers)*********************************************************** * 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/***********************************************************

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

The ATMOS 2011 workshop will be held in connection with ALGO 2011,hosted by Max Planck Institut fuer Informatik, which will take placein Saarbruecken, on September 8, 2011.

Since 2000, the series of ATMOS workshops brings together researchersand practitioners who are interested in all aspects of algorithmicmethods and models for transportation optimization and provides aforum for the exchange and dissemination of new ideas and techniques.

------------------------------------------------------------------TOPICS------We invite papers for presentation at the workshop on optimizationproblems for passenger and freight transport, including -- but notlimited to:

------------------------------------------------------------------SUBMISSIONS-----------Authors are invited to submit an extended abstract or full paper ofat most 12 pages. The paper should contain a succinct statement ofthe issues and of their motivation, a summary of the main results,and a brief explanation of their significance, accessible tonon-specialist readers. Proofs omitted due to space constraints canbe put into an appendix to be read by the program committee membersat their discretion. Papers must be submitted electronically athttp://www.easychair.org/conferences/?conf=atmos2011. The submissionmust be received by 23:59 (GMT) on June 24, 2011. Each acceptedpaper must be presented at the workshop by one of the authors.

------------------------------------------------------------------PROCEEDINGS-----------The proceedings will be published on the Dagstuhl OpenAccess Seriesin Informatics (OASIcs) publication service.

*********************************************************** * 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/***********************************************************

satellite workshop of 6th International Symposium Advances in ArtificialIntelligence and Applicationsorganized in the framework of FEDERATED CONFERENCE ON COMPUTER SCIENCE ANDINFORMATION SYSTEMSFedCSIS - 2011

* Authors should submit draft papers (as Postscript, PDF of MSWord file)* The total length of a paper should not exceed 8 pages (IEEE style). IEEEstyle templates are available at http://fedcsis.org/?q=node/22.* Papers will be refereed and accepted on the basis of their scientificmerit and relevance to the workshop.* Accepted and Presented paper will be published in the ConferenceProceedings and included in the IEEE Xplore® database (pending) and indexedin the DBLP.* Extended versions of selected papers presented during the conference willbe published as Special Issue(s) of journal(s) to be announced later.====================

-- Assoc. Prof. Stefka FidanovaIICT-BASAcad. G. Bonchev str. bl.25A1113 Sofia BulgariaPh. +359-2-9796642*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

The departement of Electronic and Computer Science of ENSTA ParisTechis developping methods and tools in the area of System Safety andReliability.

The research activity is focused on the formal verification ofembedded systems taking into account heterogeneity of them likesoftware/hardware interaction or software/physical environmentinteractions. The applicants must have a PhD degree in ComputerScience and they must have some knowledge but not limited in abstractinterpretation, model checking, test generation, type systems, systemmodelling.

The Faculty of Sciences of Université Libre de Bruxelles (ULB, Brussels) invites applications for a 1 year full-time academic position within the Department of Mathematics, beginning October 1st 2011.

The successful candidate should be proficient both in teaching and in research. Publications in Discrete Mathematics are a plus. Candidates should hold a PhD degree in Mathematics, and have a record of international-level research publications. The successful candidate will reinforce one of the research teams of the Department of Mathematics.

He or she will teach mathematics classes (possibly also exercises), in french, at all levels, for a total of around 120 lecture hours.

Tuesday, March 29, 2011

The University of Victoria will be hosting the IWOCA 2011conference June 20-22, 2011.

Note that the paper submission deadline is this Sunday April 3.----------------------------------------------------------------Call for Papers: IWOCA 2011,22nd International Workshop On Combinatorial Algorithms,Victoria BC, Canada, June 20-22, 2011.

The series of IWOCA conferences grew out of a 17-year history of AWOCAmeetings (Australasian Workshop on Combinatorial Algorithms). PreviousAWOCA and IWOCA meetings have been held in Australia, Indonesia, Korea,Japan and the Czech Republic. The 2011 meeting in Victoria, BC, Canadais the first time that IWOCA will be held in North America.

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

The aim of the thesis is to progress in the THEORY of Polynomial Optimization by solving fundamental questions arising in PRACTICE. The student should therefore have a strong background in algebra and geometry and be able and willing to implement optimization problems using systems for symbolic and numeric computation.

Polynomial Optimization Problems are optimization problems with a polynomial goal function and polynomial inequality constraints. In recent years, methods from Real Algebraic Geometry (sums of squares) and Functional Analysis (truncated moment problem) have been refined in a way that allows to translate a Polynomial Optimization Problem into an equivalent or at least approximating Semidefinite Program.

There is a teaching load of two hours per week attached to the position. Teaching can be done in German or English.

Applications should be sent electronically to:m.s@uni-konstanz.dewhere m.s should be replaced by markus.schweighofer.

Applications received by April 18, 2011, will receive full consideration. However, later applications may be considered as well until the positions have been filled.

Binational doctoral studies with two thesis advisors are conceivable. At least one of the advisors should be Markus Schweighofer.

Wireless sensor networks consist of spatially distributed autonomouscomputing units that cooperatively monitor a variable property, forexample, environmental conditions such as temperature, sound, vibration,pressure, motion or pollutants. They are being used in variousapplication areas, including industrial process monitoring and control,machine health monitoring, environment and habitat monitoring,healthcare applications, home automation, and traffic control.

Apart from begin equipped with different sensors, each node in a sensornetwork is generally equipped with a very limited battery, a rathersmall memory device, a small hard disk, a simple processing unit, anda radio transceiver or another alternative device for wirelesscommunication. Some of the algorithmic issues that must be addressed insensor networks concern, for example, event detection, data gathering,object tracking, base station initiated querying, power saving, etc.

The fact that a complex sensor network is composed of simple computingunits has an analogy with certain animal societies, whose individualsare often very simple but together they result in a much more complexand capable entity. Thus, from an algorithmic point of view, bio-inspired solutions, such as swarm intelligence techniques, artificialimmune systems, or evelutionary algorithms may provide valuablealternatives for solving problems in sensor networks. Genetic andevolutionary algorithms, for example, may be used to solve large-scaleoptimization problems occuring in sensor networks. On the other side,self-organization may help in distributed controll and management tasks.

SCOPE AND TOPICS OF INTEREST

For this workshop we invite original, and so-far unpublished,contributions from the following topic areas:

* All contributions must deal with algorithmic aspects in wireless sensor networks * Applications of genetic and evolutionary computation principles * Use of swarm intelligence principles such as self-organization * Other bio-inspired computing paradigms such as artificial immune systems

PAPER SUBMISSION

Researchers are invited to submit papers of not more than 8 pages inACM style. Templates and formatting instructions can be found athttp://www.sigevo.org/gecco-2011/papers.htmlNote: even though this webpage asks for anonymous submissions, thisdoes not hold for GECCO workshops. The author names SHOULD appearon the submitted papers.

*********************************************************** * 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/***********************************************************

Two-page abstract papers describing late-breaking developments in thefield of genetic and evolutionary computation are being solicited forpresentation at the Late Breaking Abstracts Workshop at the 2011 Geneticand Evolutionary Computation Conference (GECCO-2011) to be held 12-16 July,2011, in Dublin, Ireland, and inclusion in a CD-ROM to be distributed toall attendees of the conference and in the ACM Digital Library.

Late-breaking abstract papers will be briefly examined for relevance andminimum standards of acceptability, including adherence to formattingrequirements and the two-page limit, but will not be peer reviewed indetail.

Acceptance decisions will be made as soon as possible after receipt of thesubmission, until the 12 April 2011 deadline. Authors of accepted late-breaking abstracts will individually retain copyright (and all otherrights) to their late-breaking abstracts. Accepted late breaking abstractswith no authors registered by the deadline will not appear in the Late-Breaking Papers section in the CD-ROM nor the ACM Digital Library.

GECCO is sponsored by the Association for Computing Machinery SpecialInterest Group for Genetic and Evolutionary Computation (ACM SIGEVO).

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

The classical Turing computability has been THE paradigm forcomputation for more than half a century. In less than two decades,various paradigms have been proposed (invented, discovered orreframed) and communities have emerged: computable analysis, algebraicmodels, Quantum computing, DNA, Cellular automaton... All of them falloutside the classical context because they manipulate objects that arejust out of the classical scope (infinite objects or uncountably manyvalues) or continuous or infinite time. Unfortunately, there is nomiraculous generalized Church-Turing thesis (nor specialized analognor...).

The workshop aims at gathering researchers of a scattered but wideoff-Turing community in order to share points of view and bring forththe common problematics. The audience aimed at is roughly the same as:

Monday, March 28, 2011

----------------------------------------------------------------------- Our apologies if you receive duplicates of this posting. Please feel free to distribute it to those who might be interested. -----------------------------------------------------------------------

Since its creation in 2002, ADHOC-NOW has become a well-established and well-known international conference dedicated to wireless and mobile computing. It serves as a forum for interesting discussions on ongoing research and new contributions. The conference addresses both experimental and theoretical research in the areas of ad hoc networks, sensor networks, mesh networks and vehicular networks. It focuses on all issues from link layer up to the application layer. In 2011, ADHOC-NOW will for the first time be organized in Germany, in the beautiful city of Paderborn.

We seek original contributions as work in progress, experimental and theoretical research in Wireless Sensor, Ad-Hoc, Mobile and Wireless Networks. Submissions must not be published or under review for another conference or journal. We are interested, but not limited to, research papers in any of the following areas:

The conference proceedings will be published by Springer-Verlag, as part of the Lecture Notes in Computer Science (LNCS) series (pending). Each accepted paper will be included in the conference proceedings, provided at least one author of the paper registers to present the paper at the conference. High-quality articles will be invited for a special issue of Ad Hoc & Sensor Wireless Networks: An International Journal (AHSWN), SCIE-indexed.

Authors can upload either regular papers or short papers. Regular papers should not exceed 14 pages (including a 150 word abstract, all figures, tables and references) in Springer Verlag LNCS format. Short papers must be limited to up to 4 pages in LNCS format. Acceptable formats for papers are PS and PDF. All papers will be reviewed for technical merit.

+-------------------------------------------------------------+MSN is one of the leading international conferences dedicated toaddressing challenges emerging from mobile, wireless and ad hocnetworking and computing. The conference will have many jointplenary sessions (such as the keynote, panels, and welcoming reception).MSN 2011 will hold multiple one or half day workshops of the conferenceweek in Beijing, co-located with the main conference.

We invite you to submit workshop proposals on any topic relatedto mobile communications and wireless networking before April 10,2011 to the Workshop Chairs. The ideal workshop proposal shouldfocus on a specific area, be of current interest, and be able toattract a number of high-quality submissions. Proposals onemerging topics guaranteed to generate significant interestin the community will be selected. MSN 2011 will have somereturning and some new workshops.

A workshop proposal should be no more than 3 pages, containing at least:* A draft call for papers (as complete as possible)* The workshop deadlines (internal and external)* Names and affiliations of main organizers and tentative composition of the committees* Motivation and rationale for the workshop* Expected number of submissions and participants* Prior history of this workshop, if any (including # submissions, # accepted papers and # attendees)* If the workshop was co-located with another conference, please include details and a brief description why MSN 2011 is more appropriate.

*********************************************************** * 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/***********************************************************

About Tsinghua Science and Technology: a comprehensive academic journal sponsored by Tsinghua University is published bimonthly. This journal aims at presenting the up-to-date scientific achievements with high creativity and great significance in engineering fields especially in computer and electronic engineering. It is indexed by Engineering Index (Ei, USA), Chemical Abstracts (CA, USA), INSPEC, P - (Russia), SA, Cambridge Abstract and other abstracting indexes.

This special issue is devoted to new research addressing the challenges in the areas of mobile computing and wireless and mobile networking. Recent convergence of information communications technology and computing is creating new demands and opportunities for ubiquitous computing via wireless and mobile equipment without technological restrictions. The demanding networking environment of wireless communications and the fast-growing number of mobile users impose several challenges in terms of channel estimation, network protocol design, resource management, systematic design, application development. The objective of this special issue is to gather recent advances addressing networks, systems, algorithms, and applications that support the symbiosis of mobile computers and wireless networks. It aims to publish high quality, original, unpublished research papers covering all issues in mobile computing and wireless and mobile networking at the link layer and above.

Guest Editors:==============Yu Wang, University of North Carolina at Charlotte, USAFan Li, Beijing Institute of Technology, ChinaYanwei Wu, Minnesota State University, USABin Xu, Tsinghua University, ChinaTeresa Dahlberg, University of North Carolina at Charlotte, USA*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

The following is an announcement of the summer thematic program on the mathematics of constraint satisfaction that will be held at the Fields Institute in Toronto this summer. One of the threads of the program is on approximability. There will also be a workshop associated with the program on the approximability of CSPs, that will be held during Aug 12-16, 2011, just preceding the RANDOM/APPROX conference in Princeton.

Please circulate the announcement to any individuals who might be interested in participating in the program, summer school, and/or any of the workshops (details on how to apply appear below; applications by *April 15, 2011* if possible are encouraged).

------------------------------------------------------------------------- Fields Institute Summer Thematic Program on the Mathematics of Constraint Satisfaction -------------------------------------------------------------------------

During July and August 2011, the Fields Institute will host a thematic program on the Mathematics of Constraint Satisfaction. The program will include a 5-day summer school, three focused workshops, the Coxeter Lectures, regular weekly seminars, and extended periods of time for in-residence researchers and students for intensive study. The program will bring together researchers from various communities within pure mathematics and theoretical computer science.

Outline of Scientific Activities:

The main activities of the program will be concentrated around a series of three workshops, a summer school, and the Coxeter Lectures. The summer school will take place during the last week of June, 2011 and the three workshops will be held at regular intervals throughout the summer. The Coxeter Lectures will be given by Moshe Vardi (Rice) on July 11-13, 2011.

Participation in the Program:

All scientific events are open to the mathematical sciences community, but visitors are requested to indicate their interest in participating in some or all of the planned events by filling out the information form found on the program website. The information form can also be used to request office space or funding. Fields scientific programs are devoted to research in the mathematical sciences, and enhanced graduate and post-doctoral training opportunities. Part of the mandate of the Institute is to broaden and enlarge the community, and to encourage the participation of women and members of visible minority groups in our scientific programs.

Deadlines:

Requests for support or office space may be submitted at any time by filling out the application form found on the program website, but interested participants are urged to apply by *April 15, 2011* if possible.

Each day of the summer school will consist of four 90 minute lectures plus time set aside for school participants and instructors to meet to discuss questions and problems related to the lectures. Lecture notes and problem sets will be prepared in advance and posted on the program website. A primary goal of the summer school is to provide the participants with a thorough and intense introduction to the main themes of the summer program.

This workshop will focus on all aspects of graph homomorphisms, from those directly related to constraint satisfaction problems, such as minimum cost and list homomorphisms, versions of projectivity, and polymorphisms, to those related to basic graph theoretic notions such as colourings, tree-width and tree-depth, and those related to notions from category theory, such as adjoint functors, to those related to statistical physics such as counting homomorphisms, and study of connection matrices. The goal is to bring together the main players in all aspects of graph homomorphisms, and share views of new trends and techniques.

The main goal of this workshop is to highlight the recent advances on the CSP Dichotomy Conjecture arising from the algebraic approach. It will focus on the various algebraic notions and results that have been developed in the attempts to resolve this conjecture and connected problems and will also include presentations on related algebraic topics, such as Maltsev Conditions and Tame Congruence Theory. The workshop may also include presentations on CSPs over infinite templates, quantified CSPs, and connections with logic, finite model theory, and complexity.

The workshop will focus on the recent advances in our understanding of the approximation threshold of various CSPs, based on progress in both algorithmic techniques and methods to show tight non approximability results. The power of various convex programming relaxations for CSPs, the construction of gap instances highlighting limitations of such relaxations, and the connections of these to the complexity of approximating CSPs will be a prominent theme of the workshop. The Unique Games conjecture and results revolving around it will naturally be a centerpiece of the workshop. This workshop is expected to have a more interdisciplinary focus. In particular one of its aims is to foster a cross fertilization of ideas between the algebraic approach to characterize the tractability of CSPs and the analytic approach to characterize the approximability of CSPs, and draw parallels between the algebraic dichotomy conjecture and the Unique Games conjecture that would hopefully shed some light on both these prominent conjectures.

I would like to bring vacancies in the SENSEable City Lab to yourattention. We are seeking postdoctoral fellows who have researchexperience in network science and massive datasets. If you know ofanyone who might be interested, I'd be grateful if you could pass thejob announcement below along.

Thanks a million,Dominik

* Postdoctoral positions at the SENSEable City Lab, MIT

The SENSEable City Laboratory at the Massachusetts Institute ofTechnology is seeking exceptional candidates to fill severalpostdoctoral positions. The focus of the research will be on complexsystems at the urban/regional scale. SENSEable City Lab researcherscome from various disciplines, including architecture, urban planning,physics, mathematics, engineering, computer science, and the arts. Thelab emphasizes the importance of human behavior and emotion in thestudy of pervasive technologies in the urban environment. Researchprojects are developed and achieved through a team-based,multidisciplinary approach. A wide variety of disciplinary backgroundswill be considered, but experience in handling massive data sets andnetwork science is a must.

If you are interested, please send a cover letter, CV, links or copiesof relevant publications, and two letters of reference tosenseable-applicants@mit.edu.

** Responsibilities and Qualifications

The responsibilities include:

1) Perform basic or applied research;2) Extend existing theories and methods;3) Prepare and write research papers targeted for top tier conferences and journals;4) Contribute to the functioning of the lab including supervising students and liaising with other researchers in the community;

The ideal candidate will have a recent Ph.D., a background in physics,computational biology, statistics, computer science or related areasand experience in computational modeling, data mining andanalysis. Candidates with a strong analytical background and interestin interdisciplinary research as evident from published research willbe also given particular attention. Experience or interest in one ofthe following fields is a plus, but not necessarily a requirement:esthetic sense, human-computer interaction, GIS, data fusion, datavisualization, signal processing, human mobility, and transportation.

-- Dominik Dahlem ----------------SENSEable City Laboratory | MITwww: http://senseable.mit.edutel: 1-617-324-5560 -----------*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

On behalf of the Organizing Committee, we invite you to participate in the8th IMACS Conference on Monte Carlo Methods, August 29 - September 2, 2011,Borovets, Bulgaria.

The topics of the conference cover both, theoretical developments andapplication fields.Stochastic metaheuristics are kind of Monte Carlo Methods for combinatorialand continues optimization. The Stochastic metaheusristic trend of theconference focuses on new theoretical and applied advances in the field ofsearch and optimization. It aims to provide a forum for researchers anddevelopers to exchange the latest experiences and ideas on stochasticmetaheuristic methods to cross-fertilize domains like numerical methods,algorithms, softwareimplementations, computational science, and complex applications.

The abstracts of all accepted talks will be published in a booklet ofabstracts. All participants will obtain their copies of this booklet atregistration. The abstract (up to 1 page stating clearly the originality ofthe results) are to be written in standard LaTeX. It is assumed that oneparticipant will present not more than one talk.

The papers of all talks will be published after a standard referringprocedure in the journalMonte Carlo Methods and Applications or Springer Lecture Notes in ComputerSciences.

Deadlines:Submission of registration forms and abstracts - April 15, 2011Notification of acceptance of talks - May 01, 2011Submission of full papers - June 010, 2011Notification of acceptance of papers - July 20, 2011Submission of accommodation forms - July 25, 2011

__Assoc. Prof. Stefka FidanovaIICT-BASAcad. G. Bonchev str. bl.25A1113 Sofia BulgariaPh. +359-2-9796642*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Best regards,-- Pawel*********************************************************** * 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, March 26, 2011

Special Issue on ``Theory and Applications of Graph Searching Problems''

Manuscripts are solicited for a special issue in the journal "Theoretical Computer Science" (TCS) on "Theory and Applications of Graph Searching Problems". This special issue will be dedicated to the 60th birthday of Lefteris M. Kirousis.

Graph searching is often referred to, in a more playful language, as a pursuit-evasion game. This is a kind of game where one part is a set of evaders, that hide in a graph representing a network, and the other part is a number pursuers, that move systematically in the graph. The game may vary significantly according to the capabilities of the evaders and the pursuers. The objective of the game is to capture the evaders in an optimal way, where the notion of optimality itself admits several interpretations. The area of Graph Searching has become a very active research area in theoretical computer science and discrete mathematics, with impact and applications in various domains.

With this Special Issue, we wish to foster research in the area by exposing new results and directions for further research. The purpose of the issue is to put together various recent results related to Graph Searching both from the applied andthe theoretical point of view. Potential topics include (but are not limited to) the following:

Submissions should be made in PDF format using the standard TCS submission system at http://ees.elsevier.com/tcs/ (doing author login). To ensure that all manuscripts are correctly identified for inclusion into the special issue you are editing, it is important that authors select SI TCS-A: Graph Searching (Thilikos) when they reach the "Article Type" step in the submission process.

Submissions must be received before July 31, 2011.

Papers will be refereed according to the standards of TCS.

We will do our best to have the refereeing procedure timely finished. Please contact the guest editors for additional information.

Guest Editors

Fedor V. Fomin (University of Bergen)

Pierre Fraigniaud (CNRS and University Paris Diderot)

Stephan Kreutzer (University of Oxford)

Dimitrios M. Thilikos (National and Kapodistrian University of Athens)

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

Friday, March 25, 2011

We apologize for possible multiple copies of this call for papersbeing delivered due to its submission to several mailing lists.

CALL FOR PAPERS

The series of MFCS symposia, organized alternately in the CzechRepublic, Poland and Slovakia since 1972, has a long andwell-established tradition. The MFCS symposia encourage high-qualityresearch in all branches of theoretical computer science. Their broadscope provides an opportunity to bring together researchers who do notusually meet at specialized conferences. Quality papers presentingoriginal research on theoretical aspects of computer science aresolicited.

Submission of abstracts April 15, 2011Notification May 30, 2011Conference August 22-26, 2011

Submissions to MFCS must not exceed 12 pages (in Springer-Verlag'sLecture Notes style). If the authors believe that more details areessential to substantiate the main claims, they may include a clearlymarked appendix that will be read at the discretion of the programcommittee. Simultaneous submissions of papers to any other conferencewith published proceedings or submitting previously published papersis not allowed. Only electronic submissions in the PDF format areaccepted. Detailed information about the submission procedure will beavailable on the conference web page in due time. The proceedings willbe published in the new ARCoSS subline of Lecture Notes in ComputerScience by Springer-Verlag.

The conference is organized by the Polish Mathematical Society and theFaculty of Mathematics, Informatics and Mechanics at the University ofWarsaw. For further information, please consult the conference webpage mfcs.mimuw.edu.pl.*********************************************************** * 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/***********************************************************

GA aims to provide a forum for researchers to discuss the mostrecent trends and results in graph algorithms and theirapplications. One goal is to show how theoretical advances,engineering principles and thorough experimental evaluations can helpdevelopers build efficient, robust, and scalable applications fordomain-specific scenarios. Another goal is to extract, formalize,and model new algorithmic graph problems from modern real-worldapplications, exploring directions for future research.

The workshop is in honor of Giorgio Ausiello in the occasion of his70th birthday.

We are seeking for papers presenting theoretical results and/orcomputational studies. Position and survey papers as well aspapers formalizing novel interesting open problems on the workshoptopics are also welcome.

Authors are invited to submit an extended abstract or full paper ofat most 12 pages and an optional appendix. Papers must be formattedin LaTeX. Contributions should be submitted electronically in pdfformat via the EasyChair submission system, accessible at:http://www.easychair.org/conferences/?conf=ga20110

There will be no proceedings, but a selection of the papers acceptedfor presentation at the workshop will be invited for a special issueof Theoretical Computer Science. Indeed, because of the lack of aproceedings, submission of work that is intended for publicationelsewhere is welcome. Such submissions should include details ofthe other submission.

Tremendous advances in our ability to acquire, store and process data,as well as the pervasive use of computers in general, have resulted ina spectacular increase in the amount of data being collected. Thisavailability of high-quality data has led to major advances in bothscience and industry. In general, society is becoming increasinglydata driven, and this trend is likely to continue in the coming years.

The increasing number of applications processing massive data meansthat in general focus on algorithm efficiency is increasing. However,the large size of the data, and/or the small size of many moderncomputing devices, also means that issues such as memory hierarchyarchitecture often play a crucial role in algorithm efficiency. Thusthe availability of massive data also means many new challenges foralgorithm designers.

The aim of the workshop on massive data algorithmcs is to provide aforum for researchers from both academia and industry interested inalgorithms for massive dataset problems. The scope of the workshopincludes both fundamental algorithmic problems involving massive data,as well as algorithms for more specialized problems in, e.g.,graphics, databases, statistics and bioinformatics. Topics of interestinclude, but are not limited to:

We invite submissions of extended abstracts (at most 10 pages notcounting references) of original research. Extended abstract should besubmitted through the EasyChair website by Wednesday April 27. Authorswill be notified about acceptance by Monday May 9, and final versionswill be due on May 30. Accepted extended abstracts will be collectedin a booklet, which will be distributed at the workshop. There will beno formal proceedings, so work presented at the workshop can also be(or have been) presented at other conferences. An author of eachaccepted abstract is expected to give a presentation of the abstractat the workshop.

Call for Papers: February 2011Paper submission deadline: Wednesday April 27Notification of acceptance: Monday May 9Early registration deadline: May 16Final version due: May 30Symposium: June 16, 2011

Participation

The workshop will take place on June 16, 2011 in Paris, France,immediately following the 27th Annual Symposium on ComputationalGeometry (SoCG). Participants should register through the on-lineregistration which will soon be opened on the workshop webpage underhttp://www.madalgo.au.dk/massive2011 . All researchers and industrypeople interested in massive data algorithmics are encouraged toattend the workshop.

Due to the addition of specific sessions and given the multiple extension requests, the deadline has been extended to the 5th of April, 2011. Submitted abstracts should be from two to maximum four pages long.

NEWS!!! -------------------------------------------------------------------Authors will be invited to submit extended versions of the abstracts, subject to further review to be published in "EVOLVE - A bridge between Probability, Set Oriented Numerics and Evolutionary Computation", in the series Studies in Computational Intelligence, Springer (edited book on the theoretical foundations of evolutionary computation, indexed by DBLP, Ulrichs, SCOPUS, MathSciNet, Current Mathematical Publications, Mathematical Reviews, Zentralblatt Math: MetaPress and Springerlink).---------------------------------------------------------------------------

The massive use and large applicability spectrum of evolutionary algorithms for real-life applications determined the need of establishing solid theoretical grounds. Only to offer a few examples, one may consider mathematical objects that are sometimes difficult and/or costly to calculate. At the same time, acknowledged new results show that evolutionary computation can provide in some cases good and fast estimators of these quantities. Similarly, the handling of large quantities of data may require the use of distributed environments where the probability of failure and the stability of the algorithms may need to be addressed. What is more, common practice confirms in many cases that theory based results have the advantage of ensuring performance guarantee factors for evolutionary algorithms in areas as diverse as optimization, bio-informatics or robotics.

The aim of the EVOLVE workshop is to build a bridge between probability, statistics, set oriented numerics and evolutionary computing, as to identify new common and challenging research aspects. The workshop is also intended to foster a growing interest for robust and efficient methods with a sound theoretical background. EVOLVE is intended to unify theory-inspired methods and cutting-edge techniques ensuring performance guarantee factors. By gathering researchers with different backgrounds, ranging from computer science to mathematics, statistics and physics, to name just a few, a unified view and vocabulary can emerge where the theoretical advancements may echo in different domains.

The EVOLVE 2011 workshop represents a follow-up of the Workshop on Evolutionary Algorithms - New Challenges in Theory and Practice, organized by the ALEA Working Group in Bordeaux, France, March 2010, with the support of the EA association.

Topics of interest (include but are not limited to)***************************************

We invite researchers working on both theoretical and practical aspects of evolutionary algorithms to submit an abstract of maximum two pages. The submissions have to be done exclusively through EasyChair, at the following address: http://www.easychair.org/conferences/?conf*evolve2011. All submissions must be in English.

The final submission must include the PDF file along with all the accompanying source files (LaTeX file, figures). An EasyChair account is mandatory - in case you do not have an EasyChair account, you can create one for free at EasyChair.

The final version of the abstract must be uploaded on EasyChair before the 5th of April 2011. Authors who cannot meet the specified deadline are invited to contact the EVOLVE organizers.

Publication*********Authors will be invited to submit full papers, that will be published subject to further review in "EVOLVE - A bridge between Probability, Set Oriented Numerics and Evolutionary Computation", in the series Studies in Computational Intelligence, Springer (edited book on the theoretical foundations of evolutionary computation, indexed by DBLP, Ulrichs, SCOPUS, MathSciNet, Current Mathematical Publications, Mathematical Reviews, Zentralblatt Math: MetaPress and Springerlink).

All the accepted abstracts will be presented orally at the workshop and will appear in proceedings that will be handed out at the event. In addition, all accepted authors will be invited to submit an extended version of their work also to a journal special issue (to be announced).

Important dates************Submission deadline: April 5, 2011Notification of acceptance: April 15, 2011Registration deadline: April 25, 2011Conference dates: May 25-27, 2011

The call is also available online on the EVOLVE 2011 website at http://evolve.uni.lu/index.php/call-for-abstracts___________________________________________________________________________*********************************************************** * 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, March 23, 2011

The Department of Computer Science, University of Sheffield, is advertising for three new academic posts, open to any area of computer science. These are at professorial level, and lecturer/senior lecturer level (permanent positions roughly equivalent to Assistant Professor in the US system).

*********************************************************** * Contributions to be spread via DMANET are submitted to* * DMANET@zpr.uni-koeln.de* * Replies to a message carried on DMANET should NOT be* addressed to DMANET but to the original sender. The* original sender, however, is invited to prepare an* update of the replies received and to communicate it* via DMANET.* * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/***********************************************************

The conference will explore the theme that many processes in the physical, biological, engineering, and social sciences involve information processing at a fundamental level and can be studied through computational models. A conference held in Berkeley in May, 2002 helped crystallize this theme as a promising direction of research, and this second conference will highlight the impact of the computational lens on areas such as quantum information science, statistical physics, social networks, economics and game theory, genetics, molecular biology, evolutionary biology, cognitive science, mathematics, statistics and machine learning.

------

Featured Speakers:

Professor Leslie Valiant, Harvard University Evolution as a Form of Learning

Professor Ehud Kalai, Northwestern University Robustness and Complexity in Games