Dokt-seminar-l

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

1 participants
222 discussions

Doct.seminar 8.3.
by Robert Samal 07 Mar '18

07 Mar '18

Dear all, tomorrow, we will have Karel Kral presenting paper Three conjectures in extremal spectral graph theory by Michael Tait and Josh Tobin. See you there, R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague

1 0

First doctoral seminar this term
by Robert Samal 21 Feb '18

21 Feb '18

Hey all, tomorrow, we will have first seminar of this term. Which means we will be distributing new papers and scheduling the talks. (We have quite a few new papers that didn't make it to the web page yet, so if you come, you will be more likely to get a paper you want :-) ) R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague

1 1

Fwd: Second Announcement: GRWC 2018 - Application Deadline Approaching
by Robert Samal 17 Jan '18

17 Jan '18

Hi everyone, the following is about an interesting summer school-workshop at Iowa State school. Last summer, Maso was there, so ask him for details and his opinion. My understanding is that it is a good opportunity. R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague -------- Original Message -------- Subject: Second Announcement: GRWC 2018 - Application Deadline Approaching Date: 2018-01-15 23:52 From: "Ferrara, Michael" <MICHAEL.FERRARA(a)UCDENVER.EDU> To: "Combinatorics.Workshop(a)gmail.com" <Combinatorics.Workshop(a)gmail.com> Dear Combinatorial Colleagues and GRWC Alums, I am writing today with a second announcement for the Rocky Mountain - Great Plains Graduate Workshop in Combinatorics (GRWC). This summer, the 5th GRWC will be held from MAY 20 - JUNE 2 at IOWA STATE UNIVERSITY, in Ames, IA. More information about the workshop can be found below, and also on the GRWC website www.combinatoricsworkshop.org [1] Applications are now open, and the deadline for full consideration is JANUARY 31, 2018. The application process is competitive, and we encourage applicants to spend a bit of time on their application statement, as this is an important part of the review process. Our current NSF funding will support travel and local expenses for 20 or more participants from U.S. institutions outside of the organizing schools. Once again this year, generous funding from The Combinatorics Foundation will also support a limited number of students and/or postdocs from international universities. If you would kindly forward this email and/or distribute the attached flier to any graduate students or postdocs that may be interested, that would be greatly appreciated. Also, for those of you who will be attending the JMM this year, we have organized a special session showcasing research from the 2016 and 2017 workshops. Held on Friday, January 12, the session will feature research presentations by 11 graduate students and postdocs. Many Thanks, Mike Ferrara University of Colorado Denver On behalf of the GRWC organizing committee ******************** [2]MORE INFORMATION ABOUT THE GRWC: The primary goal of the workshop is to help students and postdocs build a durable research network of peers from across the community that will support their research activity and productivity into their careers. Each summer, GRWC participants, including faculty from the organizing universities, work collaboratively on open problems that are proposed and presented by student participants. Thus far, research groups from 2014 - 2017 have completed 24 papers, with a number more in progress. Examples of problems presented at the GRWC can be found at https://sites.google.com/view/grwc/problem-garden?authuser=0 The 2017 problem garden will be posted early in 2018. While research collaborations are the central activity of the GRWC, each workshop also includes mentoring from faculty and other forms of professional development. In past years, these included panel discussions with PhD mathematicians working in industry, and workshops on preparing for the academic job hunt, selecting appropriate publication venues, and other topics. Links: ------ [1] http://www.combinatoricsworkshop.org [2] https://sites.google.com/site/rmgpgrwc/ -- __________ _______ |\ /| Jiří Fiala / ___ \ | \ / | Dept. of Applied Mathematics +420-95155-4322 \__/ _ \__/ | / \/ \ | Charles University fiala(a)kam.mff.cuni.cz | |_| | |/________\| Prague http://kam.mff.cuni.cz/~fiala \_______/

1 0

Doct. seminar 4.1.: Approximate Counting, the Lovász Local Lemma and Inference in Graphical Models
by Robert Samal 03 Jan '18

03 Jan '18

Dear all, tomorrow, we will have Jakub Pekárek presenting paper Approximate Counting, the Lovász Local Lemma and Inference in Graphical Models by Ankur Moitra. Happy new year! R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague

1 0

no seminar tomorrow
by Robert Samal 20 Dec '17

20 Dec '17

Dear all, our planned speaker for tomorrow is ill, so tomorrow's seminar is canceled. (There is an interesting noon seminar planned, though, highly recommended!) Enjoy your holiday, R -- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague

1 0

Doct. seminar 7. 12.: A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
by Martin Böhm 06 Dec '17

06 Dec '17

Dear colleagues, let me invite you to the next session of our doctoral seminar that will take place tomorrow (7. 12.) at 9:50 in S6. I will present a paper by Neil Olver and Laszló Végh titled A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. ( https://arxiv.org/abs/1611.01778 ) The paper presents a new strongly polynomial algorithm for generalized flow maximization. In generalized flow maximization, there are additional gain factors on edges, so that flow can actually multiplicatively change when going through an edge. Solving generalized flows in strongly polynomial time is an important progress towards showing that general LPs have strongly polynomial algorithms; this is due to the fact that we can use generalized flows to find a feasible solution to an LP of the form Ax=b, x>=0 with A having two arbritrary non-zero entries per column. The first strongly polynomial algorithm was given by Végh in 2016; the algorithm we will see is a substantial simplification of the first algorithm. The new algorithm also improves qualitatively on the previous one, with a running time bound of O( (m+n log n) mn log(n^2/m) ). --- Only basic knowledge of maximum flows will be assumed; everyone is welcome. Last but not least, I'll bring some tea, fruit and cookies at 9:45, so come in on time to get a mini-breakfast! See you all there, Martin Böhm

1 0

Doct. seminar 24. 5.: Rank-Pairing Heaps
by Jan Musílek 18 Oct '17

18 Oct '17

Dear colleagues, let me invite you to the last doctoral seminar of this semester on this Thursday at 9:50 in S6. Radek Hušek will present a paper: Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan: Rank-Pairing Heaps [1] With best regards, Honza [1] http://epubs.siam.org/doi/pdf/10.1137/100785351

2 1

Second doctoral seminar this term
by Robert Samal 11 Oct '17

11 Oct '17

Dear colleagues, let me remind you that the second doctoral seminar of the winter semester will take place this Thursday Oct 12 at 10:40 in S6. We will present newly proposed papers and create a preliminary schedule of the talks. The regular seminar will then take place as usual, every Thursday at 9:50 (note the earlier time) in S6. We are currently looking for volunteer speaker for Oct 26. If you are able to present at this date, please let me know. A selection of papers can also be found at http://kam.mff.cuni.cz/dokt_seminar/nabidka.html -- on tomorrow's seminar, however, you will hear a short exposition of some of them, and we will have (some of them) printed out. You will find the schedule and more information at http://kam.mff.cuni.cz/dokt_seminar/ Finally, all further announcements about the seminar will go only to the email address dokt-seminar-l(a)kam.mff.cuni.cz You can subscribe at https://kam.mff.cuni.cz/mailman/listinfo/dokt-seminar-l The usual content is one email per week announcing the next talk (and possibly mention prerequisities, if any). Best wishes, Robert Samal PS Apology to the few people I did not include in the last week's email. -- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague

1 0

First doctoral seminar this term
by Robert Samal 04 Oct '17

04 Oct '17

Hi everybody, this term we will have a somewhat unusual start of the semester. We will meet tomorrow (Oct 5, 10:40 in S6) but instead of a presentation by one of us or a presentation of new papers we will watch an interesting talk from the TCS+ series. For details of the series see https://sites.google.com/ site/plustcs/past-talks We will watch the talk on Reverse Minkowski theorem. But don't watch it ahead and in particular don't trick yourself to think that you will watch it later. Also the possibility to ask questions (to other participants, we won't be watching a live talk) is crucial. I hope this will be an optimistic start of the term that will inspire everybody to give a nice talk later. :-) Also, to the new grad students: welcome, I hope you will enjoy the seminar. Btw. I will hopefully join you during the talk, but can't promise the time -- I will be in the midst of discussing study reform of our bachelor program. Hopefully see you tomorrow, Robert -- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague

1 0

Fwd: Seminar at Ustav informatiky
by Robert Samal 05 Sep '17

05 Sep '17

Interesting seminar on extremal/random graph theory, graph limits, etc. Should occur somewhat regularly also during the semester, usually Friday at 10 (at CS institute of the Academy). Robert -- Robert Šámal IÚUK MFF UK -- CSI of Charles University in Prague ---------- Forwarded message ---------- From: Jan Hladky <honzahladky(a)gmail.com> Date: 1 September 2017 at 22:25 Subject: Seminar at Ustav informatiky To: Robert Samal <samal(a)iuuk.mff.cuni.cz>, hansraj(a)kam.mff.cuni.cz, Zdenek Dvorak <rakdver(a)iuuk.mff.cuni.cz> Hi Robert, Hans, Zdenek, this is just to let you know that there is a fairly regular seminar at the CS institute of the Czech Academy, with a focus on extremal/random/limit graph theory. http://uivty.cs.cas.cz/ExtrA/seminar.html Please, pass this message to anyone who you thought might be interested in being added to the mailing list. Best, Honza

1 0

← Newer
1
...
13
14
15
16
17
18
19
...
23
Older →

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

Dokt-seminar-l