ALGCO: Algorithmes, Graphes et Combinatoire

Les recherches de l’équipe AlGCo se concentrent sur l’étude théorique et algorithmique de structures combinatoires classiques : principalement les graphes, mais aussi les graphes orientés, matroïdes et matroïdes orientés. Nos motivations sont d’ordre fondamental (questions de partitionnement, coloration, plongement, isomorphisme), algorithmique (notamment autour de la complexité paramétrée : algorithmes FPT, existence de noyau polynomiaux) ou applicatif, en provenance d’autres domaines de l’informatique théorique (bio-informatique, imagerie, morphométrie, modélisation de réseaux...). 

Membres

Permanents

Non permanents

Publications depuis 2014 - Evaluation 2019

Articles de revues internationales

2019

  1. Preface to special issue on Theory and Applications of Graph Searching
    Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos
    Theoretical Computer Science, Elsevier, 2019, 794, pp.1-2.
  2. Some further results on squarefree arithmetic progressions in infinite words
    James Currie, Tero Harju, Pascal Ochem, Narad Rampersad
    Theoretical Computer Science, Elsevier, 2019, 799, pp.140-148.
  3. Repetition avoidance in products of factors
    Pamela Fleischmann, Pascal Ochem, Kamellia Reshadi
    Theoretical Computer Science, Elsevier, 2019, 791, pp.123-126.
  4. 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, Elsevier, In press. <10.1016/j.dam.2019.10.013>
  5. How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
    Marin Bougeret, Ignasi Sau Valls
    Algorithmica, Springer Verlag, 2019, 81 (10), pp.4043-4068.
  6. 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, Wiley, 2019, 92 (2), pp.130-151.
  7. Counting Gallai 3-colorings of complete graphs
    Josefran de Oliveira Bastos, Fabrício Siqueira Benevides, Guilherme Oliveira Mota, Ignasi Sau Valls
    Discrete Mathematics, Elsevier, 2019, 342 (9), pp.2618-2631.
  8. Approximating maximum uniquely restricted matchings in bipartite graphs
    Julien Baste, Dieter Rautenbach, Ignasi Sau Valls
    Discrete Applied Mathematics, Elsevier, 2019, 267, pp.30-40.
  9. Adapting The Directed Grid Theorem into an FPT Algorithm
    Victor Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau Valls
    Electronic Notes in Theoretical Computer Science, Elsevier, 2019, 346, pp.229-240.
  10. Degree-constrained 2-partitions of graphs
    Jørgen Bang-Jensen, Stéphane Bessy
    Theoretical Computer Science, Elsevier, 2019, 776, pp.64-74.
  11. Weighted proper orientations of trees and graphs of bounded treewidth
    Julio Araujo, Cláudia Linhares Sales, Ignasi Sau Valls, Ana Silva
    Theoretical Computer Science, Elsevier, 2019, 771, pp.39-48.
  12. Parameterized complexity of a coupled-task scheduling problem
    Stéphane Bessy, Rodolphe Giroudeau
    Journal of Scheduling, Springer Verlag, 2019, 22 (3), pp.305-313.
  13. On the Kőnig-Egerváry theorem for $k$-paths
    Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
    Journal of Graph Theory, Wiley, 2019, 91 (1), pp.73-87.
  14. On the number of circuit–cocircuit reversal classes of an oriented matroid
    Emeric Gioan, Chi Ho Yuen
    Discrete Mathematics, Elsevier, 2019, 342 (4), pp.1056-1059.
  15. Explicit Linear Kernels for Packing Problems
    Valentin Garnero, Christophe Paul, Ignasi Sau Valls, Dimitrios Thilikos
    Algorithmica, Springer Verlag, 2019, 81 (4), pp.1615-1656.
  16. A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
    François Dross, Mickael Montassier, Alexandre Pinlou
    Discrete Mathematics, Elsevier, 2019, 342 (4), pp.943-950.
  17. The active bijection for graphs
    Emeric Gioan, Michel Las Vergnas
    Advances in Applied Mathematics, Elsevier, 2019, 104, pp.165-236.
  18. Large induced forests in planar graphs with girth 4
    François Dross, Mickaël Montassier, Alexandre Pinlou
    Discrete Applied Mathematics, Elsevier, 2019, 254, pp.96-106.
  19. Cutwidth: Obstructions and Algorithmic Aspects
    Archontia Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
    Algorithmica, Springer Verlag, 2019, 81 (2), pp.557-588.
  20. On some interesting ternary formulas
    Pascal Ochem, Matthieu Rosenfeld
    The Electronic Journal of Combinatorics, Open Journal Systems, 2019, 26 (1), pp.P1.12.
  21. 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, Elsevier, 2019, 134, pp.110-142.
  22. Oriented incidence colourings of digraphs
    Christopher Duffy, Gary Macgillivray, Pascal Ochem, André Raspaud
    Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2019, 39 (1), pp.191-210.
  23. Homothetic triangle representations of planar graphs
    Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
    Journal of Graph Algorithms and Applications, Brown University, 2019, 23 (4), pp.745-753.
  24. Strong immersion is a well-quasi-ordering for semicomplete digraphs
    Florian Barbero, Christophe Paul, Michał Pilipczuk
    Journal of Graph Theory, Wiley, 2019, 90, pp.484-496.
  25. On the structure of Schnyder woods on orientable surfaces
    Daniel Gonçalves, Kolja Knauer, Benjamin Lévêque
    Journal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2019, 10 (1), pp.127-164.

