VC Dimension and a Union Theorem for Set Systems. - Stijn Cambie; António Girão; Ross J. Kang (Electron. J. Comb., 2019)

A Sauer-Shelah-Perles Lemma for Lattices. - Stijn Cambie; Bogdan Chornomaz; Zeev Dvir; Yuval Filmus; Shay Moran (Electron. J. Comb., 2020)

An asymptotic resolution of a problem of Plesník. - Stijn Cambie (J. Comb. Theory B, 2020)

Extremal Binary PFAs in a Černý Family. - Stijn Cambie; Michiel de Bondt; Henk Don (DLT, 2021)

Structure and Colour in Triangle-Free Graphs. - N. R. Aravind; Stijn Cambie; Wouter Cames van Batenburg; Rémi de Joannis de Verclos; Ross J. Kang; Viresh Patel (Electron. J. Comb., 2021)

Packing list-colourings. - Stijn Cambie; Wouter Cames van Batenburg; Ewan Davies; Ross J. Kang (CoRR, 2021)

Five results on maximizing topological indices in graphs. - Stijn Cambie (Discret. Math. Theor. Comput. Sci., 2021)

On the maximum mean subtree order of trees. - Stijn Cambie; Stephan Wagner 003; Hua Wang 003 (Eur. J. Comb., 2021)

Extremal total distance of graphs of given radius I. - Stijn Cambie (J. Graph Theory, 2021)

On the relationship between variable Wiener index and variable Szeged index. - Stijn Cambie; John Haslegrave (Appl. Math. Comput., 2022)

Maximizing Line Subgraphs of Diameter at Most t. - Stijn Cambie; Wouter Cames van Batenburg; Rémi de Joannis de Verclos; Ross J. Kang (SIAM J. Discret. Math., 2022)

A proof of Frankl's conjecture on cross-union families. - Stijn Cambie; Jaehoon Kim; Hong Liu 010; Tuan Tran (Comb. Theory, 2023)

Extremal Binary PFAs with Small Number of States. - Stijn Cambie; Michiel de Bondt; Henk Don (Int. J. Found. Comput. Sci., 2023)

Regular Turán numbers and some Gan-Loh-Sudakov-type problems. - Stijn Cambie; Rémi de Joannis de Verclos; Ross J. Kang (J. Graph Theory, 2023)

Maximum size of digraphs of given radius. - Stijn Cambie (Discret. Math., 2023)

Bounding Mean Orders of Sub-$k$-Trees of $k$-Trees. - Stijn Cambie; Bradley McCoy; Stephan G. Wagner; Corrine Yap (Electron. J. Comb., 2024)

The Minimum Number of Maximal Independent Sets in Twin-Free Graphs. - Stijn Cambie; Stephan G. Wagner (Electron. J. Comb., 2024)

Fractional list packing for layered graphs. - Stijn Cambie; Wouter Cames van Batenburg (CoRR, 2024)

Partitions of planar (oriented) graphs into a connected acyclic and an independent set. - Stijn Cambie; François Dross; Kolja Knauer; Hoang La; Petru Valicov (CoRR, 2024)

List packing number of bounded degree graphs. - Stijn Cambie; Wouter Cames van Batenburg; Ewan Davies; Ross J. Kang (Comb. Probab. Comput., 2024)

Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs. - Stijn Cambie (Discret. Appl. Math., 2024)

Bounds and monotonicity of critical set parameters of colourings. - Stijn Cambie (Discret. Math., 2024)

Extremal values of degree-based entropies of bipartite graphs. - Stijn Cambie; Yanni Dong; Matteo Mazzamurro (Inf. Sci., 2024)

A Precise Condition for Independent Transversals in Bipartite Covers. - Stijn Cambie; Penny Haxell; Ross J. Kang; Ronen Wdowinski (SIAM J. Discret. Math., 2024)

Many Hamiltonian subsets in large graphs with given density. - Stijn Cambie; Jun Gao 002; Hong Liu 010 (Comb. Probab. Comput., 2024)

Optimally reconfiguring list and correspondence colourings. - Stijn Cambie; Wouter Cames van Batenburg; Daniel W. Cranston (Eur. J. Comb., 2024)

When removing an independent set is optimal for reducing the chromatic number. - Stijn Cambie; John Haslegrave; Ross J. Kang (Eur. J. Comb., 2024)

Packing list-colorings. - Stijn Cambie; Wouter Cames van Batenburg; Ewan Davies; Ross J. Kang (Random Struct. Algorithms, 2024)

Decreasing the mean subtree order by adding k edges. - Stijn Cambie; Guantao Chen; Yanli Hao; Nizamettin Tokar (J. Graph Theory, 2024)

The Maximum Number of Connected Sets in Regular Graphs. - Stijn Cambie; Jorik Jooken; Jan Goedgebeur (Electron. J. Comb., 2025)

On edge-colouring-games by Erdős, and Bensmail and Mc Inerney. - Stijn Cambie; Michiel Provoost (CoRR, 2025)

Reconfiguration of List Colourings. - Stijn Cambie; Wouter Cames van Batenburg; Daniel W. Cranston; Jan van den Heuvel; Ross J. Kang (CoRR, 2025)

Towards the essence of Šoltés' problem. - Stijn Cambie (Appl. Math. Comput., 2026)