AlGCo : algorithmes, graphes et combinatoire

Responsable : Emeric Gioan

Département Informatique - LIRMM


Accueil | Annonces | Membres | Projets | Visiteurs | Publications | Séminaire


Publications depuis 2008
La page ci-dessous est générée automatiquement à partir de HAL.
(Attention : elle est obtenue par la recherche "AlGCo" sur HAL, elle ne reflète que les saises déjà effectuées sur HAL à ce jour, les références ne sont pas exactes pour les articles enregistrés avant publication définitive, et la liste de conférences ne distingue pas celles avec publication d'actes et sans publication).

Revues : 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008
Conférences : 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008
Conférences invitées : 2019 2018 2016 2015 2014 2013 2012 2011 2010 2009 2008
Ouvrages et chapitres d'ouvrages : 2022 2021 2020 2019 2018 2017 2016 2015 2013 2012 2010
Travaux d'édition :


Revues 2008 - 2024


Revues 2024

[3]Computing the fully optimal spanning tree of an ordered bipolar directed graph. Emeric Gioan, Michel Las Vergnas. Discrete Mathematics, 2024, 347 (5), pp.113895.
[2]FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau. Discrete Applied Mathematics, 2024, 346, pp.80-94. ⟨10.1016/j.dam.2023.11.026⟩. [DOI]
[1]Digraph redicolouring. Nicolas Bousquet, Frédéric Havet, Nicolas Nisse, Lucas Picasarri-Arrieta, Amadeus Reinald. European Journal of Combinatorics, 2024, 116, pp.103876. ⟨10.1016/j.ejc.2023.103876⟩. [DOI]


Revues 2023

[23]k-apices of minor-closed graph classes. I. Bounding the obstructions. Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. Journal of Combinatorial Theory, Series B, 2023, 161, pp.180-227. ⟨10.1016/j.jctb.2023.02.012⟩. [DOI]
[22]Edge Separators for Graphs Excluding a Minor. Gwenaël Joret, William Lochet, Michał Seweryn. The Electronic Journal of Combinatorics, 2023, 30 (4), pp.4.12. ⟨10.37236/11744⟩. [DOI]
[21]Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. Petr Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. ACM Transactions on Algorithms, 2023, 19 (3), pp.1-29. ⟨10.1145/3583688⟩. [DOI]
[20]Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. Júlio Araújo, Marin Bougeret, Victor Campos, Ignasi Sau. Algorithmica, 2023, 85 (2), pp.444-491. ⟨10.1007/s00453-022-01036-5⟩. [DOI]
[19]Properties of a ternary infinite word. James Currie, Pascal Ochem, Narad Rampersad, Jeffrey Shallit. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2023, 57, pp.#1. ⟨10.1051/ita/2022010⟩. [DOI]
[18]2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4. Xuan Hoang La, Kenny Štorgel. Discrete Mathematics, 2023, 346 (8), pp.#113405. ⟨10.1016/j.disc.2023.113405⟩. [DOI]
[17]On ternary Dejean words avoiding 010. Pascal Ochem. Notes on Number Theory and Discrete Mathematics, 2023, 29 (3), pp.545-548. ⟨10.7546/nntdm.2023.29.3.545-548⟩. [DOI]
[16]The mixed search game against an agile and visible fugitive is monotone. Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos. Discrete Mathematics, 2023, 346 (4), pp.113345. ⟨10.1016/j.disc.2023.113345⟩. [DOI]
[15]Single machine robust scheduling with budgeted uncertainty. Marin Bougeret, Artur Alves Pessoa, Michael Poss. Operations Research Letters, 2023, 51 (2), pp.137-141. ⟨10.1016/j.orl.2023.01.007⟩. [DOI]
[14]Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs. Fedor V. Fomin, Petr Golovach, Dimitrios M. Thilikos. Information and Computation, 2023, 293, pp.105049. ⟨10.1016/j.ic.2023.105049⟩. [DOI]
[13]Pseudoperiodic Words and a Question of Shevelev. Joseph Meleshko, Pascal Ochem, Jeffrey Shallit, Sonja Linghui Shan. Discrete Mathematics and Theoretical Computer Science, 2023, 25:2 (Automata, Logic and Semantics), ⟨10.46298/dmtcs.9919⟩. [DOI]
[12]The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree. Christopher Duffy, Fabien Jacques, Mickaël Montassier, Alexandre Pinlou. Discrete Mathematics, 2023, 346 (10), pp.113579. ⟨10.1016/j.disc.2023.113579⟩. [DOI]
[11]On Strict Brambles. Emmanouil Lardas, Evangelos Protopapas, Dimitrios M. Thilikos, Dimitris Zoros. Graphs and Combinatorics, 2023, 39 (2), pp.24. ⟨10.1007/s00373-023-02618-y⟩. [DOI]
[10]How to find a good explanation for clustering?. Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov. Artificial Intelligence, 2023, 322, pp.103948. ⟨10.1016/j.artint.2023.103948⟩. [DOI]
[9]Detours in directed graphs. Fedor V. Fomin, Petr Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov. Journal of Computer and System Sciences, 2023, 137, pp.66-86. ⟨10.1016/j.jcss.2023.05.001⟩. [DOI]
[8]Antisquares and Critical Exponents. Aseem Baranwal, James Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey Shallit. Discrete Mathematics and Theoretical Computer Science, 2023, 25:2 (Combinatorics), pp.#11. ⟨10.46298/dmtcs.10063⟩. [DOI]
[7]Doubled Patterns with Reversal and Square-Free Doubled Patterns. Antoine Domenech, Pascal Ochem. The Electronic Journal of Combinatorics, 2023, 30 (1), ⟨10.37236/11590⟩. [DOI]
[6]Target set selection with maximum activation time. Lucas Keiler, Carlos Vinicius Gomes Costa Lima, Ana Karolinna Maia, Rudini Sampaio, Ignasi Sau. Discrete Applied Mathematics, 2023, 338, pp.199-217. ⟨10.1016/j.dam.2023.06.004⟩. [DOI]
[5]Reducing the vertex cover number via edge contractions. Paloma Thomé de Lima, Vinicius F. dos Santos, Ignasi Sau, Uéverton dos Santos Souza, Prafullkumar Tale. Journal of Computer and System Sciences, 2023, 136, pp.63-87. ⟨10.1016/j.jcss.2023.03.003⟩. [DOI]
[4]Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach. The Electronic Journal of Combinatorics, 2023, 30 (1), pp.1-35. ⟨10.37236/10866⟩. [DOI]
[3]Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos. SIAM Journal on Computing, 2023, 52 (4), pp.865-912. ⟨10.1137/21M140482X⟩. [DOI]
[2]Optimization problems in graphs with locational uncertainty. Marin Bougeret, Jérémy Omer, Michael Poss. INFORMS Journal on Computing, 2023, 35 (3), pp.578-592. ⟨10.1287/ijoc.2023.1276⟩. [DOI]
[1]Partitioning into degenerate graphs in linear time. Timothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon. European Journal of Combinatorics, 2023, 114, pp.103771. ⟨10.1016/j.ejc.2023.103771⟩. [DOI]


Revues 2022

[25]Algorithmic aspects of broadcast independence. Stéphane Bessy, Dieter Rautenbach. Discrete Applied Mathematics, 2022, 314, pp.142-149. ⟨10.1016/j.dam.2022.03.001⟩. [DOI]
[24]2-Distance List (Δ+3) -Coloring of Sparse Graphs. Xuan Hoang La. Graphs and Combinatorics, 2022, 38 (6), pp.#167. ⟨10.1007/s00373-022-02572-1⟩. [DOI]
[23]Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. Marin Bougeret, Bart M P Jansen, Ignasi Sau. SIAM Journal on Discrete Mathematics, 2022, 36 (4), pp.2737-2773. ⟨10.1137/21m1400766⟩. [DOI]
[22]2-Distance list (Δ+2)-coloring of planar graphs with girth at least 10. Xuan Hoang La, Mickaël Montassier. Journal of Combinatorial Optimization, 2022, 44 (2), pp.1356-1375. ⟨10.1007/s10878-022-00883-w⟩. [DOI]
[21]The chromatic number of signed graphs with bounded maximum average degree. Fabien Jacques, Alexandre Pinlou. Discrete Applied Mathematics, 2022, 316 (C), pp.43-59. ⟨10.1016/j.dam.2022.03.025⟩. [DOI]
[20]Complete Graph Drawings up to Triangle Mutations. Emeric Gioan. Discrete and Computational Geometry, 2022, 67, pp.985-1022. ⟨10.1007/s00454-021-00339-8⟩. [DOI]
[19]Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo. Graphs and Combinatorics, 2022, 38 (6), ⟨10.1007/s00373-022-02589-6⟩. [DOI]
[18]On Tutte polynomial expansion formulas in perspectives of matroids and oriented matroids. Emeric Gioan. Discrete Mathematics, 2022, 345 (7), pp.#112796. ⟨10.1016/j.disc.2022.112796⟩. [DOI]
[17]Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound. Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach. The Electronic Journal of Combinatorics, 2022, 29 (2), ⟨10.37236/10610⟩. [DOI]
[16]Adapting the Directed Grid Theorem into an FPT Algorithm. Victor Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau. SIAM Journal on Discrete Mathematics, 2022, 36 (3), pp.1887-1917. ⟨10.1137/21m1452664⟩. [DOI]
[15]Further extensions of the Grötzsch Theorem. Xuan Hoang La, Borut Lužar, Kenny Štorgel. Discrete Mathematics, 2022, 345 (6), pp.#112849. ⟨10.1016/j.disc.2022.112849⟩. [DOI]
[14]k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. ACM Transactions on Algorithms, 2022, 18 (3), pp.1-30. ⟨10.1145/3519028⟩. [DOI]
[13]Acyclic, Star, and Injective Colouring: Bounding the Diameter. Christoph Brause, Petr Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith. The Electronic Journal of Combinatorics, 2022, 29 (2), pp.#P2.43. ⟨10.37236/10738⟩. [DOI]
[12]A polynomial time algorithm to compute the connected treewidth of a series–parallel graph. Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos. Discrete Applied Mathematics, 2022, 312, pp.72-85. ⟨10.1016/j.dam.2021.02.039⟩. [DOI]
[11]Avoiding square-free words on free groups. Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld. Theoretical Computer Science, 2022, 922, pp.206-217. ⟨10.1016/j.tcs.2022.04.025⟩. [DOI]
[10]Block Elimination Distance. Öznur Yaşar Diner, Archontia Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos. Graphs and Combinatorics, 2022, 38 (5), pp.#133. ⟨10.1007/s00373-022-02513-y⟩. [DOI]
[9]Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. Júlio Araújo, Marin Bougeret, Victor Campos, Ignasi Sau. Algorithmica, 2022, 84 (11), pp.3365-3406. ⟨10.1007/s00453-022-00979-z⟩. [DOI]
[8]An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. Fedor Fomin, Petr Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. ACM Transactions on Computation Theory, 2022, 14 (3-4), pp.1-29. ⟨10.1145/3571278⟩. [DOI]
[7]Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth. Kolja Knauer, Xuan Hoang La, Petru Valicov. The Electronic Journal of Combinatorics, 2022, 29 (4), ⟨10.37236/10914⟩. [DOI]
[6]Contraction Bidimensionality of Geometric Intersection Graphs. Julien Baste, Dimitrios M. Thilikos. Algorithmica, 2022, 84 (2), pp.510-531. ⟨10.1007/s00453-021-00912-w⟩. [DOI]
[5]Complexity of some arc-partition problems for digraphs. Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta. Theoretical Computer Science, 2022, 928, pp.167-182. ⟨10.1016/j.tcs.2022.06.023⟩. [DOI]
[4]A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps. Raul Lopes, Ignasi Sau. Theoretical Computer Science, 2022, 898, pp.75-91. ⟨10.1016/j.tcs.2021.10.023⟩. [DOI]
[3]Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss. SIAM Journal on Discrete Mathematics, 2022, 36 (4), ⟨10.1137/21M1457199⟩. [DOI]
[2]Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2. Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo. Journal of Graph Theory, 2022, 100 (2), pp.294-314. ⟨10.1002/jgt.22779⟩. [DOI]
[1]A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos. SIAM Journal on Discrete Mathematics, 2022, 36 (1), pp.411-435. ⟨10.1137/20M1369361⟩. [DOI]


Revues 2021

[28]On the chromatic numbers of signed triangular and hexagonal grids. Fabien Jacques. Information Processing Letters, 2021, 172, pp.#106156. ⟨10.1016/j.ipl.2021.106156⟩. [DOI]
[27]Homomorphisms of planar $(m,n)$-colored-mixed graphs to planar targets. Fabien Jacques, Pascal Ochem. Discrete Mathematics, 2021, 344 (12), pp.#112600. ⟨10.1016/j.disc.2021.112600⟩. [DOI]
[26]A family of formulas with reversal of arbitrarily high avoidability index. Pascal Ochem. Theoretical Computer Science, 2021, 896, pp.168-170. ⟨10.1016/j.tcs.2021.10.013⟩. [DOI]
[25]Exponential independence in subcubic graphs. Stéphane Bessy, Johannes Pardey, Dieter Rautenbach. Discrete Mathematics, 2021, 344 (8), pp.#112439. ⟨10.1016/j.disc.2021.112439⟩. [DOI]
[24]Good orientations of unions of edge‐disjoint spanning trees. Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell. Journal of Graph Theory, 2021, 96 (4), pp.594-618. ⟨10.1002/jgt.22633⟩. [DOI]
[23]Connected search for a lazy robber. Isolde Adler, Christophe Paul, Dimitrios M. Thilikos. Journal of Graph Theory, 2021, 97 (4), pp.510-552. ⟨10.1002/jgt.22669⟩. [DOI]
[22]Compactors for parameterized counting problems. Dimitrios M. Thilikos. Computer Science Review, 2021, 39, pp.100344. ⟨10.1016/j.cosrev.2020.100344⟩. [DOI]
[21]Every Collinear Set in a Planar Graph is Free. Vida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote. Discrete and Computational Geometry, 2021, 65 (4), pp.999-1027. ⟨10.1007/s00454-019-00167-x⟩. [DOI]
[20]Preface of STACS 2019 Special Issue. Rolf Niedermeier, Christophe Paul. Theory of Computing Systems, 2021, 65 (4), pp.635-637. ⟨10.1007/s00224-020-10026-5⟩. [DOI]
[19]On the complexity of finding large odd induced subgraphs and odd colorings. Rémy Belmonte, Ignasi Sau. Algorithmica, 2021, 83 (8), pp.2351-2373. ⟨10.1007/s00453-021-00830-x⟩. [DOI]
[18]Minor obstructions for apex-pseudoforests. Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis. Discrete Mathematics, 2021, 344 (10), pp.112529. ⟨10.1016/j.disc.2021.112529⟩. [DOI]
[17]A Unifying Model for Locally Constrained Spanning Tree Problems. Luiz Alberto Do Carmo Viana, Manoel Campêlo, Ignasi Sau, Ana Silva. Journal of Combinatorial Optimization, 2021, 42 (1), pp.125-150. ⟨10.1007/s10878-021-00740-2⟩. [DOI]
[16]Finding Cuts of Bounded Degree. Guilherme C M Gomes, Ignasi Sau. Algorithmica, 2021, 83 (6), pp.1677-1706. ⟨10.1007/s00453-021-00798-8⟩. [DOI]
[15]Packing Arc-Disjoint Cycles in Tournaments. Stéphane Bessy, Marin Bougeret, Ramaswamy Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi. Algorithmica, 2021, 83 (5), pp.1393-1420. ⟨10.1007/s00453-020-00788-2⟩. [DOI]
[14]Coloring Problems on Bipartite Graphs of Small Diameter. Victor A Campos, Guilherme C.M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva. The Electronic Journal of Combinatorics, 2021, 28 (2), pp.#P2.14. ⟨10.37236/9931⟩. [DOI]
[13]Approximation results for makespan minimization with budgeted uncertainty. Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder. Theory of Computing Systems, 2021, 65 (6), pp.903-915. ⟨10.1007/s00224-020-10024-7⟩. [DOI]
[12]The interval number of a planar graph is at most three. Guillaume Guegan, Kolja Knauer, Jonathan Rollin, Torsten Ueckerdt. Journal of Combinatorial Theory, Series B, 2021, 146, pp.61-67. ⟨10.1016/j.jctb.2020.07.006⟩. [DOI]
[11]Avoidability of Palindrome Patterns. Pascal Ochem, Matthieu Rosenfeld. The Electronic Journal of Combinatorics, 2021, 28 (1), pp.#1.4. ⟨10.37236/9593⟩. [DOI]
[10]Reducing graph transversals via edge contractions. Paloma T Lima, Vinicius F dos Santos, Ignasi Sau, Uéverton S Souza. Journal of Computer and System Sciences, 2021, 120, pp.62-74. ⟨10.1016/j.jcss.2021.03.003⟩. [DOI]
[9]$r$-hued ( r + 1 ) -coloring of planar graphs with girth at least 8 for $r$ ≥ 9. Xuan Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov. European Journal of Combinatorics, 2021, 91, pp.#103219. ⟨10.1016/j.ejc.2020.103219⟩. [DOI]
[8]Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph. Anne Berry, Geneviève Simonet. Algorithms, 2021, 14 (12), pp.347-367. ⟨10.3390/a14120347⟩. [DOI]
[7]Target set selection with maximum activation time. Lucas Keiler, Carlos V.G.C. Lima, Ana Karolinna Maia, Rudini Sampaio, Ignasi Sau. Procedia Computer Science, 2021, 195, pp.86-96. ⟨10.1016/j.procs.2021.11.014⟩. [DOI]
[6]Hitting forbidden induced subgraphs on bounded treewidth graphs. Ignasi Sau, Uéverton dos Santos Souza. Information and Computation, 2021, 281, pp.104812. ⟨10.1016/j.ic.2021.104812⟩. [DOI]
[5]A Menger-like property of tree-cut width. Archontia C Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. Journal of Combinatorial Theory, Series B, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩. [DOI]
[4]Minimum Reload Cost Graph Factors. Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos. Theory of Computing Systems, 2021, 65 (5), pp.815-838. ⟨10.1007/s00224-020-10012-x⟩. [DOI]
[3]Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. Dimitrios M. Thilikos, Archontia Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Marcin Wrochna. SIAM Journal on Discrete Mathematics, 2021, 35 (1), pp.105-151. ⟨10.1137/18M1228839⟩. [DOI]
[2]A note on deterministic zombies. Bartier Valentin, Laurine Bénéteau, Marthe Bonamy, Xuan Hoang La, Jonathan Narboni. Discrete Applied Mathematics, 2021, 301, pp.65-68. ⟨10.1016/j.dam.2021.05.001⟩. [DOI]
[1]Exact square coloring of subcubic planar graphs. Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Eric Sopena, Petru Valicov. Discrete Applied Mathematics, 2021, 293, pp.74-89. ⟨10.1016/j.dam.2021.01.007⟩. [DOI]


Revues 2020

[26]Not all planar graphs are in PURE-4-DIR. Daniel Gonçalves. Journal of Graph Algorithms and Applications, 2020, 24 (3), pp.293-301. ⟨10.7155/jgaa.00533⟩. [DOI]
[25]Avoiding conjugacy classes on the 5-letter alphabet. Golnaz Badkobeh, Pascal Ochem. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2020, 54 (2), pp.1-4. ⟨10.1051/ita/2020003⟩. [DOI]
[24]Subgraph Complementation. Fedor V. Fomin, Petr A. Golovach, Torstein Strømme, Dimitrios M. Thilikos. Algorithmica, 2020, 82 (7), pp.1859-1880. ⟨10.1007/s00453-020-00677-8⟩. [DOI]
[23]Acyclic coloring of graphs and entropy compression method. Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou. Discrete Mathematics, 2020, 343 (4), pp.#111772. ⟨10.1016/j.disc.2019.111772⟩. [DOI]
[22]Dushnik–Miller dimension of TD-Delaunay complexes. Daniel Gonçalves, Lucas Isenmann. European Journal of Combinatorics, 2020, 88, pp.#103110. ⟨10.1016/j.ejc.2020.103110⟩. [DOI]
[21]On non-repetitive sequences of arithmetic progressions: The cases k ∈ { 4 , 5 , 6 , 7 , 8 }. Borut Lužar, Martina Mockovčiaková, Pascal Ochem, Alexandre Pinlou, Roman Sotak. Discrete Applied Mathematics, 2020, 279, pp.106-117. ⟨10.1016/j.dam.2019.10.013⟩. [DOI]
[20]On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. Theory of Computing Systems, 2020, 64 (2), pp.251-271. ⟨10.1007/s00224-019-09938-8⟩. [DOI]
[19]Sparse obstructions for minor-covering parameters. Dimitris Chatzidimitriou, Dimitrios M. Thilikos, Dimitris Zoros. Discrete Applied Mathematics, 2020, 278, pp.28-50. ⟨10.1016/j.dam.2019.10.021⟩. [DOI]
[18]On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. Júlio Araújo, Victor A Campos, Ana Karolinna Maia de Oliveira, Ignasi Sau, Ana Silva. Algorithmica, 2020, 82 (6), pp.1616-1639. ⟨10.1007/s00453-019-00659-5⟩. [DOI]
[17]Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos. Theoretical Computer Science, 2020, 814, pp.135-152. ⟨10.1016/j.tcs.2020.01.026⟩. [DOI]
[16]Out‐colourings of digraphs. Noga Alon, Jørgen Bang‐jensen, Stéphane Bessy. Journal of Graph Theory, 2020, 93 (1), pp.88-112. ⟨10.1002/jgt.22476⟩. [DOI]
[15]Parameterized Complexity of Elimination Distance to First-Order Logic Properties. Fedor Fomin, Petr Golovach, Dimitrios M. Thilikos. ACM Transactions on Computational Logic, 2020, 23 (3), pp.17. ⟨10.1145/3517129⟩. [DOI]
[14]Oriented cliques and colorings of graphs with low maximum degree. Janusz Dybizbański, Pascal Ochem, Alexandre Pinlou, Andrzej Szepietowski. Discrete Mathematics, 2020, 343 (5), pp.#111829. ⟨10.1016/j.disc.2020.111829⟩. [DOI]
[13]Minor-obstructions for apex sub-unicyclic graphs. Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki Velona. Discrete Applied Mathematics, 2020, 284, pp.538-555. ⟨10.1016/j.dam.2020.04.019⟩. [DOI]
[12]Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos. SIAM Journal on Discrete Mathematics, 2020, 34 (3), pp.1623-1648. ⟨10.1137/19M1287146⟩. [DOI]
[11]Structure and enumeration of $K_4$- minor-free links and link-diagrams. Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona. European Journal of Combinatorics, 2020, 89, pp.103147. ⟨10.1016/j.ejc.2020.103147⟩. [DOI]
[10]Partitioning sparse graphs into an independent set and a graph with bounded size components. Ilkyoo Choi, François Dross, Pascal Ochem. Discrete Mathematics, 2020, 343 (8), pp.111921. ⟨10.1016/j.disc.2020.111921⟩. [DOI]
[9]Bidimensionality and Kernels. Fedor Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. SIAM Journal on Computing, 2020, 49 (6), pp.1397-1422. ⟨10.1137/16M1080264⟩. [DOI]
[8]On independent set in B1-EPG graphs. Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul. Discrete Applied Mathematics, 2020, 278, pp.62-72. ⟨10.1016/j.dam.2019.10.019⟩. [DOI]
[7]Hitting minors on bounded treewidth graphs. III. Lower bounds. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos. Journal of Computer and System Sciences, 2020, 109, pp.56-77. ⟨10.1016/j.jcss.2019.11.002⟩. [DOI]
[6]Enumerating $k$-arc-connected orientations. Sarah Blind, Kolja Knauer, Petru Valicov. Algorithmica, 2020, 82 (12), ⟨10.1007/s00453-020-00738-y⟩. [DOI]
[5]Dual Parameterization of Weighted Coloring. Júlio Araújo, Victor A Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Ana Silva. Algorithmica, 2020, 82 (8), pp.2316-2336. ⟨10.1007/s00453-020-00686-7⟩. [DOI]
[4]Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos. Networks, 2020, 75 (3), pp.259-277. ⟨10.1002/net.21923⟩. [DOI]
[3]Maximum cuts in edge-colored graphs. Luerbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza, Rubens Sucupira. Discrete Applied Mathematics, 2020, 281, pp.229-234. ⟨10.1016/j.dam.2019.02.038⟩. [DOI]
[2]Edge degeneracy: Algorithmic and structural results. Stratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. Thilikos. Theoretical Computer Science, 2020, 839, pp.164-175. ⟨10.1016/j.tcs.2020.06.006⟩. [DOI]
[1]Complexity of planar signed graph homomorphisms to cycles. François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron. Discrete Applied Mathematics, 2020, 284, pp.166-178. ⟨10.1016/j.dam.2020.03.029⟩. [DOI]


Revues 2019

[29]Relating broadcast independence and independence. Stéphane Bessy, Dieter Rautenbach. Discrete Mathematics, 2019, 342 (12), pp.#111589. ⟨10.1016/j.disc.2019.07.005⟩. [DOI]
[28]Large induced forests in planar graphs with girth 4. François Dross, Mickaël Montassier, Alexandre Pinlou. Discrete Applied Mathematics, 2019, 254, pp.96-106. ⟨10.1016/j.dam.2018.06.029⟩. [DOI]
[27]A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. François Dross, Mickaël Montassier, Alexandre Pinlou. Discrete Mathematics, 2019, 342 (4), pp.943-950. ⟨10.1016/j.disc.2018.11.023⟩. [DOI]
[26]Counting Gallai 3-colorings of complete graphs. Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Guilherme Oliveira Mota, Ignasi Sau. Discrete Mathematics, 2019, 342 (9), pp.2618-2631. ⟨10.1016/j.disc.2019.05.015⟩. [DOI]
[25]Dynamic monopolies for interval graphs with bounded thresholds. Stéphane Bessy, Stefan Ehard, Lucia D. Penso, Dieter Rautenbach. Discrete Applied Mathematics, 2019, 260, pp.256-261. ⟨10.1016/j.dam.2019.01.022⟩. [DOI]
[24]Repetition avoidance in products of factors. Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi. Theoretical Computer Science, 2019, 791, pp.123-126. ⟨10.1016/j.tcs.2019.04.013⟩. [DOI]
[23]Approximating maximum uniquely restricted matchings in bipartite graphs. Julien Baste, Dieter Rautenbach, Ignasi Sau. Discrete Applied Mathematics, 2019, 267, pp.30-40. ⟨10.1016/j.dam.2019.04.024⟩. [DOI]
[22]Strong immersion is a well-quasi-ordering for semicomplete digraphs. Florian Barbero, Christophe Paul, Michał Pilipczuk. Journal of Graph Theory, 2019, 90, pp.484-496. ⟨10.1002/jgt.22408⟩. [DOI]
[21]Weighted proper orientations of trees and graphs of bounded treewidth. Julio Araujo, Cláudia Linhares Sales, Ignasi Sau, Ana Silva. Theoretical Computer Science, 2019, 771, pp.39-48. ⟨10.1016/j.tcs.2018.11.013⟩. [DOI]
[20]On the number of circuit–cocircuit reversal classes of an oriented matroid. Emeric Gioan, Chi Ho Yuen. Discrete Mathematics, 2019, 342 (4), pp.1056-1059. ⟨10.1016/j.disc.2018.12.006⟩. [DOI]
[19]Some further results on squarefree arithmetic progressions in infinite words. James Currie, Tero Harju, Pascal Ochem, Narad Rampersad. Theoretical Computer Science, 2019, 799, pp.140-148. ⟨10.1016/j.tcs.2019.10.006⟩. [DOI]
[18]Oriented incidence colourings of digraphs. Christopher Duffy, Gary Macgillivray, Pascal Ochem, André Raspaud. Discussiones Mathematicae Graph Theory, 2019, 39 (1), pp.191-210. ⟨10.7151/dmgt.2076⟩. [DOI]
[17]How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. Marin Bougeret, Ignasi Sau. Algorithmica, 2019, 81 (10), pp.4043-4068. ⟨10.1007/s00453-018-0468-8⟩. [DOI]
[16]On some interesting ternary formulas. Pascal Ochem, Matthieu Rosenfeld. The Electronic Journal of Combinatorics, 2019, 26 (1), pp.P1.12. ⟨10.37236/7901⟩. [DOI]
[15]On the Kőnig-Egerváry theorem for $k$-paths. Stéphane Bessy, Pascal Ochem, Dieter Rautenbach. Journal of Graph Theory, 2019, 91 (1), pp.73-87. ⟨10.1002/jgt.22421⟩. [DOI]
[14]Degree-constrained 2-partitions of graphs. Jørgen Bang-Jensen, Stéphane Bessy. Theoretical Computer Science, 2019, 776, pp.64-74. ⟨10.1016/j.tcs.2018.12.023⟩. [DOI]
[13]Vertex partitions of ($C 3 , C 4 , C 6$) -free planar graphs. François Dross, Pascal Ochem. Discrete Mathematics, 2019, 342 (11), pp.3229-3236. ⟨10.1016/j.disc.2019.07.002⟩. [DOI]
[12]Robust scheduling with budgeted uncertainty. Marin Bougeret, Artur Alves Pessoa, Michael Poss. Discrete Applied Mathematics, 2019, 261, pp.93-107. ⟨10.1016/j.dam.2018.07.001⟩. [DOI]
[11]Homothetic triangle representations of planar graphs. Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. Journal of Graph Algorithms and Applications, 2019, 23 (4), pp.745-753. ⟨10.7155/jgaa.00509⟩. [DOI]
[10]The active bijection for graphs. Emeric Gioan, Michel Las Vergnas. Advances in Applied Mathematics, 2019, 104, pp.165-236. ⟨10.1016/j.aam.2018.11.001⟩. [DOI]
[9]Upper bounds on the uniquely restricted chromatic index. Julien Baste, Dieter Rautenbach, Ignasi Sau. Journal of Graph Theory, 2019, 91 (3), pp.251-258. ⟨10.1002/jgt.22429⟩. [DOI]
[8]Parameterized complexity of a coupled-task scheduling problem. Stéphane Bessy, Rodolphe Giroudeau. Journal of Scheduling, 2019, 22 (3), pp.305-313. ⟨10.1007/s10951-018-0581-1⟩. [DOI]
[7]Cutwidth: Obstructions and Algorithmic Aspects. Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. Algorithmica, 2019, 81 (2), pp.557-588. ⟨10.1007/s00453-018-0424-7⟩. [DOI]
[6]Adapting The Directed Grid Theorem into an FPT Algorithm. Victor Campos, Raul Lopes, Ana Karolinna Maia de Oliviera, Ignasi Sau. Electronic Notes in Theoretical Computer Science, 2019, 346, pp.229-240. ⟨10.1016/j.entcs.2019.08.021⟩. [DOI]
[5]Preface to special issue on Theory and Applications of Graph Searching. Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos. Theoretical Computer Science, 2019, 794, pp.1-2. ⟨10.1016/j.tcs.2019.09.043⟩. [DOI]
[4]On the structure of Schnyder woods on orientable surfaces. Daniel Gonçalves, Kolja Knauer, Benjamin Lévêque. Journal of Computational Geometry, 2019, 10 (1), pp.127-164. ⟨10.20382/jocg.v10i1a5⟩. [DOI]
[3]Induced minors and well-quasi-ordering. Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck. Journal of Combinatorial Theory, Series B, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩. [DOI]
[2]Bipartite spanning sub(di)graphs induced by 2-partitions. Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo. Journal of Graph Theory, 2019, 92 (2), pp.130-151. ⟨10.1002/jgt.22444⟩. [DOI]
[1]Explicit Linear Kernels for Packing Problems. Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. Algorithmica, 2019, 81 (4), pp.1615-1656. ⟨10.1007/s00453-018-0495-5⟩. [DOI]


Revues 2018

[28]On triangles in $Kr$-minor free graphs. Boris Albar, Daniel Gonçalves. Journal of Graph Theory, 2018, 88 (1), pp.154-173. ⟨10.1002/jgt.22203⟩. [DOI]
[27]The $k$-strong induced arboricity of a graph. Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt. European Journal of Combinatorics, 2018, 67, pp.1-20. ⟨10.1016/j.ejc.2017.05.010⟩. [DOI]
[26]A Linear Kernel for Planar Total Dominating Set. Valentin Garnero, Ignasi Sau. Discrete Mathematics and Theoretical Computer Science, 2018, 20 (1), ⟨10.23638/DMTCS-20-1-14⟩. [DOI]
[25]The Geodetic Hull Number is Hard for Chordal Graphs. Stéphane Bessy, Mitre Dourado, Lucia Penso, Dieter Rautenbach. SIAM Journal on Discrete Mathematics, 2018, 32 (1), pp.543-547. ⟨10.1137/17M1131726⟩. [DOI]
[24]Bounds on the burning number. Stéphane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, Elham Roshanbin. Discrete Applied Mathematics, 2018, 235, pp.16-22. ⟨10.1016/j.dam.2017.09.012⟩. [DOI]
[23]On the number of labeled graphs of bounded treewidth. Julien Baste, Marc Noy, Ignasi Sau. European Journal of Combinatorics, 2018, 71, pp.12-21. ⟨10.1016/j.ejc.2018.02.030⟩. [DOI]
[22]Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. François Dross, Mickaël Montassier, Alexandre Pinlou. The Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.45. ⟨10.37236/6815⟩. [DOI]
[21]Hitting minors, subdivisions, and immersions in tournaments. Jean-Florent Raymond. Discrete Mathematics and Theoretical Computer Science, 2018, 20 (1), pp.4212. ⟨10.23638/DMTCS-20-1-5⟩. [DOI]
[20]Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. ACM Transactions on Algorithms, 2018, 14 (1), pp.1-31. ⟨10.1145/3155298⟩. [DOI]
[19]An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. Algorithmica, 2018, 80 (4), pp.1330-1356. ⟨10.1007/s00453-017-0313-5⟩. [DOI]
[18]Improved FPT algorithms for weighted independent set in bull-free graphs. Henri Perret Du Cray, Ignasi Sau. Discrete Mathematics, 2018, 341 (2), pp.451-462. ⟨10.1016/j.disc.2017.09.012⟩. [DOI]
[17]On repetition thresholds of caterpillars and trees of bounded degree. Borut Lužar, Pascal Ochem, Alexandre Pinlou. The Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.61. ⟨10.37236/6793⟩. [DOI]
[16]Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. Florian Barbero, Christophe Paul, Michał Pilipczuk. ACM Transactions on Algorithms, 2018, 14 (3), pp.#38. ⟨10.1145/3196276⟩. [DOI]
[15]Approximability and exact resolution of the multidimensional binary vector assignment problem. Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau. Journal of Combinatorial Optimization, 2018, 36 (3), pp.1059-1073. ⟨10.1007/s10878-018-0276-8⟩. [DOI]
[14]Degenerate matchings and edge colorings. Julien Baste, Dieter Rautenbach. Discrete Applied Mathematics, 2018, 239, pp.38-44. ⟨10.1016/j.dam.2018.01.002⟩. [DOI]
[13]Avoidability of circular formulas. Guilhem Gamard, Pascal Ochem, Gwenaël Richomme, Patrice Séébold. Theoretical Computer Science, 2018, 726, pp.1-4. ⟨10.1016/j.tcs.2017.11.014⟩. [DOI]
[12]Polynomial expansion and sublinear separators. Louis Esperet, Jean-Florent Raymond. European Journal of Combinatorics, 2018, 69, pp.49-53. ⟨10.1016/j.ejc.2017.09.003⟩. [DOI]
[11]Structure and Enumeration of $K4$-minor-free links and link diagrams. Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona. Electronic Notes in Discrete Mathematics, 2018, 68, pp.119-124. ⟨10.1016/j.endm.2018.06.021⟩. [DOI]
[10]Structured Connectivity Augmentation. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. SIAM Journal on Discrete Mathematics, 2018, 32 (4), pp.2612-2635. ⟨10.1137/17M1146233⟩. [DOI]
[9]Ruling out FPT algorithms for Weighted Coloring on forests. Julio Araujo, Julien Baste, Ignasi Sau. Theoretical Computer Science, 2018, 729, pp.11-19. ⟨10.1016/j.tcs.2018.03.013⟩. [DOI]
[8]Well-quasi-ordering $H$-contraction-free graphs. Marcin Jakub Kamiński, Jean-Florent Raymond, Théophile Trunck. Discrete Applied Mathematics, 2018, 248, pp.18-27. ⟨10.1016/j.dam.2017.02.018⟩. [DOI]
[7]Multigraphs without large bonds are wqo by contraction. Marcin Jakub Kamiński, Jean-Florent Raymond, Théophile Trunck. Journal of Graph Theory, 2018, 88 (4), pp.558-565. ⟨10.1002/jgt.22229⟩. [DOI]
[6]An FPT 2-Approximation for Tree-Cut Decomposition. Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. Algorithmica, 2018, 80 (1), pp.116-135. ⟨10.1007/s00453-016-0245-5⟩. [DOI]
[5]A Tight Erdös-Pósa Function for Wheel Minors. Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwénaël Joret, Jean-Florent Raymond, Ignasi Sau. SIAM Journal on Discrete Mathematics, 2018, 32 (3), pp.2302-2312. ⟨10.1137/17M1153169⟩. [DOI]
[4]Out-degree reducing partitions of digraphs. Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo. Theoretical Computer Science, 2018, 719, pp.64-72. ⟨10.1016/j.tcs.2017.11.007⟩. [DOI]
[3]On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs. Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza. Theoretical Computer Science, 2018, 746, pp.36-48. ⟨10.1016/j.tcs.2018.06.024⟩. [DOI]
[2]Multicut Is FPT. Nicolas Bousquet, Jean Daligault, Stéphan Thomassé. SIAM Journal on Computing, 2018, 47 (1), pp.166-207. ⟨10.1137/140961808⟩. [DOI]
[1]Complexity dichotomies for the Minimum F -Overlay problem. Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant. Journal of Discrete Algorithms, 2018, 52-53, pp.133-142. ⟨10.1016/j.jda.2018.11.010⟩. [DOI]


Revues 2017

[41]2-subcoloring is NP-complete for planar comparability graphs. Pascal Ochem. Information Processing Letters, 2017, 128, pp.46-48. ⟨10.1016/j.ipl.2017.08.004⟩. [DOI]
[40]Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture. Stéphane Bessy, Jocelyn Thiebaut. Electronic Notes in Discrete Mathematics, 2017, 61, pp.115-121. ⟨10.1016/j.endm.2017.06.028⟩. [DOI]
[39]Low Polynomial Exclusion of Planar Graph Patterns. Jean-Florent Raymond, Dimitrios M. Thilikos. Journal of Graph Theory, 2017, 84 (1), pp.26-44. ⟨10.1002/jgt.22009⟩. [DOI]
[38]The Geodetic Hull Number is Hard for Chordal Graphs. Stéphane Bessy, Mitre Dourado, Lucia Penso, Dieter Rautenbach. Electronic Notes in Discrete Mathematics, 2017, 62, pp.291-296. ⟨10.1016/j.endm.2017.10.050⟩. [DOI]
[37]List Coloring with a Bounded Palette. Marthe Bonamy, Ross J. Kang. Journal of Graph Theory, 2017, 84 (1), pp.93-103. ⟨10.1002/jgt.22013⟩. [DOI]
[36]Bounds on the exponential domination number. Stéphane Bessy, Pascal Ochem, Dieter Rautenbach. Discrete Mathematics, 2017, 340 (3), pp.494-503. ⟨10.1016/j.disc.2016.08.024⟩. [DOI]
[35]Colouring diamond-free graphs. Konrad K. Dabrowski, François Dross, Daniël Paulusma. Journal of Computer and System Sciences, 2017, 89, pp.410-431. ⟨10.1016/j.jcss.2017.06.005⟩. [DOI]
[34]Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. François Dross, Mickaël Montassier, Alexandre Pinlou. European Journal of Combinatorics, 2017, 66, pp.81-94. ⟨10.1016/j.ejc.2017.06.014⟩. [DOI]
[33]Dushnik-Miller dimension of contact systems of d -dimensional boxes. Mathew D. Francis, Daniel Gonçalves. Electronic Notes in Discrete Mathematics, 2017, 61, pp.467-473. ⟨10.1016/j.endm.2017.06.075⟩. [DOI]
[32]Homomorphisms of 2-edge-colored triangle-free planar graphs. Pascal Ochem, Alexandre Pinlou, Sagnik Sen. Journal of Graph Theory, 2017, 85 (1), pp.258-277. ⟨10.1002/jgt.22059⟩. [DOI]
[31]The complexity of partitioning into disjoint cliques and a triangle-free graph. Marin Bougeret, Pascal Ochem. Discrete Applied Mathematics, 2017, 217, pp.438-445. ⟨10.1016/j.dam.2016.10.004⟩. [DOI]
[30]Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom. Theoretical Computer Science, 2017, 690, pp.91-103. ⟨10.1016/j.tcs.2017.06.013⟩. [DOI]
[29]Burning a graph is hard. Stéphane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, Elham Roshanbin. Discrete Applied Mathematics, 2017, 232, pp.73-87. ⟨10.1016/j.dam.2017.07.016⟩. [DOI]
[28]Peut-on limiter les détours dans un réseau ?. Nicolas Bonichon, Claire Pennarun. Interstices, 2017.
[27]A linear kernel for planar red–blue dominating set. Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos. Discrete Applied Mathematics, 2017, 217, pp.536-547. ⟨10.1016/j.dam.2016.09.045⟩. [DOI]
[26]Extremal Values of the Chromatic Number for a Given Degree Sequence. Stéphane Bessy, Dieter Rautenbach. Graphs and Combinatorics, 2017, 33 (4), pp.789-799. ⟨10.1007/s00373-017-1814-3⟩. [DOI]
[25]Acyclic edge coloring through the Lovász Local Lemma. Dimitrios M. Thilikos, Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos. Theoretical Computer Science, 2017, 665, pp.40 - 50. ⟨10.1016/j.tcs.2016.12.011⟩. [DOI]
[24]Recent techniques and results on the Erdős-Pósa property. Jean-Florent Raymond, Dimitrios M. Thilikos. Discrete Applied Mathematics, 2017, 231, pp.25-43. ⟨10.1016/j.dam.2016.12.025⟩. [DOI]
[23]Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms. Nazanin Movarraei, Pascal Ochem. Information Processing Letters, 2017, 123, pp.42-46. ⟨10.1016/j.ipl.2017.02.009⟩. [DOI]
[22]Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant. Discrete Mathematics and Theoretical Computer Science, 2017, FCT '15, 19 (4), ⟨10.23638/DMTCS-19-4-3⟩. [DOI]
[21]On the complexity of computing the k-restricted edge-connectivity of a graph. Luis Pedro Montejano, Ignasi Sau. Theoretical Computer Science, 2017, 662, pp.31-39. ⟨10.1016/j.tcs.2016.12.006⟩. [DOI]
[20]Maximum Cuts in Edge-colored Graphs. Rubens Sucupira, Luerbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza. Electronic Notes in Discrete Mathematics, 2017, 62, pp.87 - 92. ⟨10.1016/j.endm.2017.10.016⟩. [DOI]
[19]Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Julien Baste, Luerbio Faria, Sulamita Klein, Ignasi Sau. Theory of Computing Systems, 2017, 61 (3), pp.777-794. ⟨10.1007/s00224-016-9716-y⟩. [DOI]
[18]Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. Journal of Computer and System Sciences, 2017, 86, pp.191-206. ⟨10.1016/j.jcss.2017.01.003⟩. [DOI]
[17]The Parameterized Complexity of Graph Cyclability. Petr A. Golovach, Marcin Kamiński, Spyridon Maniatis, Dimitrios M. Thilikos. SIAM Journal on Discrete Mathematics, 2017, 31 (1), pp.511 - 541. ⟨10.1137/141000014⟩. [DOI]
[16]Colorful paths for 3-chromatic graphs. Nicolas Bousquet, Stéphane Bessy. Discrete Mathematics, 2017, 340 (5), pp.1000-1007. ⟨10.1016/j.disc.2017.01.016⟩. [DOI]
[15]On the difference between the Szeged and the Wiener index. Marthe Bonamy, Martin Knor, Borut Lužar, Alexandre Pinlou, Riste Škrekovski. Applied Mathematics and Computation, 2017, 312, pp.202-213. ⟨10.1016/j.amc.2017.05.047⟩. [DOI]
[14]Minors in graphs of large θr-girth. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. European Journal of Combinatorics, 2017, 65, pp.106-121. ⟨10.1016/j.ejc.2017.04.011⟩. [DOI]
[13]Computing a Clique Tree with the Algorithm Maximal Label Search. Anne Berry, Geneviève Simonet. Algorithms, 2017, 10 (1), pp.#20. ⟨10.3390/a10010020⟩. [DOI]
[12]Antistrong digraphs. Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell. Journal of Combinatorial Theory, Series B, 2017, 122, pp.68-90. ⟨10.1016/j.jctb.2016.05.004⟩. [DOI]
[11]On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability. Iyad Kanj, Dimitrios M. Thilikos, Ge Xia. Information and Computation, 2017, 257 (139-156), ⟨10.1016/j.ic.2017.11.002⟩. [DOI]
[10]Editing to a planar graph of given degrees. Konrad K. Dabrowski, Petr A. Golovach, Pim van 'T Hof, Daniël Paulusma, Dimitrios M. Thilikos. Journal of Computer and System Sciences, 2017, 85, pp.168-182. ⟨10.1016/j.jcss.2016.11.009⟩. [DOI]
[9]Packing and covering immersion-expansions of planar sub-cubic graphs. Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. European Journal of Combinatorics, 2017, 65, pp.154-167. ⟨10.1016/j.ejc.2017.05.009⟩. [DOI]
[8]Möbius Stanchion Systems. Lucas Isenmann, Timothée Pecatte. Electronic Notes in Discrete Mathematics, 2017, 62, pp.177-182. ⟨10.1016/j.endm.2017.10.031⟩. [DOI]
[7]Ruling out FPT algorithms for Weighted Coloring on forests. Julio Araujo, Julien Baste, Ignasi Sau. Electronic Notes in Discrete Mathematics, 2017, 62, pp.195-200. ⟨10.1016/j.endm.2017.10.034⟩. [DOI]
[6]An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Mamadou Moustapha Kanté, Eun Jung Kim, O-Joung Kwon, Christophe Paul. Algorithmica, 2017, 79 (1), pp.66-95. ⟨10.1007/s00453-016-0230-z⟩. [DOI]
[5]Irrelevant vertices for the planar Disjoint Paths Problem. Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. Journal of Combinatorial Theory, Series B, 2017, 122, pp.815-843. ⟨10.1016/j.jctb.2016.10.001⟩. [DOI]
[4]Avoidability of Formulas with Two Variables. Pascal Ochem, Matthieu Rosenfeld. The Electronic Journal of Combinatorics, 2017, 24 (4), pp.#P4.30. ⟨10.37236/6536⟩. [DOI]
[3]A polynomial-time algorithm for Outerplanar Diameter Improvement. Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller. Journal of Computer and System Sciences, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩. [DOI]
[2]Encoding toroidal triangulations. Vincent Despré, Daniel Gonçalves, Benjamin Lévêque. Discrete and Computational Geometry, 2017, 57 (3), pp.507-544. ⟨10.1007/s00454-016-9832-0⟩. [DOI]
[1]On the parameterized complexity of the Edge Monitoring problem. Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau. Information Processing Letters, 2017, 121, pp.39-44. ⟨10.1016/j.ipl.2017.01.008⟩. [DOI]


Revues 2016

[25]Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták. Discrete Mathematics, 2016, 339 (2), pp.780 - 789. ⟨10.1016/j.disc.2015.10.016⟩. [DOI]
[24]Exponential Domination in Subcubic Graphs. Stéphane Bessy, Pascal Ochem, Dieter Rautenbach. The Electronic Journal of Combinatorics, 2016, 23 (4), pp.#P4.42. ⟨10.37236/5711⟩. [DOI]
[23]On interval representations of graphs. Aquiles Braga de Queiroz, Valentin Garnero, Pascal Ochem. Discrete Applied Mathematics, 2016, 202, pp.30-36. ⟨10.1016/j.dam.2015.08.022⟩. [DOI]
[22]A short proof that shuffle squares are 7-avoidable. Guillaume Guégan, Pascal Ochem. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2016, 50 (1), pp.101-103. ⟨10.1051/ita/2016007⟩. [DOI]
[21]Doubled patterns are 3-avoidable. Pascal Ochem. The Electronic Journal of Combinatorics, 2016, 23 (1), pp.P1.19. ⟨10.37236/5618⟩. [DOI]
[20]3-path in graphs with bounded average degree. Stanislav Jendrol, Mária Maceková, Mickaël Montassier, Roman Soták. Discussiones Mathematicae Graph Theory, 2016, 36 (2), pp.339-353. ⟨10.7151/dmgt.1859⟩. [DOI]
[19]Fractional Triangle Decompositions in Graphs with Large Minimum Degree. François Dross. SIAM Journal on Discrete Mathematics, 2016, 30 (1), pp.36-42. ⟨10.1137/15M1014310⟩. [DOI]
[18]Scattered packings of cycles. Aistis Atminas, Marcin Kamiński, Jean-Florent Raymond. Theoretical Computer Science, 2016, 647, pp.33 - 42. ⟨10.1016/j.tcs.2016.07.021⟩. [DOI]
[17]A lower bound on the order of the largest induced forest in planar graphs with high girth. François Dross, Mickaël Montassier, Alexandre Pinlou. Discrete Applied Mathematics, 2016, 214, pp.99-107. ⟨10.1016/j.dam.2016.06.011⟩. [DOI]
[16]Approximating the sparsest $k$-subgraph in chordal graph. Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Theory of Computing Systems, 2016, 58 (1), pp.111-132. ⟨10.1007/s00224-014-9568-2⟩. [DOI]
[15]On the complexity of Wafer-to-Wafer Integration. Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau. Discrete Optimization, 2016, 22 (part B), pp.255-269. ⟨10.1016/j.disopt.2016.07.001⟩. [DOI]
[14]An edge variant of the Erdős–Pósa property. Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. Discrete Mathematics, 2016, 339 (8), pp.2027-2035. ⟨10.1016/j.disc.2016.03.004⟩. [DOI]
[13]Contraction Obstructions for Connected Graph Searching. Best Micah J, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros. Discrete Applied Mathematics, 2016, 209, pp.27-47. ⟨10.1016/j.dam.2015.07.036⟩. [DOI]
[12]Detecting minors in matroids through triangles. Boris Albar, Daniel Gonçalves, Jorge Luis Ramírez Alfonsín. European Journal of Combinatorics, 2016, 53, pp.50-58. ⟨10.1016/j.ejc.2015.10.010⟩. [DOI]
[11]Minimal disconnected cuts in planar graphs. Marcin Kamiński, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos. Networks, 2016, 68 (4), pp.250-259. ⟨10.1002/net.21696⟩. [DOI]
[10](Meta) Kernelization. Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos. Journal of the ACM (JACM), 2016, 63 (5), pp.#44. ⟨10.1145/2973749⟩. [DOI]
[9]Orienting Triangulations. Boris Albar, Daniel Gonçalves, Kolja Knauer. Journal of Graph Theory, 2016, 83 (4), pp.392-405. ⟨10.1002/jgt.22005⟩. [DOI]
[8]Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar. ACM Transactions on Algorithms, 2016, 12 (2), pp.No. 21. ⟨10.1145/2797140⟩. [DOI]
[7]On the consistency of orthology relationships. Mark Jones, Christophe Paul, Celine Scornavacca. BMC Bioinformatics, 2016, 17 (S14), pp.11-14. ⟨10.1186/s12859-016-1267-3⟩. [DOI]
[6]Islands in graphs on surfaces. Louis Esperet, Pascal Ochem. SIAM Journal on Discrete Mathematics, 2016, 30 (1), pp.206-219. ⟨10.1137/140957883⟩. [DOI]
[5]Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique. Christophe Paul, Anthony Perez, Stéphan Thomassé. Journal of Computer and System Sciences, 2016, 82 (2), ⟨10.1016/j.jcss.2015.08.002⟩. [DOI]
[4]Parameterized certificate dispersal and its variants. Valentin Garnero, Mathias Weller. Theoretical Computer Science, 2016, 622, pp.66-78. ⟨10.1016/j.tcs.2016.02.001⟩. [DOI]
[3]Coloring non-crossing strings. Louis Esperet, Daniel Gonçalves, Arnaud Labourel. The Electronic Journal of Combinatorics, 2016, 23 (4), pp.4.4. ⟨10.37236/5710⟩. [DOI]
[2]Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. Julien Baste, Christophe Paul, Ignasi Sau, Celine Scornavacca. Bulletin of Mathematical Biology, 2016, 79 (4), pp.920-938. ⟨10.1007/s11538-017-0260-y⟩. [DOI]
[1]Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. Discrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.131-146. ⟨10.46298/dmtcs.2147⟩. [DOI]


Revues 2015

[21]Complexity dichotomy for oriented homomorphism of planar graphs with large girth. Guillaume Guégan, Pascal Ochem. Theoretical Computer Science, 2015, 596, pp.142-148. ⟨10.1016/j.tcs.2015.06.041⟩. [DOI]
[20]Characterization of some binary words with few squares. Golnaz Badkobeh, Pascal Ochem. Theoretical Computer Science, 2015, 588, pp.73-80. ⟨10.1016/j.tcs.2015.03.044⟩. [DOI]
[19]The role of planarity in connectivity problems parameterized by treewidth. Julien Baste, Ignasi Sau. Theoretical Computer Science, 2015, 570, pp.1-14. ⟨10.1016/j.tcs.2014.12.010⟩. [DOI]
[18]Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable. Marthe Bonamy. SIAM Journal on Discrete Mathematics, 2015, 29 (3), pp.1735-1763. ⟨10.1137/130927449⟩. [DOI]
[17]Hadwiger Number of Graphs with Small Chordality. Petr A. Golovach, Pinar Heggernes, Pim van 'T Hof, Christophe Paul. SIAM Journal on Discrete Mathematics, 2015, 29 (3), pp.1427-1451. ⟨10.1137/140975279⟩. [DOI]
[16]Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. Jørgen Bang-Jensen, Stéphane Bessy. Journal of Graph Theory, 2015, 79 (4), pp.249-266. ⟨10.1002/jgt.21830⟩. [DOI]
[15]Asteroidal quadruples in non rooted path graphs. Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato. Discussiones Mathematicae Graph Theory, 2015, 35 (4), pp.603-614. ⟨10.7151/dmgt.1821⟩. [DOI]
[14]Near-colorings: non-colorable graphs and NP-completeness. Mickaël Montassier, Pascal Ochem. The Electronic Journal of Combinatorics, 2015, 22 (1), pp.#P1.57. ⟨10.37236/3509⟩. [DOI]
[13]The Maximum Clique Problem in Multiple Interval Graphs. Mathew C. Francis, Daniel Gonçalves, Pascal Ochem. Algorithmica, 2015, 71 (4), pp.812-836. ⟨10.1007/s00453-013-9828-6⟩. [DOI]
[12]Excluding cycles with a fixed number of chords. Pierre Aboulker, Nicolas Bousquet. Discrete Applied Mathematics, 2015, 180, pp.11-24. ⟨10.1016/j.dam.2014.08.006⟩. [DOI]
[11]Classification of Coupled Dynamical Systems with Multiple Delays: Finding the Minimal Number of Delays. Leonhard Lücken, Jan Philipp Pade, Kolja Knauer. SIAM Journal on Applied Dynamical Systems, 2015, 14 (1), pp.286-304. ⟨10.1137/14097183X⟩. [DOI]
[10]Planar Disjoint-Paths Completion. Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos. Algorithmica, 2015, 76 (2), pp.401-425. ⟨10.1007/s00453-015-0046-2⟩. [DOI]
[9]Strong edge coloring sparse graphs. Julien Bensmail, Marthe Bonamy, Hervé Hocquard. Electronic Notes in Discrete Mathematics, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.773-778. ⟨10.1016/j.endm.2015.06.104⟩. [DOI]
[8]Independent Domination in Cubic Graphs. Paul Dorbec, Michael A. Henning, Mickaël Montassier, Justin Southey. Journal of Graph Theory, 2015, 80 (4), pp.329-349. ⟨10.1002/jgt.21855⟩. [DOI]
[7]Forbidding Kuratowski Graphs as Immersions. Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos. Journal of Graph Theory, 2015, 78 (1), pp.43-60. ⟨10.1002/jgt.21790⟩. [DOI]
[6]A single-exponential FPT algorithm for the K4-minor cover problem. Eun Jung Kim, Christophe Paul, Geevarghese Philip. Journal of Computer and System Sciences, 2015, 81 (1), pp.186-207. ⟨10.1016/j.jcss.2014.05.001⟩. [DOI]
[5]Explicit Linear Kernels via Dynamic Programming. Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. SIAM Journal on Discrete Mathematics, 2015, 29 (4), pp.1864-1894. ⟨10.1137/140968975⟩. [DOI]
[4]Two floor building needing eight colors. Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni. Journal of Graph Algorithms and Applications, 2015, 19 (1), pp.1--9. ⟨10.7155/jgaa.00344⟩. [DOI]
[3]The Erdős–Hajnal conjecture for paths and antipaths. Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé. Journal of Combinatorial Theory, Series B, 2015, 113, pp.261-264. ⟨10.1016/j.jctb.2015.01.001⟩. [DOI]
[2]Design of fault-tolerant on-board networks with variable switch sizes. Olivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane Pérennes. Theoretical Computer Science, 2015, 562, pp.75-89. ⟨10.1016/j.tcs.2014.09.034⟩. [DOI]
[1]Identifying codes in hereditary classes of graphs and VC-dimension. Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li, Aline Parreau, Stéphan Thomassé. SIAM Journal on Discrete Mathematics, 2015, 29 (4), pp.2047-2064. ⟨10.1137/14097879X⟩. [DOI]


Revues 2014

[27](Arc-)disjoint flows in networks. Jørgen Bang-Jensen, Stéphane Bessy. Theoretical Computer Science, 2014, 526, pp.28-40. ⟨10.1016/j.tcs.2014.01.011⟩. [DOI]
[26]Brooks’ theorem on powers of graphs. Marthe Bonamy, Nicolas Bousquet. Discrete Mathematics, 2014, 325, pp.12-16. ⟨10.1016/j.disc.2014.01.024⟩. [DOI]
[25]List coloring the square of sparse graphs with large degree. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. European Journal of Combinatorics, 2014, 41, pp.128-137. ⟨10.1016/j.ejc.2014.03.006⟩. [DOI]
[24]Square roots of minor closed graph classes. Nestor Nestoridis, Dimitrios M. Thilikos. Discrete Applied Mathematics, 2014, 168, pp.34 - 39. ⟨10.1016/j.dam.2013.05.026⟩. [DOI]
[23]Contracting chordal graphs and bipartite graphs to paths and trees. Pinar Heggernes, Pim van ’t Hof, Benjamin Lévêque, Christophe Paul. Discrete Applied Mathematics, 2014, LAGOS’11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina, 164, pp.444-449. ⟨10.1016/j.dam.2013.02.025⟩. [DOI]
[22]Contracting Graphs to Paths and Trees. Pinar Heggernes, Pim Van ’t Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul. Algorithmica, 2014, 68 (1), pp.109-132. ⟨10.1007/s00453-012-9670-2⟩. [DOI]
[21]More on square-free words obtained from prefixes by permutations. Pascal Ochem. Fundamenta Informaticae, 2014, Russian-Finnish Symposium in Discrete Mathematics, 132 (1), pp.109-112. ⟨10.3233/FI-2014-1035⟩. [DOI]
[20]Application of entropy compression in pattern avoidance. Pascal Ochem, Alexandre Pinlou. The Electronic Journal of Combinatorics, 2014, 21 (2), pp.1-12. ⟨10.37236/3038⟩. [DOI]
[19]Binary patterns in binary cube-free words: Avoidability and growth. Robert Mercaş, Pascal Ochem, Alexey V. Samsonov, Arseny M. Shur. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2014, 48 (4), pp.369-389. ⟨10.1051/ita/2014015⟩. [DOI]
[18]Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations. Daniel Gonçalves, Benjamin Lévêque. Discrete and Computational Geometry, 2014, 51 (1), pp.67-131. ⟨10.1007/s00454-013-9552-7⟩. [DOI]
[17]Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Pascal Ochem, Alexandre Pinlou. Graphs and Combinatorics, 2014, 30 (2), pp.439-453. ⟨10.1007/s00373-013-1283-2⟩. [DOI]
[16]Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. Discrete Mathematics, 2014, 317, pp.19-32. ⟨10.1016/j.disc.2013.10.022⟩. [DOI]
[15]On the bend-number of planar and outerplanar graphs. Daniel Heldt, Kolja Knauer, Torsten Ueckerdt. Discrete Applied Mathematics, 2014, 179, pp.109-119. ⟨10.1016/j.dam.2014.07.015⟩. [DOI]
[14]Practical and Efficient Circle Graph Recognition. Emeric Gioan, Christophe Paul, Marc Tedder, Derek Corneil. Algorithmica, 2014, 69 (4), pp.759-788. ⟨10.1007/s00453-013-9745-8⟩. [DOI]
[13]Outerplanar obstructions for matroid pathwidth. Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki. Discrete Mathematics, 2014, 315, pp.95-101. ⟨10.1016/j.disc.2013.10.007⟩. [DOI]
[12]Practical and Efficient Split Decomposition via Graph-Labelled Trees. Emeric Gioan, Christophe Paul, Marc Tedder, Derek Corneil. Algorithmica, 2014, 69 (4), pp.789-843. ⟨10.1007/s00453-013-9752-9⟩. [DOI]
[11]Lift-contractions. Petr A. Golovach, Daniël Paulusma, Marcin Kamiski, Dimitrios M. Thilikos. European Journal of Combinatorics, 2014, 35, pp.286-296. ⟨10.1016/j.ejc.2013.06.026⟩. [DOI]
[10]2-Distance Coloring of Sparse Graphs. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. Journal of Graph Theory, 2014, 77 (3), pp.190-218. ⟨10.1002/jgt.21782⟩. [DOI]
[9]Another remark on the radical of an ODD perfect number. Pascal Ochem, Michaël Rao. The Fibonacci Quarterly, 2014, 52 (3), pp.215-217.
[8]On the number of prime factors of an odd perfect number. Pascal Ochem, Michael Rao. Mathematics of Computation, 2014, 83 (289), pp.2435-2439. ⟨10.1090/S0025-5718-2013-02776-7⟩. [DOI]
[7]Parameterized domination in circle graphs. Christophe Paul, Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Ignasi Sau, Stéphan Thomassé. Theory of Computing Systems, 2014, 54 (1), pp.45-72. ⟨10.1007/s00224-013-9478-8⟩. [DOI]
[6]Dynamic Programming for Graphs on Surfaces. Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos. ACM Transactions on Algorithms, 2014, 10 (2), pp.1-26/8. ⟨10.1145/2556952⟩. [DOI]
[5]Organizing the atoms of the clique separator decomposition into an atom tree. Anne Berry, Romain Pogorelcnik, Geneviève Simonet. Discrete Applied Mathematics, 2014, 177, pp.1-13. ⟨10.1016/j.dam.2014.05.030⟩. [DOI]
[4]Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé. Journal of Graph Theory, 2014, 75 (3), pp.284-302. ⟨10.1002/jgt.21740⟩. [DOI]
[3]Clique versus Independent Set. Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé. European Journal of Combinatorics, 2014, 40, pp.73-92. ⟨10.1016/j.ejc.2014.02.003⟩. [DOI]
[2]Strong chromatic index of planar graphs with large girth. Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud. Discussiones Mathematicae Graph Theory, 2014, 34 (4), pp.723-733. ⟨10.7151/dmgt.1763⟩. [DOI]
[1]Hitting and harvesting pumpkins. Gwénaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé. SIAM Journal on Discrete Mathematics, 2014, 28 (3), pp.1363-1390. ⟨10.1137/120883736⟩. [DOI]


Revues 2013

[17]On approximating the $d$-girth of a graph. David Peleg, Ignasi Sau, Mordechai Shalom. Discrete Applied Mathematics, 2013, 161 (16-17), pp.2587-2596. ⟨10.1016/j.dam.2013.04.022⟩. [DOI]
[16]Polynomial kernels for Proper Interval Completion and related problems. Stéphane Bessy, Anthony Perez. Information and Computation, 2013, 231, pp.89-108. ⟨10.1016/j.ic.2013.08.006⟩. [DOI]
[15]On exact algorithms for the permutation CSP. Eun Jung Kim, Daniel Gonçalves. Theoretical Computer Science, 2013, 511, pp.109-116. ⟨10.1016/j.tcs.2012.10.035⟩. [DOI]
[14]Optimizing the Graph Minors Weak Structure Theorem. Archontia C. Giannopoulou, Dimitrios M. Thilikos. SIAM Journal on Discrete Mathematics, 2013, 27 (3), pp.1209-1227. ⟨10.1137/110857027⟩. [DOI]
[13]Obtaining a Bipartite Graph by Contracting Few Edges. Christophe Paul, Pinar Heggernes, Pim van 'T Hof, Daniel Lokshtanov. SIAM Journal on Discrete Mathematics, 2013, 27 (4), pp.2143-2156. ⟨10.1137/130907392⟩. [DOI]
[12]Adjacent vertex-distinguishing edge coloring of graphs with maximum degree $\Delta$. Hervé Hocquard, Mickaël Montassier. Journal of Combinatorial Optimization, 2013, 26 (1), pp.152-160. ⟨10.1007/s10878-011-9444-9⟩. [DOI]
[11]Asymptotic enumeration of non-crossing partitions on surfaces. Dimitrios M. Thilikos, Ignasi Sau, Juanjo Rué. Discrete Mathematics, 2013, pp.635-649. ⟨10.1016/j.disc.2012.12.011⟩. [DOI]
[10]Characterizing Graphs of Small Carving-Width. Rémy Belmonte, Pim van 'T Hof, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos. Discrete Applied Mathematics, 2013, pp.Electronic Edition. ⟨10.1016/j.dam.2013.02.036⟩. [DOI]
[9]Partitioning the arcs of a digraph into a star forests of the underlying graph with prescribed orientation properties. Jørgen Bang-Jensen, Daniel Gonçalves, Anders Yeo. Theoretical Computer Science, 2013, 475, pp.13-20. ⟨10.1016/j.tcs.2012.12.007⟩. [DOI]
[8]Strong edge-colouring and induced matchings. Hervé Hocquard, Pascal Ochem, Petru Valicov. Information Processing Letters, 2013, 113 (19-21), pp.836-843. ⟨10.1016/j.ipl.2013.07.026⟩. [DOI]
[7]Vertex Partitions of Graphs into Cographs and Stars. Paul Dorbec, Mickael Montassier, Pascal Ochem. Journal of Graph Theory, 2013, 75, pp.75-90. ⟨10.1002/jgt.21724⟩. [DOI]
[6]A Complexity Dichotomy for the Coloring of Sparse Graphs. Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou. Journal of Graph Theory, 2013, 73 (1), pp.85-102. ⟨10.1002/jgt.21659⟩. [DOI]
[5]Increasing the minimum degree of a graph by contractions. Petr A. Golovach, Marcin J. Kamiński, Daniël Paulusma, Dimitrios M. Thilikos. Theoretical Computer Science, 2013, 481, pp.74-84. ⟨10.1016/j.tcs.2013.02.030⟩. [DOI]
[4]Enumerating the edge-colourings and total colourings of a regular graph. Stéphane Bessy, Frédéric Havet. Journal of Combinatorial Optimization, 2013, 25 (4), pp.523-535. ⟨10.1007/s10878-011-9448-5⟩. [DOI]
[3]Locally identifying coloring in bounded expansion classes of graphs. Daniel Gonçalves, Aline Parreau, Alexandre Pinlou. Discrete Applied Mathematics, 2013, 161 (18), pp.2946-2951. ⟨10.1016/j.dam.2013.07.003⟩. [DOI]
[2]Complements of nearly perfect graphs. Andras Gyarfas, Zhentao Li, Raphael Machado, András Sebő, Stéphan Thomassé, Nicolas Trotignon. The Electronic Journal of Combinatorics, 2013, 4 (3), pp.299 - 310. ⟨10.4310/JOC.2013.v4.n3.a2⟩. [DOI]
[1]On the (non-)existence of polynomial kernels for $P_l$-free edge modification problems. Sylvain Guillemot, Frédéric Havet, Christophe Paul, Anthony Perez. Algorithmica, 2013, 65 (4), pp.900-926. ⟨10.1007/s00453-012-9619-5⟩. [DOI]


Revues 2012

[33]Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Stéphan Thomassé, Nicolas Bousquet. Combinatorics, Probability and Computing, 2012, 21, pp.512-514. ⟨10.1017/S0963548312000065⟩. [DOI]
[32]Sieve Methods for Odd Perfect Numbers. S. Adam Fletcher, P. Nielsen Pace, Pascal Ochem. Mathematics of Computation, 2012, 81, pp.1753-1776. ⟨10.1090/S0025-5718-2011-02576-7⟩. [DOI]
[31]Graph transformations preserving the stability number. Benjamin Lévêque, Dominique de Werra. Discrete Applied Mathematics, 2012, 160, pp.2752-2759. ⟨10.1016/j.dam.2011.08.023⟩. [DOI]
[30]Split Decomposition and Graph-Labelled Trees: Characterizations and Fully-Dynamic Algorithms for Totally Decomposable Graphs. Emeric Gioan, Christophe Paul. Discrete Applied Mathematics, 2012, 160 (6), pp.708-733. ⟨10.1016/j.dam.2011.05.007⟩. [DOI]
[29]L(p,q)-labeling of sparse graphs. Clément Charpentier, Mickaël Montassier, André Raspaud. Journal of Combinatorial Optimization, 2012, 25 (4), pp.646-660. ⟨10.1007/s10878-012-9507-6⟩. [DOI]
[28]Segment representation of a subclass of co-planar graphs. Mathew C. Francis, Jan Kratochvil, Tomáš Vyskočil. Discrete Mathematics, 2012, 312, pp.1815-1818. ⟨10.1016/j.disc.2012.01.024⟩. [DOI]
[27]A stability theorem on fractional covering of triangles by edges. Penny Haxell, Alexandr Kostochka, Stéphan Thomassé. European Journal of Combinatorics, 2012, 33 (5), pp.799-806. ⟨10.1016/j.ejc.2011.09.024⟩. [DOI]
[26]Repetition Thresholds for Subdivided Graphs and Trees. Pascal Ochem, Elise Vaslet. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2012, 46 (1), pp.123-130. ⟨10.1051/ita/2011122⟩. [DOI]
[25]On backbone coloring of graphs. Yuehua Bu, Mickaël Montassier, André Raspaud, Weifan Wang. Journal of Combinatorial Optimization, 2012, 23, pp.79-93. ⟨10.1007/s10878-010-9342-6⟩. [DOI]
[24]LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. Dimitrios M. Thilikos, Archontia C. Giannopoulou, Paul Hunter. Discrete Applied Mathematics, 2012, pp.2089-2097. ⟨10.1016/j.dam.2012.03.015⟩. [DOI]
[23]Triangle Contact Representations and Duality. Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. Discrete and Computational Geometry, 2012, 48 (1), pp.239-254. ⟨10.1007/s00454-012-9400-1⟩. [DOI]
[22]Catalan structures and dynamic programming in H-minor-free graphs. Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. Journal of Computer and System Sciences, 2012, 78 (5), pp.1606-1622. ⟨10.1016/j.jcss.2012.02.004⟩. [DOI]
[21]Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma. Journal of Combinatorial Optimization, 2012, pp.15. ⟨10.1007/s10878-012-9490-y⟩. [DOI]
[20]Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Gregory Gutin, Eunjung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo. Algorithmica, 2012, 64, pp.112-125. ⟨10.1007/s00453-011-9548-8⟩. [DOI]
[19]Fast Minor Testing in Planar Graphs. Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos. Algorithmica, 2012, 64 (1), pp.69-84. ⟨10.1007/s00453-011-9563-9⟩. [DOI]
[18]Odd Perfect Numbers are Greater than 10^1500. Pascal Ochem, Michael Rao. Mathematics of Computation, 2012, 81 (279), pp.1869-1877. ⟨10.1090/S0025-5718-2012-02563-4⟩. [DOI]
[17]Simpler multicoloring of triangle-free hexagonal graphs. Ignasi Sau, Petra Šparl, Janez Žerovnik. Discrete Mathematics, 2012, 312 (1), pp.181-187. ⟨10.1016/j.disc.2011.07.031⟩. [DOI]
[16]Some structural properties of planar graphs and their applications to 3-choosability. Min Chen, Mickaël Montassier, André Raspaud. Discrete Mathematics, 2012, 312 (2), pp.362-373. ⟨10.1016/j.disc.2011.09.028⟩. [DOI]
[15](k,1)-coloring of sparse graphs. Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud. Discrete Mathematics, 2012, 312 (6), pp.1128-1135. ⟨10.1016/j.disc.2011.11.031⟩. [DOI]
[14]D-cores: measuring collaboration of directed graphs based on degeneracy. Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis. Knowledge and Information Systems (KAIS), 2012, 35 (2), pp.311 - 343. ⟨10.1007/s10115-012-0539-0⟩. [DOI]
[13]Coloring vertices of a graph or finding a Meyniel obstruction. Kathie Cameron, Benjamin Lévêque, Frédéric Maffray. Theoretical Computer Science, 2012, 428, pp.10-17. ⟨10.1016/j.tcs.2011.12.018⟩. [DOI]
[12]Parameterized complexity of finding small degree-constrained subgraphs. Omid Amini, Ignasi Sau, Saket Saurabh. Journal of Discrete Algorithms, 2012, 10, pp.70-83. ⟨10.1016/j.jda.2011.05.001⟩. [DOI]
[11]On exact algorithms for treewidth. Hans L. Bodlaender, Fedor V. Fomin, Aries Koster, Dieter Kratsch, Dimitrios M. Thilikos. ACM Transactions on Algorithms, 2012, 9 (1), pp.12:1--12:23. ⟨10.1145/2390176.2390188⟩. [DOI]
[10]On graphs with no induced subdivision of K4. Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon. Journal of Combinatorial Theory, Series B, 2012, 102, pp.924-947. ⟨10.1016/j.jctb.2012.04.005⟩. [DOI]
[9]Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks. IEEE/ACM Transactions on Networking, 2012, 20, pp.1-15. ⟨10.1109/TNET.2012.2186462⟩. [DOI]
[8]On the Complexity of Entailment in Existential Conjunctive First Order Logic with Atomic Negation. Marie-Laure Mugnier, Geneviève Simonet, Michaël Thomazo. Information and Computation, 2012, 215, pp.8-31. ⟨10.1016/j.ic.2012.03.001⟩. [DOI]
[7]Cyclic orderings and cyclic arboricity of matroids. Jan van den Heuvel, Stéphan Thomassé. Journal of Combinatorial Theory, Series B, 2012, 102, pp.638-646. ⟨10.1016/j.jctb.2011.08.004⟩. [DOI]
[6]Quartets and Unrooted Phylogenetic Networks. Philippe Gambette, Vincent Berry, Christophe Paul. Journal of Bioinformatics and Computational Biology, 2012, 10 (4), pp.1250004.1-1250004.23. ⟨10.1142/S0219720012500047⟩. [DOI]
[5]GMPLS Label Space Minimization through Hypergraph Layouts. Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado. Theoretical Computer Science, 2012, 444, pp.3-16. ⟨10.1016/j.tcs.2012.01.033⟩. [DOI]
[4]Tree-representation of set families and applications to combinatorial decompositions. Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao. European Journal of Combinatorics, 2012, 33 (5), pp.688-711. ⟨10.1016/j.ejc.2011.09.032⟩. [DOI]
[3]On the approximability of some degree-constrained subgraph problems. Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh. Discrete Applied Mathematics, 2012, 160 (2), pp.1661-1679. ⟨10.1016/j.dam.2012.03.025⟩. [DOI]
[2]On Spanning Galaxies in Digraphs. Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. Discrete Applied Mathematics, 2012, 160 (6), pp.744-754. ⟨10.1016/j.dam.2011.07.013⟩. [DOI]
[1]Connected Graph Searching. Lali Barrière, Paola Flocchini, Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Nicola Santoro, Dimitrios M. Thilikos. Information and Computation, 2012, 219, pp.1-16. ⟨10.1016/j.ic.2012.08.004⟩. [DOI]


Revues 2011

[16]On self-duality of branchwidth in graphs of bounded genus. Ignasi Sau, Dimitrios M. Thilikos. Discrete Applied Mathematics, 2011, 159 (17), pp.2184-2186. ⟨10.1016/j.dam.2011.06.028⟩. [DOI]
[15]The Domination Number of Grids. Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé. SIAM Journal on Discrete Mathematics, 2011, 25, pp.1443-1453. ⟨10.1137/11082574⟩. [DOI]
[14]Algorithms and complexity results for persuasive argumentation. Eunjung Kim, Ordyniak Sebastian, Szeider Stefan. Artificial Intelligence, 2011, 175, pp.1722-1736. ⟨10.1016/j.artint.2011.03.001⟩. [DOI]
[13]Characterizing Directed Path Graphs by Forbidden Asteroids. Kathie Cameron, Chinh T. Hoàng, Benjamin Lévêque. Journal of Graph Theory, 2011, 68, pp.103-112. ⟨10.1002/jgt.20543⟩. [DOI]
[12]Bounds for the Generalized Repetition Threshold. Francesca Fiorenzi, Pascal Ochem, Elise Vaslet. Theoretical Computer Science, 2011, 412 (27), pp.2955-2963. ⟨10.1016/j.tcs.2010.10.009⟩. [DOI]
[11]Covering a Graph by Forests and a Matching. Tomáš Kaiser, Mickaël Montassier, André Raspaud. SIAM Journal on Discrete Mathematics, 2011, 25 (4), pp.1804-1811. ⟨10.1137/100818340⟩. [DOI]
[10]Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs. Xavier Muñoz, Zhentao Li, Ignasi Sau. SIAM Journal on Discrete Mathematics, 2011, 25 (4), pp.1490-1505. ⟨10.1137/090775440⟩. [DOI]
[9]A General Label Search to Investigate Classical Graph Search Algorithms. Geneviève Simonet, Anne Berry, Richard Krueger. Discrete Applied Mathematics, 2011, 159, pp.128-142. ⟨10.1016/j.dam.2010.02.011⟩. [DOI]
[8]Reconstruction combinatoire de réseaux phylogénétiques. Philippe Gambette. Biosystema, 2011, 28, pp.85-92.
[7]The Recognition of Tolerance and Bounded Tolerance Graphs. George B. Mertzios, Ignasi Sau, Shmuel Zaks. SIAM Journal on Computing, 2011, 40 (5), pp.1234-1257. ⟨10.1137/090780328⟩. [DOI]
[6]Faster parameterized algorithms for minor containment. Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos. Theoretical Computer Science, 2011, 412 (50), pp.7018-7028. ⟨10.1016/j.tcs.2011.09.015⟩. [DOI]
[5]Traffic grooming in bidirectional WDM ring networks. Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau. Networks, 2011, 58 (1), pp.20-35. ⟨10.1002/net.20410⟩. [DOI]
[4]Circuits in graphs through a prescribed set of ordered vertices. David Coudert, Frédéric Giroire, Ignasi Sau. Journal of Interconnection Networks, 2011, 11 (3-4), pp.121-141. ⟨10.1142/S0219265910002763⟩. [DOI]
[3]Kernel bounds for disjoint cycles and disjoint paths. Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo. Theoretical Computer Science, 2011, 412, pp.4570-4578. ⟨10.1016/j.tcs.2011.04.039⟩. [DOI]
[2]Kernels for feedback arc set in tournaments. Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé. Journal of Computer and System Sciences, 2011, 77 (6), pp.1071-1078. ⟨10.1016/j.jcss.2010.10.001⟩. [DOI]
[1]Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem. Guinez Flavio, Martin Matamala, Stéphan Thomassé. Discrete Applied Mathematics, 2011, 159, pp.23-30. ⟨10.1016/j.dam.2010.09.011⟩. [DOI]


Revues 2010

[22]On Vertex Partitions and some Minor-Monotone Parameters. Daniel Gonçalves. Journal of Graph Theory, 2010, 66 (1), pp.49-56. ⟨10.1002/jgt.20490⟩. [DOI]
[21]Partitioning a Graph into a Cycle and an Anticycle: A Proof of Lehel's Conjecture. Stéphane Bessy, Stéphan Thomassé. Journal of Combinatorial Theory, Series B, 2010, 100 (2), pp.176-180. ⟨10.1016/j.jctb.2009.07.001⟩. [DOI]
[20]A note on the acyclic 3-choosability of some planar graphs. Hervé Hocquard, Mickaël Montassier, André Raspaud. Discrete Applied Mathematics, 2010, 158 (10), pp.1104-1110. ⟨10.1016/j.dam.2010.02.005⟩. [DOI]
[19]An Introduction to Clique Minimal Separator Decomposition. Anne Berry, Romain Pogorelcnik, Geneviève Simonet. Algorithms, 2010, 3 (2), pp.197-215. ⟨10.3390/a3020197⟩. [DOI]
[18]Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. Ignasi Sau, Dimitrios M. Thilikos. Journal of Discrete Algorithms, 2010, 8 (3), pp.330-338. ⟨10.1016/j.jda.2010.02.002⟩. [DOI]
[17]A Survey on Algorithmic Aspects of Modular Decomposition. Michel Habib, Christophe Paul. Computer Science Review, 2010, 4 (1), pp.41-59. ⟨10.1016/j.cosrev.2010.01.001⟩. [DOI]
[16]Diamond-Free Circle Graphs are Helly Circle. Jean Daligault, Daniel Gonçalves, Michaël Rao. Discrete Mathematics, 2010, 310 (4), pp.845-849. ⟨10.1016/j.disc.2009.09.022⟩. [DOI]
[15]Planar Graphs Have 1-string Representations. Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem. Discrete and Computational Geometry, 2010, 43 ((3)), pp.626-647. ⟨10.1007/s00454-009-9196-9⟩. [DOI]
[14]Decomposition of sparse graphs into two forests, one having bounded maximum degree. Mickaël Montassier, André Raspaud, Xuding Zhu. Information Processing Letters, 2010, 110 (20), pp.913-916. ⟨10.1016/j.ipl.2010.07.009⟩. [DOI]
[13]Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. O.V. Borodin, A.O. Ivanova, Mickael Montassier, Pascal Ochem, André Raspaud. Journal of Graph Theory, 2010, 65 (2), pp.83-93. ⟨10.1002/jgt.20467⟩. [DOI]
[12]Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time. Christophe Crespelle, Philippe Gambette. Information Processing Letters, 2010, 110, pp.497-502. ⟨10.1016/j.ipl.2010.03.015⟩. [DOI]
[11]FPT Algorithms and Kernels for the Directed k-Leaf Problem. Jean Daligault, Gregory Gutin, Anders Yeo, Eunjung Kim. Journal of Computer and System Sciences, 2010, 76 (2), pp.144-152. ⟨10.1016/j.jcss.2009.06.005⟩. [DOI]
[10]Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau. SIAM Journal on Discrete Mathematics, 2010, 24 (2), pp.400-419. ⟨10.1137/080744190⟩. [DOI]
[9]Polynomial Kernels for 3-Leaf Power Graph Modification Problems. Stéphane Bessy, Christophe Paul, Anthony Perez. Discrete Applied Mathematics, 2010, 158 (16), pp.1732-1744. ⟨10.1016/j.dam.2010.07.002⟩. [DOI]
[8]Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni. Discrete Mathematics, 2010, 310 (3), pp.557--560. ⟨10.1016/j.disc.2009.03.039⟩. [DOI]
[7]Acyclic improper colourings of graphs with bounded maximum degree. Louigi Addario-Berry, Louis Esperet, Ross Kang, Colin Mcdiarmid, Alexandre Pinlou. Discrete Mathematics, 2010, 310 (2), pp.223-229. ⟨10.1016/j.disc.2008.09.009⟩. [DOI]
[6]Optical index of fault tolerant routings in WDM networks. Stéphane Bessy, Clément Lepelletier. Networks, 2010, 56 (2), pp.95-102. ⟨10.1002/net.20351⟩. [DOI]
[5]Graph Extremities Defined by Search Algorithms. Anne Berry, Jean R.S. Blair, Jean-Paul Bordat, Geneviève Simonet. Algorithms, 2010, 3 (2), pp.100-124. ⟨10.3390/a3020100⟩. [DOI]
[4]Homomorphisms of 2-edge-colored graphs. Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena. Discrete Applied Mathematics, 2010, 158 (12), pp.1365-1379. ⟨10.1016/j.dam.2009.09.017⟩. [DOI]
[3]Well-Quasi-Order of Relabel Functions. Jean Daligault, Michael Rao, Stéphan Thomassé. Order, 2010, 27, pp.301-315. ⟨10.1007/s11083-010-9174-0⟩. [DOI]
[2]WDM and Directed Star Arboricity. Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé. Combinatorics, Probability and Computing, 2010, 19, pp.161-182. ⟨10.1017/S0963548309990551⟩. [DOI]
[1]Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. Christophe Crespelle, Christophe Paul. Algorithmica, 2010, 58 (2), pp.405-432. ⟨10.1007/s00453-008-9273-0⟩. [DOI]


Revues 2009

[23]A Planar Linear Hypergraph Whose Edges Cannot be Represented as Straight Line Segments. Daniel Gonçalves. European Journal of Combinatorics, 2009, 30 (1), pp.280-282. ⟨10.1016/j.ejc.2007.12.004⟩. [DOI]
[22]Covering Planar Graphs with Forests, one Having Bounded Maximum Degree. Daniel Gonçalves. Journal of Combinatorial Theory, Series B, 2009, 99 (2), pp.314-322. ⟨10.1016/j.jctb.2008.07.004⟩. [DOI]
[21]Clique-Width and the Speed of Hereditary Properties. Peter Allen, Vadim Lozin, Michaël Rao. The Electronic Journal of Combinatorics, 2009, 16 (1), pp.11. ⟨10.37236/124⟩. [DOI]
[20]An Oriented Coloring of Planar Graphs with Girth at Least Five. Alexandre Pinlou. Discrete Mathematics, 2009, 309, pp.2108-2118. ⟨10.1016/j.disc.2008.04.030⟩. [DOI]
[19]Edge Maximal Graphs of Branchwidth k: The k-Branches. Christophe Paul, Jan Arne Telle. Discrete Mathematics, 2009, 309 (6), pp.1467-1475. ⟨10.1016/j.disc.2008.02.030⟩. [DOI]
[18]Clean the Graph Before You Draw It!. Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat. Information Processing Letters, 2009, 109 (10), pp.463-467. ⟨10.1016/j.ipl.2009.01.003⟩. [DOI]
[17]On Star and Caterpillar Arboricity. Daniel Gonçalves, Pascal Ochem. Discrete Mathematics, 2009, 309 (11), pp.3694-3702. ⟨10.1016/j.disc.2008.01.041⟩. [DOI]
[16]Kinetic Maintenance of Mobile k-Centres in Trees. Christophe Paul, Stéphane Durocher. Discrete Applied Mathematics, 2009, 157 (7), pp.1432-1446. ⟨10.1007/978-3-540-77120-3_31⟩. [DOI]
[15]Branchwidth of Chordal Graphs. Christophe Paul, Jan Arne Telle. Discrete Applied Mathematics, 2009, 157 (12), pp.2718-2725. ⟨10.1016/j.dam.2008.08.006⟩. [DOI]
[14]Interval completion is Fixed Parameter Tractable. Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle. SIAM Journal on Computing, 2009, 38 (5), pp.2007-2020. ⟨10.1137/070710913⟩. [DOI]
[13]On Two Techniques of Combining Branching and Treewidth. Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov. Algorithmica, 2009, 54 (2), pp.181-207. ⟨10.1007/s00453-007-9133-3⟩. [DOI]
[12]Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings. Anne Berry, Richard Krueger, Geneviève Simonet. SIAM Journal on Discrete Mathematics, 2009, 23 (1), pp.428-446. ⟨10.1137/070684355⟩. [DOI]
[11]Linear time 3-approximation for MAST problem. Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul. ACM Transactions on Algorithms, 2009, 5 (2), pp.1-18. ⟨10.1145/1497290.1497299⟩. [DOI]
[10]Characterizing path graphs by forbidden induced subgraphs. Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann. Journal of Graph Theory, 2009, 62 (4), pp.369-384. ⟨10.1002/jgt.20407⟩. [DOI]
[9]Exponential time algorithms for the minimum dominating set problem on some graph classes. Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca. ACM Transactions on Algorithms, 2009, 6, pp.article 9. ⟨10.1145/1644015.1644024⟩. [DOI]
[8]Complexity of $(p,1)$-Total Labelling. Frédéric Havet, Stéphan Thomassé. Discrete Applied Mathematics, 2009, 157, pp.2859-2870. ⟨10.1016/j.dam.2009.03.021⟩. [DOI]
[7]The Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids - 1 - The fully Optimal Basis of a Bounded Region. Emeric Gioan, Michel Las Vergnas. European Journal of Combinatorics, 2009, 30 (8 (special issue: Combinatorial Geometries and Applications: Oriented Matroids and Matroids)), pp.1868-1886. ⟨10.1016/j.ejc.2008.12.013⟩. [DOI]
[6]Partitions versus sets : a case of duality. Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé. European Journal of Combinatorics, 2009, pp.1-7. ⟨10.1016/j.ejc.2009.09.004⟩. [DOI]
[5]Computing Galled Networks from Real Data. Daniel Huson, Regula Rupp, Vincent Berry, Philippe Gambette, Christophe Paul. Bioinformatics, 2009, 25 (12), pp.i85-i93. ⟨10.1093/bioinformatics/btp217⟩. [DOI]
[4]On the Approximability Results for Maximum Agreement Subtree and Maximum Compatible Tree Problems. François Nicolas, Sylvain Guillemot, Vincent Berry, Christophe Paul. Discrete Applied Mathematics, 2009, 157 (7), pp.1555-1570. ⟨10.1016/j.dam.2008.06.007⟩. [DOI]
[3]Submodular Partition Functions. Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé. Discrete Mathematics, 2009, 309, pp.6000-6008. ⟨10.1016/j.disc.2009.04.033⟩. [DOI]
[2]Detecting induced subgraphs. Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon. Discrete Applied Mathematics, 2009, 157 (17), pp.3540-3551. ⟨10.1016/j.dam.2009.02.015⟩. [DOI]
[1]Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes. Sèverine Bérard, Annie Chateau, Cedric Chauve, Christophe Paul, Eric Tannier. Journal of Computational Biology, 2009, 16 (10), pp.1287-1309. ⟨10.1089/cmb.2009.0088⟩. [DOI]


Revues 2008

[17]Circuit-Cocircuit Reversing Systems in Regular Matroids. Emeric Gioan. Annals of Combinatorics, 2008, 12 (2), pp.171-182. ⟨10.1007/s00026-008-0345-2⟩. [DOI]
[16]Solving Some NP-Complete Problems using Split Decomposition. Michaël Rao. Discrete Applied Mathematics, 2008, 156 (14), pp.2768-2780. ⟨10.1016/j.dam.2007.11.013⟩. [DOI]
[15]On the L(p,1)-labelling of graphs. Daniel Gonçalves. Discrete Mathematics, 2008, 308 (8), pp.1405-1414. ⟨10.1016/j.disc.2007.07.075⟩. [DOI]
[14]Clique-width of graphs defined by one-vertex extensions. Michaël Rao. Discrete Mathematics, 2008, 308, pp.6157-6165. ⟨10.1016/j.disc.2007.11.039⟩. [DOI]
[13]Improved Layout of Phylogenetic Networks. Philippe Gambette, Daniel Huson. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2008, 5 (3), pp.472-479. ⟨10.1109/tcbb.2007.1046⟩. [DOI]
[12]Paths partition with prescribed beginnings in digraphs: A Chvátal–Erdős condition approach. Stéphane Bessy. Discrete Mathematics, 2008, 308 (18), pp.4108-4115. ⟨10.1016/j.disc.2007.07.113⟩. [DOI]
[11]Oriented Colorings of Partial 2-trees. Pascal Ochem, Alexandre Pinlou. Information Processing Letters, 2008, 108, pp.82-86. ⟨10.1016/j.ipl.2008.04.007⟩. [DOI]
[10]A Note on Computing Set Overlap Classes. Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao. Information Processing Letters, 2008, 108 (4), pp.186-191. ⟨10.1016/j.ipl.2008.05.005⟩. [DOI]
[9]A Simple Linear Time LexBFS Cograph Recongition Algorithm. Anna Bretscher, Derek Corneil, Michel Habib, Christophe Paul. SIAM Journal on Discrete Mathematics, 2008, 22 (4), pp.1277-1296. ⟨10.1137/060664690⟩. [DOI]
[8]A More Efficient Algorithm for Perfect Sorting by Reversals. Sèverine Bérard, Cedric Chauve, Christophe Paul. Information Processing Letters, 2008, 106, pp.90-95. ⟨10.1016/j.ipl.2007.10.012⟩. [DOI]
[7]The Hoàng-Reed Conjecture holds for tournaments. Frédéric Havet, Stéphan Thomassé, Anders Yeo. Discrete Mathematics, 2008, 308, pp.3412-3415. ⟨10.1016/j.disc.2007.06.033⟩. [DOI]
[6]Sequential and Parallel Triangulating Algorithms for Elimination Game and New Insights on Minimum Degree. Anne Berry, Elias Dahlhaus, Pinar Heggernes, Geneviève Simonet. Theoretical Computer Science, 2008, 409 (3), pp.601-616. ⟨10.1016/j.tcs.2008.09.059⟩. [DOI]
[5]On the Oriented Chromatic Index of Oriented Graphs. Pascal Ochem, Alexandre Pinlou, Eric Sopena. Journal of Graph Theory, 2008, 57 (4), pp.313-332. ⟨10.1002/jgt.20286⟩. [DOI]
[4]Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Mickaël Montassier, Pascal Ochem, Alexandre Pinlou. Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.1-24. ⟨10.46298/dmtcs.418⟩. [DOI]
[3]Optimal Distance Labeling for Interval Graphs and Related Graphs Families. Cyril Gavoille, Christophe Paul. SIAM Journal on Discrete Mathematics, 2008, 22 (3), pp.1239-1258. ⟨10.1137/050635006⟩. [DOI]
[2]Competitive Graph Searches. Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. Theoretical Computer Science, 2008, 393 (1-3), pp.72-80. ⟨10.1016/j.tcs.2007.10.048⟩. [DOI]
[1]Finding a Vector Orthogonal to Roughly Half a Collection of Vectors. Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé. Journal of Complexity, 2008, 24, pp.39-53. ⟨10.1016/j.jco.2006.09.005⟩. [DOI]

Conférences 2008 - 2024


Conférences 2024

[1]Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. Stéphane Bessy, Stéphan Thomassé, Laurent Viennot. STACS 2024 - 41st International Symposium on Theoretical Aspects of Computer Science, Mar 2024, Clermont-Ferrand, France. pp.13:1-13:12, ⟨10.4230/LIPIcs.STACS.2024.13⟩. [DOI]


Conférences 2023

[11]Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes. Petr Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3684-3699, ⟨10.1137/1.9781611977554.ch141⟩. [DOI]
[10]FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii. Sayan Bandyapadhyay, William Lochet, Saket Saurabh. SoCG 2023 - 39th International Symposium on Computational Geometry, Jun 2023, Dallas, TX, United States. pp.12:1-12:14, ⟨10.4230/LIPIcs.SoCG.2023.12⟩. [DOI]
[9]Kernelization for Graph Packing Problems via Rainbow Matching. Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht. SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩. [DOI]
[8]Excluding Single-Crossing Matching Minors in Bipartite Graphs. Archontia Giannopoulou, Dimitrios M. Thilikos, Sebastian Wiederrecht. SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2023, Florence, Italy. pp.2111-2121, ⟨10.1137/1.9781611977554.ch81⟩. [DOI]
[7]Minimum-Membership Geometric Set Cover, Revisited. Sayan Bandyapadhyay, William Lochet, Saket Saurabh, Jie Xue. SoCG 2023 - 39th International Symposium on Computational Geometry, Jun 2023, Dallas, United States. pp.11:1-11:14, ⟨10.4230/LIPIcs.SoCG.2023.11⟩. [DOI]
[6]Compound Logics for Modification Problems. Fedor V. Fomin, Petr A. Golovach, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.1-21, ⟨10.4230/LIPIcs.ICALP.2023.51⟩. [DOI]
[5]Dynamic programming on bipartite tree decompositions. Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos. IPEC 2023 - 18th International Symposium on Parameterized and Exact Computation, Sep 2023, Amsterdam, Netherlands. pp.16:1-16:22, ⟨10.4230/LIPIcs.IPEC.2023.26⟩. [DOI]
[4]PACE Solver Description: Touiouidth. Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Rocton. IPEC 2023 - 18th International Symposium on Parameterized and Exact Computation, Sep 2023, Amsterdam, Netherlands. pp.4, ⟨10.4230/LIPIcs.IPEC.2023.38⟩. [DOI]
[3]Faster parameterized algorithms for modification problems to minor-closed classes. Laure Morelle, Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. ICALP 2023 - 50th International Colloquium on Automata, Languages and Programming, Jul 2023, Paderborn, Germany. pp.93:1-93:19, ⟨10.4230/LIPIcs.ICALP.2023.93⟩. [DOI]
[2]Nonrepetitive colorings of $R^d$. Kathleen Barsse, Daniel Gonçalves, Matthieu Rosenfeld. Eurocom 2023 - 12th European Conference on Combinatorics, Graph Theory and Applications, Aug 2023, Prague, Czech Republic. pp.114-119, ⟨10.5817/CZ.MUNI.EUROCOMB23-016⟩. [DOI]
[1]New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. Victor Campos, Jonas Costa, Raul Lopes, Ignasi Sau. ESA 2023 - 31st Annual European Symposium on Algorithms, Sep 2023, Amsterdam, Netherlands. pp.30:1-30:18, ⟨10.4230/LIPIcs.ESA.2023.30⟩. [DOI]


Conférences 2022

[5]On counting orientations for graph homomorphisms and for dually embedded graphs using the Tutte polynomial of matroid perspectives. Emeric Gioan. ICGT 2022 - 11th International Colloquium on Graph Theory and Combinatorics, Jul 2022, Montpellier, France.
[4]On Comparable Box Dimension. Zdeněk Dvořák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt. SoCG 2022 - 38th International Symposium on Computational Geometry, Jun 2022, Berlin, Germany. pp.38:1--38:14, ⟨10.4230/LIPIcs.SoCG.2022.38⟩. [DOI]
[3]Reducing the Vertex Cover Number via Edge Contraction. Paloma T. Lima, Vinicius Fernandes dos Santos, Ignasi Sau, Uéverton dos Santos Souza, Prafullkumar Tale. 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.69⟩. [DOI]
[2]Killing a vortex. Dimitrios M. Thilikos, Sebastian Wiederrecht. FOCS 2022 - 63rd IEEE Annual Symposium on Foundations of Computer Science, Oct 2022, Denver, United States. pp.1069-1080, ⟨10.1109/FOCS54457.2022.00104⟩. [DOI]
[1]Optimization problems in graphs with locational uncertainty. Marin Bougeret, Jérémy Omer, Michael Poss. ROADEF 2022 - 23e 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.


Conférences 2021

[7]The Chromatic Number of Signed Graphs with Bounded Maximum Average Degree. Fabien Jacques, Alexandre Pinlou. EuroComb 2021 - European Conference on Combinatorics, Graph Theory and Applications, Sep 2021, Barcelone (online), Spain. pp.657-662, ⟨10.1007/978-3-030-83823-2_105⟩. [DOI]
[6]On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle. FCT 2021 - 23rd International Symposium on Fundamentals of Computation Theory, Sep 2021, Athens, Greece. pp.287-300, ⟨10.1007/978-3-030-86593-1_20⟩. [DOI]
[5]Hcore-Init: Neural Network Initialization based on Graph Degeneracy. Stratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis. ICPR 2020 - 25th International Conference on Pattern Recognition, Jan 2021, Milan (Virtual), Italy. pp.5852-5858, ⟨10.1109/ICPR48806.2021.9412940⟩. [DOI]
[4]A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. Júlio Araújo, Marin Bougeret, Victor Campos, Ignasi Sau. 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⟩. [DOI]
[3]A Constant-Factor Approximation for Weighted Bond Cover. Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos. APPROX/RANDOM 2021 - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Aug 2021, Seattle, United States. pp.7:1--7:14, ⟨10.4230/LIPIcs.APPROX/RANDOM.2021.7⟩. [DOI]
[2]Parameterized Complexity of Elimination Distance to First-Order Logic Properties. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. LICS 2021 - 36th ACM/IEEE Symposium on Logic in Computer Science, Jun 2021, Rome, Italy. pp.1-13, ⟨10.1109/LICS52264.2021.9470540⟩. [DOI]
[1]Cliques in exact distance powers of graphs of given maximum degree. Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov. 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⟩. [DOI]


Conférences 2020

[11]Hierarchical Clusterings of Unweighted Graphs. Svein Hogemo, Christophe Paul, Jan Arne Telle. MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.47:1-47:13, ⟨10.4230/LIPIcs.MFCS.2020.47⟩. [DOI]
[10]Hitting topological minor models in planar graphs is fixed parameter tractable. Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. SODA 2020 - 31st Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.931-950, ⟨10.1137/1.9781611975994.56⟩. [DOI]
[9]On the complexity of finding large odd induced subgraphs and odd colorings. Rémy Belmonte, Ignasi Sau. WG 2020 - 46th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2020, Leeds, United Kingdom. pp.67-79, ⟨10.1007/978-3-030-60440-0_6⟩. [DOI]
[8]An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. ICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrücken, Germany. pp.95:1-95:20, ⟨10.4230/LIPIcs.ICALP.2020.95⟩. [DOI]
[7]A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos. SODA 2020 - 31st Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2020, Salt Lake City, UT, United States. pp.951-970, ⟨10.1137/1.9781611975994.57⟩. [DOI]
[6]Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel. Marin Bougeret, Bart M P Jansen, Ignasi Sau. ICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrücken, Germany. pp.16:1--16:19, ⟨10.4230/LIPIcs.ICALP.2020.16⟩. [DOI]
[5]Reducing Graph Transversals via Edge Contractions. Paloma T. Lima, Vinicius Fernandes dos Santos, Ignasi Sau, Uéverton dos Santos Souza. MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.64:1-64:15, ⟨10.4230/LIPIcs.MFCS.2020.64⟩. [DOI]
[4]A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. Raul Lopes, Ignasi Sau. MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.68:1-68:15, ⟨10.4230/LIPIcs.MFCS.2020.68⟩. [DOI]
[3]Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. Ignasi Sau, Uéverton dos Santos Souza. MFCS 2020 - 45th International Symposium on Mathematical Foundations of Computer Science, Aug 2020, Prague, Czech Republic. pp.82:1-82:15, ⟨10.4230/LIPIcs.MFCS.2020.82⟩. [DOI]
[2]An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL. Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos. ESA 2020 - 28th Annual European Symposium on Algorithms, Sep 2020, Pisa, Italy. pp.51:1-51:17, ⟨10.4230/LIPIcs.ESA.2020.51⟩. [DOI]
[1]A linear fixed parameter tractable algorithm for connected pathwidth. Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos. ESA 2020 - 28th Annual European Symposium on Algorithms, Sep 2020, Milan, Italy. pp.64:1-64:16, ⟨10.4230/LIPIcs.ESA.2020.64⟩. [DOI]


Conférences 2019

[13]The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degree. Fabien Jacques, Mickaël Montassier, Alexandre Pinlou. BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France.
[12]3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes. Daniel Gonçalves. WG 2019 - 45th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2019, Vall de Núria, Spain. pp.351-363, ⟨10.1007/978-3-030-30786-8_27⟩. [DOI]
[11]Clustering to Given Connectivities. Petr A. Golovach, Dimitrios M. Thilikos. IPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.18:1-18:17, ⟨10.4230/LIPIcs.IPEC.2019.18⟩. [DOI]
[10]Every Collinear Set in a Planar Graph Is Free. Vida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote. SODA 2019 - 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2019, San Diego, CA, United States. pp.1521-1538, ⟨10.1137/1.9781611975482.92⟩. [DOI]
[9]Modification to Planarity is Fixed Parameter Tractable. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.28:1--28:17, ⟨10.4230/LIPIcs.STACS.2019.28⟩. [DOI]
[8]r-hued coloring of planar graphs with girth at least 8. Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov. BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France.
[7]Lean Tree-Cut Decompositions: Obstructions and Algorithms. Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.32:1--32:14, ⟨10.4230/LIPIcs.STACS.2019.32⟩. [DOI]
[6]Approximation results for makespan minimization with budgeted uncertainty. Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder. WAOA 2019 - 17th International Workshop on Approximation and Online Algorithms, Sep 2019, Munich, Germany. pp.60-71, ⟨10.1007/978-3-030-39479-0_5⟩. [DOI]
[5]Packing Arc-Disjoint Cycles in Tournaments. Stéphane Bessy, Marin Bougeret, Ramaswamy Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi. MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.27:1-27:14, ⟨10.4230/LIPIcs.MFCS.2019.27⟩. [DOI]
[4]Connected Search for a Lazy Robber. Isolde Adler, Christophe Paul, Dimitrios M. Thilikos. FSTTCS 2019 - 39th IARCS Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2019, Bombay, India. pp.7:1--7:14, ⟨10.4230/LIPIcs.FSTTCS.2019.7⟩. [DOI]
[3]Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. Stéphane Bessy, Marin Bougeret, Alan D.A. Carneiro, Fábio Protti, Uéverton dos Santos Souza. 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⟩. [DOI]
[2]Minimum Reload Cost Graph Factors. Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos. SOFSEM 2019 - 45th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2019, Nový Smokovec, Slovakia. pp.67-80, ⟨10.1007/978-3-030-10801-4_7⟩. [DOI]
[1]Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization. Guilherme C. M. Gomes, Ignasi Sau. IPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.19:1--19:15, ⟨10.4230/LIPIcs.IPEC.2019.19⟩. [DOI]


Conférences 2018

[10]Planar Graphs as L-intersection or L-contact graphs. Daniel Gonçalves, Lucas Isenmann, Claire Pennarun. SODA: Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.172-184, ⟨10.1137/1.9781611975031.12⟩. [DOI]
[9]Partial complementation of graphs. Fedor V. Fomin, Petr A. Golovach, Torstein J F Strømme, Dimitrios M. Thilikos. SWAT: Scandinavian Workshops on Algorithm Theory, Jun 2018, Malmö, Sweden. pp.21:1--21:13, ⟨10.4230/LIPIcs.SWAT.2018.21⟩. [DOI]
[8]Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma. Ioannis Giotis, Lefteris Kirousis, John Livieratos, Kostas I Psaromiligkos, Dimitrios M. Thilikos. International Conference on Random and Exhaustive Generation of Combinatorial Structures (GASCom), Jun 2018, Athens, Greece. pp.148-155.
[7]On the complexity of finding internally vertex-disjoint long directed paths. Julio Araujo, Victor Campos, Ana Karolinna Maia de Oliveira, Ignasi Sau, Ana Silva. LATIN 2018 - 13th Latin American Symposium on Theoretical Informatics, Apr 2018, Buenos Aires, Argentina. pp.66-79, ⟨10.1007/978-3-319-77404-6_6⟩. [DOI]
[6]Temporal matching in link stream: kernel and approximation. Julien Baste, Binh-Minh Bui-Xuan. CTW 2018 - 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jun 2018, Paris, France.
[5]Computing Small Pivot-Minors. Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma. WG 2018 - 44th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2018, Cottbus, Germany. pp.125-138, ⟨10.1007/978-3-030-00256-5_11⟩. [DOI]
[4]A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos. IPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.2:1--2:13, ⟨10.4230/LIPIcs.IPEC.2018.2⟩. [DOI]
[3]Data-Compression for Parametrized Counting Problems on Sparse Graphs. Eun Jung Kim, Maria Serna, Dimitrios M. Thilikos. 29th International Symposium on Algorithms and Computation (ISAAC), Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.20:1--20:13, ⟨10.4230/LIPIcs.ISAAC.2018.20⟩. [DOI]
[2]Discrete Morse theory for the collapsibility of supremum sections. Balthazar Bauer, Lucas Isenmann. ICGT: International Colloquium on Graph Theory and combinatorics, Jul 2018, Lyon, France.
[1]Dual parameterization of Weighted Coloring. Julio Araujo, Victor Campos, Carlos Vinícius G. C. Lima, Vinicius Fernandes dos Santos, Ignasi Sau, Ana Silva. IPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.12:1--12:14, ⟨10.4230/LIPIcs.IPEC.2018.12⟩. [DOI]


Conférences 2017

[14]Integer vectors and combinatorial properties of affine dependencies of ±1 vectors over the reals. Emeric Gioan, Ilda da Silva. Symmetry in Finite and Infinite Structures, Jul 2017, Lisbonne, Portugal.
[13]On the Number of Labeled Graphs of Bounded Treewidth. Julien Baste, Marc Noy, Ignasi Sau. WG 2017 - 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.88-99, ⟨10.1007/978-3-319-68705-6_7⟩. [DOI]
[12]Dushnik-Miller dimension of TD-Delaunay complexes. Daniel Gonçalves, Lucas Isenmann. EuroCG: European Workshop on Computational Geometry, Apr 2017, Malmo, Sweden.
[11]Contraction-Bidimensionality of Geometric Intersection Graphs. Julien Baste, Dimitrios M. Thilikos. IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.5:1--5:13, ⟨10.4230/LIPIcs.IPEC.2017.5⟩. [DOI]
[10]Uniquely Restricted Matchings and Edge Colorings. Julien Baste, Dieter Rautenbach, Ignasi Sau. WG 2017 - 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.100-112, ⟨10.1007/978-3-319-68705-6_8⟩. [DOI]
[9]Triangle packing in (sparse) tournaments: approximation and kernelization. Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut. ESA 2017 - 25th Annual European Symposium on Algorithms, Sep 2017, Vienne, Austria. pp.14:1--14:13, ⟨10.4230/LIPIcs.ESA.2017.14⟩. [DOI]
[8]How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?. Marin Bougeret, Ignasi Sau. IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.10:1--10:13, ⟨10.4230/LIPIcs.IPEC.2017.10⟩. [DOI]
[7]Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos. IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.4:1--4:12, ⟨10.4230/LIPIcs.IPEC.2017.4⟩. [DOI]
[6]Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. Florian Barbero, Christophe Paul, Michał Pilipczuk. 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), Jul 2017, Warsaw, Poland. pp.70:1--70:13, ⟨10.4230/LIPIcs.ICALP.2017.70⟩. [DOI]
[5]On Some Interesting Ternary Formulas. Pascal Ochem, Matthieu Rosenfeld. WORDS 2017 - 11th International Conference on Combinatorics on Words, Sep 2017, Montreal, Canada. pp.30-35, ⟨10.1007/978-3-319-66396-8_4⟩. [DOI]
[4]Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. Julien Baste, Didem Gözüpek, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos. IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.3:1--3:12, ⟨10.4230/LIPIcs.IPEC.2017.3⟩. [DOI]
[3]Structured Connectivity Augmentation. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos. MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.29:1--29:13, ⟨10.4230/LIPIcs.MFCS.2017.29⟩. [DOI]
[2]Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. ICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15, ⟨10.4230/LIPIcs.ICALP.2017.57⟩. [DOI]
[1]Complexity Dichotomies for the Minimum $F$-Overlay Problem. Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant. 28th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2017, Newcastle, Australia. pp.116-127, ⟨10.1007/978-3-319-78825-8_10⟩. [DOI]


