Charlier, E., Puzynina, S., & Vandomme, E. (2020). Recurrence along directions in multidimensional words. Discrete Mathematics, 343, 23. doi:10.1016/j.disc.2020.112006 |
Vandomme, E. (June 2018). Fully leafed induced subtrees [Paper presentation]. Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, France. |
Vandomme, E. (May 2018). Maximal number of leaves in induced subtrees [Paper presentation]. Optimization Days, Montreal, Canada. |
Blin, G., Blondin Massé, A., Gasparoux, M., Hamel, S., & Vandomme, E. (2018). Nearest constrained circular words. Leibniz International Proceedings in Informatics, 105 (6), 1-14. doi:10.4230/LIPIcs.CPM.2018.6 |
Blondin Massé, A., De Carufel, J., Goupil, A., Lapointe, M., Nadeau, É., & Vandomme, E. (2018). Leaf realization problem, caterpillar graphs and prefix normal words. Theoretical Computer Science, 732, 1-13. doi:10.1016/j.tcs.2018.04.019 |
Blondin Massé, A., De Carufel, J., Goupil, A., Lapointe, M., Nadeau, É., & Vandomme, E. (2018). Fully leafed induced subtrees. Lecture Notes in Computer Science, 10979. doi:10.1007/978-3-319-94667-2_8 |
Vandomme, E. (13 May 2017). How to count leaves in the trees from Tetris? [Paper presentation]. Quebec Colloquium of the Mathematical Sciences Institute (ISM) students, Trois-Rivières, Canada. |
Vandomme, E. (25 April 2017). On a conjecture about regularity and l-abelian complexity [Paper presentation]. School on bridges between Automatic Sequences, Algebra and Number Theory, Montréal, Canada. |
Vandomme, E. (07 April 2017). Covering codes [Paper presentation]. Combinatorics on Words and Tilings Workshop, Montréal, Canada. |
Vandomme, E. (19 January 2017). Sous-arbres induits pleinement feuillus [Paper presentation]. Séminaire de Mathématiques Discrètes de l'Université de Liège, Liège, Belgium. |
Vandomme, E., & Gravier, S. (2017). Constant 2-labellings and an application to (r,a,b)-covering codes. Discussiones Mathematicae. Graph Theory, 37 (4), 891-918. doi:10.7151/dmgt.1973 |
Vandomme, E. (2016). Mathémagie - L'art de la divination [Paper presentation]. Exposé Maths à Modeler, Neufchâteau, Belgium. |
Gravier, S., Parreau, A., Rottey, S., Storme, L., & Vandomme, E. (October 2015). Identifying codes in vertex-transitive graphs and strongly regular graphs. Electronic Journal of Combinatorics, 22 (4), 4.6. doi:10.37236/5256 |
Vandomme, E. (2015). Contributions to combinatorics on words in an abelian context and covering problems in graphs [Doctoral thesis, ULiège - Université de Liège]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/176364 |
Parreau, A., Rigo, M., Rowland, E., & Vandomme, E. (2015). A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences. Electronic Journal of Combinatorics, 22 (1), 1.27. |
Parreau, A., Rigo, M., Rowland, E., & Vandomme, E. (September 2014). A new approach to the 2-regularity of the ℓ-abelian complexity of 2-automatic sequences (extended abstract) [Paper presentation]. Journées montoises d'informatique théorique, Nancy, France. |
Gravier, S., Parreau, A., Rottey, S., Storme, L., & Vandomme, E. (July 2014). Identifying codes in vertex-transitive graphs [Paper presentation]. 9th International colloquium on graph theory and combinatorics (ICGT 2014), Grenoble, France. |
Vandomme, E. (2014). Comment sauver sa maison des flammes ? [Paper presentation]. Ma thèse en 180 secondes, Université de Liège, Liège, Belgium. |
Rigo, M., Parreau, A., & Vandomme, E. (20 January 2014). A conjecture on the 2-abelian complexity of the Thue-Morse word [Paper presentation]. Representing Streams II, Leiden, Netherlands. |
Vandomme, E., Gravier, S., & Parreau, A. (09 September 2013). Linear formulation of identifying codes in graphs [Poster presentation]. Fourth PhD-Day of the Belgian Mathematical Society, Bruxelles, Belgium. |
Rigo, M., Salimov, P., & Vandomme, E. (2013). Some properties of abelian return words. Journal of Integer Sequences, 16, 13.2.5. |
Rigo, M., & Vandomme, E. (14 December 2012). 2-abelian complexity of the Thue-Morse sequence [Paper presentation]. Representing Streams, Leiden, Netherlands. |
Gravier, S., & Vandomme, E. (November 2012). Constant 2-labelling of weighted cycles [Paper presentation]. Bordeaux Graph Workshop, Bordeaux, France. |
Rigo, M., Salimov, P., & Vandomme, E. (11 September 2012). Some properties of abelian return words (long abstract) [Paper presentation]. Journées montoises d'informatique théorique. |
Gravier, S., & Vandomme, E. (September 2012). Constant 2-labelling of a graph [Paper presentation]. Journées montoises d'informatique théorique, Louvain-la-Neuve, Belgium. |
Vandomme, E., & Gravier, S. (23 May 2012). Coloring of the infinite grid [Poster presentation]. School on Combinatorics, Automata and Number Theory, CIRM Marseille, France. |
Lacroix, A., Rampersad, N., Rigo, M., & Vandomme, E. (2012). Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure. Fundamenta Informaticae, 116, 175-187. doi:10.3233/FI-2012-677 |
Vandomme, E. (March 2011). Complexité syntaxique d’ensembles d’entiers ultimement périodique [Paper presentation]. École Jeunes Chercheurs en Informatique Mathématique, Amiens, France. |
Vandomme, E. (2010). Problème de décision pour les ensembles ultimement périodiques dans un système de numération non-standard [Master’s dissertation, ULiège - Université de Liège]. ORBi-University of Liège. https://orbi.uliege.be/handle/2268/211863 |