Jonathan Narboni
Contact and current situationPh.D Student (third year)
Université de Bordeaux, LaBRI
351, cours de la Libération, CS 10004 F-33405
Talence Cedex - France
✉ jonathan.narboni@labri.fr
|
Bio
Research Interests
Current Situation
- PhD student
- Laboratoire Bordelais de Recherche en Informatique (UMR 5800) (LaBRI)
- Research Department: Combinatorics and Algorithms
- Team : Graphs and
Optimization
- CV (PDF)
PhD Subject
- Title: Homomorphisms, colorings and structural properties of graphs
- PhD Supervisor: Marthe Bonamy, František Kardoš and Éric Sopena
- Started in October 2019
Publications
Published
-
A note on deterministic zombies. (Bartier, V., Bénéteau, L., Bonamy, M., La, H., & Narboni, J. (2021). Discrete Applied Mathematics, 301, 65-68. arXiv).
-
On the 4-color theorem for signed graphs. (Kardoš, F., & Narboni, J. (2021). European Journal of Combinatorics, 91, 103215. arXiv).
-
A note on connected greedy edge colouring. (Bonamy, M., Groenland, C., Muller, C., Narboni, J., Pekárek, J., & Wesolek, A. (2021)). Discrete Applied Mathematics, 304, 129-136. arXiv).
Submited
-
On a recolouring version of Hadwiger's conjecture. (Bonamy, M., Heinrich, M., Legrand-Duchesne, C., & Narboni, J. (2021). arXiv preprint arXiv:2103.10684. arXiv).
-
On Vizing's edge colouring question. (Bonamy, M., Defrain, O., Klimošová, T., Lagoutte, A., & Narboni, J. (2021). arXiv preprint arXiv:2107.07900. arXiv).
-
Circular (4−ε)-coloring of some classes of signed graphs. (Kardoš, F., Narboni, J., Naserasr, R., & Wang, Z. (2021). arXiv preprint arXiv:2107.12126. arXiv).
Talks
-
Bratislava Graph Seminar (Decembre 2021, online)
On a recolouring version of Hadwiger's conjecture. , Bonamy, M., Heinrich, M., Legrand-Duchesne, C., & Narboni, J. -
Journées Graphes et Algorithmes (JGA) 2021 (October 2021, online)
Vizing’s edge-coloring conjecture holds. , Narboni, J. -
CanaDAM minisymposium on reconfiguration (May 2021, online)
On Vizing's edge colouring question , M. Bonamy, O. Defrain, T. Klimošová, A. Lagoutte, J. Narboni. -
Hosigra ANR anual meeting (May 2021, online)
Coloring signed graph with a given cyclomatic number , J. Bok, N. Jedlickova, E. Sopena, J. Narboni. -
Bratislava Graph Seminar (March 2021, online)
On Vizing's edge colouring question , M. Bonamy, O. Defrain, T. Klimosova, A. Lagoutte, J. Narboni. -
Journées Graphes et Algorithmes (JGA) 2020 (November 2020, online)
On the 4-color theorem for signed graphs , F. Kardoš, J. Narboni. -
Bordeaux Graph Seminar (November 2020, online)
On Vizing's edge colouring question , M. Bonamy, O. Defrain, T. Klimosova, A. Lagoutte, J. Narboni. -
Journées Graphes et Algorithmes (JGA) 2019 (Bruxelles, Belgique, November 13th-15th 2019)
On the 4-color theorem for signed graphs , F. Kardoš, J. Narboni. -
Bordeaux Graph Workshop (BGW) 2019 (Bordeaux, France, October 28th-31st 2019)
On the 4-color theorem for signed graphs , F. Kardoš, J. Narboni.
Research visits
- Tereza Klimošová, Univerzita Karlova, Prague (December 2019)
- Théo Pierron, Université de Lyon (July 2020)
Teaching
- 2021-2022: (Université de Bordeaux)
- 2021-2022: Advanced graph theory, (M2, 4h).
- 2019-2021: (ENSEIRB Engineering School)
- 2021-2022: Data structures and algorithms, (L3,∼20h).
- 2020-2022: Java programming, (M1,∼80h).
- 2019-2020: Introduction to Unix system, (L3,∼15h).
- 2019-2020: Operating system, (M2,∼15h).
- 2019-2020: C programming, (M1,∼35h).
- 2019-2020: Scheme programming, (M1,∼35h).
Other
- 2020-2022: Co-organizer of the weekly Bordeaux graph seminar.
- 2020-2021: Mentor in the LaBRI mentoring program.
- 2020-2021: President of the association of the computer science Ph.D students of Bordeaux.
- 2020: Member of the organizing committee of IWOCA.
Contact
- LaBRI, Université Bordeaux.
- 351, cours de la libération, 33405 TALENCE Cedex, FRANCE
- Tel.: (33) 5 40 00 84 19
- Office: 123
- Mail: jonathan.narboni AT labri.fr