2018

  1. Upper bounds on the uniquely restricted chromatic index
    Julien Baste, Dieter Rautenbach, Ignasi Sau Valls
    Journal of Graph Theory, Wiley, 2018, 91 (3), pp.251-258.
  2. Structured Connectivity Augmentation
    Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (4), pp.2612-2635.
  3. Approximability and exact resolution of the multidimensional binary vector assignment problem
    Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
    Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (3), pp.1059-1073.
  4. Well-quasi-ordering $H$-contraction-free graphs
    Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck
    Discrete Applied Mathematics, Elsevier, 2018, 248, pp.18-27.
  5. Complexity dichotomies for the Minimum F -Overlay problem
    Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau Valls, Rémi Watrigant
    Journal of Discrete Algorithms, Elsevier, 2018, 52-53, pp.133-142.
  6. Multigraphs without large bonds are wqo by contraction
    Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck
    Journal of Graph Theory, Wiley, 2018, 88 (4), pp.558-565.
  7. Robust scheduling with budgeted uncertainty
    Marin Bougeret, Artur Alves Pessoa, Michael Poss
    Discrete Applied Mathematics, Elsevier, 2018, 261 (31), pp.93-107.
  8. Structure and Enumeration of $K4$-minor-free links and link diagrams
    Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona
    Electronic Notes in Discrete Mathematics, Elsevier, 2018, 68, pp.119-124.
  9. On triangles in $Kr$-minor free graphs
    Boris Albar, Daniel Gonçalves
    Journal of Graph Theory, Wiley, 2018, 88 (1), pp.154-173.
  10. An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$
    Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos
    Algorithmica, Springer Verlag, 2018, 80 (4), pp.1330-1356.
  11. Out-degree reducing partitions of digraphs
    Joergen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo
    Theoretical Computer Science, Elsevier, 2018, 719, pp.64-72.
  12. Degenerate matchings and edge colorings
    Julien Baste, Dieter Rautenbach
    Discrete Applied Mathematics, Elsevier, 2018, 239, pp.38-44.
  13. Improved FPT algorithms for weighted independent set in bull-free graphs
    Henri Perret Du Cray, Ignasi Sau Valls
    Discrete Mathematics, Elsevier, 2018, 341 (2), pp.451-462.
  14. Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
    Fedor Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos
    ACM Transactions on Algorithms, Association for Computing Machinery, 2018, 14 (1), pp.1-31.
  15. Hitting minors, subdivisions, and immersions in tournaments
    Jean-Florent Raymond
    Discrete Mathematics and Theoretical Computer Science, DMTCS, 2018, 20 (1), pp.4212.
  16. Multicut Is FPT
    Nicolas Bousquet, Jean Daligault, Stéphan Thomassé
    SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2018, 47 (1), pp.166-207.
  17. On repetition thresholds of caterpillars and trees of bounded degree
    Borut Lužar, Pascal Ochem, Alexandre Pinlou
    The Electronic Journal of Combinatorics, Open Journal Systems, 2018, 25 (1), pp.#P1.61.
  18. Avoidability of circular formulas
    Guilhem Gamard, Pascal Ochem, Gwenaël Richomme, Patrice Séébold
    Theoretical Computer Science, Elsevier, 2018, 726, pp.1-4.
  19. 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, Open Journal Systems, 2018, 25 (1), pp.#P1.45.
  20. Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs
    Florian Barbero, Christophe Paul, Michał Pilipczuk
    ACM Transactions on Algorithms, Association for Computing Machinery, 2018, 14 (3), pp.#38.
  21. The $k$-strong induced arboricity of a graph
    Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
    European Journal of Combinatorics, Elsevier, 2018, 67, pp.1-20.
  22. Polynomial expansion and sublinear separators
    Louis Esperet, Jean-Florent Raymond
    European Journal of Combinatorics, Elsevier, 2018, 69, pp.49-53.
  23. Bounds on the burning number
    Stéphane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, Elham Roshanbin
    Discrete Applied Mathematics, Elsevier, 2018, 235, pp.16-22.
  24. How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
    Marin Bougeret, Ignasi Sau Valls
    Algorithmica, Springer Verlag, 2018. <10.1007/s00453-018-0468-8>
  25. The Geodetic Hull Number is Hard for Chordal Graphs
    Stéphane Bessy, Mitre Dourado, Lucia Penso, Dieter Rautenbach
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (1), pp.543-547.
  26. 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 Valls
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (3), pp.2302-2312.
  27. An FPT 2-Approximation for Tree-Cut Decomposition
    Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos
    Algorithmica, Springer Verlag, 2018, 80 (1), pp.116-135.