Conférences 2016

[13]Partitioning sparse graphs into an independent set and a forest of bounded degree. François Dross, Mickaël Montassier, Alexandre Pinlou. BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France.
[12]Beaux ordres et graphes. Jean-Florent Raymond. Journées du GDR-IM 2016, 2016, Paris, France. 2016.
[11]Colouring Diamond-free Graphs. Konrad K. Dabrowski, François Dross, Daniël Paulusma. SWAT: Scandinavian Workshops on Algorithm Theory, 2016, Reykjavik, Iceland. pp.16:1--16:14, ⟨10.4230/LIPIcs.SWAT.2016.16⟩. [DOI]
[10]On a conjecture on k-Thue sequences. Borut Lužar, Martina Mockovčiaková, Pascal Ochem, Alexandre Pinlou, Roman Soták. BGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France.
[9]Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem. Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau. ISCO: International Symposium on Combinatorial Optimization, May 2016, Vietri sul Mare, Italy. pp.148-159, ⟨10.1007/978-3-319-45587-7_13⟩. [DOI]
[8]Avoidability of Formulas with Two Variables. Pascal Ochem, Matthieu Rosenfeld. 20th International Conference on Developments in Language Theory (DLT 2016), Laboratoire de combinatoire et d'informatique mathématique (LaCIM), Université du Québec à Montréal, Jul 2016, Montréal, Canada. pp.344-354, ⟨10.1007/978-3-662-53132-7_28⟩. [DOI]
[7]FPT Algorithms for Plane Completion Problems. Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros. MFCS: Mathematical Foundations of Computer Science, Aug 2016, Kraków, Poland. pp.26:1-26:13, ⟨10.4230/LIPIcs.MFCS.2016.26⟩. [DOI]
[6]Packing and Covering Immersion Models of Planar subcubic Graphs. Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. WG 2016 - 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84, ⟨10.1007/978-3-662-53536-3_7⟩. [DOI]
[5]On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs. Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.423-437, ⟨10.1007/978-3-319-48749-6_31⟩. [DOI]
[4]Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordeshai Shalom. WG 2016 - 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.195-206, ⟨10.1007/978-3-662-53536-3_17⟩. [DOI]
[3]Cutwidth: obstructions and algorithmic aspects. Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna. IPEC 2016 - 11th International Symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13, ⟨10.4230/LIPIcs.IPEC.2016.15⟩. [DOI]
[2]Revival d'un challenge d'optimisation. Eric Bourreau, Brett Choquet, Valentin Pollet, Jocelyn Thiebaut, Bruno Yun. ROADEF 2016 - 17e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2016, Compiègne, France.
[1]Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. Julien Baste, Christophe Paul, Ignasi Sau, Celine Scornavacca. AAIM: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.53-64, ⟨10.1007/978-3-319-41168-2_5⟩. [DOI]


