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. ESA Test-of-Time Award 2015 (Dorothea Wagner)
2. ALEA in Europe Meeting -- 22-26 February 2016 -- Munich -
registration (Konstantinos Panagiotou)
3. CFP: DEBS 2016 - The 10th ACM International Conference on
Distributed and Event-Based Systems (Vinay Setty)
4. CFP: SIAM Workshop on Network Science 2016 (Blair Sullivan)
----------------------------------------------------------------------
Message: 1
Date: Tue, 15 Dec 2015 08:50:50 +0100
From: Dorothea Wagner <dorothea.wagner@kit.edu>
To: dmanet <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] ESA Test-of-Time Award 2015
Message-ID: <6A476099-8113-4099-88C8-17A5C1AEE3E9@kit.edu>
Content-Type: text/plain; charset=us-ascii
___________________________________________________________________________________
Announcement of the ESA Test-of-Time Award 2015
European Symposium on Algorithms (ESA)
http://esa-symposium.org/
___________________________________________________________________________________
The ESA Test-of-Time Award (ESA ToTA) recognizes outstanding papers in
algorithms research that were published in the ESA proceedings 19-21
years ago and which are still influential and stimulating for the field
today.
The award committee selected the following two papers for the ESA ToTA 2015.
The papers stand out for their impact and wide use in the algorithms field, and for their excellent citation records up to the present day.
>From ESA 03-95:
Mechthild Stoer, Frank Wagner:
A Simple Min Cut Algorithm
Proceedings ESA'94, also in: JACM 44:4 (1997) 585-591
Laudatio
The minimum cut problem in graphs is a basic problem in network analysis
and is needed, for example, as the separation routine in branch-and-cut
algorithms for the Traveling Salesman problem. Stoer and Wagner gave an
elegant and efficient algorithm for the problem that avoids the computation
of maximum flows, building upon previous work by Nagamochi and Ibaraki. The
same algorithm was independently found by Frank. The algorithm continues to
be taught because of its elegance and used because of its efficiency and ease
of implementation.
>From ESA 94-96:
Sudipto Guha, Samir Khuller:
Approximation Algorithms for Connected Dominating Sets
Proceedings ESA'96, also in: Algorithmica 20:4 (1998) 374-387
Laudatio
It is natural to require connectedness as an additional constraint for a
dominating set, for example, in ad hoc wireless networks. Domination
guarantees coverage and connectedness guarantees communication between
the selected nodes. Guha and Khuller gave polynomial algorithms for a
logarithmic-factor approximation to its solution. Under the usual
assumptions, this is the best possible. Their much-cited work has
stimulated similar research for connected variants of many other graph
problems.
Exceptionally, in this first year in which award is given, the
ESA ToTA 2015 committee was asked to consider all qualifying papers from
ESA 93-95 and ESA 94-96, respectively.
Award Committee: Jan van Leeuwen, Kurt Mehlhorn and Mike Paterson
_________________________________________________________________________________________
------------------------------
Message: 2
Date: Tue, 15 Dec 2015 09:05:04 +0100
From: "Konstantinos Panagiotou" <kpanagio@math.lmu.de>
To: <dmanet@zpr.uni-koeln.de>
Subject: [DMANET] ALEA in Europe Meeting -- 22-26 February 2016 --
Munich - registration
Message-ID: <02d001d1370f$4e1d3870$ea57a950$@math.lmu.de>
Content-Type: text/plain; charset="iso-8859-1"
==========================
ALEA in Europe Meeting
Munich, 22-26 February 2016
<http://www.alea-in-europe.com/> http://www.alea-in-europe.com/
==========================
(apologies for multiple copies)
We are pleased to announce the second ALEA in Europe meeting, to be held in
Munich 22-26 February 2016.
This five day meeting and school is an activity in the context of the
<http://aleanetwork.net/index.php> ALEA network and aims at bringing together
researchers working on Random Discrete Structures in Computer Science,
Probability and Statistical Physics. The goal is to provide postdocs and
students the unique opportunity to learn from leading experts the state of the
art results and methods and to meet fellow colleagues.
The meeting will feature three distinguished series consisting of three lectures
each, five invited seminars, and a number of shorter talks by some of the
participants.
Topics of interest include: discrete random structures, combinatorics,
probability theory, bio inspired computation, statistical physics.
Participation is free of charge. However, please register until February 7,
2016.
Main speakers:
Marc Noy (UPC Barcelona)
Christina Goldschmidt (Oxford)
Benjamin Doerr (LIX, Ecole Polytechnique)
Invited Seminars:
Mihyun Kang (TU Graz)
Carola Doerr (Université Pierre et Marie Curie)
Mathias Schacht (University of Hamburg)
Johannes Lengler (ETH Zurich)
Benedikt Stufler (University of Munich)
Organization:
Konstantinos Panagiotou (University of Munich)
------------------------------
Message: 3
Date: Tue, 15 Dec 2015 10:05:19 +0100
From: Vinay Setty <vsetty@mpi-inf.mpg.de>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: DEBS 2016 - The 10th ACM International
Conference on Distributed and Event-Based Systems
Message-ID: <566FD7CF.1060107@mpi-inf.mpg.de>
Content-Type: text/plain; charset=windows-1252
----------------------------------------------------------------------
----------------------------------------------------------------------
CALL FOR PAPERS
10th ACM International Conference on Distributed Event-Based Systems
Irvine, CA, USA,
June 20-24 2016
http://www.debs2016.org
----------------------------------------------------------------------
----------------------------------------------------------------------
OBJECTIVES:
Over the past decade, the ACM International Conference on Distributed
and Event- based Systems (DEBS) has become the premier venue for
contributions in the fields of distributed and event-based systems.
The objectives of the ACM International Conference on Distributed and
Event-Based Systems (DEBS) are to provide a forum dedicated to the
dissemination of original research, the discussion of practical
insights, and the reporting of experiences relevant to distributed
systems and event-based computing. The conference aims at providing a
forum for academia and industry to exchange ideas through industry
papers and demo papers.
SCOPE:
Starting this year DEBS is extending its scope to embrace a broader
set of topics related to distributed systems and event-based
computing. Topics of particular interest may include (but are not
limited to) models, architectures and paradigms of distributed and
event-based systems, middleware systems and frameworks, and
applications, experiences and requirements. The scope of the DEBS
conference covers all topics relevant to distributed and event-based
computing ranging from those discussed in related disciplines (e.g.,
software systems, distributed systems, distributed data processing,
data management, dependability, knowledge management, networking,
programming languages, security and software engineering), to domain-
specific topics of event-based computing (e.g., real-time analytics,
mobile computing, social networking, pervasive, green computing and
ubiquitous computing, sensors networks, user interfaces, big data
processing, spatio-temporal processing, cloud computing, the Internet
of things, peer-to-peer computing, embedded systems and stream
processing), to enterprise-related topics (e.g., complex event
detection, enterprise application integration, real-time enterprises
and web services).
In addition to these traditional topics, the scope of DEBS 2016 will
include the increasingly important area of Internet of Things. New
advances in distributed and event-based systems pose a great potential
for a major contribution in this area. For further information, please
refer to the call for contributions in the track of your choice.
TOPICS COVERED INCLUDE, BUT ARE NOT LIMITED TO:
1) Models, Architectures and Paradigms: Event-driven architectures,
event processing in big data, complex event processing, rule-based
systems, logic-based event recognition, event correlation and pattern
languages.
2) Middleware infrastructures: Distributed data processing,
distributed programming, federated event-based systems, event
dissemination on P2P systems, fault tolerance, reliability and
availability and scalability.
3) Applications, Experience and Requirements: Use cases and
applications of distributed and event-based systems in various domains
including Internet of Things, Smart Cities, Smart Grids, Finance,
Logistics.
Submission Dates:
Abstract submission for research track: Feb 22nd, 2016
Research and industry paper submission: Feb 27th, 2016
Tutorial proposal submission: Mar 7th, 2016
Grand Challenge solution submission: Mar 30th, 2016
Author notification: Apr 18th, 2016
Poster, demo, doctoral
symposium submission: Apr 30th, 2016
Camera ready submission: May 6th, 2016
STRUCTURE:
DEBS 2016 will be organized along six tracks:
1. Research Track that presents original research contributions.
Submissions will be evaluated by an experienced program committee
consisting of eminent researchers from all over the world.
2. Industry and Experience Reports Track meant to report on innovative
deployments of event-based systems. Contributions will be reviewed by
researchers and industry practitioners working in event-based
computing.
3. The Tutorial Track where recognized experts in the field will
present their tutorials on relevant emerging areas of research.
4. Poster and Demo Track where authors can report on work in progress
and/or arrange to demonstrate interesting ideas and applications
pertaining to event- based systems.
5. Doctoral Symposium Track meant for doctoral candidates whose
research area overlaps with event-based systems.
6. Grand Challenge Track: Here the committee will set out a grand
challenge problem and then judge the most innovative approaches for
its solution.
PROCEEDINGS:
Accepted papers will appear in the conference proceedings, which will
be published in the ACM Digital Library. The authors of accepted
papers will be given a choice between different copyright agreements,
in accordance with the recent changes in the ACM policy. The options
will include new opportunities for open access as well as the
traditional ACM copyright agreement.
AUTHORS TAKE NOTE: A new policy by ACM will allow DEBS 2016 to make
the proceedings available ahead of the conference via the ACM Digital
Library. Thus, the official publication date is the date the
proceedings appear in the ACM Digital Library. This date may be up to
two weeks prior to the first day of the conference. The official
publication date affects the deadline for any patent filings related
to published work.
SUBMISSION INFORMATION: http://www.debs2016.org/submission-
guidelines.html
GENERAL CO-CHAIRS:
Avigdor Gal, Technion, Israel
Matthias Weidlich, Humboldt-Universitaet zu Berlin, Germany
RESEARCH TRACK CO-CHAIRS:
Vana Kalogeraki, Athens University of Economics and Business, Greece
Nalini Venkasubramanian, University of California, Irvine, USA
INDUSTRY TRACK CO-CHAIRS:
Malu Castellanos, HP, USA
Alejandro Buchmann, Technische Universitaet Darmstadt, Germany
DOCTORAL SYMPOSIUM CO-CHAIRS:
David Eyers, University of Otago, New Zeland
Leonardo Querzoni, Sapienza University, Italy
TUTORIALS CO-CHAIRS:
Gianpaolo Cugola, Politecnico di Milano, Italy
Bugra Gedik, Bilkent University, Germany
GRAND CHALLENGE CO-CHAIRS:
Vincenzo Gulisano, Chalmers University of Technology, Sweden
Zbigniew Jerzak, SAP AG, Germany
Holger Ziekow, Furtwangen University, Furtwangen, Germany
DEMO AND POSTERS CO-CHAIRS:
Nesime Tatbul, Intel Labs/MIT, USA
Ioannis Katakis, University of Athens, Greece
SPONSORSHIP CO-CHAIRS:
Opher Etzion, Yezreel Valley College, Israel
Christoph Emmersberger, University of Regensburg, Germany
PROCEEDINGS CHAIR:
Thomas Heinze, SAP, USA
PUBLICITY CO-CHAIRS:
Mohammad Sadoghi, IBM T.J. Watson Research Center, USA
Izchak Tzachi Sharfman, Technion, Israel
Vinay Setty, MPI, Germany
WEB CO-CHAIRS:
Matthew Forshaw, Newcastle University, UK
Ye Zhao, Google Inc., USA
------------------------------
Message: 4
Date: Tue, 15 Dec 2015 08:33:38 -0500
From: Blair Sullivan <vbsulliv@ncsu.edu>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP: SIAM Workshop on Network Science 2016
Message-ID:
<CAMANxd4nZSFqTUCnjRUTT4u3kNxHEuHVh3FAq_CtTT6ZALGbGw@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
==========================================================
SIAM Workshop on Network Science (NS'16)
July 15 - 16, 2016
The Westin Boston Waterfront
Boston, Massachusetts, USA
CALL FOR PAPERS
www.siam.org/meetings/ns16/
==========================================================
SCOPE
=====
Network science has a rich history, tracing its roots back
through sociology, chemistry, biology, electrical engineering,
computer science, and topology all the way to Euler and the
Königsberg bridges nearly 300 years ago. Network science
studies the mathematical structure of the graphs that arise in
these diverse fields, and the design, analysis, and applications
of algorithms that compute with and on them. The goal of the
SIAM Network Science workshop is to promote cross-fertilization
among the communities that study and apply networks and graphs,
both inside and outside SIAM.
NS'16 will be co-located in Boston with the 2016 SIAM Annual
Meeting (July 11-15) and the SIAM Conference on Life Sciences
(July 11-14).
KEY DATES
=========
Submissions deadline: February 25, 2016
Notification: March 31, 2016
Preregistration and hotel deadline: June 13, 2016
SIAM NS'16: July 15-16, 2016
SUBMISSION
==========
Submission site: easychair.org/conferences/?conf=siamns2016
Latex style: siam.org/meetings/ns16/siam-wns-style.zip
We invite contributions focused on all aspects of mathematical,
algorithmic, and computational techniques in network science.
The workshop will feature three formats for contributed
presentations: 25-minute talks, 5-minute lightning talks in the
"Ignite" format (5 minutes, 20 slides, 15-second auto-advance),
and posters. The program committee will consider all
submissions for all three presentation formats.
Submit a 2-page abstract using the LaTeX style files provided
on the NS'16 web site through the SIAM NS'16 EasyChair site.
Accepted abstracts will be posted online in late May 2016;
authors will be required to submit LaTeX source adhering to
the template in April 2016.
IGNITE TALK FORMAT
==================
The Ignite format is new for NS'16; see www.ignitetalks.io
for a description. We especially want to use this format to
highlight work by early-career researchers. If you feel your
submission is particularly appropriate for an Ignite talk,
please let us know using the checkbox on the EasyChair
submission page.
ORGANIZATION
============
Workshop Co-Chairs:
John Gilbert, UC Santa Barbara
Blair D. Sullivan, NC State
Program Committee:
Ulrik Brandes, Konstanz
Bailey Fosdick, Colorado State
Assefaw Gebremedhin, Washington State
David Gleich, Purdue
Aric Hagberg, Los Alamos Lab
David Kempe, USC
Jeremy Kepner, MIT Lincoln Lab
Carl Kingsford, Carnegie Mellon
Christine Klymko, Lawrence Livermore Lab
Dan Larremore, Santa Fe Institute
Chris Long, US Department of Defense
Vince Lyzinski, Johns Hopkins
Aleksander Madry, MIT
Vahab Mirrokni, Google
Fabrizio Petrini, IBM
Cynthia Phillips, Sandia Labs
Lev Reyzin, UI Chicago
Johan Ugander, Stanford
Sebastiano Vigna, Milano
------------------------------
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 94, Issue 14
**************************************
No comments:
Post a Comment