2017

  1. 2-subcoloring is NP-complete for planar comparability graphs
    Pascal Ochem
    Information Processing Letters, Elsevier, 2017, 128, pp.46-48.
  2. Burning a graph is hard
    Stéphane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, Elham Roshanbin
    Discrete Applied Mathematics, Elsevier, 2017, 232, pp.73-87.
  3. Avoidability of Formulas with Two Variables
    Pascal Ochem, Matthieu Rosenfeld
    The Electronic Journal of Combinatorics, Open Journal Systems, 2017, 24 (4), pp.#P4.30.
  4. Maximum Cuts in Edge-colored Graphs
    Rubens Sucupira, Luerbio Faria, Sulamita Klein, Ignasi Sau Valls, Uéverton Souza
    Electronic Notes in Discrete Mathematics, Elsevier, 2017, 62, pp.87 - 92.
  5. The Geodetic Hull Number is Hard for Chordal Graphs
    Stéphane Bessy, Mitre Dourado, Lucia Penso, Dieter Rautenbach
    Electronic Notes in Discrete Mathematics, Elsevier, 2017, 62, pp.291-296.
  6. Ruling out FPT algorithms for Weighted Coloring on forests
    Julio Araujo, Julien Baste, Ignasi Sau Valls
    Electronic Notes in Discrete Mathematics, Elsevier, 2017, 62, pp.195-200.
  7. Möbius Stanchion Systems
    Lucas Isenmann, Timothée Pecatte
    Electronic Notes in Discrete Mathematics, Elsevier, 2017, 62, pp.177-182.
  8. Colouring diamond-free graphs
    Konrad Dabrowski, François Dross, Daniël Paulusma
    Journal of Computer and System Sciences, Elsevier, 2017, 89, pp.410-431.
  9. 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, Elsevier, 2017, 312, pp.202-213.
  10. A polynomial-time algorithm for Outerplanar Diameter Improvement
    Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos, Mathias Weller
    Journal of Computer and System Sciences, Elsevier, 2017, 89, pp.315 - 327.
  11. Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
    Julien Baste, Luerbio Faria, Sulamita Klein, Ignasi Sau Valls
    Theory of Computing Systems, Springer Verlag, 2017, 61 (3), pp.777-794.
  12. 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, Springer Verlag, 2017, 79 (1), pp.66-95.
  13. Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
    Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau Valls, Mordechai Shalom
    Theoretical Computer Science, Elsevier, 2017, 690, pp.91-103.
  14. Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture
    Stéphane Bessy, Jocelyn Thiebaut
    Electronic Notes in Discrete Mathematics, Elsevier, 2017, 61, pp.115-121.
  15. Dushnik-Miller dimension of contact systems of d -dimensional boxes
    Mathew Francis, Daniel Gonçalves
    Electronic Notes in Discrete Mathematics, Elsevier, 2017, 61, pp.467-473.
  16. Extremal Values of the Chromatic Number for a Given Degree Sequence
    Stéphane Bessy, Dieter Rautenbach
    Graphs and Combinatorics, Springer Verlag, 2017, 33 (4), pp.789-799.
  17. Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms
    Nazanin Movarraei, Pascal Ochem
    Information Processing Letters, Elsevier, 2017, 123, pp.42-46.
  18. Colorful paths for 3-chromatic graphs
    Nicolas Bousquet, Stéphane Bessy
    Discrete Mathematics, Elsevier, 2017, 340 (5), pp.1000-1007.
  19. Editing to a planar graph of given degrees
    Konrad Dabrowski, Petr A. Golovach, Pim van 'T Hof, Daniël Paulusma, Dimitrios M. Thilikos
    Journal of Computer and System Sciences, Elsevier, 2017, 85, pp.168-182.
  20. 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, DMTCS, 2017, FCT '15, 19 (4). <10.23638/DMTCS-19-4-3>
  21. Parameterized algorithms for min-max multiway cut and list digraph homomorphism
    Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos
    Journal of Computer and System Sciences, Elsevier, 2017, 86, pp.191-206.
  22. On the parameterized complexity of the Edge Monitoring problem
    Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau Valls
    Information Processing Letters, Elsevier, 2017, 121, pp.39-44.
  23. Bounds on the exponential domination number
    Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
    Discrete Mathematics, Elsevier, 2017, 340 (3), pp.494-503.
  24. On the complexity of computing the k-restricted edge-connectivity of a graph
    Luis Pedro Montejano, Ignasi Sau Valls
    Theoretical Computer Science, Elsevier, 2017, 662, pp.31-39.
  25. Acyclic edge coloring through the Lovász Local Lemma
    Dimitrios M. Thilikos, Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos
    Theoretical Computer Science, Elsevier, 2017, 665, pp.40 - 50.
  26. A linear kernel for planar red–blue dominating set
    Valentin Garnero, Ignasi Sau Valls, Dimitrios M. Thilikos
    Discrete Applied Mathematics, Elsevier, 2017, 217, pp.536-547.
  27. 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, Elsevier, 2017, 66, pp.81-94.
  28. Encoding toroidal triangulations
    Vincent Despré, Daniel Gonçalves, Benjamin Lévêque
    Discrete and Computational Geometry, Springer Verlag, 2017, 57 (3), pp.507-544.
  29. The complexity of partitioning into disjoint cliques and a triangle-free graph
    Marin Bougeret, Pascal Ochem
    Discrete Applied Mathematics, Elsevier, 2017, 217, pp.438-445.
  30. List Coloring with a Bounded Palette
    Marthe Bonamy, Ross J. Kang
    Journal of Graph Theory, Wiley, 2017, 84 (1), pp.93-103.
  31. Homomorphisms of 2-edge-colored triangle-free planar graphs
    Pascal Ochem, Alexandre Pinlou, Sagnik Sen
    Journal of Graph Theory, Wiley, 2017, 85 (1), pp.258-277.
  32. Antistrong digraphs
    Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell
    Journal of Combinatorial Theory, Series B, Elsevier, 2017, 122, pp.68-90.
  33. Low Polynomial Exclusion of Planar Graph Patterns
    Jean-Florent Raymond, Dimitrios M. Thilikos
    Journal of Graph Theory, Wiley, 2017, 84 (1), pp.26-44.
  34. 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, Elsevier, 2017, 122, pp.815-843.
  35. The Parameterized Complexity of Graph Cyclability
    Petr Golovach, Marcin Kamiński, Spyridon Maniatis, Dimitrios M. Thilikos
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2017, 31 (1), pp.511 - 541.
  36. On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
    Iyad Kanj, Dimitrios M. Thilikos, Ge Xia
    Information and Computation, Elsevier, 2017, 257 (139-156). <10.1016/j.ic.2017.11.002>
  37. Computing a Clique Tree with the Algorithm Maximal Label Search
    Anne Berry, Geneviève Simonet
    Algorithms, MDPI, 2017, 10 (1), pp.#20.
  38. Minors in graphs of large θr-girth
    Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos
    European Journal of Combinatorics, Elsevier, 2017, 65, pp.106-121.
  39. Recent techniques and results on the Erdős-Pósa property
    Jean-Florent Raymond, Dimitrios M. Thilikos
    Discrete Applied Mathematics, Elsevier, 2017, 231, pp.25-43.
  40. Packing and covering immersion-expansions of planar sub-cubic graphs
    Archontia Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
    European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167.

