Colin Geniet

Orcid: 0000-0003-4034-7634

According to our database1, Colin Geniet authored at least 11 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Factoring Pattern-Free Permutations into Separable ones.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Maximum Independent Set when excluding an induced minor: K<sub>1</sub> + tK<sub>2</sub> and tC<sub>3</sub> ⊎ C<sub>4</sub>.
CoRR, 2023

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

First Order Logic and Twin-Width in Tournaments.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs.
CoRR, 2022

Twin-width VII: groups.
CoRR, 2022

2021
Twin-width II: small classes.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Twin-width III: Max Independent Set, Min Dominating Set, and Coloring.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Twin-width III: Max Independent Set and Coloring.
CoRR, 2020

2019
Big Step Normalisation for Type Theory.
Proceedings of the 25th International Conference on Types for Proofs and Programs, 2019


  Loading...