BEGIN:VCALENDAR
PRODID:-//Campus Event Calendar//EN
X-WR-CALNAME: Campus Event Calendar
X-WR-TIMEZONE:(UTC+01:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna
VERSION:2.0
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=3
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=10
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20170808T130000
DURATION:PT0H30M0S
UID:1EEF843D106C5F00C1258167002BF57F
DTSTAMP:20170724T100008
SUMMARY:Andreas Schmid (MPI-INF - D1) talks about "Computing Tutte Paths
"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Andreas Schmid
DESCRIPTION:Tutte paths are one of the most successful tools for attacki
ng Hamiltonicity \nproblems in planar graphs. Unfortunately\, results ba
sed on them are \nnon-constructive\, as their proofs inherently use an i
nduction on overlapping \nsubgraphs and these overlaps hinder to bound t
he running time to a polynomial.\n\nFor special cases however\, computat
ional results of Tutte paths are known: For \n4-connected planar graphs\
, Tutte paths are in fact Hamiltonian paths and Chiba \nand Nishizeki sh
owed how to compute such paths in linear time. For 3-connected \nplanar
graphs\, Tutte paths have a more complicated structure\, and it has only
\nrecently been shown that they can be computed in polynomial time.\n\n
However\, Tutte paths are defined for general 2-connected planar graphs
and this \nis what most applications need. Unfortunately\, no computatio
nal results are \nknown. We give the first efficient algorithm that comp
utes a Tutte path (for \nthe general case of 2-connected planar graphs).
One of the strongest existence \nresults about such Tutte paths is due
to Sanders\, which allows to prescribe the \nend vertices and an interme
diate edge of the desired path. Encompassing and \nstrengthening all pre
vious computational results on Tutte paths\, we show how to \ncompute th
is special Tutte path efficiently (in quadratic time). Our method \nrefi
nes both\, the results of Thomassen and Sanders\, and avoids overlapping
\nsubgraphs by using a novel iterative decomposition along 2-separators
.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20170808-1300-0
24
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20170810T130000
DURATION:PT0H30M0S
UID:94F7241B98C079B5C1258144004C0E8E
DTSTAMP:20170619T155044
SUMMARY:Krzysztof Fleszar (MPI-INF - D1) talks about "Maximum Disjoint P
aths: New Algorithms based on Tree-Likeness"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Antonios Antoniadis
DESCRIPTION:Maximum Edge Disjoint Paths is a classical NP-hard problem o
f finding a \nmaximum-size subset from a given set of k terminal pairs t
hat can be routed via \nedge-disjoint paths. One of the big open problem
s in approximation algorithms \nis to close the gap between the best kno
wn approximation upper and lower bound.\n\nIn this talk\, I introduce th
e problem and present new approximation algorithms \n(ESA 2016) that str
engthen best-known results. They provide new bounds \nformulated in term
s of the feedback vertex set number r of a graph\, which \nmeasures its
vertex deletion distance to a forest.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20170810-1300-0
24
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20170816T140000
DURATION:PT1H0M0S
UID:817E6C498021CD83C12581680033A61F
DTSTAMP:20170725T112408
SUMMARY:Andreas Herzig (CNRS, Univ. Toulouse) talks about "Dynamic logic
and propositional assignments"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:Talk [Public Audience]
CONTACT:Jennifer Müller\, Phone: 2900
DESCRIPTION:In this talk I present Dynamic Logic of Propositional \nAssi
gnments(DL-PA): an instance of Propositional Dynamic Logic whose \natomi
c programs are assignments of propositional variables. I will in \nparti
cular establish the relation with Quantified Boolean Formulas\, \ncoming
with complexity\, expressivity and succinctness results. I show \nhow s
everal popular knowledge representation formalisms can be captured \nin
DL-PA\, including update and revision operations and planning tasks \nan
d their modification.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20170816-1400-0
24
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20170817T140000
DURATION:PT1H30M0S
UID:1E105538CEE8CC76C125816700276D1A
DTSTAMP:20170724T091038
SUMMARY:Thomas Schneider (TU Darmstadt) talks about "Engineering Privacy
-Preserving Cryptographic Protocols"
LOCATION:Saarbrücken building E9 1, room Lecture Hall
CATEGORIES:CISPA Distinguished Lecture Series [Public Audience]
CONTACT:Sabine Nermerich\, Phone: 302-71911
DESCRIPTION:As today’s world gets more and more connected\, actors with
different and \npotentially conflicting interests want to interact in ma
ny application \nscenarios. Examples are citizens and governments (face
recognition)\, patients \nand health insurances (e-health services)\, or
companies (cloud computing). In \nthis context\, it is of foremost impo
rtance that the underlying IT systems and \nalgorithms can fulfill the d
iverse security and privacy requirements of the \ninvolved parties. In p
articular\, if sensitive (e.g.\, medical or personal) data \nis processe
d by not fully trusted service providers (e.g.\, "in the cloud")\, \nthi
s data should be protected against misuse. \nPrivacy-preserving cryptogr
aphic protocols allow to process such sensitive data \nunder encryption
in a provably secure way. In our work we design\, optimize and \nprototy
pically implement highly efficient privacy-preserving cryptographic \npr
otocols. Moreover\, we build tools to automatically generate such protoc
ols. \nIn this talk\, I give an overview on our past\, present\, and fut
ure research in \nthe area of engineering privacy-preserving cryptograph
ic protocols. We are \nworking in three main areas: In the first area we
consider highly efficient \nprotocols for specific functionalities such
as private set intersection for \nwhich current applications like Faceb
ook\, WhatsApp or Secret still use insecure \nsolutions. The second area
deals with generic protocols that can securely \nevaluate arbitrary fun
ctionalities where we show for example how to securely \nevaluate privat
e functions. The third area are collaborations with other \ndisciplines
such as a recent collaboration that shows how to benefit from \nexisting
hardware synthesis tools. In the future we are planning to improve \nse
curity and scalability of the protocols with the overall goal of enablin
g \nfurther real-world privacy-preserving applications.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20170817-1400-L
ectureHall
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20170818T110000
DURATION:PT1H30M0S
UID:E06B47DC6ED88B08C125816700272286
DTSTAMP:20170724T090727
SUMMARY:Martin Ochoa (Singapore University of Technology and Design) tal
ks about "Securing Cyber-Physical Systems: Challenges and the road ahead
"
LOCATION:Saarbrücken building E9 1, room Lecture Hall
CATEGORIES:CISPA Distinguished Lecture Series [Public Audience]
CONTACT:Sabine Nermerich\, Phone: 302-71911
DESCRIPTION:With the proliferation of highly connected "smart things"\,
such as home and \nindustrial automation systems\, there has been also a
corresponding rise in \nattacks and concerns regarding their security.
On the one hand\, many of these \nsystems were not designed with securit
y considerations in mind\, due to \nhistorical reasons (in the case of l
egacy Industrial Control Systems) and \nrush-to-market constraints (for
some Internet-of-Things devices). Moreover\, \nthere are other inherent
constraints that conflict with security\, such as \ncomputational limita
tions\, real-time deadlines and the difficulty to perform \ntraditional
testing and patching\, among others. In this talk we discuss some of \nt
hese challenges and report on recent results and work in progress being
\nperformed on realistic CPS testbeds (water\, smart-grid and IoT) at SU
TD. Such \nefforts include: authenticating communications and enforcing
memory safety in \nICS\, reasoning on integrity violating information fl
ows in CPS and building \nscalable highly-interactive honeypots.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20170818-1100-L
ectureHall
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20170829T130000
DURATION:PT0H30M0S
UID:952BE02D66C476CCC12581600024B4DE
DTSTAMP:20170717T084055
SUMMARY:Aruni Choudhary (MPI-INF - D1) talks about "Improved Approximate
Rips Filtrations with Shifted Integer Lattices"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Aruni Choudhary
DESCRIPTION:Rips complexes are important structures for analyzing topolo
gical features of \nmetric spaces. Unfortunately\, generating these comp
lexes constitutes an \nexpensive task\nbecause of a combinatorial explos
ion in the complex size. For $n$ points in \n$\mathbb{R}^d$\, we present
a scheme to construct a $3\sqrt{2}$-approximation of \nthe\nmulti-scale
filtration of the $L_\infty$-Rips complex\, which extends to a \n$O(d^{
0.25})$-approximation of the Rips filtration for the Euclidean case. The
\n$k$-skeleton of the resulting approximation has a total size of $n2^{
O(d\log \nk)}$. The scheme is based on the integer lattice and on the ba
rycentric \nsubdivision of the $d$-cube.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20170829-1300-0
24
END:VEVENT
END:VCALENDAR