2016

  1. (Meta) Kernelization
    Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
    Journal of the ACM (JACM), Association for Computing Machinery, 2016, 63 (5), pp.#44.
  2. Exponential Domination in Subcubic Graphs
    Stéphane Bessy, Pascal Ochem, Dieter Rautenbach
    The Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (4), pp.#P4.42.
  3. Orienting Triangulations
    Boris Albar, Daniel Gonçalves, Kolja Knauer
    Journal of Graph Theory, Wiley, 2016, 83 (4), pp.392-405.
  4. On the complexity of Wafer-to-Wafer Integration
    Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau
    Discrete Optimization, Elsevier, 2016, 22 (part B), pp.255-269.
  5. An edge variant of the Erdős–Pósa property
    Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos
    Discrete Mathematics, Elsevier, 2016, 339 (8), pp.2027-2035.
  6. 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, DMTCS, 2016, 17 (3), pp.131-146.
  7. Parameterized certificate dispersal and its variants
    Valentin Garnero, Mathias Weller
    Theoretical Computer Science, Elsevier, 2016, 622, pp.66-78.
  8. Detecting minors in matroids through triangles
    Boris Albar, Daniel Gonçalves, Jorge L. Ramírez Alfonsín
    European Journal of Combinatorics, Elsevier, 2016, 53, pp.50-58.
  9. Approximating the sparsest $k$-subgraph in chordal graph
    Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
    Theory of Computing Systems, Springer Verlag, 2016, 58 (1), pp.111-132.
  10. On interval representations of graphs
    Aquiles Braga de Queiroz, Valentin Garnero, Pascal Ochem
    Discrete Applied Mathematics, Elsevier, 2016, 202, pp.30-36.
  11. 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, Elsevier, 2016, 82 (2). <10.1016/j.jcss.2015.08.002>
  12. Doubled patterns are 3-avoidable
    Pascal Ochem
    The Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (1), pp.P1.19.
  13. Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
    Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau Valls, Somnath Sikdar
    ACM Transactions on Algorithms, Association for Computing Machinery, 2016, 12 (2), pp.No. 21.
  14. 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, Elsevier, 2016, 339 (2), pp.780 - 789.
  15. Coloring non-crossing strings
    Louis Esperet, Daniel Gonçalves, Arnaud Labourel
    The Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (4), pp.4.4.
  16. Fractional Triangle Decompositions in Graphs with Large Minimum Degree
    François Dross
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (1), pp.36-42.
  17. Contraction Obstructions for Connected Graph Searching
    Best Micah J, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros
    Discrete Applied Mathematics, Elsevier, 2016, 209, pp.27-47.
  18. 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, Elsevier, 2016, 214, pp.99-107.
  19. 3-path in graphs with bounded average degree
    Stanislav Jendrol, Mária Maceková, Mickaël Montassier, Roman Soták
    Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2016, 36 (2), pp.339-353.
  20. Islands in graphs on surfaces
    Louis Esperet, Pascal Ochem
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (1), pp.206-219.
  21. Scattered packings of cycles
    Aistis Atminas, Marcin Kamiński, Jean-Florent Raymond
    Theoretical Computer Science, Elsevier, 2016, 647, pp.33 - 42.
  22. On the consistency of orthology relationships
    Mark Jones, Christophe Paul, Celine Scornavacca
    BMC Bioinformatics, BioMed Central, 2016, 17 (S14), pp.11-14.
  23. Minimal disconnected cuts in planar graphs
    Marcin Kamiński, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos
    Networks, Wiley, 2016, 68 (4), pp.250-259.
  24. A short proof that shuffle squares are 7-avoidable
    Guillaume Guégan, Pascal Ochem
    RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2016, 50 (1), pp.101-103.

