Send dmanet mailing list submissions to
dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. postdoc positions in Warsaw (Marcin Kami?ski)
2. [CFP] SWANSITY 2014- Self-organizing Wireless Access Networks
for Smart cITY ( In conjuction with SECON 2014 ) (Valeria Loscri)
3. DAM special issue DGA13: deadline approaching (Antonio Mucherino)
4. MFCS 2014: Call for Papers (mfcs2014@inf.u-szeged.hu)
5. [Algorithms] Special Issue "Parameterized Algorithmics -
Challenges from Real-World Applications" (Stefan Kratsch)
----------------------------------------------------------------------
Message: 1
Date: Tue, 18 Feb 2014 11:56:05 +0100
From: Marcin Kami?ski <mjk@mimuw.edu.pl>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] postdoc positions in Warsaw
Message-ID:
<CAMZEzu-=oHHRFWrRJQ56h06zQur_mRU+yTB4LytXiCXLAPZnqw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
The Warsaw Center of Mathematics and Computer Science has several open
postdoctoral positions. The deadline for applications is March 15. You
will find more information here: http://www.wcmcs.edu.pl/node/41
Please note that:
* the graph theory and algorithms community at the University of
Warsaw is large and growing (http://zaa.mimuw.edu.pl/),
* the monthly allowance is ample given the cost of living in Warsaw
(http://bit.ly/16VtFxH),
* calls for postdoctoral positions are expected twice a year until 2017,
* along with calls for visting PhD students
(http://www.wcmcs.edu.pl/node/40) and experienced researchers
(http://www.wcmcs.edu.pl/node/64).
Please do not hesitate to contact us if you have any questions.
Best regards,
Marcin Kami?ski (mjk@mimuw.edu.pl)
?ukasz Kowalik (kowalik@mimuw.edu.pl)
------------------------------
Message: 2
Date: Tue, 18 Feb 2014 15:53:40 +0100 (CET)
From: Valeria Loscri <valeria.loscri@inria.fr>
To: "dmanet@zpr.uni-koeln.de" <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] [CFP] SWANSITY 2014- Self-organizing Wireless Access
Networks for Smart cITY ( In conjuction with SECON 2014 )
Message-ID: <493974781.532913.1392735220450.JavaMail.zimbra@inria.fr>
Content-Type: text/plain; charset=utf-8
================================================================================
CFP: SWANSITY 2014- Self-organizing Wireless Access Networks for Smart cITY
>>>>> In conjuction with SECON 2014 <<<<<
================================================================================
30 June 2014, Singapore
https://sites.google.com/site/swansity2014
The SWANSITY workshop aims to solicit contributions on novel algorithms, methodological studies and experimentations on how to make a city-wide network infrastructure able to self-adapt to the dynamic requirements posed by the users and by the applications, to manage the complexity of heterogeneous devices and access technologies, and to guarantee robust, ubiquitous, and secure connectivity over the urban environments. At the same time, beside studying the issues of the city-wide infrastructure deployment, the workshop aims to investigate the potential provided by the end-users devices (e.g. smartphones, tablets) when augmented with self-organization capabilities, in order to turn them into active components of the smart-city network, instead of mere connection end- points. Such a potential includes the possibility to extend the network access in a pervasive way, to provide ubiquitous computing services, and to favor the emergence of ?collectivity intelligence behaviors? thr!
ough collaboration and direct communication among devices.
In line with such objectives, original contributions are solicited in topics of interest including, but not limited to, the following:
* Models of network components? interactions on a smart-city
* Techniques and tools for modeling self-organizing wireless networks on large-scale urban environments
* Self-organizing wireless networks for pervasive urban access
* Self-organizing and self-repairing wireless networks for disaster recovery
* Dynamic resource allocation schemes for urban environments
* Evolutionary design of wireless network components and devices
* Enabling technologies and algorithms for self-configuring wireless nodes
* Self-organizing femtocell and cognitive radio networks
* Cooperative Smart Objects supporting Wireless Networks Interoperability
* Decision making strategies for software defined radio devices
* Emerging collective intelligence in self-organizing wireless networks
* Network virtualization for heterogeneous wireless networks
* Bio-inspired models for self-organizing wireless networks
* Controlled mobility algorithms for self-placing wireless networks
* Self-organizing networks through Device-2-Device technology (D2D)
* Business model to promote users collaboration and resources sharing
* Security, Privacy and Trust issues in Self-organizing wireless networks
Prospective authors are invited to submit original technical paper by the deadline of 31 March 2014. Submissions will be accepted through EDAS. All submissions must be written in English and be at most six (6) printed pages in length, including figures.
Important dates & Information
Submission deadline: March 31st, 2014
Format: All submissions must be written in English and be at most six (6) printed pages in length via edas
http://edas.info/N16973
Notification of acceptance:April 30th, 2014
Camera Ready: May 12th, 2014
Program: June 1st, 2014
For full details, please visit the following website: https://sites.google.com/site/swansity2014
TPC Co-Chairs
Gianluca ALOI, University of Calabria, Italy
Marco DI FELICE, Univesity of Bologna,Italy
Valeria LOSCRI', Inria Lille-Nord Europe, FUN, France Pasquale PACE, University of Calabria, Italy
Giuseppe RUGGERI, University of Reggio Calabria, Italy
Steering Committee
Emanuele VITERBO, MONASH University Giancarlo FORTINO, UNICAL- Italy
TPC Members
Kaushik Roy Chowdhury, Northeastern University, USA
Claudia Campolo, University of Reggio Calabria, Italy
Yue Gao (Frank), Queen Mary University of London, UK
Yi Hong, Monash University, Australia
Antonio Iera, University of Reggio Calabria, Italy
Wenfeng Li, Wuhan University of Technology, China
Antonio Liotta, TU/e, Netherlands
Karnouskos Stamatis, SAP, Germany
Pietro Manzoni, UPV -Valencia, Spain
Pedro Jose Marron, University of Duisburg-Essen, Germany
Nathalie Mitton, Inria Lille-Nord Europe, FUN, France
Antonella Molinaro, University of Reggio Calabria, Italy
Enrico Natalizio, Compiegne,Technology, University, France
Tahiry Razafindralambo, Inria Lille-Nord Europe, FUN, France
Anna Maria Vegni, University of Roma Tre, Italy
Mengchu Zhou, New Jersey Institute of Technology, USA
Valeria Loscri
Research Scientist FUN Team
Inria Lille-Nord Europe .
Parc scientifique de la Haute Borne
40, avenue Halley - B?t A - Park Plaza
59650 Villeneuve d'Ascq - France
www.inria.fr
Follow us
Twitter ? twitter.com/inria
YouTube? youtube.com/inriachannel
------------------------------
Message: 3
Date: Tue, 18 Feb 2014 17:29:53 +0100
From: Antonio Mucherino <antonio.mucherino@irisa.fr>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] DAM special issue DGA13: deadline approaching
Message-ID: <53038A81.2010700@irisa.fr>
Content-Type: text/plain; charset=windows-1252; format=flowed
Final Call for Papers -- deadline approaching: February 28th, 2014
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 (DGA13), 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 February 28th, 2014. All accepted papers
will be published online individually, before print publication.
Information about the special issue and instructions for the submission
can be found on DGA13 workshop's website at the address:
http://dga2013.icomp.ufam.edu.br/index.php/publication
Looking forward to receiving your contribution.
The Guest Editors,
Antonio Mucherino
Rosiane de Freitas
Carlile Lavor
------------------------------
Message: 4
Date: Tue, 18 Feb 2014 22:36:40 +0100 (CET)
From: mfcs2014@inf.u-szeged.hu
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] MFCS 2014: Call for Papers
Message-ID:
<51754.91.82.179.5.1392759400.squirrel@webmail.inf.u-szeged.hu>
Content-Type: text/plain;charset=utf-8
2nd Call for Papers
39th International Symposium on
Mathematical Foundations of Computer Science
MFCS 2014
Budapest, August 25--29, 2014
www.inf.u-szeged.hu/mfcs2014
*Announcement*
The series of MFCS symposia, organized since 1972, has a long and
well-established tradition. The MFCS conferences encourage high-quality
research in all branches of theoretical computer science. Their broad
scope provides an opportunity to bring together researchers who do not
usually meet at specialized conferences. Quality papers presenting
original research on theoretical aspects of computer science are
solicited.
*Topics*
Principal topics of interest include (but are not limited to):
algorithms and data structures (incl. sequential, parallel,
distributed, randomized, approximation, graph, network, on-line,
parameterized, optimization algorithms),
algorithmic game theory,
algorithmic learning theory,
computational complexity (structural and model-related),
computational geometry,
models of computation,
networks (incl. wireless, sensor, ad-hoc networks),
parallel and distributed computing,
quantum computing,
automata, grammars and formal languages,
combinatorics on words, trees, and other structures,
bioinformatics,
computer-assisted reasoning,
concurrency theory,
cryptography and security,
databases and knowledge-based systems,
formal specifications and program development,
foundations of computing,
logic, algebra and categories in computer science,
types in computer science,
mobile computing,
semantics and verification of programs,
theoretical issues in artificial intelligence.
*Invited Speakers*
Krishnendu Chatterjee (IST Austria, Klosterneuburg, Austria),
Achim Jung (U. of Birmingham, UK),
D\'aniel Marx (Hungarian Academy of Sciences, Budapest, Hungary),
Peter Bro Miltersen (Aarhus U., Denmark),
Cyril Nicaud (U. Paris-Est, Marne-la-Vall\'ee, France),
Alexander Sherstov (UCLA, Los Angeles, USA),
Christian Sohler (TU Dortmund, Germany).
*Program Committee*
Albert Atserias (UPC, Barcelona, Spain),
Giorgio Ausiello (U. ``La Sapienza'', Rome, Italy),
Jos Baeten (CWI, Amsterdam, The Netherlands),
Therese Biedl (U. of Waterloo, Canada),
Miko\laj Boja\'nczyk (Warsaw U., Poland),
Gerth St\olting Brodal (Aarhus U., Denmark),
Christian Choffrut (U. Paris Diderot, France),
Erzs\'ebet Csuhaj-Varj\'u (E\"otv\"os Lor\'and U., Budapest, Hungary,
co-chair),
Rocco De Nicola (IMT Lucca, Italy),
Martin Dietzfelbinger (TU Ilmenau, Germany, co-chair),
Manfred Droste (U. of Leipzig, Germany),
Robert Els\"asser (U. Salzburg, Austria),
Zolt\'an \'Esik (U. of Szeged, Hungary, chair),
Uli Fahrenberg (Irisa/INRIA Rennes, France),
Fedor V. Fomin (U. of Bergen, Norway),
Fabio Gadducci (U. of Pisa, Italy),
Anna G\'al (U. of Texas, Austin, USA),
Dora Giammarresi (U. ``Tor Vergata'', Rome, Italy),
Roberto Grossi (U. of Pisa, Italy),
Anupam Gupta (CMU, Pittsburgh, USA),
Michel Habib (U. Paris Diderot, France),
Kristoffer Arnsfelt Hansen (Aarhus U., Denmark),
Edith Hemaspaandra (RIT, Rochester, USA),
Kazuo Iwama (Kyoto U., Japan),
Yoshihiko Kakutani (U. of Tokyo, Japan),
Juhani Karhum\"aki (U. of Turku, Finland),
Bakhadyr Khoussainov (U. of Auckland, New Zealand),
Elias Koutsoupias (U. of Oxford, UK),
Rastislav Kr\'alovi\v c (Comenius U., Bratislava, Slovakia),
Jan Kratochvil (Charles U., Prague, Czech Republic),
Stefan Kratsch (TU Berlin, Germany),
Amit Kumar (IIT, New Delhi, India),
Kim G. Larsen (Aalborg U., Denmark),
Fr\'ed\'eric Magniez (U. Paris Diderot, Paris, France),
Ralph Matthes (U. Paul Sabatier, Toulouse, France),
Madhavan Mukund (CMI, Chennai, India),
Jean-\'Eric Pin (LIAFA, U. Paris Diderot, and CNRS, Paris, France),
Alexander Rabinovich (Tel Aviv U., Israel),
Peter Rossmanith (RWTH Aachen U., Germany),
Jan Rutten (CWI, Amsterdam, and Radboud U. Nijmegen, The Netherlands),
Wojciech Rytter (Warsaw U., Poland),
Luigi Santocanale (Aix-Marseille U., France),
Christian Scheideler (U. of Paderborn, Germany),
Thomas Schwentick (TU Dortmund, Germany),
Alex Simpson (U. of Edinburgh, UK),
Mohit Singh (Microsoft Research, Redmond, USA),
Klaus Sutner (CMU, Pittsburgh, USA),
G\'abor Tardos (Hungarian Academy of Sciences, Budapest, Hungary),
Gy\"orgy Tur\'an (U. of Illinois, Chicago, USA),
Peter Widmayer (ETH Zurich, Switzerland),
Philipp Woelfel (U. of Calgary, Canada).
*Important dates*
Paper submission deadline: *April 18, 2014.*
Author notification: *June 3, 2014.*
Camera-ready deadline: *June 16, 2014.*
Conference: *August 25--29, 2014.*
*Submission guidelines*
Submissions to MFCS must not exceed 12 pages
(in Springer-Verlag's Lecture Notes style and including bibliography).
If the authors believe that more details are essential to substantiate
the main claims, they may include a clearly marked appendix that will
be read at the discretion of the program committee.
Simultaneous submissions of papers to any other conference with
published proceedings or simultaneous or previous submission of the
same contribution to journals is not allowed. Only electronic
submissions
in PDF format are accepted.
Information about the submission procedure is available on the
conference web page. The proceedings will be published in the
*ARCoSS subline of Lecture Notes in Computer Science by
Springer-Verlag*.
It is planned to have a special issue of*Information and Computation*
to which journal versions of the best papers are invited.
*Contact*
Zolt\'an \'Esik: ze@inf.u-szeged.hu or
Erzs\'ebet Csuhaj-Varj\'u: csuhaj@inf.elte.hu or
Martin Dietzfelbinger: martin.dietzfelbinger@tu-ilmenau.de
The conference is organized by the Faculty of Informatics,
E\"otv\"os Lor\'and University, Budapest,
and the Department of Foundations of Computer Science,
Faculty of Science and Informatics, University of Szeged,
in cooperation with EATCS.
------------------------------
Message: 5
Date: Tue, 18 Feb 2014 23:20:19 +0100
From: Stefan Kratsch <stefan.kratsch@tu-berlin.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] [Algorithms] Special Issue "Parameterized
Algorithmics - Challenges from Real-World Applications"
Message-ID: <5303DCA3.3040404@tu-berlin.de>
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Dear Colleagues,
we would like to invite submissions to the upcoming special issue
Parameterized Algorithmics - Challenges from Real-World Applications
http://www.mdpi.com/si/algorithms/Parameterized_Algorithmics
of the open access journal Algorithms (ISSN 1999-4893,
http://www.mdpi.com/journal/algorithms). The submission deadline
is 31 May 2014, but you may send your manuscript at any time before
then. If you plan to contribute a research or review article, please send
a short abstract to the Editorial Office (algorithms@mdpi.com).
A detailed call for submissions can be found below.
We look forward to your contributions.
Christian Komusiewicz
Stefan Kratsch
Rolf Niedermeier
Guest Editors
-------------------------------------------------------------------------------------------------------
Call for submissions:
Over the last decade, parameterized complexity analysis for NP-hard
problems
has developed into one of the most prospering areas in algorithms and
complexity
research. So far, the main research focus is on purely theoretical
analysis (mostly
concerning graph-theoretic problems).
However, practical success often relies on one or more of the following
aspects:
* The problem under study occurs in real-world applications and
ideally
comes along with real-world data for testing.
* The considered parameterization yields small parameter values in
real-world
instances.
* The running time analysis accounts for the combinatorial
explosion behind
exponential parameter functions, as well as for polynomial
running time factors in
the overall input size.
We invite submissions that address one or more of the aforementioned
points in
analyzing the parameterized complexity of NP-hard problems, which arises
from
application areas including (but not limited to) network analysis
(biological, social,
and technical), computational geometry, SAT solving, bioinformatics, string
problems, operations research and combinatorial optimization, computational
social choice, data clustering, and mining.
We particularly welcome submissions that introduce new but practically
relevant
problem formulations and/or parameterizations, present linear-time fixed-
parameter tractability and/or kernelization results, or that take into
account
aspects of algorithm engineering. In particular, such aspects could
include the
measurement or estimation of parameter values in real-world data.
Finally, feature
papers or surveys addressing some of the above aspects are also of
interest.
Keywords
* NP-hard problems
* exact algorithms
* fixed-parameter tractability
* kernelization and data reduction
* efficient algorithms
* algorithm engineering
The deadline for submission is 31 May 2014, but you may send your
manuscript
at any time before then. All submissions are peer-reviewed and accepted
papers
will be published immediately. If you plan to contribute, please send a
short
abstract to the Editorial Office (algorithms@mdpi.com).
Algorithms is an open access journal, which has no income from selling
subscriptions. To defray the editorial and production costs, the journal
levies an
Article Processing Charge (APC) for accepted papers. Please refer to
http://www.mdpi.com/journal/algorithms/apc/ for more information. The
charge
currently is of 300 CHF (Swiss Francs) per accepted paper.
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 72, Issue 18
**************************************
No comments:
Post a Comment