Conférences 2015

[17]Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. François Dross, Mickaël Montassier, Alexandre Pinlou. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.269-275, ⟨10.1016/j.endm.2015.06.037⟩. [DOI]
[16]An alternative proof for the constructive Asymmetric Lovász Local Lemma. Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, İstanbul, Turkey.
[15]On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. ANALCO: Analytic Algorithmics and Combinatorics, Jan 2015, San Diego, California, United States. ⟨10.1137/1.9781611973761.2⟩. [DOI]
[14]Orienting triangulations. Boris Albar, Daniel Gonçalves, Kolja Knauer. EuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia.
[13]Minimal Disconnected Cuts in Planar Graphs. Marcin J. Kaminski, Daniël Paulusma, Stewart Anthony, Dimitrios M. Thilikos. FCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.243-254, ⟨10.1007/978-3-319-22177-9_19⟩. [DOI]
[12]A Fixed Parameter Algorithm for Plane Subgraph Completion. Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros. CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, Istanbul, Turkey.
[11]Variants of Plane Diameter Completion. Clément Requilé, Dimitrios M. Thilikos, Petr A. Golovach. IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.30-42, ⟨10.4230/LIPIcs.IPEC.2015.30⟩. [DOI]
[10]On Independent Set on B1-EPG Graphs. Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul. WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩. [DOI]
[9]An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132, ⟨10.1007/978-3-319-28684-6_11⟩. [DOI]
[8]Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma. 25th International Workshop on Combinatorial Algorithms (IWOCA), Oct 2015, Verona, Italy. pp.100-111, ⟨10.1007/978-3-319-29516-9_9⟩. [DOI]
[7]Editing to a Planar Graph of Given Degrees. Konrad K. Dabrowski, Petr A. Golovach, Pim Van'T Hof, Daniël Paulusma, Dimitrios M. Thilikos. CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.143-156, ⟨10.1007/978-3-319-20297-6_10⟩. [DOI]
[6]Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations. Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant. FCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.189-201, ⟨10.1007/978-3-319-22177-9_15⟩. [DOI]
[5]An FPT 2-Approximation for Tree-cut Decomposition. Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46, ⟨10.1007/978-3-319-28684-6_4⟩. [DOI]
[4]Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89, ⟨10.4230/LIPIcs.IPEC.2015.78⟩. [DOI]
[3]Induced minors and well-quasi-ordering. Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.197-201, ⟨10.1016/j.endm.2015.06.029⟩. [DOI]
[2]A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller. CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩. [DOI]
[1]An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Mamadou Moustapha Kanté, Eun Jung Kim, O-Joung Kwon, Christophe Paul. IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.138-150, ⟨10.4230/LIPIcs.IPEC.2015.138⟩. [DOI]