2015

  1. Independent Domination in Cubic Graphs
    Paul Dorbec, Michael A. Henning, Mickaël Montassier, Justin Southey
    Journal of Graph Theory, Wiley, 2015, 80 (4), pp.329-349.
  2. Planar Disjoint-Paths Completion
    Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos
    Algorithmica, Springer Verlag, 2015, 76 (2), pp.401-425.
  3. Strong edge coloring sparse graphs
    Julien Bensmail, Marthe Bonamy, Hervé Hocquard
    Electronic Notes in Discrete Mathematics, Elsevier, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.773-778.
  4. Complexity dichotomy for oriented homomorphism of planar graphs with large girth
    Guillaume Guégan, Pascal Ochem
    Theoretical Computer Science, Elsevier, 2015, 596, pp.142-148.
  5. Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles
    Jørgen Bang-Jensen, Stéphane Bessy
    Journal of Graph Theory, Wiley, 2015, 79 (4), pp.249-266.
  6. Characterization of some binary words with few squares
    Golnaz Badkobeh, Pascal Ochem
    Theoretical Computer Science, Elsevier, 2015, 588, pp.73-80.
  7. The Maximum Clique Problem in Multiple Interval Graphs
    Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
    Algorithmica, Springer Verlag, 2015, 71 (4), pp.812-836.
  8. The role of planarity in connectivity problems parameterized by treewidth
    Julien Baste, Ignasi Sau Valls
    Theoretical Computer Science, Elsevier, 2015, 570, pp.1-14.
  9. The Erdős–Hajnal conjecture for paths and antipaths
    Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
    Journal of Combinatorial Theory, Series B, Elsevier, 2015, 113, pp.261-264.
  10. Near-colorings: non-colorable graphs and NP-completeness
    Mickaël Montassier, Pascal Ochem
    The Electronic Journal of Combinatorics, Open Journal Systems, 2015, 22 (1), pp.#P1.57.
  11. 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, Society for Industrial and Applied Mathematics, 2015, 29 (4), pp.2047-2064.
  12. Excluding cycles with a fixed number of chords
    Pierre Aboulker, Nicolas Bousquet
    Discrete Applied Mathematics, Elsevier, 2015, 180, pp.11-24.
  13. A single-exponential FPT algorithm for the $K_4$-minor cover problem
    Kim Eun Jung, Christophe Paul, Geevarghese Philip
    Journal of Computer and System Sciences, Elsevier, 2015, 81 (1), pp.186-207.
  14. Two floor building needing eight colors
    Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni
    Journal of Graph Algorithms and Applications, Brown University, 2015, 19 (1), pp.1--9.
  15. Forbidding Kuratowski Graphs as Immersions
    Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
    Journal of Graph Theory, Wiley, 2015, 78 (1), pp.43-60.
  16. Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
    Marthe Bonamy
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (3), pp.1735-1763.
  17. Asteroidal quadruples in non rooted path graphs
    Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato
    Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2015, 35 (4), pp.603-614.
  18. Explicit Linear Kernels via Dynamic Programming
    Valentin Garnero, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (4), pp.1864-1894.
  19. Hadwiger Number of Graphs with Small Chordality
    Petr A. Golovach, Pinar Heggernes, Pim van 'T Hof, Christophe Paul
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (3), pp.1427-1451.
  20. 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, Elsevier, 2015, 562, pp.75-89.

