Julien Baste

Julien Baste

I currently have a one year position as an assistant professor.

Research interests : graph theory, parameterized complexity, graph modification, treewidth, planar graphs
Affiliation : ARP, LIP6, UPMC
Email : julien.baste [at] lip6 [dot] fr

Teaching

Publications

Talks

Events

Internships

Training

Teaching

Year University UE code UE level
2017/2018 Université Pierre et Marie Curie - UPMC (Paris 6) 4I505 Conception et Pratique de l'Algorithmique M1 28H TME
4I900 Complexité, Algorithmes Randomisés et Approchés M1 20H TME
3I014 Réseaux L3 38,5H TD
2I0I1 Orientation et Insertion Professionnelle L2 44H TD Page du cours
2016/2017 Université de Montpellier HLIN102 Du binaire au web L1 24H TP, 15H TD
HLSE305 C2I APESS 18H TP
HLIN101 Introduction à l'algorithmique et à la programmation L1 4H TD
2015/2016 Université de Montpellier HLIN102 Du binaire au web L1 22H TP, 14H TD
HLSE305 C2I L2 33H TP
2014/2015 Université de Montpellier HLIN202 Programmation avancée L1 18H TP
HLIN101 Introduction à l'algorithmique et à la programmation L1 24H TP, 27H TD

Publications

  1. Contraction-Bidimensionality of geometric intersection graphs
    Julien Baste and Dimitrios Thilikos.

  2. Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
    Julien Baste, Ignasi Sau, and Dimitrios Thilikos.

  3. Ruling out FPT algorithms for Weighted Coloring on forests
    Julien Baste, Júlio Araújo, and Ignasi Sau.

  4. Parameterized complexity of finding a spanning tree with minimum reload cost diameter
    Julien Baste, Didem Gözüpek, Christophe Paul, Mordechai Shalom, Ignasi Sau, and Dimitrios M. Thilikos.

  5. Degenerate Matchings and Edge Colorings
    Julien Baste and Dieter Rautenbach.

  6. Uniquely restricted matchings and edge colorings
    Julien Baste, Dieter Rautenbach, and Ignasi Sau.

  7. On the number of labeled graphs of bounded treewidth
    Julien Baste, Marc Noy, and Ignasi Sau.

  8. Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees
    Julien Baste, Christophe Paul, Ignasi Sau, and Celine Scornavacca.

  9. On the Parameterized Complexity of the Edge Monitoring problem
    Julien Baste, Fairouz Beggas, Hamamache Kheddouci, and Ignasi Sau.

  10. Parameterized complexity dichotomy for (r,l)-Vertex Deletion
    Julien Baste, Luerbio Faria, Sulamita Klein, and Ignasi Sau.

  11. The role of planarity in connectivity problems parametrized by treewidth
    Julien Baste and Ignasi Sau.

Talks

Events

Year Event Place Date
2017 Recent Advances ​in Parameterized Complexity ​Tel Aviv, Israel December 3rd - December 7th
ALGO2017 Vienna, Austria September 4th - September 8th
PCSS2017 Vienna, Austria September 1st - September 3rd
WG2017 Eindhoven, The Netherlands June 21st - June 23rd
Research meeting Ulm, Germany January 30th - February 3rd
2016 Research meeting Fortaleza, Brazil November 21st - December 9th
JGA2016 Paris, France November 16th - November 18th
AAIM2016 Bergamo, Italy July 18th - July 20th
Research meeting Istanbul, Turkey June 26 - July 1st
ÉPIT2016 Marseille, France May 9th - May 13rd
2015 JGA2015 Orléans, France November 4th - November 6th
GROW 2015 Aussois, France October 11th - October 15th
Research meeting Lyon, France July 7th - July 9th
SGT2015 Porquerolles, France May 18th - May 22nd
Research meeting Barcelona, Spain May 2nd - May 8th
15èmes JCALM Sophia-Antipolis, France March 10th - March 11th
International Workshop on Graph Decomposition CIRM, Marseille, France January 19th - January 23rd
2014 JGA 2014 Dijon, France November 12th - November 14th
IPEC'14 Wroclaw, Poland September 10th - September 12th

Some Internships

Training