Conférences 2014

[21]The role of planarity in connectivity problems parameterized by treewidth. Julien Baste, Ignasi Sau. IPEC 2014 - 9th International Symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.63-74, ⟨10.1007/978-3-319-13524-3_6⟩. [DOI]
[20]A 14$k$-Kernel for Planar Feedback Vertex Set via Region Decomposition. Marthe Bonamy, Lukasz Kowalik. IPEC 2014 - 9th International Symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.97-109, ⟨10.1007/978-3-319-13524-3_9⟩. [DOI]
[19]Geometric Extensions of Cutwidth in any Dimension. Menelaos Karavelas, Dimitris Zoros, Spyridon Maniatis, Dimitrios M. Thilikos. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
[18]Detecting minors in matroids throughout triangles. Boris Albar, Daniel Gonçalves, Jorge Luis Ramírez Alfonsín. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
[17]Intersection Graphs of L-Shapes and Segments in the Plane. Stefan Felsner, Kolja Knauer, George B. Mertzios, Torsten Ueckerdt. MFCS: Mathematical Foundations of Computer Science, Aug 2014, Budapest, Hungary. pp.299-310, ⟨10.1007/978-3-662-44465-8_26⟩. [DOI]
[16]Entropy compression method applied to graph colorings. Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou. ICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France.
[15]Bidimensionality of Geometric Intersection Graphs. Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos. SOFSEM: Theory and Practice of Computer Science, Jan 2014, Špindlerův Mlýn, Czech Republic. pp.293-305, ⟨10.1007/978-3-319-04298-5_26⟩. [DOI]
[14]Structure of W_4 -immersion free graphs. Rémy Belmonte, Archontia C. Giannopoulou, Daniel Lokshtanov, Dimitrios M. Thilikos. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
[13]An edge variant of the Erdős-Pósa property. Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
[12]Hadwiger Number of Graphs with Small Chordality. Petr A. Golovach, Pinar Heggernes, Pim van 'T Hof, Christophe Paul. WG 2014 - 40th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-Fuzelier, France. pp.201-213, ⟨10.1007/978-3-319-12340-0_17⟩. [DOI]
[11]The Parameterized Complexity of Graph Cyclability. Petr A. Golovach, Marcin Kamiski, Spyridon Maniatis, Dimitrios M. Thilikos. ESA 2014 - 22nd European Symposium on Algorithms, Sep 2014, Wrocław, Poland. pp.492-504, ⟨10.1007/978-3-662-44777-2_41⟩. [DOI]
[10]CORECLUSTER: A Degeneracy Based Graph Clustering Framework. Christos Giatsidis, Fragkiskos Malliaros, Dimitrios M. Thilikos, Michalis Vazirgiannis. IAAA: Innovative Applications of Artificial Intelligence, Jul 2014, Quebec City, Canada.
[9]Making Octants Colorful and Related Covering Decomposition Problems. Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt. SODA 2014 - 25th ACM/SIAM Symposium on Discrete Algorithms, Jan 2014, Portland, United States. pp.1424-1432, ⟨10.1137/1.9781611973402.105⟩. [DOI]
[8]Convexity in partial cubes: the Hull number. Marie Albenque, Kolja Knauer. 11th Latin American Symposium on Theoretical Informatics (LATIN), Mar 2014, Montevideo, Uruguay. pp.421-432, ⟨10.1007/978-3-642-54423-1_37⟩. [DOI]
[7]Contraction Obstructions for Connected Graph Searching. Best Micah J, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
[6]Covering and packing pumpkin models. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
[5]Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant. SOFSEM: Theory and Practice of Computer Science, Jan 2014, Nový Smokovec, Slovakia. pp.150-161, ⟨10.1007/978-3-319-04298-5_14⟩. [DOI]
[4]Explicit linear kernels via dynamic programming. Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324, ⟨10.4230/LIPIcs.STACS.2014.312⟩. [DOI]
[3]Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. Steven Chaplick, Paul Dorbec, Jan Kratochvil, Mickaël Montassier, Juraj Stacho. WG 2014 - 40th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-fuzelier, France. pp.139-151, ⟨10.1007/978-3-319-12340-0_12⟩. [DOI]
[2]Quantifying trust dynamics in signed graphs, the S-Cores approach. Christos Giatsidis, Bogdan Cautis, Silviu Maniu, Michalis Vazirgiannis, Dimitrios M. Thilikos. SDM 2014 - 14th SIAM International Conference on Data Mining, Aug 2014, Philadelphia, United States. pp.668-676, ⟨10.1137/1.9781611973440.77⟩. [DOI]
[1]Recognition of dynamic circle graphs. Christophe Crespelle, Emeric Gioan, Christophe Paul. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.