2014

  1. On the bend-number of planar and outerplanar graphs
    Daniel Heldt, Kolja Knauer, Torsten Ueckerdt
    Discrete Applied Mathematics, Elsevier, 2014, 179, pp.109-119.
  2. Organizing the atoms of the clique separator decomposition into an atom tree
    Anne Berry, Romain Pogorelcnik, Geneviève Simonet
    Discrete Applied Mathematics, Elsevier, 2014, 177, pp.1-13.
  3. 2-Distance Coloring of Sparse Graphs
    Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
    Journal of Graph Theory, Wiley, 2014, 77 (3), pp.190-218.
  4. List coloring the square of sparse graphs with large degree
    Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
    European Journal of Combinatorics, Elsevier, 2014, 41, pp.128-137.
  5. 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), EDP Sciences, 2014, 48 (4), pp.369-389.
  6. On the number of prime factors of an odd perfect number
    Pascal Ochem, Michael Rao
    Mathematics of Computation, American Mathematical Society, 2014, 83 (289), pp.2435-2439.
  7. Another remark on the radical of an ODD perfect number
    Pascal Ochem, Michaël Rao
    The Fibonacci Quarterly, Dalhousie University, 2014, 52 (3). <315-317>
  8. Brooks’ theorem on powers of graphs
    Marthe Bonamy, Nicolas Bousquet
    Discrete Mathematics, Elsevier, 2014, 325, pp.12-16.
  9. Computation with No Memory, and Rearrangeable Multicast Networks
    Emeric Gioan, Serge Burckel, Emmanuel Thomé
    Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 1 (in progress) (1), pp.121-142.
  10. (Arc-)disjoint flows in networks
    Jørgen Bang-Jensen, Stéphane Bessy
    Theoretical Computer Science, Elsevier, 2014, 526, pp.28-40.
  11. Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs
    Pascal Ochem, Alexandre Pinlou
    Graphs and Combinatorics, Springer Verlag, 2014, 30 (2), pp.439-453.
  12. 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, Wiley, 2014, 75 (3), pp.284-302.
  13. Outerplanar obstructions for matroid pathwidth
    Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki
    Discrete Mathematics, Elsevier, 2014, 315, pp.95-101.
  14. 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, Elsevier, 2014, 317, pp.19-32.
  15. Parameterized domination in circle graphs
    Christophe Paul, Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Ignasi Sau Valls, Stéphan Thomassé
    Theory of Computing Systems, Springer Verlag, 2014, 54 (1), pp.45-72.
  16. Clique versus Independent Set
    Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé
    European Journal of Combinatorics, Elsevier, 2014, 40, pp.73-92.
  17. Application of entropy compression in pattern avoidance
    Pascal Ochem, Alexandre Pinlou
    The Electronic Journal of Combinatorics, Open Journal Systems, 2014, 21 (2), pp.1-12.
  18. Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations
    Daniel Gonçalves, Benjamin Lévêque
    Discrete and Computational Geometry, Springer Verlag, 2014, 51 (1), pp.67-131.
  19. 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, Elsevier, 2014, LAGOS’11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina, 164, pp.444-449.
  20. Strong chromatic index of planar graphs with large girth
    Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud
    Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2014, 34 (4), pp.723-733.
  21. Contracting Graphs to Paths and Trees
    Pinar Heggernes, Pim Van ’t Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
    Algorithmica, Springer Verlag, 2014, 68 (1), pp.109-132.
  22. Practical and Efficient Split Decomposition via Graph-Labelled Trees
    Emeric Gioan, Christophe Paul, Marc Tedder, Derek Corneil
    Algorithmica, Springer Verlag, 2014, 69 (4), pp.789-843.
  23. Practical and Efficient Circle Graph Recognition
    Emeric Gioan, Christophe Paul, Marc Tedder, Derek Corneil
    Algorithmica, Springer Verlag, 2014, 69 (4), pp.759-788.
  24. More on square-free words obtained from prefixes by permutations
    Pascal Ochem
    Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2014, Russian-Finnish Symposium in Discrete Mathematics, 132 (1), pp.109-112.
  25. Hitting and harvesting pumpkins
    Gwénaël Joret, Christophe Paul, Ignasi Sau Valls, Saket Saurabh, Stéphan Thomassé
    SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2014, 28 (3), pp.1363-1390.
  26. Dynamic Programming for Graphs on Surfaces
    Juanjo Rué, Ignasi Sau Valls, Dimitrios M. Thilikos
    ACM Transactions on Algorithms, Association for Computing Machinery, 2014, 10 (2), pp.8.
  27. Lift-contractions
    Petr A. Golovach, Daniël Paulusma, Marcin Kamiski, Dimitrios M. Thilikos
    European Journal of Combinatorics, Elsevier, 2014, 35, pp.286 - 296.
  28. Square roots of minor closed graph classes
    Nestor Nestoridis, Dimitrios M. Thilikos
    Discrete Applied Mathematics, Elsevier, 2014, 168, pp.34 - 39.

Communications internationales

2019

  1. 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes
    Daniel Gonçalves
    45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2019, Vall de Núria, Spain. pp.351-363.
  2. Approximation results for makespan minimization with budgeted uncertainty
    Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
    WAOA 2019, Sep 2019, Munich, Germany.
  3. 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.1 - 23.
  4. Modification to Planarity is Fixed Parameter Tractable
    Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
    STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.28:1--28:17.
  5. Minimum Reload Cost Graph Factors
    Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos
    SOFSEM, Jan 2019, Nový Smokovec, Slovakia. pp.67-80.
  6. Every Collinear Set in a Planar Graph Is Free
    Vida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote
    SODA: Symposium on Discrete Algorithms, Jan 2019, San Diego, CA, United States. pp.1521-1538.
  7. Connected tree-width and connected cops and robber game
    Christophe Paul
    CAALM: Complexity, Algorithms, Automata and Logic Meet, Jan 2019, Chennai, India. <https://www.cmi.ac.in/~sri/CAALM2019/>
  8. Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
    Guilherme Gomes, Ignasi Sau Valls
    14th International Symposium on Parameterized and Exact Computation (IPEC), Sep 2019, Munich, Germany. pp.19:1--19:15.
  9. A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth
    Julien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos
    IPEC: International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.2:1--2:13.
  10. Lean Tree-Cut Decompositions: Obstructions and Algorithms
    Archontia Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
    STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.32:1--32:14.

