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:20190617T130000
DURATION:PT0H30M0S
UID:A6F3A765FE855D42C12584160045B104
DTSTAMP:20190611T144113
SUMMARY:Stefano Leucci (MPI-INF - D1) talks about "Tracking Routes in
Communication Networks"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Nitin Saurabh
DESCRIPTION:The minimum tracking set problem is an optimization proble
m that deals with \nmonitoring communication paths that can be used fo
r exchanging point-to-point \nmessages using as few tracking devices a
s possible. More precisely, a tracking \nset of a given graph $G$ and
a set of source-destination pairs of vertices, is \na subset $T$ of ve
rtices of $G$ such that the vertices in $T$ traversed by any \nsource-
destination shortest path $P$ uniquely identify $P$.\nThe minimum trac
king set problem has been introduced in [Banik et al., CIAC \n2017] fo
r the case of a single source-destination pair.\nThere, the authors sh
ow that the problem is APX-hard and that it can be \n2-approximated fo
r the class of planar graphs, even though no hardness result \nis know
n for this case.\nIn this paper we focus on the case of multiple sourc
e-destination pairs and we \npresent the first $\widetilde{O}(\sqrt{n}
)$-approximation algorithm for general \ngraphs. Moreover, we prove th
at the problem remains NP-hard even for cubic \nplanar graphs and all
pairs $S \times D$, where $S$ and $D$ are the sets of \nsources and de
stinations, respectively.\nFinally, for the case of a single source-de
stination pair, we design an (exact) \nFPT algorithm w.r.t. the maximu
m number of vertices at the same distance from \nthe source.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190617-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190618T130000
DURATION:PT0H45M0S
UID:5ADE5EC256AF1BE1C12583E0002E9B11
DTSTAMP:20190418T102903
SUMMARY:Sandip Sinha (Columbia University) talks about "Local Decodabi
lity of the Burrows-Wheeler Transform"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Karl Bringmann
DESCRIPTION:The Burrows-Wheeler Transform (BWT) is a reversible prepro
cessing step that \nfacilitates significant compression of strings wit
h context, and is the basis \nof the bzip compression program. Alas, t
he decoding process of BWT is \ninherently sequential and requires \Om
ega(n) time even to retrieve a single \ncharacter. \n\nWe study the su
ccinct data structure problem of locally decoding short \nsubstrings o
f a given text under its compressed BWT, i.e., with small additive \nr
edundancy r over the Move-To-Front compression. The celebrated BWT-bas
ed \nFM-index yield a trade-off of r = O~(n/\sqrt{t}) bits, to decode
a single \ncharacter in O(t) time. We give a near-quadratic improvemen
t r = O~(n\lg(t)/t). \nAs a by-product, we obtain an exponential (in t
) improvement on the redundancy \nof the FM-index for counting pattern
-matches on compressed text. In the \ninteresting regime where the tex
t compresses to n^{1-o(1)} bits, these results \nprovide an exp(t) ove
rall space reduction. For the local decoding problem of \nBWT, we also
prove an \Omega(n/t^2) cell-probe lower bound for "symmetric" \ndata
structures.\n\nWe achieve our main result by designing a compressed p
artial-sums (Rank) data \nstructure over BWT. The key component is a l
ocally-decodable Move-to-Front \n(MTF) code: with only O(1) extra bits
per block of length n^{\Omega(1)}, the \ndecoding time of a single ch
aracter can be decreased from \Omega(n) to O(\lg \nn). This result is
of independent interest in algorithmic information theory.\n\nThis is
joint work with Omri Weinstein.\n\nNote: This talk will take 45min.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190618-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190619T113000
DURATION:PT0H20M0S
UID:0F9C7298F94A0E59C12583B500371E1E
DTSTAMP:20190306T110201
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190619-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190620T130000
DURATION:PT0H30M0S
UID:8DD9D7288E343316C125840E0042E6A9
DTSTAMP:20190603T141044
SUMMARY:Themis Gouleakis (MPI-INF - D1) talks about "Communication and
Memory Efficient Testing of Discrete Distributions"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Themistoklis Gouleakis
DESCRIPTION:This talk is about distribution testing with communication
and memory \nconstraints in the following computational models: (1) T
he one-pass streaming \nmodel where the goal is to minimize the sample
complexity of the protocol \nsubject to a memory constraint, and (2)
A distributed model where the data \nsamples reside at multiple machin
es and the goal is to minimize the \ncommunication cost of the protoco
l. In both these models, we provide efficient \nalgorithms for uniform
ity/identity testing (goodness of fit) and closeness \ntesting (two sa
mple testing). Moreover, we show nearly-tight lower bounds on \n(1) th
e sample complexity of any one-pass streaming tester for uniformity, \
nsubject to the memory constraint, and (2) the communication cost of a
ny \nuniformity testing protocol, in a restricted "one-pass" model of
communication.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190620-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190624T113000
DURATION:PT0H45M0S
UID:9C4D8F63F27C6B35C125841200442DA8
DTSTAMP:20190607T142441
SUMMARY:Khaled Elbassioni (Khalifa University, UAE (former group membe
r in D1)) talks about "Some Black-box Reductions for Cost-robust Discr
ete Optimization Problems"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Kurt Mehlhorn
DESCRIPTION:Title: Some Black-box Reductions for Cost-robust Discrete
Optimization Problems\n\nAbstract: Standard optimization algorithms a
ssume precise knowledge of their \ninputs, and find optimal or near-op
timal solutions under this assumption. \nHowever, in real-life applica
tions, the input data may be known up to a \nlimited precision with e
rrors introduced possibly due to inaccuracy in \nmeasurements or lack
of exact information about the precise value of the input \nparameters
. Clearly, an optimization algorithm designed based on such distorted
\ndata to optimize a certain objective function would not yield reliab
le results, \nif no special consideration of such uncertainty is taken
. One of the basic \napproaches to deal with uncertainty in data is ro
bust optimization, where some \n(deterministic) assumption is made on
the uncertain parameters, and the \nobjective is to optimize over the
worst-case these parameters can assume.\n\nIn this talk, we consider r
obust discrete optimization problems with cost \nuncertainty defined b
y a convex set. Assuming the existence of an integrality \ngap verifi
er with a bounded approximation guarantee for the LP relaxation of \n
the non-robust version of the problem, we derive approximation algorit
hms for \nthe robust version under different types of uncertainty, inc
luding polyhedral \nand ellipsoidal uncertainty
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190624-1130
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190624T130000
DURATION:PT0H30M0S
UID:16A313C4B02C92A4C12584160045E39D
DTSTAMP:20190611T144322
SUMMARY:Mirko (MPI-INF - D1) talks about "TBA"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Nitin Saurabh
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190624-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190624T130000
DURATION:PT0H30M0S
UID:C3B8390FFAA8F591C1258416004603D0
DTSTAMP:20190611T144444
SUMMARY:Mirko (MPI-INF - D1) talks about "TBA"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Nitin Saurabh
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190624-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190625T130000
DURATION:PT0H30M0S
UID:11C2AA24C34B7A45C12583C2003675D5
DTSTAMP:20190319T105451
SUMMARY:Pieter Kleer (CWI, Amsterdam) talks about "The switch Markov c
hain for sampling graphs with given degrees"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Nitin Saurabh
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190625-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190627T130000
DURATION:PT0H30M0S
UID:45C5438658AB4A9CC125840E002E06DE
DTSTAMP:20190603T102244
SUMMARY:Guy Even (Tel Aviv University) talks about "to be announced"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Kurt Mehlhorn
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190627-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190702T130000
DURATION:PT0H30M0S
UID:3321FC3E29F3F1EDC1258416004CE812
DTSTAMP:20190611T160001
SUMMARY:Maximilian John (MPI-INF - D1) talks about "Dynamic Sparsifica
tion for Quadratic Assignment Problems"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Maximilian John
DESCRIPTION:We present a framework for optimizing sparse quadratic ass
ignment problems.\nWe propose an iterative algorithm that dynamically
generates the quadratic part \nof the assignment problem and, thus, so
lves a sparsified linearization of the \noriginal problem in every ite
ration.\nThis procedure results in a hierarchy of lower bounds and, in
addition, \nprovides heuristic primal solutions in every iteration.\n
This framework was motivated by the task of the French government to d
esign the \nFrench keyboard standard, which included solving sparse qu
adratic assignment \nproblems with over $100$ special characters; a si
ze where many commonly used \napproaches fail.\nThe design of a new st
andard\noften involves conflicting opinions of multiple stakeholders i
n a committee.\nHence, there is no agreement on a single well-defined
objective function that \ncan be used for an extensive one-shot optimi
zation.\nInstead, the process is highly interactive and demands rapid
prototyping, e.g., \nquick primal solutions, on-the-fly evaluation of
manual changes, and prompt \nassessments of solution quality. \nPartic
ularly concerning the latter aspect, our algorithm is able to provide
\nhigh-quality lower bounds for these problems in several minutes.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190702-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190703T113000
DURATION:PT0H20M0S
UID:6AF46C7E0DB4AA08C12583B500373CF8
DTSTAMP:20190306T110320
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190703-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190703T121500
DURATION:PT1H0M0S
UID:C8DE60ECAFC1F4D2C12583AE004A1406
DTSTAMP:20190227T142907
SUMMARY:Mario Fritz (CISPA) talks about "The Bright and Dark Sides of
Computer Vision: Challenges and Opportunities for Privacy and Security
"
LOCATION:Saarbrücken building E1 5, room 002
CATEGORIES:Joint Lecture Series [Public Audience]
CONTACT:Jennifer Müller\, Phone: 2900
DESCRIPTION: -
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190703-1215
-002
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190704T130000
DURATION:PT0H30M0S
UID:586E38EF6A76C7F6C12583C40058C4A3
DTSTAMP:20190321T170935
SUMMARY:Bundit Laekhanukit (MPI-INF - D1) talks about "An O(log^2{k}/l
og log {k})-Approximation Algorithm for Directed Steiner Tree: A Tight
Quasi-Polynomial-Time Algorithm"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Antonios Antoniadis
DESCRIPTION:In the Directed Steiner Tree (DST) problem we are given an
n-vertex directed \nedge-weighted graph, a root r, and a collection o
f k terminal\nnodes. Our goal is to find a minimum-cost arborescence t
hat contains a directed \npath from r to every terminal. We present an
O(log^2 k/log \nlog{k})-approximation algorithm for DST that runs in
quasi-polynomial-time. By \nadjusting the parameters in the hardness r
esult of Halperin and Krauthgamer \n[STOC'03], we show the matching lo
wer bound of Omega(log^2{k}/log log{k}) for \nthe class of quasi-polyn
omial-time algorithms. This is the first improvement on \nthe DST prob
lem since the classical quasi-polynomial-time O(log^3 k) \napproximati
on algorithm by Charikar et al. [SODA'98; J. Algorithms'99] (The \npap
er erroneously claims an O(log^2k) approximation due to a mistake in p
rior \nwork.) Our approach is based on two main ingredients.\n\nFirst,
we derive an approximation preserving reduction to the Label-Consiste
nt \nSubtree (LCST) problem. The LCST instance has quasi-polynomial si
ze and \nlogarithmic height. We remark that, in contrast, Zelikovsky's
heigh-reduction \ntheorem used in all prior work on DST achieves a r
eduction to a tree instance \nof the related Group Steiner Tree (GST)
problem of similar height, however \nlosing a logarithmic factor in th
e approximation ratio. Our second ingredient \nis an LP-rounding algor
ithm to approximately solve LCST instances, which is \ninspired by the
framework developed by Rothvoss [Preprint, 2011]. We consider a \nShe
rali-Adams lifting of a proper LP relaxation of LCST. Our rounding alg
orithm \nproceeds level by level from the root to the leaves, rounding
and conditioning \neach time on a proper subset of label variables. A
small enough (namely, \npolylogarithmic) number of Sherali-Adams lift
ing levels is sufficient to \ncondition up to the leaves.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190704-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190708T103000
DURATION:PT1H0M0S
UID:5D7BDA3FD7B0C293C12583FC00504810
DTSTAMP:20190516T163653
SUMMARY:Abhik Roychoudhury (National University of Singapore) talks ab
out "Automated Program Repair"
LOCATION:Kaiserslautern building G26, room 111 / simultaneous videocas
t to Saarbrücken building E1 5, room 029 / Meeting ID: 6312
CATEGORIES:SWS Distinguished Lecture Series [AG Audience]
CONTACT:Mouna Litz
DESCRIPTION:Automated program repair is an emerging and exciting field
of research, which \nallows for automated rectification of errors and
vulnerabilities. The use of \nautomated program repair can be myriad,
such as (a) improving programmer \nproductivity (b) automated fixing
of security vulnerabilities as they are \ndetected, (c) self-healing s
oftware for autonomous devices such as drones, as \nwell as (d) use of
repair in introductory programming education by grading and \nprovidi
ng hints for programming assignments. One of the key technical \nchall
enges in achieving automated program repair, is the lack of formal \ns
pecifications of intended program behavior. In this talk, we will \nco
nceptualize the use of symbolic execution approaches and tools for ext
racting \nsuch specifications. This is done by analyzing a buggy progr
am against selected \ntests, or against reference implementations. Suc
h specification inference \ncapability can be combined with program sy
nthesis techniques to automatically \nrepair programs. The capability
of specification inference also serves a novel \nuse of symbolic execu
tion beyond verification and navigation of large search \nspaces. Auto
mated program repair via symbolic execution goes beyond \nsearch-based
approaches which attempt to lift patches from elsewhere in the \nprog
ram. Such an approach can construct "imaginative" patches, serves as a
\ntest-bed for the grand- challenge of automated programming, and con
tributes to \nthe vision of trustworthy self-healing software. Towards
the end of the talk, \nwe can put the research on automated repair in
light of the overall practice of \nsoftware security, by sharing some
experiences gained at the Singapore \nCyber-security Consortium.\n
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190708-1030
-111
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190717T113000
DURATION:PT0H20M0S
UID:685BA7BA3CF550BAC12584100043A94B
DTSTAMP:20190605T141902
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190717-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190807T113000
DURATION:PT0H20M0S
UID:F829EAF35D610A2DC12584100043CB94
DTSTAMP:20190605T142030
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190807-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190821T113000
DURATION:PT0H20M0S
UID:A2945A1CD7D5BEF0C12584100043D647
DTSTAMP:20190605T142057
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190821-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190904T113000
DURATION:PT0H20M0S
UID:3D987868A5F82F48C12584100043E01F
DTSTAMP:20190605T142122
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190904-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190918T113000
DURATION:PT0H20M0S
UID:DE0AB08DEBD1544DC12584100043E8E2
DTSTAMP:20190605T142145
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20190918-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20191002T113000
DURATION:PT0H20M0S
UID:574187EAD7514C66C12584100043F1DF
DTSTAMP:20190605T142208
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20191002-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20191016T113000
DURATION:PT0H20M0S
UID:972FBA2F07F59E25C12584100043F820
DTSTAMP:20190605T142224
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20191016-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20191106T113000
DURATION:PT0H20M0S
UID:DBB07E01D4F4849FC12584100043FE17
DTSTAMP:20190605T142239
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20191106-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20191204T113000
DURATION:PT0H20M0S
UID:ADB896FB2C9B414AC1258410004403BB
DTSTAMP:20190605T142254
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20191204-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20191218T113000
DURATION:PT0H20M0S
UID:CC5BB28861FB7868C125841000440857
DTSTAMP:20190605T142305
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "D1 Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Ben Wiederhake
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20191218-1130
-333
END:VEVENT
END:VCALENDAR