Conférences 2013

[11]Planar graphs with Δ ≥ 8 are (Δ + 1)-edge-choosable. Marthe Bonamy. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2013, Pise, Italy. pp.241-244, ⟨10.1007/978-88-7642-475-5_39⟩. [DOI]
[10]Recoloring bounded treewidth graphs. Marthe Bonamy, Nicolas Bousquet. LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, 2013, Playa del Carmen, Mexico. pp.293-297, ⟨10.1016/j.endm.2013.10.040⟩. [DOI]
[9]A linear kernel for planar red-blue dominating set. Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos. CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. pp.117-120.
[8]Too many triangles. Boris Albar, Daniel Gonçalves. LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Apr 2013, Playa del Carmen, Mexico. pp.293-297, ⟨10.1016/j.endm.2013.10.046⟩. [DOI]
[7]Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. STACS: Symposium on Theoretical Aspects of Computer Science, Feb 2013, Kiel, Germany. pp.92-103, ⟨10.4230/LIPIcs.STACS.2013.92⟩. [DOI]
[6]Excluding Graphs as Immersions in Surface Embedded Graphs. Archontia C. Giannopoulou, Marcin Kamiński, Dimitrios M. Thilikos. WG 2013 - 39th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2013, Lübeck, Germany. pp.274-285, ⟨10.1007/978-3-642-45043-3_24⟩. [DOI]
[5]Adjacent vertex-distinguishing edge coloring of graphs. Marthe Bonamy, Nicolas Bousquet, Hervé Hocquard. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2013, Pise, Italy. pp.313-318, ⟨10.1007/978-88-7642-475-5_50⟩. [DOI]
[4]Polynomial Gap Extensions of the Erdős-Pósa Theorem. Jean-Florent Raymond, Dimitrios M. Thilikos. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.13-18, ⟨10.1007/978-88-7642-475-5_3⟩. [DOI]
[3]Evaluating Cooperation in coauthorship graphs with degeneracy. Christos Giatsidis, Michalis Vazirgiannis, Dimitrios M. Thilikos. BDA: Bases de Données Avancées, Oct 2013, Nantes, France.
[2]Linear Kernels and Single-exponential Algorithms via Protrusion Decompositions. Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar. ICALP: International Colloquium on Automata, Languages and Programming, Jul 2013, Riga, Latvia. pp.613-624, ⟨10.1007/978-3-642-39206-1_52⟩. [DOI]
[1]Strong chromatic index of planar graphs with large girth. Arnaud Pêcher, Mickaël Montassier, André Raspaud. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.265-270, ⟨10.1007/978-88-7642-475-5_43⟩. [DOI]