2018

  1. Data-Compression for Parametrized Counting Problems on Sparse Graphs
    Eun Jung Kim, Maria Serna, Dimitrios M. Thilikos
    ISAAC: International Symposium on Algorithms and Computation, Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.20:1--20:13.
  2. Dual parameterization of Weighted Coloring
    Julio Araujo, Victor Campos, Carlos Vinícius G. C. Lima, Vinicius Fernandes dos Santos, Ignasi Sau Valls, Ana Silva
    13th International Symposium on Parameterized and Exact Computation (IPEC), Aug 2018, Helsinki, Finland. pp.12:1--12:14.
  3. 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. <https://projet.liris.cnrs.fr/~icgt2018/>
  4. Computing Small Pivot-Minors
    Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël Paulusma
    WG: Graph-Theoretic Concepts in Computer Science, Jun 2018, Cottbus, Germany. pp.125-138.
  5. Temporal matching in link stream: kernel and approximation
    Julien Baste, Binh-Minh Bui-Xuan
    16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2018), Jun 2018, Paris, France.
  6. Partial complementation of graphs
    Fedor Fomin, Petr Golovach, Torstein Strømme, Dimitrios M. Thilikos
    SWAT: Scandinavian Workshops on Algorithm Theory, Jun 2018, Malmö, Sweden. pp.21:1--21:13.
  7. On the complexity of finding internally vertex-disjoint long directed paths
    Julio Araujo, Victor Campos, Ana Karolinna Maia, Ignasi Sau Valls, Ana Silva
    13th Latin American Symposium on Theoretical Informatics (LATIN), Apr 2018, Buenos Aires, Argentina. pp.66-79.
  8. 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.
  9. A polynomial Turing kernel to compute the cut-width of semi-complete digraph
    Christophe Paul
    FILOFOCS: French-Israeli Workshop on Foundations of Computer Science, Oct 2018, Paris, France. <https://www.irif.fr/~adiro/filofocs/filofocs2018/index.html>
  10. Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma
    Ioannis Giotis, Lefteris Kirousis, John Livieratos, Kostas Psaromiligkos, Dimitrios M. Thilikos
    GASCom: Random and Exhaustive Generation of Combinatorial Structures, Jun 2018, Athens, Greece. pp.148-155.

2017

  1. Contraction-Bidimensionality of Geometric Intersection Graphs
    Julien Baste, Dimitrios M. Thilikos
    IPEC: International symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.5:1--5:13.
  2. Triangle packing in (sparse) tournaments: approximation and kernelization
    Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut
    ESA: European Symposium on Algorithms, Sep 2017, Vienne, Austria. pp.14:1--14:13.
  3. Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter
    Julien Baste, Didem Gözüpek, Ignasi Sau Valls, Mordechai Shalom, Dimitrios M. Thilikos
    IPEC: International symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.3:1--3:12.
  4. Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth
    Julien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos
    IPEC: International symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.4:1--4:12.
  5. How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
    Marin Bougeret, Ignasi Sau Valls
    IPEC: International symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.10:1--10:13.
  6. Structured Connectivity Augmentation
    Fedor Fomin, Petr Golovach, Dimitrios M. Thilikos
    MFCS: Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.29:1--29:13.
  7. On Some Interesting Ternary Formulas
    Pascal Ochem, Matthieu Rosenfeld
    WORDS, Sep 2017, Montreal, Canada. pp.30-35.
  8. 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.
  9. Complexity Dichotomies for the Minimum $F$-Overlay Problem
    Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau Valls, Rémi Watrigant
    IWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. pp.12.
  10. Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs
    Florian Barbero, Christophe Paul, Michał Pilipczuk
    ICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Warsaw, Poland. pp.70:1--70:13.
  11. 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.
  12. On the Number of Labeled Graphs of Bounded Treewidth
    Julien Baste, Marc Noy, Ignasi Sau Valls
    WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.88-99.
  13. Uniquely Restricted Matchings and Edge Colorings
    Julien Baste, Dieter Rautenbach, Ignasi Sau Valls
    WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.100-112.
  14. Dushnik-Miller dimension of TD-Delaunay complexes
    Daniel Gonçalves, Lucas Isenmann
    EuroCG: European Workshop on Computational Geometry, Apr 2017, Malmo, Sweden.

