Hi all,
Just a reminder: this Thursday we will have next edition of "doktorandsky
seminar". As announced on https://kam.mff.cuni.cz/~dsemweb/, our speaker
will be
Tomáš Hons
and he will talk about paper
A. Björklund, T. Husfeldt, P. Kaski: The shortest even cycle problem is
tractable
https://dl.acm.org/doi/abs/10.1145/3519935.3520030
Time: Thursday 9:50-12:10
Place: S8
This paper from STOC 2022 will teach us how to efficiently find the
shortest even cycle
in a given digraph -- and we will use very interesting mathematics to do
this.
See you there,
R
--
Robert Šámal
IÚUK MFF UK -- CSI of Charles University
Hi all,
Just a reminder: this Thursday we will have next edition of "doktorandsky
seminar".
As we agreed last week, we will have
David Mikšaník
finishing presentation of the paper
A. Bernshteyn, A. Dhawan: Fast algorithms for Vizing's theorem on bounded
degree graphs
https://arxiv.org/abs/2303.05408
This presentation will be more or less independent of last week. We will
see the famous entropy-compression method in action: the same method that
is the base of algorithmic version of Lovasz local lemma. It won't be long,
thus we start at 10:40 to accomodate more people.
Time: Thursday 10:40-12:10
Place: S8
See you there,
R
--
Robert Šámal
IÚUK MFF UK -- CSI of Charles University
Hi all,
Just a reminder: this Thursday we will have next edition of "doktorandsky
seminar". As announced on https://kam.mff.cuni.cz/~dsemweb/, our speaker
will be
David Mikšaník
and he will talk about paper
A. Bernshteyn, A. Dhawan: Fast algorithms for Vizing's theorem on bounded
degree graphs
https://arxiv.org/abs/2303.05408
Time: Thursday 9:50-12:10
Place: S8
We will recall how Vizing's theorem is proved, see an efficient algorithm
for getting the coloring and an interesting technique to bound the
algorithm running time (so-called Entropy compression method).
See you there,
R
--
Robert Šámal
IÚUK MFF UK -- CSI of Charles University
Hi all,
Just a reminder: this Thursday we will have next edition of "doktorandsky
seminar". As announced on https://kam.mff.cuni.cz/~dsemweb/, our speaker
will be
Jan Soukup
and he will talk about paper
A. Suk: Short edges and noncrossing paths in complete topological graphs
https://arxiv.org/abs/2307.08165
*Regular place, time is the earlier one, i.e., 9:50 from now on! *
Time: Thursday 9:50-12:10
Place: S8
See you there,
R
--
Robert Šámal
IÚUK MFF UK -- CSI of Charles University