Conférences 2012

[8]Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. Christof Loeding, Nicolas Bousquet. LATA'10: Language and Automata Theory and Applications, Germany. pp.118-129.
[7]On Exact Algorithms for Permutation CSP. Daniel Gonçalves, Eunjung Kim. APEX: Approximation, Parameterized and EXact Algorithms, Feb 2012, Paris, France.
[6]Contraction checking in graphs on surfaces. Marcin Kaminski, Dimitrios M. Thilikos. STACS'12: 29th Symposium on Theoretical Aspects of Computer Science, Feb 2012, Paris, France. pp.182-193.
[5]A Combinatorial Method for 3D Landmark-based Morphometry: Application to the Study of Coronal Craniosynostosis. Emeric Gioan, Kevin Sol, Gérard Subsol. MICCAI: Medical Image Computing and Computer-Assisted Intervention, Oct 2012, Nice, France. pp.533-541, ⟨10.1007/978-3-642-33454-2_66⟩. [DOI]
[4]Parameterized K_4-Cover in Single Exponential Time. Eunjung Kim, Christophe Paul, Geevarghese Philip. SWAT: Scandinavian Workshop on Algorithmic Theory, Jul 2012, Helsinki, Sweden. pp.199-130.
[3]The Maximum Clique Problem in Multiple Interval Graphs. Mathew C. Francis, Daniel Gonçalves, Pascal Ochem. WG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.57-68.
[2]Dynamic Programming for $H$-minor-free Graphs. Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos. COCOON: Computing and Combinatorics Conference, Aug 2012, Sydney, NSW, Australia. pp.86-97, ⟨10.1007/978-3-642-32241-9_8⟩. [DOI]
[1]Parameterized domination in circle graphs. Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé. WG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.45-72, ⟨10.1007/s00224-013-9478-8⟩. [DOI]


