Skip to Main content Skip to Navigation

lirmm-01347424v1  Journal articles
Guillaume GuéganPascal Ochem. A short proof that shuffle squares are 7-avoidable
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2016, 50 (1), pp.101-103. ⟨10.1051/ita/2016007⟩
lirmm-03772619v1  Conference papers
Paloma T. LimaVinicius Fernandes dos SantosIgnasi Sau VallsUéverton dos Santos SouzaPrafullkumar Tale. Reducing the Vertex Cover Number via Edge Contraction
MFCS 2022 - 47th International Symposium on Mathematical Foundations of Computer Science, Aug 2022, Vienna, Austria. pp.69:1-69:14, ⟨10.4230/LIPIcs.MFCS.2022.20⟩
lirmm-00324589v1  Conference papers
David BremnerJonathan LenchnerGiuseppe LiottaChristophe PaulMarc Pouget et al.  A Note on α-Drawable k-Trees
CCCG 2008 - 20th Annual Canadian Conference on Computational Geometry, Aug 2008, Montréal, Québec, Canada. pp.23-26
hal-03771145v1  Journal articles
Mamadou Moustapha KantéChristophe PaulDimitrios Thilikos. A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2022, 36 (1), pp.411-435. ⟨10.1137/20M1369361⟩
hal-03389854v2  Journal articles
Fedor FominPetr GolovachDimitrios M. Thilikos. Parameterized Complexity of Elimination Distance to First-Order Logic Properties
ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 23 (3), pp.17. ⟨10.1145/3517129⟩
hal-03002744v2  Conference papers
Stratis LimniosGeorge DasoulasDimitrios M. ThilikosMichalis Vazirgiannis. Hcore-Init: Neural Network Initialization based on Graph Degeneracy
ICPR 2020 - 25th International Conference on Pattern Recognition, Jan 2021, Milan (Virtual), Italy. pp.5852-5858, ⟨10.1109/ICPR48806.2021.9412940⟩
hal-03595364v1  Conference papers
Marin BougeretJérémy OmerMichael Poss. Optimization problems in graphs with locational uncertainty
ROADEF 2022 - 23ème congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne, France
hal-03540673v1  Conference papers
Florent FoucaudSuchismita MishraNarayanan NarayananReza NaserasrPetru Valicov. Cliques in exact distance powers of graphs of given maximum degree
LAGOS 2021 - 11th Latin and American Algorithms, Graphs and Optimisation Symposium, May 2021, Sao Paulo, Brazil. pp.427-436, ⟨10.1016/j.procs.2021.11.052⟩
lirmm-03526774v1  Conference papers
Stéphane BessyMarin BougeretAlan D.A. CarneiroFábio ProttiUéverton dos Santos Souza. Width Parameterizations for Knot-Free Vertex Deletion on Digraphs
IPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.2:1-2:16, ⟨10.4230/LIPIcs.IPEC.2019.2⟩
lirmm-03526704v1  Conference papers
Júlio AraújoMarin BougeretVictor CamposIgnasi Sau Valls. A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover
IPEC 2021 - 16th International Symposium on Parameterized and Exact Computation, Sep 2021, Virtual, Portugal. pp.4:1-4:19, ⟨10.4230/LIPIcs.IPEC.2021.4⟩
lirmm-02079017v1  Conference papers
Christophe Paul. Connected tree-width and connected cops and robber game
CAALM 2019 - Complexity, Algorithms, Automata and Logic Meet, Jan 2019, Chennai, India
lirmm-03479885v1  Journal articles
Fabien Jacques. On the chromatic numbers of signed triangular and hexagonal grids
Information Processing Letters, Elsevier, 2021, 172, pp.#106156. ⟨10.1016/j.ipl.2021.106156⟩