Jonathan Narboni

Contact and current situation

Post-Doctoral Researcher

Jagiellonian University, Krakau

ul. prof. S. Łojasiewicza 6, 30-348 Kraków

Room: 3014

✉ jonathan.narboni@uj.edu.pl

Bio

I am currently a post-doctoral researcher at the Theoretical Computer Science Department of Jagiellonian University, supervised by Bartosz Walzcak. My research interests primarily revolve around graph coloring, combinatorial reconfiguration, and geometric graph theory. My PhD was conducted at Labri (Université de Bordeaux), where I focused on graph coloring and graph coloring reconfiguration, with Marthe Bonamy, František Kardoš , and Éric Sopena as my supervisors.

Research Interests

Throughout my PhD, my primary research has been centered around graph coloring and graph coloring reconfiguration, with a particular emphasis on reconfiguration of edge coloring and vertex coloring in signed graphs. Currently, I am directing my attention towards combinatorial reconfiguration and geometric graphs.

Jonathan Narboni

Current Situation

Post-Doc in the "Colorings, Cliques and Independent Sets" project, supervised by Bartosz Walzcak
Department of Theoretical Computer Science, Jagiellonian University, Krakau (UJ)
CV (PDF)

PhD Subject

Title: Coloring and Recoloring
PhD Supervisor: Marthe Bonamy, František Kardoš and Éric Sopena
October 2019 - July 2022

Publications

Published

On Vizing's edge colouring question. (Bonamy, M., Defrain, O., Klimošová, T., Lagoutte, A., & Narboni, J. (2023).Journal of Combinatorial Theory, Series B, 159, 126-139.arXiv).
Lower bound for constant-size local certification. (Ardévol Martínez, V., Caoduro, M., Feuilloley, L., Narboni, J., Pournajafi, P., & Raymond, J. F. (2023).In Stabilization, Safety, and Security of Distributed Systems: 24th International Symposium, Proceedings (pp. 239-253).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).
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).

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).
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

Jagiellonian University TCS seminar (January 2023, Krakau, Poland)
Vizing's edge-recoloring conjecture holds.,Narboni, J.
ICGT (Internation Colloquium on Graph Theory and combinatorics) 2022 (July 2022, Montpellier, France)
Vizing's edge-recoloring conjecture holds.,Narboni, J.
Banff workshop on reconfiguration (May 2022, Banff, Canada)
Vizing's edge-recoloring conjecture holds.,Narboni, J.
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

Fréderic Havet, Université Nice-Côte d'Azur (February 2023)
Théo Pierron, Université de Lyon (July 2020)
Tereza Klimošová, Univerzita Karlova, Prague (December 2019)

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

2023: Co-organizer of the minisymposium on colorings at SICGT .
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

Jagiellonian University.
ul. prof. S. Łojasiewicza 6, 30-348 Kraków, Poland
Office: 3014
Mail: jonathan.narboni AT uj.edu.pl