Conférences 2011

[16]Pattern Avoidance and HDOL Words. Pascal Ochem. WORDS 2011 - 8th International Conference on Combinatorics on Words, Sep 2011, Prague, Czech Republic. , 2011.
[15]Multicut is FPT. Nicolas Bousquet, Jean Daligault, Stéphan Thomassé. STOC 2011 - 43rd Symposium on Theory of Computing, Jun 2011, San José, United States. pp.459-468, ⟨10.1145/1993636.1993698⟩. [DOI]
[14]On the diameter of reconfiguration graphs for vertex colourings. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma. EuroComb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. pp.161-166.
[13]2-distance coloring of sparse graphs. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. Eurocomb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. pp.155-160, ⟨10.1016/j.endm.2011.09.027⟩. [DOI]
[12]Contracting Chordal Graphs and Bipartite Graphs to Paths and Trees. Pinar Heggernes, Pim van 'T Hof, Benjamin Lévêque, Christophe Paul. LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.87-92.
[11]Obtaining a Bipartite Graph by Contracting Few Edges. Pinar Heggerness, Pim Van'T Hof, Daniel Lokshtanov, Christophe Paul. IARCS 31st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), Dec 2011, Mumbai, India. pp.217-228, ⟨10.4230/LIPIcs.FSTTCS.2011.217⟩. [DOI]
[10]On Approximating the $d$-Girth of a Graph. David Peleg, Ignasi Sau, Mordechai Shalom. SOFSEM, Jan 2011, Nový Smokovec, Slovakia. pp.467-481, ⟨10.1007/978-3-642-18381-2_39⟩. [DOI]
[9]Contracting Graphs to Paths and Trees. Pinar Heggerness, Pim Van'T Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul. IPEC 2011 - 6th International Symposium on Parameterized and Exact Computation, Sep 2011, Saarbrücken, Germany. pp.55-66, ⟨10.1007/978-3-642-28050-4_5⟩. [DOI]
[8]Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Pascal Ochem, Alexandre Pinlou. LAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. pp.123-128, ⟨10.1016/j.endm.2011.05.022⟩. [DOI]
[7]Hitting and Harvesting Pumpkins. Gwénaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé. ESA 2011 - 19th Annual European Symposium on Algorithms, Sep 2011, Saarbrücken, Germany. pp.394-407, ⟨10.1007/978-3-642-23719-5_34⟩. [DOI]
[6]Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices. Emeric Gioan, Kevin Sol, Gérard Subsol. CCCG 2011 - 23rd Canadian Conference on Computational Geometry, Aug 2011, Toronto, Canada.
[5]Conflict Packing Yield Linear Vertex-Kernels for k- Fast, $k-Dense$ RTI and a Related Problem. Christophe Paul, Anthony Perez, Stéphan Thomassé. 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011), Aug 2011, Warsaw, Poland. pp.497-507, ⟨10.1007/978-3-642-22993-0_45⟩. [DOI]
[4]Plate-forme semi-automatique : E-quity. Sandra Bringay, Alexandre Pinlou, Sylvain Durand, Sébastien Pro, Patrice Séébold. Séminaire national "C2i1 : plan pour la réussite en licence et compétences numériques, Jun 2011, Montpellier, France. 11 p.
[3]Plus rapide, efficace et équitable qu'un correcteur humain ? la plate-forme semi-automatique E-quity. Sandra Bringay, Alexandre Pinlou, Sylvain Durand, Sébastien Pro, Patrice Séébold. IC: Ingénierie des Connaissances, May 2011, Chambéry, France. 22èmes Journées francophones d'Ingénierie des Connaissances, 2011.
[2]A new 3D morphometric method based on a combinatorial encoding of 3D point confguration: application to skull anatomy for clinical research and physical antropology.. Emeric Gioan, Kevin Sol, Gérard Subsol, Yann Heuzé, Joan Richtsmeier, José Braga, Francis Thackeray. AAPA: American Association of Physical Anthropologists, Apr 2011, Minneapolis, United States. 80th Annual Meeting of the American Association of Physical Anthropologists, 2011.
[1]Une nouvelle méthode de morphométrie 3D par codage combinatoire de confgurations de points 3D: application à l'anatomie du crâne.. Emeric Gioan, Kevin Sol, Gérard Subsol, José Braga, Jacques Treil. 18ièmes Journées de la Societé d'Anthropologie de Paris, Jan 2011, France.


Conférences 2010

[12]A Quadratic Kernel for Feedback Vertex Set. Stéphan Thomassé. SODA'09: Symposium on Discrete Algorithms, New York, United States. pp.115-119.
[11]From Path Graphs to Directed Path Graphs. Steve Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia Tondato. WG 2010 - 36th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.256-265, ⟨10.1007/978-3-642-16926-7_24⟩. [DOI]
[10]Milling a Graph with Turn Costs: a Parameterized Complexity Perspective. Micheal Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Fran Rosamond, Sue Whitesides, Nathan Yu. WG 2010 - 36th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.123-134, ⟨10.1007/978-3-642-16926-7_13⟩. [DOI]
[9]Generalized Graph Clustering: Recognizing (p,q)-Cluster. Pinar Heggerness, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle. WG'10: International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.12.
[8]Triangle Contact Representations and Duality. Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. 18th International Symposium on Graph Drawing (GD), Sep 2010, Konstanz, Germany. pp.262-273, ⟨10.1007/978-3-642-18469-7_24⟩. [DOI]
[7]Fast Minor Testing in Planar Graphs. Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos. ESA 2010 - 18th Annual European Symposium on Algorithms, Sep 2010, Liverpool, United Kingdom. pp.97-109, ⟨10.1007/978-3-642-15775-2_9⟩. [DOI]
[6]Dynamic programming for graphs on surfaces. Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos. ICALP: International Colloquium on Automata, Languages and Programming, 2010, Bordeaux, France. pp.372-383.
[5]Utilisation de la visualisation en nuage arboré pour l'analyse littéraire. Delphine Amstutz, Philippe Gambette. JADT'10: 10th International Conference on statistical analysis of textual data, Jun 2010, Rome, Italie. pp.12.
[4]Densidées : calcul automatique de la densité des idées dans un corpus oral. Hyeran Lee, Philippe Gambette, Elsa Maillé, Constance Thuillier. RECITAL'2010 : 12ième Rencontre des Étudiants Chercheurs en Informatique pour le Traitement Automatique des Langues, Jul 2010, Montréal, Canada. pp.1-10.
[3]Utilisation de l'analyse textuelle automatique dans la recherche sur la maladie d'Alzheimer. Hyeran Lee, Philippe Gambette, Melissa Barkat-Defradas. Colloque international des jeunes chercheurs en Didactique des Langues et en Linguistique, Jun 2010, Grenoble, France.
[2]On the (Non-)Existence of Polynomial Kernels for Pl -Free Edge Modification Problems. Sylvain Guillemot, Christophe Paul, Anthony Perez. IPEC 2010 - 5th International Symposium on Parameterized and Exact Computation, Dec 2010, Chennai, India. pp.147-157, ⟨10.1007/978-3-642-17493-3_15⟩. [DOI]
[1]Identifying colorings of graphs. Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau. 8FCC, 2010, Orsay, France.


