Colin Geniet

Orcid: 0000-0003-4034-7634

According to our database¹, Colin Geniet authored at least 23 papers between 2019 and 2026.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Bibliography

2026

Moderately beyond clique-width: reduced component max-leaf and related parameters.

[BibT_eX]

[DOI]

CoRR, April, 2026

Variants of Merge-Width and Applications.

[BibT_eX]

[DOI]

CoRR, February, 2026

Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions.

[BibT_eX]

[DOI]

Colin Geniet

Aliénor Goubault-Larrecq

Kévin Perrot

CoRR, February, 2026

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications.

[BibT_eX]

[DOI]

CoRR, February, 2026

Maximum Independent Set when Excluding an Induced Minor: K1 + tK2 and $tC_3 \uplus C_4$.

[BibT_eX]

[DOI]

Algorithmica, February, 2026

Basis Number of Graphs Excluding Minors.

[BibT_eX]

[DOI]

Colin Geniet

Ugo Giocanti

CoRR, January, 2026

Transducing Linear Decompositions of Tournaments.

[BibT_eX]

[DOI]

Colin Geniet

Fatemeh Ghasemi

Mamadou Moustapha Kanté

CoRR, January, 2026

First order logic and twin-width in tournaments and dense oriented graphs.

[BibT_eX]

[DOI]

Colin Geniet

Stéphan Thomassé

Eur. J. Comb., 2026

First-Order Logic and Twin-Width for Some Geometric Graphs.

[BibT_eX]

[DOI]

Colin Geniet

Gunwoo Kim

Lucas Meijer

Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025

χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs.

[BibT_eX]

[DOI]

Marthe Bonamy

Colin Geniet

CoRR, April, 2025

Separability Properties of Monadically Dependent Graph Classes.

[BibT_eX]

[DOI]

Édouard Bonnet

Samuel Braunfeld

Ioannis Eleftheriadis

Colin Geniet

Nikolas Mählmann

Michal Pilipczuk

Wojciech Przybyszewski

Szymon Torunczyk

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Twin-Width, logical and combinatorial characterisations. (Twin-width : Caractérisations logiques et combinatoires).

[BibT_eX]

[DOI]

Colin Geniet

PhD thesis, 2024

Half-integral Erdös-Pósa property for non-null S-T paths.

[BibT_eX]

[DOI]

CoRR, 2024

Factoring Pattern-Free Permutations into Separable ones.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Maximum Independent Set when excluding an induced minor: K1 + tK2 and tC3 ⊎ C4.

[BibT_eX]

[DOI]

CoRR, 2023

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

First Order Logic and Twin-Width in Tournaments.

[BibT_eX]

[DOI]

Colin Geniet

Stéphan Thomassé

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Twin-width VII: groups.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Twin-width II: small classes.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Twin-width III: Max Independent Set, Min Dominating Set, and Coloring.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Twin-width III: Max Independent Set and Coloring.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Big Step Normalisation for Type Theory.

[BibT_eX]

[DOI]

Thorsten Altenkirch

Colin Geniet

Proceedings of the 25th International Conference on Types for Proofs and Programs, 2019

Colin Geniet

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...