2016

  1. Cutwidth: obstructions and algorithmic aspects
    Archontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna
    IPEC: International symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13.
  2. FPT Algorithms for Plane Completion Problems
    Dimitris Chatzidimitriou, Archontia 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.
  3. Avoidability of Formulas with Two Variables
    Pascal Ochem, Matthieu Rosenfeld
    DLT: Developments in Language Theory, Laboratoire de combinatoire et d'informatique mathématique (LaCIM), Université du Québec à Montréal, Jul 2016, Montréal, Canada. pp.344-354.
  4. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees
    Julien Baste, Christophe Paul, Ignasi Sau Valls, Celine Scornavacca
    AAIM: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.53-64.
  5. Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability
    Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau Valls, Mordeshai Shalom
    WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.195-206.
  6. Packing and Covering Immersion Models of Planar subcubic Graphs
    Archontia Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos
    WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84.
  7. 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.
  8. 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.
  9. 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. <http://bgw.labri.fr/2016/>
  10. On Independent Set on B1-EPG Graphs
    Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
    WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169.
  11. Vertex-partitions of graphs
    Mickaël Montassier
    ICGCA: International Conference on Graph theory, Combinatorics and their Applications, Oct 2016, Jinhua, China.
  12. 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. <http://bgw.labri.fr/2016/>
  13. 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.
  14. On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs
    Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau Valls, Uéverton dos Santos Souza
    COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.423-437.
  15. Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
    Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
    IWOCA: International Workshop on Combinatorial Algorithms, 2015, Verona, Italy. pp.100-111.

2015

  1. An FPT 2-Approximation for Tree-cut Decomposition
    Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos
    WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46.
  2. An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$
    Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos
    WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132.
  3. Bidimensionality and Parameterized Algorithms
    Dimitrios M. Thilikos
    IPEC: International symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.1-16.
  4. Variants of Plane Diameter Completion
    Clément Requilé, Dimitrios M. Thilikos, Petr A. Golovach
    IPEC: International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.30-42.
  5. Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism
    Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos
    IPEC: International symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.78-89.
  6. An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
    Christophe Paul, Eun Jung Kim, Mamadou Moustapha Kanté, O-Joung Kwon
    IPEC: International symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.139-150.
  7. 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.
  8. 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.
  9. Minimal Disconnected Cuts in Planar Graphs
    Marcin Kaminski, Daniël Paulusma, Stewart Anthony, Dimitrios M. Thilikos
    FCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.243-254.
  10. 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.
  11. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
    Nathann Cohen, Daniel Gonçalves, Kim Eun Jung, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos, Mathias Weller
    CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142.
  12. 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.
  13. 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. <https://tutte2015.ma.rhul.ac.uk>
  14. Orienting triangulations
    Boris Albar, Daniel Gonçalves, Kolja Knauer
    EuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia. <http://eurocg15.fri.uni-lj.si>
  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>
  16. 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.
  17. 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. <https://conferences.matheo.si/event/6/page/12>
  18. 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. <http://ctw2015.eng.marmara.edu.tr>
  19. 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. <http://ctw2015.eng.marmara.edu.tr>

2014

  1. A 14$k$-Kernel for Planar Feedback Vertex Set via Region Decomposition
    Marthe Bonamy, Lukasz Kowalik
    IPEC: International Symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.97-109.
  2. The role of planarity in connectivity problems parameterized by treewidth
    Julien Baste, Ignasi Sau Valls
    IPEC: International symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.63-74.
  3. The Parameterized Complexity of Graph Cyclability
    Petr A. Golovach, Marcin Kamiski, Spyridon Maniatis, Dimitrios M. Thilikos
    ESA: European Symposium on Algorithms, Sep 2014, Wrocław, Poland. pp.492-504.
  4. Quantifying trust dynamics in signed graphs, the S-Cores approach
    Christos Giatsidis, Bogdan Cautis, Silviu Maniu, Michalis Vazirgiannis, Dimitrios M. Thilikos
    SDM: SIAM Data Mining, Aug 2014, Philadelphia, United States. pp.668-676.
  5. 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.
  6. 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.
  7. Recognition of dynamic circle graphs
    Christophe Crespelle, Emeric Gioan, Christophe Paul
    ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. <http://oc.inpg.fr/conf/icgt2014/>
  8. Covering and packing pumpkin models
    Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos
    ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. <http://oc.inpg.fr/conf/icgt2014/>
  9. An edge variant of the Erdős-Pósa property
    Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. Thilikos
    ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
  10. 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.
  11. 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.
  12. 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.
  13. Detecting minors in matroids throughout triangles
    Boris Albar, Daniel Gonçalves, Jorge Ramírez Alfonsín
    ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. <http://oc.inpg.fr/conf/icgt2014/>
  14. Hadwiger Number of Graphs with Small Chordality
    Petr A. Golovach, Pinar Heggernes, Pim van 'T Hof, Christophe Paul
    WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-Fuzelier, France. pp.201-213.
  15. 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.
  16. Explicit linear kernels via dynamic programming
    Valentin Garnero, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos
    STACS: Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324.
  17. 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.
  18. Entropy compression method and graph coloring problems
    Mickaël Montassier
    C&C: Cycles and Colourings, 2014, Novy Smokovec, Slovakia.
  19. 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.
  20. Making Octants Colorful and Related Covering Decomposition Problems
    Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
    SODA: Symposium on Discrete Algorithms, Jan 2014, Portland, United States. pp.1424-1432.
  21. 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.
  22. Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
    Steven Chaplick, Paul Dorbec, Jan Kratochvil, Mickaël Montassier, Juraj Stacho
    WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-fuzelier, France. pp.139-151.

Mots-clés

Algorithmique de Graphes, Théorie des Graphes, Combinatoire

Dernière mise à jour le 07/01/2019