Program
Tentative program of FraNORAC 2019 (subject to changes)
|
Thursday 19/09/2019
|
|
|
|
|
|
|
|
10:00–10:40
|
Fedor Fomin
|
Longest Path above guarantee
|
|
10:40–11:00
|
BREAK
|
|
|
11:00–11:25
|
Marin Bougeret
|
Width Parameterizations for Knot-free Vertex Deletion on Digraphs
|
|
11:25–11:50
|
Aniket Basu Roy
|
Approximating robust bin packing with budgeted uncertainty
|
|
11:50–12:15
|
Ignasi Sau
|
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
|
|
12:15–14:15
|
LUNCH
|
|
|
14:15-14:40
|
Michael Fellows
|
An Interesting Gap Between Upper and Lower Bounds in the Proliferation of Structural Width Metrics
|
|
14:40–15:05
|
Jan-Arne Telle
|
Width parameters of graphs and structured graph classes
|
|
15:05–15:30
|
Christophe Paul
|
A linear time algorithm for fixed connected pathwidth
|
|
15:30–15:55
|
Julien Baste
|
Composing dynamic programming tree-decomposition-based algorithms
|
|
15:55–16:20
|
BREAK
|
|
|
16:20–18:00
|
Open Problems
|
|
|
|
|
|
|
Friday 20/09/2019
|
|
|
|
|
|
|
|
10:15–10:40
|
Dieter Rautenbach
|
LP based approximation of induced matchings
|
|
10:40–11:00
|
BREAK
|
|
|
11:00–11:25
|
Rémy Belmonte
|
New Results on Directed Edge Dominating Set
|
|
11:25–11:50
|
Daniel Gonçalves
|
3-colorable planar graphs have an intersection segment representation using 3 slopes
|
|
11:50–12:15
|
Petr Golovach
|
On Parameterized Complexity of Graph Modification to First-Order Logic Properties
|
|
12:15–14:15
|
LUNCH
|
|
|
14:15-14:40
|
Stéphane Bessy
|
Triangle packing in (sparse) tournaments: approximation and kernelization
|
|
14:40–15:05
|
Olav Røthe Bakken
|
Graph Arrangement Problems Parameterized by Neighbourhood Diversity
|
|
15:05–15:30
|
Giannos Stamoulis
|
Vertex deletion to planar FOL is fixed parameter tractable
|
|
15:30–15:55
|
Kiril Simonov
|
Constructing Large k-cores in Low Degeneracy Graphs
|
|
Loading... 
