Dokt-seminar-l

dokt-seminar-l@kam.mff.cuni.cz

1 participants
221 discussions

Dinner of the graduate students' reading seminar: tomorrow (Thu) at 7pm
by Robert Samal 11 Jan '24

11 Jan '24

Dear Participants of the graduate students' reading seminar, As agreed on the previous two seminars, we go jointly for a dinner tomorrow (Thursday 11th) at 7pm to the restaurant Lehka hlava (Clear Head) https://www.lehkahlava.cz/en/contact/ Please send us a short email if you plan to join. We have no funds for paying for the dinner, so everybody pays for herself/himself. Looking forward to see you there (and still before it, on the seminar tomorrow), Robert and Pavel -- Robert Šámal IÚUK MFF UK -- CSI of Charles University

2 1

Fwd: navrh: KAMAK progress report tomorrow Thu 10-12; hybrid form: S8 & zoom
by Robert Samal 11 Jan '24

11 Jan '24

Dear KAMAK 2023 Participants, dear grad.student seminar participants, As proposed earlier, tomorrow -- Thursday January 11, 10:00-12:00, we have a KAMAK progress report. It is in a HYBRID form. Either you can come to the lecture room S8 in Prague, or you can join via zoom: https://cesnet.zoom.us/j/97472038049?pwd=VmpRRnpuSVBjL3VCcGNDQkg3MVBzdz09 Meeting ID: 974 7203 8049 Passcode: 743226 We hope that each group will be ready to repeat the problem and share (partial) results and/or existing open questions with others. Please make sure that also people not familiar with the problem can understand what you are speaking about. If your group manages to send us an estimate of time length for you presentation before the meeting, we will be happy. We stress that all our graduate students are welcome to attend, even if they did not take part in last year KAMAK. See you tomorrow (in person or via zoom), Robert and Pavel

2 1

graduate students' reading seminar (Thu 9:50, Petr Chmel: Complexity of explicit constructions)
by Robert Samal 02 Jan '24

02 Jan '24

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 Petr Chmel and he will talk about paper The Hardest Explicit Construction by Oliver Korten https://ieeexplore.ieee.org/document/9719750 https://arxiv.org/abs/2106.00875 Time: Thursday 9:50-12:10 Place: S8 Probabilistic method is a common technique to show the existence of interesting combinatorial objects by counting. Often, even in cases when we can compute that a majority of objects of certain type have a desirable property, it is still hard to explicitly construct one such object. This is the purpose of this paper, presented at FOCS'21. It uses methods of complexity, logic, randomness, etc. So, it will hopefully be interesting for everybody. See you there, R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University

1 0

graduate students' reading seminar -- no talk this week
by Robert Samal 19 Dec '23

19 Dec '23

Hi all, Just a reminder, there is no talk scheduled for this week. In January we will have two more seminars before the exam period -- Petr Chmel with an interesting complexity paper and progress report from Kamak (you should come even if you did not attend Kamak, if only to find out what you have missed!). Enjoy your Christmas break and Happy New Year. R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University

1 0

graduate students' reading seminar (Thu 9:50, Gaurav Kucheriya: Graph tiling)
by Robert Samal 11 Dec '23

11 Dec '23

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 Gaurav Kucheriya and he will talk about paper Tiling edge-ordered graphs with monotone paths and other structures by I. Araujo, S. Piga, A. Treglown, Z. Xiang https://arxiv.org/pdf/2305.07294.pdf Time: Thursday 9:50-12:10 Place: S8 You may have had a chance to hear a short presentation on this at Eurocomb; Gaurav will present us with a much more thorough look at the paper. See you there, R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University

1 0

graduate students' reading seminar -- NOT THIS WEEK
by Robert Samal 04 Dec '23

04 Dec '23

Hi all, This week we don't have the seminar. Instead, I hope to meet many of you at the Homonolo workshop. Best wishes, R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University

1 0

graduate students' reading seminar (Thu 9:50, Tomáš Hons: Finding Even cycle)
by Robert Samal 27 Nov '23

27 Nov '23

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

1 0

graduate students' reading seminar (Thu 10:40, David Mikšaník: Entropy compression)
by Robert Samal 21 Nov '23

21 Nov '23

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

1 0

graduate students' reading seminar (Thu 9:50, David Mikšaník: Fast Vizing)
by Robert Samal 14 Nov '23

14 Nov '23

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

1 0

graduate students' reading seminar (Thu 9:50, Jan Soukup -- Short edges and noncrossing paths in complete topological graphs)
by Robert Samal 06 Nov '23

06 Nov '23

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

1 0

← Newer
1
2
3
4
5
6
7
8
...
23
Older →

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

Dokt-seminar-l