Conférences 2009

[19]Graph Transformations Preserving the Stability Number. Benjamin Lévêque, Dominique de Werra. LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Gramado, Brazil. pp.3-8.
[18]Exact and Parameterized Algorithms for Max Internal Spanning Tree. Henning Fernau, Serge Gaspers, Daniel Raible. WG'09: International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2009, Montpellier, France. pp.12.
[17]A Linear Vertex Kernel for Maximum Internal Spanning Tree. Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé. ISAAC'09: 20th International Symposium on Algorithms and Computation, pp.9.
[16]Asteroids in rooted and directed path graphs. Kathie Cameron, Chinh T. Hoàng, Benjamin Lévêque. Algorithmic Graph Theory, Centre for Discrete Mathematics and its applications (DIMAP), May 2009, Warwick, United Kingdom. pp.67-74.
[15]A Universally Fastest Algorithm for Max 2-Sat, Max 2-CSP and Everything in Between. Serge Gaspers, Gregory B. Sorkin. SODA'09: Symposium on Discrete Algorithms, pp.606-615.
[14]Every Planar Graph is the Intersection Graph of Segments in the Plane: Extended Abstract. Jérémie Chalopin, Daniel Gonçalves. STOC '09: 41st ACM Symposium on Theory of Computing, May 2009, France. pp.631-638.
[13]The chromatic number of sparse colored mixed graphs. Amanda Montejano, Alexandre Pinlou, André Raspaud, Eric Sopena. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.363-367, ⟨10.1016/j.endm.2009.07.060⟩. [DOI]
[12]Visualising a Text with a Tree Cloud. Philippe Gambette, Jean Véronis. IFCS'09: International Federation of Classification Societies Conference, Mar 2009, Dresde, Germany. pp.561-569, ⟨10.1007/978-3-642-10745-0_61⟩. [DOI]
[11]On Finding Directed Trees with Many Leaves. Jean Daligault, Stéphan Thomassé. IWPEC: International Workshop on Parameterized and Exact Computation, Sep 2009, Copenhagen, Denmark. pp.86-97, ⟨10.1007/978-3-642-11269-0_7⟩. [DOI]
[10]Efficient Neighbourhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search. Christophe Crespelle, Philippe Gambette. IWOCA'09: 20th International Workshop on Combinatorial Algorithms, Jun 2009, Hradec nad Moravicí, Czech Republic. pp.146-157, ⟨10.1007/978-3-642-10217-2_17⟩. [DOI]
[9]A Polynomial Kernel For Multicut In Trees. Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo. STACS'2009: 26th International Symposium on Theoretical Aspects of Computer Science, Feb 2009, Freiburg, Germany. pp.183-194.
[8]Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible. CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Jun 2009, Paris, France. pp.205-209.
[7]Polynomial Kernels for 3-Leaf Power Graph Modification Problems. Stéphane Bessy, Anthony Perez, Christophe Paul. IWOCA'09: International Workshop on Combinatorial Algorithms, pp.72-82.
[6]A Linear Programming Construction of Fully Optimal Bases in Graphs and Hyperplane Arrangements. Emeric Gioan, Michel Las Vergnas. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.307-311.
[5]The Structure of Level-k Phylogenetic Networks. Philippe Gambette, Vincent Berry, Christophe Paul. CPM: Combinatorial Pattern Matching, Jun 2009, Lille, France. pp.289-300, ⟨10.1007/978-3-642-02441-2_26⟩. [DOI]
[4]Kernels for Feedback Arc Set In Tournaments. Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2009, IIT Kanpur, India. pp.37-47, ⟨10.4230/LIPIcs.FSTTCS.2009.2305⟩. [DOI]
[3]Spanning galaxies in digraphs. Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩. [DOI]
[2]Coloring a set of touching strings. Louis Esperet, Daniel Gonçalves, Arnaud Labourel. EuroComb'09: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.213-217.
[1]Mapping Computation with No Memory. Serge Burckel, Emeric Gioan, Emmanuel Thomé. UC 2009: Unconventional Computation, Sep 2009, Ponta Delgada, Portugal. pp.85-97, ⟨10.1007/978-3-642-03745-0_15⟩. [DOI]


Conférences 2008

[10]Simple, Linear-Time Modular Decomposition. Marc Tedder, Derek Corneil, Michel Habib, Christophe Paul. ICALP: International Colloquium on Automata, Languages and Programming, Jul 2008, Reykjavik, Iceland. pp.634-645.
[9]A Representation Theorem for Union-Difference Families and Application. Binh-Minh Bui-Xuan, Michel Habib. LATIN: Latin American Symposium, Apr 2008, Búzios, Brazil. pp.492-503, ⟨10.1007/978-3-540-78773-0_43⟩. [DOI]
[8]Iterative Compression and Exact Algorithms. Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh. MFCS'2008 : 33rd International Symposium on Mathematical Foundations of Computer Science, Aug 2008, Torun, Poland. pp.335-346, ⟨10.1007/978-3-540-85238-4_27⟩. [DOI]
[7]La mv-décomposition : un nouvel algorithme pour la diffusion dans un réseau radio. Benoit Darties, Olivier Cogis, Jean-Claude König, Geneviève Simonet, Sylvain Durand. AlgoTel: Aspects Algorithmiques des Télécommunications, May 2008, Saint-Malo, France. pp.93-96.
[6]On Independent Sets and Bicliques in Graphs. Serge Gaspers, Dieter Kratsch, Mathieu Liedloff. WG'08: 34th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2008, Durham, United Kingdom. pp.171-182, ⟨10.1007/978-3-540-92248-3_16⟩. [DOI]
[5]The MV-Decomposition: Definition and Application to the Distance-2 Broadcast Problem in Multi-Hops Radio Networks. Benoit Darties, Olivier Cogis, Sylvain Durand, Jean-Claude König, Geneviève Simonet. TCS: Theoretical Computer Science, Sep 2008, Milan, Italy. pp.115-126, ⟨10.1007/978-0-387-09680-3_8⟩. [DOI]
[4]A Note on α-Drawable k-Trees. David Bremner, Jonathan Lenchner, Giuseppe Liotta, Christophe Paul, Marc Pouget, Svetlana Stolpner, Stephen Wismath. CCCG 2008 - 20th Annual Canadian Conference on Computational Geometry, Aug 2008, Montréal, Québec, Canada. pp.23-26.
[3]In Situ Design of Register Operations. Serge Burckel, Emeric Gioan. ISVLSI: IEEE Symposium on Very-Large-Scale Integration, LIRMM, Apr 2008, Montpellier, France. pp.451-454, ⟨10.1109/ISVLSI.2008.62⟩. [DOI]
[2]Guarding Art Galleries: The Extra Cost for Sculptures is Linear. Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé. SWAT: Scandinavian Workshop on Algorithm Theory, Jul 2008, Gothenburg, Sweden. pp.41-52, ⟨10.1007/978-3-540-69903-3_6⟩. [DOI]
[1]Perfect DCJ rearrangement. Annie Chateau, Cedric Chauve, Sèverine Bérard, Eric Tannier, Christophe Paul. RECOMB-CG: Comparative Genomics, Oct 2008, Paris, France. pp.158-169, ⟨10.1007/978-3-540-87989-3_12⟩. [DOI]

Conférences invitées 2008 - 2024


Conférences invitées 2019

[1]Connected tree-width and connected cops and robber game. Christophe Paul. CAALM 2019 - Complexity, Algorithms, Automata and Logic Meet, Jan 2019, Chennai, India.


Conférences invitées 2018

[1]A polynomial Turing kernel to compute the cut-width of semi-complete digraph. Christophe Paul. FILOFOCS 2018 - 7th French-Israeli Workshop on Foundations of Computer Science, Oct 2018, Paris, France.


Conférences invitées 2016

[2]Vertex-partitions of graphs. Mickaël Montassier. ICGCA: International Conference on Graph theory, Combinatorics and their Applications, Oct 2016, Jinhua, China.
[1]On six expressions of the Tutte polynomial of a graph (on a linearly ordered set of edges). Emeric Gioan. Graph Polynomials: Towards a Comparative Theory, Jun 2016, Dagstuhl seminar, Germany.


Conférences invitées 2015

[5]Introduction to parameterized complexity and some algorithmic consequences of the graph minor theory. Christophe Paul. Workshop on Graph Theory and its Applications, 2015, Istanbul, Turkey.
[4]Algorithms and Combinatorics on the Erdős–Pósa property. Dimitrios M. Thilikos. AGTAC: Algorithmic Graph Theory on the Adriatic Coast, Jun 2015, Koper, Slovenia.
[3]Bidimensionality and Parameterized Algorithms. Dimitrios M. Thilikos. IPEC 2015 - 10th International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.1-16, ⟨10.4230/LIPIcs.IPEC.2015.1⟩. [DOI]
[2]A survey on the active bijection in graphs, hyperplane arrangements, and oriented matroids. Emeric Gioan. ALEA-Network Workshop, Nov 2015, Bordeaux, France.
[1]A survey on the active bijection in graphs, hyperplane arrangements and oriented matroids. Emeric Gioan. Workshop on the Tutte polynomial, Jul 2015, London, United Kingdom.


Conférences invitées 2014

[2]Entropy compression method and graph coloring problems. Mickaël Montassier. C&C: Cycles and Colourings, 2014, Novy Smokovec, Slovakia.
[1]La méthode de compression d'entropie appliquée aux colorations de graphes. Alexandre Pinlou. Journées Graphes et Algorithmes, Nov 2014, Dijon, France.


Conférences invitées 2013

[4]Théorie des matroïdes orientés. Emeric Gioan. Ecole Jeunes Chercheurs en Informatique Mathématique, 2013, Perpignan, France.
[3]Complexité et algorithmes paramétrés. Christophe Paul. Ecole Jeunes Chercheurs en Informatique Mathématique, 2013, Perpignan, France.
[2]Skull Shapes and Oriented Matroids. Emeric Gioan. FMMIAM: French-Mexican Meeting on Industrial and Applied Mathematics, SMM, Nov 2013, Tabasco, Mexico.
[1]Theory and Applications of Bidimensionality. Dimitrios M. Thilikos. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2013, Chengdu, China. ⟨10.1007/978-3-319-03780-6⟩. [DOI]


Conférences invitées 2012

[5]Modèles d'Intersections Géométriques pour les Graphes Planaires. Daniel Gonçalves. JGA'10: Journées Graphes et Algorithmes, France.
[4]Algorithmics of Modular Decomposition. Christophe Paul. Algorithms and Permutations, Feb 2012, Paris, France.
[3]Polynomial Kernels for Proper Interval Completion and Related Problems. Stéphane Bessy, Anthony Perez. Fundamentals of Computation Theory 2011, Norway. pp.229-239.
[2]Limits of near-coloring of sparse graphs. Mickaël Montassier. 2012 International Conference on Graph Theory, Combinatorics and Applications, Oct 2012, Zhejiang, China.
[1]Enumerating the edge-colourings and total colourings of a regular graph. Stéphane Bessy, Frédéric Havet. 2012 Workshop on Graph Theory and Combinatorics, Aug 2012, National Sun Yat-sen University, Kaohsiung, Taiwan.


Conférences invitées 2011

[1]Planar Graphs as Intersection Graphs. Daniel Gonçalves. LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina.


Conférences invitées 2010

[1]Decomposition of sparse graphs, with applications to game coloring number. Mickaël Montassier. Seminar on Graph Theory, 2010, Kaohsiung, Taiwan.


Conférences invitées 2009

[1]Kernelization via Combinatorial Optimization. Stéphan Thomassé. EuroComb'09: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France.


Conférences invitées 2008

[1]Branchwidth of Graphic Matroids. Stéphan Thomassé. BCC'07: British Combinatorial Conference, United Kingdom.

Ouvrages et chapitres d'ouvrages 2008 - 2024


Ouvrages et chapitres d'ouvrages 2022

[2]The Tutte polynomial of matroid perspectives. Emeric Gioan. Handbook of the Tutte Polynomial and Related Topics, Chapter 28, Chapman and Hall/CRC, 18 p., 2022, ⟨10.1201/9780429161612⟩. [DOI]
[1]The Tutte polynomial of oriented matroids. Emeric Gioan. Handbook of the Tutte Polynomial and Related Topics, Chapter 31, Chapman and Hall/CRC, 25 p., 2022, ⟨10.1201/9780429161612⟩. [DOI]


Ouvrages et chapitres d'ouvrages 2021

[3]A Qualitative Reasoning Model for Software Testing, based on Combinatorial Geometry. Spyros Xanthakis, Emeric Gioan. M. Kalech; R. Abreu; M. Last. Artificial Intelligence Methods for Software Engineering, Chapter 12, World Scientific, pp.331-367, 2021, ⟨10.1142/9789811239922⟩. [DOI]
[2]Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. Fedor Fomin, Petr Golovach, Dimitrios M. Thilikos. Graph-Theoretic Concepts in Computer Science, 12911, Springer International Publishing, pp.308-320, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86838-3_24⟩. [DOI]
[1]Block Elimination Distance. Öznur Yaşar Diner, Archontia Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos. Graph-Theoretic Concepts in Computer Science, 12911, Springer International Publishing, pp.28-38, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86838-3_3⟩. [DOI]


Ouvrages et chapitres d'ouvrages 2020

[1]A Retrospective on (Meta) Kernelization. Dimitrios M. Thilikos. Treewidth, Kernels, and Algorithms, 12160, pp.222-246, 2020, Lecture Notes in Computer Science, 978-3-030-42070-3. ⟨10.1007/978-3-030-42071-0_16⟩. [DOI]


Ouvrages et chapitres d'ouvrages 2019

[1]Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers. Ignasi Sau, Dimitrios M. Thilikos. LNCS (11789), 2019, 978-3-030-30785-1. ⟨10.1007/978-3-030-30786-8⟩. [DOI]


Ouvrages et chapitres d'ouvrages 2018

[1]Avoiding or limiting regularities in words. Pascal Ochem, Michaël Rao, Matthieu Rosenfeld. Sequences, Groups and Number Theory, pp.177-212, 2018, 978-3-319-69151-0. ⟨10.1007/978-3-319-69152-7_5⟩. [DOI]


Ouvrages et chapitres d'ouvrages 2017

[1]An Alternate Proof of the Algorithmic Lovász Local Lemma. Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. Extended Abstracts Summer 2015, 6, pp.61-65, 2017, Trends in Mathematics, 978-3-319-51752-0. ⟨10.1007/978-3-319-51753-7_10⟩. [DOI]


Ouvrages et chapitres d'ouvrages 2016

[2]Branchwidth of Graphs. Dimitrios M. Thilikos, Fedor V. Fomin. Encyclopedia of Algorithms, pp.232-237, 2016, 978-1-4939-2863-7 (Print) 978-1-4939-2864-4 (Online). ⟨10.1007/978-1-4939-2864-4_55⟩. [DOI]
[1]Bidimensionality. Fedor V. Fomin, Erik D. Demaine, Mohammed Taghi Hajiaghayi, Dimitrios M. Thilikos. Encyclopedia of Algorithms, Springer, pp.203-207, 2016, 978-1-4939-2863-7 (Print) 978-1-4939-2864-4 (Online). ⟨10.1007/978-1-4939-2864-4_47⟩. [DOI]


Ouvrages et chapitres d'ouvrages 2015

[1]Split decomposition, circle graphs and related graph families. Christophe Paul. Ming-Yang Kao. Encyclopedia of Algorithms, 2051-2056, Springer, 2015, 978-1-4939-2863-7. ⟨10.1007/978-1-4939-2864-4_686⟩. [DOI]


Ouvrages et chapitres d'ouvrages 2013

[5]Complexité et algorithmes paramétrés. Christophe Paul. Philippe Langlois. Informatique mathématique, une photographie en 2013, Presse universitaires de Perpignan, 2013.
[4]6th Workshop on Graph Classes, Width Parameters and Optimization (GROW 2013). Dimitrios M. Thilikos. , pp.1-20, 2013.
[3]NII Shonan Meeting on: Parameterized Complexity and the Understanding, Design and Analysis of Heuristics. Gregory Gutin, Kazuo Iwama, Dimitrios M. Thilikos. , pp.1-13, 2013.
[2]Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). Erik D. Demaine, Fedor V. Fomin, Mohammadtaghi Hajiaghayi, Dimitrios M. Thilikos. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany, 3(3), pp.51-74, 2013, ⟨10.4230/DagRep.3.3.51⟩. [DOI]
[1]Eléments de théorie des matroïdes et matroïdes orientés. Emeric Gioan, Jorge Ramirez Alfonsin. Philippe Langlois. Informatique mathématique - Une photographie en 2013, Presses Universitaires de Perpignan, pp.47-95, 2013, I-2.Théorie des matroïdes et des matroïdes orientés, 9782354121839.


Ouvrages et chapitres d'ouvrages 2012

[4]Graph Minors and Parameterized Algorithm Design. Dimitrios M. Thilikos. The Multivariate Algorithmic Revolution and Beyond, LNCS (7370), pp.228-256, 2012, Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday - Part II, 978-3-642-30890-1. ⟨10.1007/978-3-642-30891-8_13⟩. [DOI]
[3]5th Workshop on GRAph Searching, Theory and Applications (GRASTA 2012). Fedor V. Fomin, Richard J. Nowakowski, Pawel Pralat, Dimitrios M. Thilikos. , pp.1-12, 2012.
[2]Parameterized and Exact Computation 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings. Gerhard J. Woeginger, Dimitrios M. Thilikos. Dimitrios M. Thilikos; Gerhard J. Woeginger. Springer, 7535, 2012, LNCS, 978-3-642-33292-0. ⟨10.1007/978-3-642-33293-7⟩. [DOI]
[1]Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Dimitrios M. Thilikos, Pierre Fraigniaud, Fedor V. Fomin, Stephan Kreutzer. Springer, 463, 2012, Theoretical Computer Science, ⟨10.1016/j.tcs.2012.10.006⟩. [DOI]


Ouvrages et chapitres d'ouvrages 2010

[2]WG'09: International Workshop on Theoretic Concepts in Computer Science. Christophe Paul, Michel Habib. 5911, 352 p., 2010, Lecture Notes in Computer Science.
[1]Almost All F-Free Graphs Have The Erdos-Hajnal Property. Martin Loebl, Bruce Reed, Alex Scott, Andrew Thomason, Stéphan Thomassé. An Irregular Mind, 21, pp.405-414, 2010, ⟨10.1007/978-3-642-14444-8_11⟩. [DOI]

Travaux d'édition 2008 - 2024