Colin Geniet

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Twin-width. III: Max independent set, min dominating set, and coloring2026-05-12Paper
First order logic and twin-width in tournaments and dense oriented graphs
European Journal of Combinatorics
2026-01-29Paper
Transducing Linear Decompositions of Tournaments
(available as arXiv preprint)
2026-01-01Paper
Basis Number of Graphs Excluding Minors
(available as arXiv preprint)
2026-01-01Paper
Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
(available as arXiv preprint)
2026-01-01Paper
Variants of Merge-Width and Applications
(available as arXiv preprint)
2026-01-01Paper
Moderately beyond clique-width: reduced component max-leaf and related parameters
(available as arXiv preprint)
2026-01-01Paper
Reducing CMSO to Unbreakable Graphs Cannot be Computable
(available as arXiv preprint)
2026-01-01Paper
Maximum independent set when excluding an induced minor: K₁ + tK₂ and tC₃ C₄
Algorithmica
2025-12-30Paper
Maximum independent set when excluding an induced minor: K₁+tK₂ and tC₃ C₄2025-01-06Paper
First-order logic and twin-width in tournaments2025-01-06Paper
χ-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
(available as arXiv preprint)
2025-01-01Paper
Separability Properties of Monadically Dependent Graph Classes
(available as arXiv preprint)
2025-01-01Paper
First-Order Logic and Twin-Width for Some Geometric Graphs
(available as arXiv preprint)
2025-01-01Paper
Separability properties of monadically dependent graph classes2025-01-01Paper
Factoring pattern-free permutations into separable ones2024-11-28Paper
Twin-width. III: Max independent set, min dominating set, and coloring
SIAM Journal on Computing
2024-11-01Paper
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth2024-05-14Paper
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
Journal of Combinatorial Theory. Series B
2024-05-10Paper
Twin-width. II: Small classes2024-01-15Paper
Half-integral Erdős-Pósa property for non-null S-T paths
(available as arXiv preprint)
2024-01-01Paper
Big step normalisation for type theory2023-10-27Paper
Factoring Pattern-Free Permutations into Separable ones2023-08-05Paper
A tamed family of triangle-free graphs with unbounded chromatic number2023-04-09Paper
Maximum Independent Set when excluding an induced minor: K₁ + tK₂ and tC₃ \uplus C₄2023-02-16Paper
A tamed family of triangle-free graphs with unbounded chromatic number
(available as arXiv preprint)
2023-01-01Paper
Twin-width II: small classes
Combinatorial Theory
2022-11-23Paper
First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs2022-07-15Paper
Twin-width VII: groups2022-04-26Paper
Twin-width VII: groups
(available as arXiv preprint)
2022-01-01Paper
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring2020-07-28Paper


Research outcomes over time


This page was built for person: Colin Geniet