AlGCo : algorithmes, graphes et combinatoire

Responsable : Mickael Montassier

Département Informatique - LIRMM


Accueil | 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 : 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008
Conférences : 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008
Conférences invitées : 2016 2015 2014 2013 2012 2011 2010 2009 2008
Ouvrages et chapitres d'ouvrages : 2016 2015 2014 2013 2012 2010
Travaux d'édition : 2016 2015 2014 2013 2012


Revues 2008 - 2017


Revues 2017

[20]An O(log OPT)-Approximation for Covering and Packing Minor Models of θr. Jean-Florent Raymond, Dimitris Chatzidimitriou, Ignasi Sau, Dimitrios M. Thilikos. Algorithmica, Springer Verlag, 2017, 〈10.1007/s00453-017-0313-5〉. [DOI]
[19]The Parameterized Complexity of Graph Cyclability. Dimitrios M. Thilikos, Petr Golovach, Marcin Kamiński, Spyridon Maniatis. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2017, 31 (1), pp.511 - 541. 〈10.1137/141000014〉. [DOI]
[18]Editing to a planar graph of given degrees. Dimitrios M. Thilikos, Konrad Dabrowski, Petr A. Golovach, Pim Van 'T Hof, Daniël Paulusma. Journal of Computer and System Sciences, Elsevier, 2017, 85, pp.168 - 182. 〈10.1016/j.jcss.2016.11.009〉. [DOI]
[17]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, Elsevier, 2017, 690, pp.91-103. 〈10.1016/j.tcs.2017.06.013〉. [DOI]
[16]On the complexity of computing the k-restricted edge-connectivity of a graph. Luis Pedro Montejano, Ignasi Sau. Theoretical Computer Science, Elsevier, 2017, 662, pp.31-39. 〈10.1016/j.tcs.2016.12.006〉. [DOI]
[15]Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Julien Baste, Luerbio Faria, Sulamita Klein, Ignasi Sau. Theory of Computing Systems, Springer Verlag, 2017, 61 (3), pp.777-794. 〈10.1007/s00224-016-9716-y〉. [DOI]
[14]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. 〈10.1016/j.tcs.2016.12.011〉. [DOI]
[13]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. 〈10.1016/j.dam.2016.12.025〉. [DOI]
[12]A linear kernel for planar red–blue dominating set. Valentin Garnero, Ignasi Sau, Dimitrios M. Thilikos. Discrete Applied Mathematics, Elsevier, 2017, 217, pp.536-547. 〈10.1016/j.dam.2016.09.045〉. [DOI]
[11]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, In press.
[10]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, Elsevier, 2017, 86, pp.191-206. 〈10.1016/j.jcss.2017.01.003〉. [DOI]
[9]Irrelevant vertices for the planar Disjoint Paths Problem. Dimitrios M. Thilikos, Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh. Journal of Combinatorial Theory, Series B, Elsevier, 2017, 122, pp.815 - 843. 〈10.1016/j.jctb.2016.10.001〉. [DOI]
[8]On the parameterized complexity of the Edge Monitoring problem. Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau. Information Processing Letters, Elsevier, 2017, 121, pp.39-44. 〈10.1016/j.ipl.2017.01.008〉. [DOI]
[7]Colorful paths for 3-chromatic graphs. Nicolas Bousquet, Stéphane Bessy. Discrete Mathematics, Elsevier, 2017, 340 (5), pp.1000-1007. 〈10.1016/j.disc.2017.01.016〉. [DOI]
[6]Minors in graphs of large θr-girth. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. European Journal of Combinatorics, Elsevier, 2017, 65, pp.106-121. 〈10.1016/j.ejc.2017.04.011〉. [DOI]
[5]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, Elsevier, 2017, 65, pp.154-167. 〈10.1016/j.ejc.2017.05.009〉. [DOI]
[4]An integer programming approach for the search of discretization orders in distance geometry problems. Jérémy Omer, Douglas Gonçalves. Optimization Letters, Springer Verlag, A Paraître, 〈10.1007/s11590-017-1207-9〉. [DOI]
[3]Well-quasi-ordering $H$-contraction-free graphs. Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck. Discrete Applied Mathematics, Elsevier, 2017, In press. 〈10.1016/j.dam.2017.02.018〉. [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. Journal of Computer and System Sciences, Elsevier, 2017, 89, pp.315 - 327. 〈10.1016/j.jcss.2017.05.016〉. [DOI]
[1]Encoding toroidal triangulations. Vincent Despré, Daniel Gonçalves, Benjamin Lévêque. Discrete and Computational Geometry, Springer Verlag, 2017, pp.507-544. 〈10.1007/s00454-016-9832-0〉. [DOI]


Revues 2016

[26]On interval representations of graphs. Aquiles Braga de Queiroz, Valentin Garnero, Pascal Ochem. Discrete Applied Mathematics, Elsevier, 2016, 202, pp.30-36. 〈10.1016/j.dam.2015.08.022〉. [DOI]
[25]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, To appear.
[24]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. 〈10.1016/j.disc.2015.10.016〉. [DOI]
[23]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. 〈10.1051/ita/2016007〉. [DOI]
[22]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. 〈10.7151/dmgt.1859〉. [DOI]
[21]On the consistency of orthology relationships. Mark Jones, Christophe Paul, Celine Scornavacca. BMC Bioinformatics, BioMed Central, 2016, 17 (S14), 〈10.1186/s12859-016-1267-3〉. [DOI]
[20]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. 〈10.1137/15M1014310〉. [DOI]
[19]Homomorphisms of 2-edge-colored triangle-free planar graphs. Pascal Ochem, Alexandre Pinlou, Sagnik Sen. Journal of Graph Theory, Wiley, 2016, to appear, 〈10.1002/jgt.22059〉. [DOI]
[18]Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations. Rodolphe Giroudeau, Guillerme Duvillié, Marin Bougeret, Rémi Watrigant. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, In press.
[17]Doubled patterns are 3-avoidable. Pascal Ochem. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2016, 23 (1), pp.P1.19. 〈http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p19/pdf〉.
[16]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.
[15](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. 〈10.1145/2973749〉. [DOI]
[14]An edge variant of the Erdős–Pósa property. Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. Discrete Mathematics, Elsevier, 2016, 339 (8), pp.2027-2035. 〈10.1016/j.disc.2016.03.004〉. [DOI]
[13]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. 〈10.1016/j.disopt.2016.07.001〉. [DOI]
[12]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. 〈10.1016/j.dam.2015.07.036〉. [DOI]
[11]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. 〈10.1016/j.ejc.2015.10.010〉. [DOI]
[10]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〉. [DOI]
[9]Orienting Triangulations. Boris Albar, Daniel Gonçalves, Kolja Knauer. Journal of Graph Theory, Wiley, 2016, 83 (4), pp.392-405. 〈10.1002/jgt.22005〉. [DOI]
[8]Minimal disconnected cuts in planar graphs. Marcin Kamiński, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos. Networks, Wiley, 2016, 68 (4), pp.2502-259. 〈10.1002/net.21696〉. [DOI]
[7]Scattered packings of cycles. Aistis Atminas, Marcin Kamiński, Jean-Florent Raymond. Theoretical Computer Science, Elsevier, 2016, 647, pp.33 - 42. 〈10.1016/j.tcs.2016.07.021〉. [DOI]
[6]Antistrong digraphs. Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell. Journal of Combinatorial Theory, Series B, Elsevier, 2016, In press. 〈10.1016/j.jctb.2016.05.004〉. [DOI]
[5]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, Association for Computing Machinery, 2016, 12 (2), pp.No. 21. 〈10.1145/2797140〉. [DOI]
[4]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. 〈10.1137/140957883〉. [DOI]
[3]Coloring non-crossing strings. Louis Esperet, Daniel Gonçalves, Arnaud Labourel. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2016, 23 (4), pp.4.4. 〈http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p4〉.
[2]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, Vol. 17 no. 3 (3), pp.131-146.
[1]Parameterized certificate dispersal and its variants. Valentin Garnero, Mathias Weller. Theoretical Computer Science, Elsevier, 2016, 622, pp.66-78. 〈10.1016/j.tcs.2016.02.001〉. [DOI]


Revues 2015

[23]Characterization of some binary words with few squares. Golnaz Badkobeh, Pascal Ochem. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 588, pp.73-80. 〈10.1016/j.tcs.2015.03.044〉. [DOI]
[22]Complexity dichotomy for oriented homomorphism of planar graphs with large girth. Guillaume Guégan, Pascal Ochem. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 596, pp.142-148. 〈10.1016/j.tcs.2015.06.041〉. [DOI]
[21]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. 〈10.1137/130927449〉. [DOI]
[20]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. 〈10.1137/140975279〉. [DOI]
[19]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. 〈10.1002/jgt.21830〉. [DOI]
[18]List Coloring with a Bounded Palette. Marthe Bonamy, Ross J. Kang. Journal of Graph Theory, Wiley, 2015, 〈10.1002/jgt.22013〉. [DOI]
[17]Near-colorings: non-colorable graphs and NP-completeness. Mickaël Montassier, Pascal Ochem. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2015, 22 (1), pp.#P1.57.
[16]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. 〈10.7151/dmgt.1821〉. [DOI]
[15]Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. François Dross, Mickaël Montassier, Alexandre Pinlou. Electronic Notes in Discrete Mathematics, Elsevier, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.269-275. 〈10.1016/j.endm.2015.06.037〉. [DOI]
[14]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.
[13]Low Polynomial Exclusion of Planar Graph Patterns. Jean-Florent Raymond, Dimitrios M. Thilikos. Journal of Graph Theory, Wiley, 2015, 〈10.1002/jgt.22009〉. [DOI]
[12]The role of planarity in connectivity problems parameterized by treewidth. Julien Baste, Ignasi Sau. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 570, pp.1-14. 〈10.1016/j.tcs.2014.12.010〉. [DOI]
[11]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. 〈10.1007/s00453-013-9828-6〉. [DOI]
[10]Planar Disjoint-Paths Completion. Isolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos. Algorithmica, Springer Verlag, 2015, 76 (2), pp.401-425. 〈http://link.springer.com/article/10.1007/s00453-015-0046-2〉. 〈10.1007/s00453-015-0046-2〉. [DOI]
[9]Excluding cycles with a fixed number of chords. Pierre Aboulker, Nicolas Bousquet. Discrete Applied Mathematics, Elsevier, 2015, 180, pp.11-24. 〈10.1016/j.dam.2014.08.006〉. [DOI]
[8]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. 〈10.1016/j.endm.2015.06.104〉. [DOI]
[7]Forbidding Kuratowski Graphs as Immersions. Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos. Journal of Graph Theory, Wiley, 2015, 78 (1), pp.43-60. 〈10.1002/jgt.21790〉. [DOI]
[6]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. 〈10.1002/jgt.21855〉. [DOI]
[5]Explicit Linear Kernels via Dynamic Programming. Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (4), pp.1864-1894. 〈10.1137/140968975〉. [DOI]
[4]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. 〈http://epubs.siam.org/doi/abs/10.1137/14097879X〉. 〈10.1137/14097879X〉. [DOI]
[3]Two floor building needing eight colors. Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni. Journal of Graph Algorithms and Applications (JGAA), Brown University, 2015, 19 (1), pp.1--9. 〈http://dx.doi.org/10.7155/jgaa.00344〉.
[2]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.1016/j.jctb.2015.01.001〉. [DOI]
[1]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.17.


Revues 2014

[28]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. 〈10.1007/s00453-012-9670-2〉. [DOI]
[27]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. 〈10.1016/j.dam.2013.02.025〉. [DOI]
[26]Brooks’ theorem on powers of graphs. Marthe Bonamy, Nicolas Bousquet. Discrete Mathematics, Elsevier, 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, Elsevier, 2014, 41, pp.128-137. 〈10.1016/j.ejc.2014.03.006〉. [DOI]
[24]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〉.
[23](Arc-)disjoint flows in networks. Jørgen Bang-Jensen, Stéphane Bessy. Theoretical Computer Science, Elsevier, 2014, 526, pp.28-40. 〈10.1016/j.tcs.2014.01.011〉. [DOI]
[22]Circle Graph Recognition in Time O(n+m)\alpha(n+m). Emeric Gioan, Christophe Paul, Marc Tedder, Derek Corneil. Algorithmica, Springer Verlag, 2014, 69 (4), pp.789-788. 〈10.1007/s00453-013-9745-8〉. [DOI]
[21]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. 〈10.1007/s00454-013-9552-7〉. [DOI]
[20]Square roots of minor closed graph classes. Nestor Nestoridis, Dimitrios M. Thilikos. Discrete Applied Mathematics, Elsevier, 2014, 168, pp.34 - 39. 〈10.1016/j.dam.2013.05.026〉. [DOI]
[19]On the bend-number of planar and outerplanar graphs. Daniel Heldt, Kolja Knauer, Torsten Ueckerdt. Discrete Applied Mathematics, Elsevier, 2014, 179, pp.109-119. 〈10.1016/j.dam.2014.07.015〉. [DOI]
[18]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. 〈10.1051/ita/2014015〉. [DOI]
[17]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. 〈10.3233/FI-2014-1035〉. [DOI]
[16]Application of entropy compression in pattern avoidance. Pascal Ochem, Alexandre Pinlou. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2014, 21 (2), pp.1-12. 〈http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p7〉.
[15]Parameterized domination in circle graphs. Christophe Paul, Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Ignasi Sau, Stéphan Thomassé. Theory of Computing Systems, Springer Verlag, 2014, 54 (1), pp.45-72. 〈10.1007/s00224-013-9478-8〉. [DOI]
[14]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. 〈10.1007/s00453-013-9752-9〉. [DOI]
[13]Graphs with maximum degree Δ≥17 and maximum average degree less than 33 are list 22-distance (Δ+2)-colorable. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. Discrete Mathematics, Elsevier, 2014, 317, pp.19-32. 〈10.1016/j.disc.2013.10.022〉. [DOI]
[12]Outerplanar obstructions for matroid pathwidth. Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki. Discrete Mathematics, Elsevier, 2014, 315, pp.95-101. 〈10.1016/j.disc.2013.10.007〉. [DOI]
[11]Lift-contractions. Petr A. Golovach, Daniël Paulusma, Marcin Kamiski, Dimitrios M. Thilikos. European Journal of Combinatorics, Elsevier, 2014, 35, pp.286 - 296. 〈10.1016/j.ejc.2013.06.026〉. [DOI]
[10]Dynamic Programming for Graphs on Surfaces. Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos. ACM Transactions on Algorithms, Association for Computing Machinery, 2014, 10 (2), pp.Article No. 8. 〈10.1145/2556952〉. [DOI]
[9]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. 〈10.1007/s00373-013-1283-2〉. [DOI]
[8]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. 〈10.1002/jgt.21740〉. [DOI]
[7]On the number of prime factors of an odd perfect number. Pascal Ochem, Michaël Rao. Mathematics of Computation, American Mathematical Society, 2014, 83 (289), pp.2435-2439. 〈10.1090/S0025-5718-2013-02776-7〉. [DOI]
[6]Hitting and harvesting pumpkins. Gwénaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2014, 28 (3), pp.1363-1390. 〈10.1137/120883736〉. [DOI]
[5]Clique versus Independent Set. Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé. European Journal of Combinatorics, Elsevier, 2014, 40, pp.73-92. 〈http://www.sciencedirect.com/science/article/pii/S0195669814000249〉. 〈10.1016/j.ejc.2014.02.003〉. [DOI]
[4]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. 〈10.1002/jgt.21782〉. [DOI]
[3]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. 〈10.7151/dmgt.1763〉. [DOI]
[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.
[1]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.


Revues 2013

[16]Obtaining a Bipartite Graph by Contracting Few Edges. Christophe Paul, Pinar Heggernes, Pim Van 'T Hof, Daniel Lokshtanov. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2013, 27 (4), pp.2143-215.
[15]On approximating the -girth of a graph. David Peleg, Ignasi Sau, Mordechai Shalom. Discrete Applied Mathematics, Elsevier, 2013, 161 (16), pp.2587-2596. 〈10.1016/j.dam.2013.04.022〉. [DOI]
[14]Polynomial kernels for Proper Interval Completion and related problems. Stéphane Bessy, Anthony Perez. Information and Computation, Elsevier, 2013, 231, pp.89-108. 〈10.1016/j.ic.2013.08.006〉. [DOI]
[13]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, Elsevier, 2013, pp.Electronic Edition. 〈http://authors.elsevier.com/sd/article/S0166218X13001236〉. 〈10.1016/j.dam.2013.02.036〉. [DOI]
[12]Asymptotic enumeration of non-crossing partitions on surfaces. Dimitrios M. Thilikos, Ignasi Sau, Juanjo Rué. Discrete Mathematics, Elsevier, 2013, pp.635-649. 〈http://www.sciencedirect.com/science/article/pii/S0012365X1200533X〉. 〈10.1016/j.disc.2012.12.011〉. [DOI]
[11]On exact algorithms for the permutation CSP. Eun Jung Kim, Daniel Gonçalves. Journal of Theoretical Computer Science (TCS), Elsevier, 2013, 511, pp.109-116. 〈10.1016/j.tcs.2012.10.035〉. [DOI]
[10]Optimizing the Graph Minors Weak Structure Theorem. Archontia C. Giannopoulou, Dimitrios M. Thilikos. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2013, 27 (3), pp.1209-1227. 〈http://epubs.siam.org/doi/abs/10.1137/110857027〉. 〈10.1137/110857027〉. [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, Elsevier, 2013, 475, pp.13-20.
[8]Increasing the minimum degree of a graph by contractions. Petr A. Golovach, Marcin Kamiński, Daniël Paulusma, Dimitrios M. Thilikos. Theoretical Computer Science, Elsevier, 2013, 481, pp.74-84. 〈10.1016/j.tcs.2013.02.030〉. [DOI]
[7]Vertex Partitions of Graphs into Cographs and Stars. Paul Dorbec, Mickael Montassier, Pascal Ochem. Journal of Graph Theory, Wiley, 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, Wiley, 2013, 73 (1), pp.85-102. 〈http://dx.doi.org/10.1002/jgt.21659〉. 〈10.1002/jgt.21659〉. [DOI]
[5]Strong edge-colouring and induced matchings. Hervé Hocquard, Pascal Ochem, Petru Valicov. Information Processing Letters, Elsevier, 2013, 113 (19-21), pp.836-843. 〈10.1016/j.ipl.2013.07.026〉. [DOI]
[4]Enumerating the edge-colourings and total colourings of a regular graph. Stéphane Bessy, Frédéric Havet. Journal of Combinatorial Optimization, Springer Verlag, 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, Elsevier, 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, Andras Sebo, Stéphan Thomassé, Nicolas Trotignon, András Sebő. Electronic Journal of Combinatorics, 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, Springer Verlag, 2013, 65 (4), pp.900-926.


Revues 2012

[34]Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Stéphan Thomassé, Nicolas Bousquet. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2012, 21, pp.512-514. 〈10.1017/S0963548312000065〉. [DOI]
[33]Segment representation of a subclass of co-planar graphs. Mathew C. Francis, Jan Kratochvil, Tomáš Vyskočil. Discrete Mathematics, Elsevier, 2012, 312, pp.1815-1818. 〈http://www.sciencedirect.com/science/article/pii/S0012365X12000386〉.
[32]Sieve Methods for Odd Perfect Numbers. S. Adam Fletcher, P. Nielsen Pace, Pascal Ochem. Mathematics of Computation, American Mathematical Society, 2012, 81, pp.1753-1776.
[31]Split Decomposition and Graph-Labelled Trees: Characterizations and Fully-Dynamic Algorithms for Totally Decomposable Graphs. Emeric Gioan, Christophe Paul. Discrete Applied Mathematics, Elsevier, 2012, 160 (6), pp.708-733.
[30]Graph transformations preserving the stability number. Benjamin Lévêque, Dominique De Werra. Discrete Applied Mathematics, Elsevier, 2012, 160, pp.2752-2759. 〈10.1016/j.dam.2011.08.023〉. [DOI]
[29]L(p,q)-labeling of sparse graphs. Clément Charpentier, Mickaël Montassier, André Raspaud. Journal of Combinatorial Optimization, Springer Verlag, 2012, 25 (4), pp.646-660. 〈10.1007/s10878-012-9507-6〉. [DOI]
[28]Fast Minor Testing in Planar Graphs. Isolde Adler, Frederic Dorn, Fedor Fomin, Ignasi Sau, Dimitrios M. Thilikos. Algorithmica, Springer Verlag, 2012, 64 (1), pp.69-84. 〈http://link.springer.com/article/10.1007%2Fs00453-011-9563-9〉. 〈10.1007/s00453-011-9563-9〉. [DOI]
[27]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, Springer Verlag, 2012, 64, pp.112-125. 〈10.1007/s00453-011-9548-8〉. [DOI]
[26]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, Elsevier, 2012, pp.2089-2097. 〈http://www.sciencedirect.com/science/article/pii/S0166218X12001199〉. 〈10.1016/j.dam.2012.03.015〉. [DOI]
[25]Triangle Contact Representations and Duality. Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. Discrete and Computational Geometry, Springer Verlag, 2012, 48 (1), pp.239-254.
[24]A stability theorem on fractional covering of triangles by edges. Penny Haxell, Alexandr Kostochka, Stéphan Thomassé. European Journal of Combinatorics, Elsevier, 2012, 33 (5), pp.799-806. 〈10.1016/j.ejc.2011.09.024〉. [DOI]
[23]Repetition Thresholds for Subdivided Graphs and Trees. Pascal Ochem, Elise Vaslet. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2012, 46 (1), pp.123-130.
[22]On backbone coloring of graphs. Yuehua Bu, Mickaël Montassier, André Raspaud, Weifan Wang. Journal of Combinatorial Optimization, Springer Verlag, 2012, 23, pp.79-93. 〈10.1007/s10878-010-9342-6〉. [DOI]
[21]Adjacent vertex-distinguishing edge coloring of graphs with maximum degree $\Delta$. Hervé Hocquard, Mickaël Montassier. Journal of Combinatorial Optimization, Springer Verlag, 2012, pp.9. 〈10.1007/s10878-011-9444-9〉. [DOI]
[20]Catalan structures and dynamic programming in H-minor-free graphs. Frederic Dorn, Fedor Fomin, Dimitrios M. Thilikos. Journal of Computer and System Sciences, Elsevier, 2012, 78 (5), pp.1606-1622. 〈http://www.sciencedirect.com/science/article/pii/S0022000012000505〉. 〈10.1016/j.jcss.2012.02.004〉. [DOI]
[19]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, Springer Verlag, 2012, pp.15. 〈10.1007/s10878-012-9490-y〉. [DOI]
[18]Odd Perfect Numbers are Greater than 10^1500. Pascal Ochem, Michael Rao. Mathematics of Computation, American Mathematical Society, 2012, 81 (279), pp.1869-1877.
[17]D-cores: measuring collaboration of directed graphs based on degeneracy. Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis. Knowledge and Information Systems (KAIS), Springer, 2012, 35 (2), pp.311 - 343. 〈http://link.springer.com/article/10.1007%2Fs10115-012-0539-0〉. 〈10.1007/s10115-012-0539-0〉. [DOI]
[16]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, IEEE/ACM, 2012, 20, pp.1-15. 〈10.1109/TNET.2012.2186462〉. [DOI]
[15](k,1)-coloring of sparse graphs. Oleg Borodin, Anna Ivanova, Mickaël Montassier, André Raspaud. Discrete Mathematics, Elsevier, 2012, 312 (6), pp.1128-1135. 〈10.1016/j.disc.2011.11.031〉. [DOI]
[14]Simpler multicoloring of triangle-free hexagonal graphs. Ignasi Sau, Petra Šparl, Janez Žerovnik. Discrete Mathematics, Elsevier, 2012, 312 (1), pp.181-187.
[13]Some structural properties of planar graphs and their applications to 3-choosability. Min Chen, Mickaël Montassier, André Raspaud. Discrete Mathematics, Elsevier, 2012, 312 (2), pp.362-373. 〈10.1016/j.disc.2011.09.028〉. [DOI]
[12]Parameterized complexity of finding small degree-constrained subgraphs. Omid Amini, Ignasi Sau, Saket Saurabh. Journal of Discrete Algorithms, Elsevier, 2012, 10, pp.70-83. 〈10.1016/j.jda.2011.05.001〉. [DOI]
[11]On graphs with no induced subdivision of K4. Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon. Journal of Combinatorial Theory, Series B, Elsevier, 2012, 102, pp.924-947. 〈10.1016/j.jctb.2012.04.005〉. [DOI]
[10]Cyclic orderings and cyclic arboricity of matroids. Jan Van den Heuvel, Stéphan Thomassé. Journal of Combinatorial Theory, Series B, Elsevier, 2012, 102, pp.638-646. 〈10.1016/j.jctb.2011.08.004〉. [DOI]
[9]On exact algorithms for treewidth. Hans L. Bodlaender, Fedor V. Fomin, Aries Koster, Dieter Kratsch, Dimitrios M. Thilikos. ACM Transactions on Algorithms, Association for Computing Machinery, 2012, 9 (1), pp.12:1--12:23. 〈http://dl.acm.org/citation.cfm?id=2390188〉. 〈10.1145/2390176.2390188〉. [DOI]
[8]Coloring vertices of a graph or finding a Meyniel obstruction. Kathie Cameron, Benjamin Lévêque, Frédéric Maffray. Theoretical Computer Science, Elsevier, 2012, 428, pp.10-17. 〈10.1016/j.tcs.2011.12.018〉. [DOI]
[7]On the approximability of some degree-constrained subgraph problems. Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh. Discrete Applied Mathematics, Elsevier, 2012, 160 (2), pp.1661-1679. 〈10.1016/j.dam.2012.03.025〉. [DOI]
[6]Quartets and Unrooted Phylogenetic Networks. Philippe Gambette, Vincent Berry, Christophe Paul. Journal of Bioinformatics and Computational Biology, World Scientific Publishing, 2012, 10 (4), pp.1250004.1-1250004.23. 〈10.1142/S0219720012500047〉. [DOI]
[5]The spanning galaxy problem. Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. Discrete Applied Mathematics, Elsevier, 2012, 160 (6), pp.744-754.
[4]Tree-representation of set families and applications to combinatorial decompositions. Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao. European Journal of Combinatorics, Elsevier, 2012, 33 (5), pp.688-711.
[3]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, Elsevier, 2012, 215, pp.8-31. 〈10.1016/j.ic.2012.03.001〉. [DOI]
[2]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, Elsevier, 2012, 444, pp.3-16. 〈10.1016/j.tcs.2012.01.033〉. [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, Elsevier, 2012, 219, pp.1-16.


Revues 2011

[16]The Domination Number of Grids. Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25, pp.1443-1453.
[15]On self-duality of branchwidth in graphs of bounded genus. Ignasi Sau, Dimitrios M. Thilikos. Discrete Applied Mathematics, Elsevier, 2011, 159 (17), pp.2184-2186. 〈10.1016/j.dam.2011.06.028〉. [DOI]
[14]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, Society for Industrial and Applied Mathematics, 2011, 25 (4), pp.1490-1505. 〈10.1137/090775440〉. [DOI]
[13]Covering a Graph by Forests and a Matching. Tomáš Kaiser, Mickaël Montassier, André Raspaud. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25 (4), pp.1804-1811. 〈10.1137/100818340〉. [DOI]
[12]A General Label Search to Investigate Classical Graph Search Algorithms. Geneviève Simonet, Anne Berry, Richard Krueger. Discrete Applied Mathematics, Elsevier, 2011, 159, pp.128-142. 〈10.1016/j.dam.2010.02.011〉. [DOI]
[11]Characterizing Directed Path Graphs by Forbidden Asteroids. Kathie Cameron, Chinh Hoàng, Benjamin Lévêque. Journal of Graph Theory, Wiley, 2011, 68, pp.103-112. 〈10.1002/jgt.20543〉. [DOI]
[10]Algorithms and complexity results for persuasive argumentation. Eunjung Kim, Ordyniak Sebastian, Szeider Stefan. Artificial Intelligence, Elsevier, 2011, 175, pp.1722-1736. 〈10.1016/j.artint.2011.03.001〉. [DOI]
[9]The Recognition of Tolerance and Bounded Tolerance Graphs. George B. Mertzios, Ignasi Sau, Shmuel Zaks. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2011, 40 (5), pp.1234-1257. 〈10.1137/090780328〉. [DOI]
[8]Kernels for feedback arc set in tournaments. Stéphane Bessy, Fedor Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé. Journal of Computer and System Sciences, Elsevier, 2011, 77 (6), pp.1071-1078.
[7]Reconstruction combinatoire de réseaux phylogénétiques. Philippe Gambette. Biosystema, Société Française de Systématique, 2011, 28, pp.85-92.
[6]Faster parameterized algorithms for minor containment. Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos. Theoretical Computer Science, Elsevier, 2011, 412 (50), pp.7018-7028.
[5]Traffic grooming in bidirectional WDM ring networks. Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau. Networks, Wiley, 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, World Scientific Publishing, 2011, 11 (3-4), pp.121-141. 〈10.1142/S0219265910002763〉. [DOI]
[3]Bounds for the Generalized Repetition Threshold. Francesca Fiorenzi, Pascal Ochem, Elise Vaslet. Theoretical Computer Science, Elsevier, 2011, 412 (27), pp.2955-2963.
[2]Kernel bounds for disjoint cycles and disjoint paths. Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo. Theoretical Computer Science, Elsevier, 2011, 412, pp.4570-4578. 〈10.1016/j.tcs.2011.04.039〉. [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, Elsevier, 2011, 159, pp.23-30. 〈10.1016/j.dam.2010.09.011〉. [DOI]


Revues 2010

[22]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, Elsevier, 2010, 100, pp.176-180.
[21]On Vertex Partitions and some Minor-Monotone Parameters. Daniel Gonçalves. Journal of Graph Theory, Wiley, 2010, 66 (1), pp.49-56.
[20]A Survey on Algorithmic Aspects of Modular Decomposition. Michel Habib, Christophe Paul. Computer Science Review, Elsevier, 2010, 4 (1), pp.41-59. 〈10.1016/j.cosrev.2010.01.001〉. [DOI]
[19]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, Society for Industrial and Applied Mathematics, 2010, 24 (2), pp.400-419. 〈10.1137/080744190〉. [DOI]
[18]A note on the acyclic 3-choosability of some planar graphs. Hervé Hocquard, Mickaël Montassier, André Raspaud. Discrete Applied Mathematics, Elsevier, 2010, 158 (10), pp.1104-1110. 〈10.1016/j.dam.2010.02.005〉. [DOI]
[17]An Introduction to Clique Minimal Separator Decomposition. Anne Berry, Romain Pogorelcnik, Geneviève Simonet. Algorithms, MDPI AG, 2010, 3 (2), pp.197-215. 〈10.3390/a3020197〉. [DOI]
[16]Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs. Ignasi Sau, Dimitrios M. Thilikos. Journal of Discrete Algorithms, Elsevier, 2010, 8 (3), pp.330-338. 〈10.1016/j.jda.2010.02.002〉. [DOI]
[15]Diamond-Free Circle Graphs are Helly Circle. Jean Daligault, Daniel Gonçalves, Michaël Rao. Discrete Mathematics, Elsevier, 2010, 310 (4), pp.845-849. 〈10.1016/j.disc.2009.09.022〉. [DOI]
[14]Polynomial Kernels for 3-Leaf Power Graph Modification Problems. Stéphane Bessy, Christophe Paul, Anthony Perez. Discrete Applied Mathematics, Elsevier, 2010, 158 (16), pp.1732-1744.
[13]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, Elsevier, 2010, 310 (3), pp.557--560. 〈10.1016/j.disc.2009.03.039〉. [DOI]
[12]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, Wiley, 2010, 65 (2), pp.83-93.
[11]Decomposition of sparse graphs into two forests, one having bounded maximum degree. Mickaël Montassier, André Raspaud, Xuding Zhu. Information Processing Letters, Elsevier, 2010, 110 (20), pp.913-916. 〈10.1016/j.ipl.2010.07.009〉. [DOI]
[10]Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time. Christophe Crespelle, Philippe Gambette. Information Processing Letters, Elsevier, 2010, 110, pp.497-502. 〈10.1016/j.ipl.2010.03.015〉. [DOI]
[9]Homomorphisms of 2-edge-colored graphs. Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena. Discrete Applied Mathematics, Elsevier, 2010, 158 (12), pp.1365-1379. 〈10.1016/j.dam.2009.09.017〉. [DOI]
[8]Planar Graphs Have 1-string Representations. Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem. Discrete and Computational Geometry, Springer Verlag, 2010, 43 ((3)), pp.626-647. 〈10.1007/s00454-009-9196-9〉. [DOI]
[7]Acyclic improper colourings of graphs with bounded maximum degree. Louigi Addario-Berry, Louis Esperet, Ross Kang, Colin Mcdiarmid, Alexandre Pinlou. Discrete Mathematics, Elsevier, 2010, 310 (2), pp.223-229. 〈10.1016/j.disc.2008.09.009〉. [DOI]
[6]FPT Algorithms and Kernels for the Directed k-Leaf Problem. Jean Daligault, Gregory Gutin, Anders Yeo, Eunjung Kim. Journal of Computer and System Sciences, Elsevier, 2010, 76 (2), pp.144-152. 〈10.1016/j.jcss.2009.06.005〉. [DOI]
[5]Well-Quasi-Order of Relabel Functions. Jean Daligault, Michael Rao, Stéphan Thomassé. Order, Springer Verlag, 2010, 27, pp.301-315. 〈10.1007/s11083-010-9174-0〉. [DOI]
[4]Optical index of fault tolerant routings in WDM networks. Stéphane Bessy, Clément Lepelletier. Networks, Wiley, 2010, 56 (2), pp.95-102.
[3]Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs. Christophe Crespelle, Christophe Paul. Algorithmica, Springer Verlag, 2010, 58 (2), pp.405-432.
[2]Graph Extremities Defined by Search Algorithms. Anne Berry, Jean R.S. Blair, Jean-Paul Bordat, Geneviève Simonet. Algorithms, MDPI AG, 2010, 3 (2), pp.100-124. 〈10.3390/a3020100〉. [DOI]
[1]WDM and Directed Star Arboricity. Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2010, 19, pp.161-182.


Revues 2009

[22]A Planar Linear Hypergraph Whose Edges Cannot be Represented as Straight Line Segments. Daniel Gonçalves. European Journal of Combinatorics, Elsevier, 2009, 30 (1), pp.280-282. 〈10.1016/j.ejc.2007.12.004〉. [DOI]
[21]Covering Planar Graphs with Forests, one Having Bounded Maximum Degree. Daniel Gonçalves. Journal of Combinatorial Theory, Series B, Elsevier, 2009, 99 (2), pp.314-322. 〈10.1016/j.jctb.2008.07.004〉. [DOI]
[20]Edge Maximal Graphs of Branchwidth k: The k-Branches. Christophe Paul, Jan Arne Telle. Discrete Mathematics, Elsevier, 2009, 309 (6), pp.1467-1475.
[19]On Star and Caterpillar Arboricity. Daniel Gonçalves, Pascal Ochem. Discrete Mathematics, Elsevier, 2009, 309 (11), pp.3694-3702. 〈10.1016/j.disc.2008.01.041〉. [DOI]
[18]An Oriented Coloring of Planar Graphs with Girth at Least Five. Alexandre Pinlou. Discrete Mathematics, Elsevier, 2009, 309, pp.2108-2118. 〈10.1016/j.disc.2008.04.030〉. [DOI]
[17]Clean the Graph Before You Draw It!. Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat. Information Processing Letters, Elsevier, 2009, 109 (10), pp.463-467. 〈http://dx.doi.org/10.1016/j.ipl.2009.01.003〉. 〈10.1016/j.ipl.2009.01.003〉. [DOI]
[16]Clique-Width and the Speed of Hereditary Properties. Peter Allen, Vadim Lozin, Michaël Rao. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2009, 16 (1), pp.11.
[15]Interval completion is Fixed Parameter Tractable. Yngve Villanger, Pinar Heggernes, Christophe Paul, Jan Arne Telle. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2009, 38 (5), pp.2007-2020. 〈http://link.aip.org/link/?SMJ/38/2007〉. 〈10.1137/070710913〉. [DOI]
[14]Kinetic Maintenance of Mobile k-Centres in Trees. Christophe Paul, Stéphane Durocher. Discrete Applied Mathematics, Elsevier, 2009, 157 (7), pp.1432-1446. 〈10.1007/978-3-540-77120-3_31〉. [DOI]
[13]Branchwidth of Chordal Graphs. Christophe Paul, Jan Arne Telle. Discrete Applied Mathematics, Elsevier, 2009, 157 (12), pp.2718-2725.
[12]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, Association for Computing Machinery, 2009, 6, pp.article 9.
[11]Linear time 3-approximation for MAST problem. Vincent Berry, Sylvain Guillemot, François Nicolas, Christophe Paul. ACM Transactions on Algorithms, Association for Computing Machinery, 2009, 5 (2), pp.1-18.
[10]Characterizing path graphs by forbidden induced subgraphs. Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann. Journal of Graph Theory, Wiley, 2009, 62 (4), pp.369-384. 〈10.1002/jgt.20407〉. [DOI]
[9]On Two Techniques of Combining Branching and Treewidth. Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov. Algorithmica, Springer Verlag, 2009, 54 (2), pp.181-207. 〈http://dx.doi.org/10.1007/s00453-007-9133-3〉. 〈10.1007/s00453-007-9133-3〉. [DOI]
[8]Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings. Anne Berry, Richard Krueger, Geneviève Simonet. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2009, 23 (1), pp.428-446.
[7]Partitions versus sets : a case of duality. Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé. European Journal of Combinatorics, Elsevier, 2009, pp.1-7. 〈10.1016/j.ejc.2009.09.004〉. [DOI]
[6]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, Elsevier, 2009, 30 (8 (special issue: Combinatorial Geometries and Applications: Oriented Matroids and Matroids)), pp.1868-1886.
[5]Submodular Partition Functions. Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé. Discrete Mathematics, Elsevier, 2009, 309, pp.6000-6008. 〈10.1016/j.disc.2009.04.033〉. [DOI]
[4]Complexity of $(p,1)$-Total Labelling. Frédéric Havet, Stéphan Thomassé. Discrete Applied Mathematics, Elsevier, 2009, 157, pp.2859-2870.
[3]Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes. Sèverine Bérard, Annie Château, Cedric Chauve, Christophe Paul, Eric Tannier. Journal of Computational Biology, Mary Ann Liebert, 2009, 16 (10), pp.1287-1309.
[2]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, Elsevier, 2009, 157 (7), pp.1555-1570.
[1]Detecting induced subgraphs. Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon. Discrete Applied Mathematics, Elsevier, 2009, 157 (17), pp.3540-3551.


Revues 2008

[16]Circuit-Cocircuit Reversing Systems in Regular Matroids. Emeric Gioan. Annals of Combinatorics, Springer Verlag, 2008, 12 (2), pp.171-182.
[15]Solving Some NP-Complete Problems using Split Decomposition. Michaël Rao. Discrete Applied Mathematics, Elsevier, 2008, 156 (14), pp.2768-2780. 〈10.1016/j.dam.2007.11.013〉. [DOI]
[14]Improved Layout of Phylogenetic Networks. Philippe Gambette, Daniel Huson. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2008, 5 (3), pp.472-479. 〈10.1109/tcbb.2007.1046〉. [DOI]
[13]Paths partition with prescribed beginnings in digraphs: A Chvátal–Erdős condition approach. Stéphane Bessy. Discrete Mathematics, Elsevier, 2008, 308 (18), pp.4108-4115. 〈10.1016/j.disc.2007.07.113〉. [DOI]
[12]Clique-width of graphs defined by one-vertex extensions. Michaël Rao. Discrete Mathematics, Elsevier, 2008, 308, pp.6157-6165. 〈10.1016/j.disc.2007.11.039〉. [DOI]
[11]On the L(p,1)-labelling of graphs. Daniel Gonçalves. Discrete Mathematics, Elsevier, 2008, 308 (8), pp.1405-1414. 〈10.1016/j.disc.2007.07.075〉. [DOI]
[10]A Simple Linear Time LexBFS Cograph Recongition Algorithm. Anna Bretscher, Derek Corneil, Michel Habib, Christophe Paul. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2008, 22 (4), pp.1277-1296.
[9]A Note on Computing Set Overlap Classes. Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien De Montgolfier, Mathieu Raffinot, Michaël Rao. Information Processing Letters, Elsevier, 2008, 108 (4), pp.186-191. 〈10.1016/j.ipl.2008.05.005〉. [DOI]
[8]A More Efficient Algorithm for Perfect Sorting by Reversals. Sèverine Bérard, Cedric Chauve, Christophe Paul. Information Processing Letters, Elsevier, 2008, 106, pp.90-95. 〈10.1016/j.ipl.2007.10.012〉. [DOI]
[7]Oriented Colorings of Partial 2-trees. Pascal Ochem, Alexandre Pinlou. Information Processing Letters, Elsevier, 2008, 108, pp.82-86. 〈10.1016/j.ipl.2008.04.007〉. [DOI]
[6]The Hoàng-Reed Conjecture holds for tournaments. Frédéric Havet, Stéphan Thomassé, Anders Yeo. Discrete Mathematics, Elsevier, 2008, 308, pp.3412-3415. 〈10.1016/j.disc.2007.06.033〉. [DOI]
[5]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, Elsevier, 2008, 24, pp.39-53. 〈10.1016/j.jco.2006.09.005〉. [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, DMTCS, 2008, 10 (1), pp.1-24.
[3]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, Elsevier, 2008, 409 (3), pp.601-616.
[2]Competitive Graph Searches. Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. Theoretical Computer Science, Elsevier, 2008, 393 (1-3), pp.72-80.
[1]Optimal Distance Labeling for Interval Graphs and Related Graphs Families. Cyril Gavoille, Christophe Paul. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2008, 22 (3), pp.1239-1258. 〈10.1137/050635006〉. [DOI]

Conférences 2008 - 2017


Conférences 2017

[5]Triangle packing in (sparse) tournaments: approximation and kernelization *. Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut. Kirk Pruhs; Christian Sohler. ESA: European Symposium on Algorithms, Sep 2017, Vienne, Austria. 25th Annual European Symposium on Algorithms, pp.1-23, 2017, Leibniz International Proceedings in Informatics. 〈http://esa-symposium.org〉. 〈10.4230/LIPIcs.ESA.2017〉. [DOI]
[4]Computing maximum cliques in B 2 EPG graphs. Nicolas Bousquet, Marc Heinrich. WG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. 43rd International Workshop on Graph-Theoretic Concepts in Computer Science, 2017, Lecture Notes in Computer Science. 〈http://www.win.tue.nl/wg2017/〉.
[3]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. 44th International Colloquium on Automata, Languages, and Programming, 80 (57), pp.1-15, 2017, Leibniz International Proceedings in Informatics (LIPIcs). 〈10.4230/LIPIcs.ICALP.2017.57〉. [DOI]
[2]Complexity Dichotomies for the Minimum F -Overlay Problem. Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant. IWOCA 2017 - 28th International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. pp.12, 2017, 〈https://carma.newcastle.edu.au/meetings/iwoca/〉.
[1]Normalized Euclidean Distance Matrices for Human Motion Retargeting. Antonin Bernardin, Ludovic Hoyet, Antonio Mucherino, Douglas S. Gonçalves, Franck Multon. MIG 2017 - Motion in Games, Nov 2017, Barcelona, Spain. 〈10.1145/3136457.3136466〉. [DOI]


Conférences 2016

[11]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. 4th International Workshop on graph theory, 2016, 〈http://bgw.labri.fr/2016/〉.
[10]Colouring Diamond-free Graphs. Konrad K. Dabrowski, François Dross, Daniël Paulusma. SWAT: Scandinavian Workshops on Algorithm Theory, 2016, Reykjavik, Iceland. 15th Scandinavian Symposium and Workshops on Algorithm Theory, 53, pp.16:1--16:14, 2016, 〈10.4230/LIPIcs.SWAT.2016.16〉. [DOI]
[9]Beaux ordres et graphes. Jean-Florent Raymond. Journées du GDR-IM 2016, 2016, Paris, France. 2016.
[8]Avoidability of Formulas with Two Variables. Pascal Ochem, Matthieu Rosenfeld. DLT: Developments in Language Theory, Jul 2016, Montréal, Canada. 20th International Conference on Developments in Language Theory, LNCS (9840), pp.344-354, 2016, Developments in Language Theory. 〈http://dlt2016.lacim.uqam.ca〉. 〈10.1007/978-3-662-53132-7_28〉. [DOI]
[7]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. 4th International Symposium on Combinatorial Optimization, LNCS (9849), pp.148-159, 2016, Combinatorial Optimization. 〈10.1007/978-3-319-45587-7_13〉. [DOI]
[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, İstanbul, Turkey. 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, 2016.
[5]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. 41st International Symposium on Mathematical Foundations of Computer Science, 58, pp.26:1-26:13, 2016, Leibniz International Proceedings in Informatics (LIPIcs). 〈10.4230/LIPIcs.MFCS.2016.26〉. [DOI]
[4]On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphs. Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. 10th International Conference on Combinatorial Optimization and Applications, LNCS (10043), pp.423-437, 2016, Combinatorial Optimization and Applications. 〈10.1007/978-3-319-48749-6_31〉. [DOI]
[3]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. 11th International Symposium on Parameterized and Exact Computation, 2016, 〈http://conferences.au.dk/algo16/ipec/〉.
[2]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. 11th International Conference on Algorithmic Aspects of Information and Management, LNCS (9778), pp.53-64, 2017, 〈10.1007/s11538-017-0260-y〉. [DOI]
[1]Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordeshai Shalom. Graph Theoretical Concepts in Computer Science - WG, 2016, Istanbul, Turkey. International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS (9941), pp.195-206, 2016, WG 2016. 〈10.1007/978-3-662-53536-3_17〉. [DOI]


Conférences 2015

[17]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. 26th International Workshop on Combinatorial Algorithms, LNCS (9538), pp.100-111, 2016, Combinatorial Algorithms. 〈10.1007/978-3-319-29516-9_9〉. [DOI]
[16]An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. 13th International Workshop on Approximation and Online Algorithms, LNCS (9499), pp.122-132, 2016, 〈10.1007/978-3-319-28684-6_11〉. [DOI]
[15]Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. IPEC: International Symposium on Parameterized and Exact Computation, 2015, Patras, Greece. 43, pp.78-89, 2015, Leibniz International Proceedings in Informatics (LIPIcs).
[14]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 & Combinatorial Optimization, May 2015, İstanbul, Turkey. 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization, 2015, 〈http://ctw2015.eng.marmara.edu.tr〉.
[13]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 & Combinatorial Optimization, May 2015, Istanbul, Turkey. 13th Cologne-Twente Workshop on Graphs & Combinatorial Optimization, 2015, 〈http://ctw2015.eng.marmara.edu.tr〉.
[12]An FPT 2-Approximation for Tree-cut Decomposition. Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. WAOA: International Workshop on Approximation and Online Algorithms, 2015, Patras, Greece. 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers, LNCS (9499), pp.35-46, 2016, Approximation and Online Algorithms. 〈10.1007/978-3-319-28684-6_4〉. [DOI]
[11]Variants of Plane Diameter Completion. Clément Requilé, Dimitrios M. Thilikos, Petr A. Golovach. 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Grenada. 2015.
[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. CSR: Computer Science Symposium in Russia, Jul 2015, Listvyanka, Russia. Springer, 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, LNCS (9139), pp.143-156, 2015, Computer Science -- Theory and Applications. 〈10.1007/978-3-319-20297-6_10〉. [DOI]
[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. Springer, Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, LNCS (9210), pp.243-254, 2015, Fundamentals of Computation Theory. 〈10.1007/978-3-319-22177-9_19〉. [DOI]
[8]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. 2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). 〈http://www.siam.org/meetings/analco15/〉. 〈10.1137/1.9781611973761.2〉. [DOI]
[7]On Independent Set on B1-EPG Graphs. Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul. WAOA: International Workshop on Approximation and Online Algorithms, 2015, Patras, Greece. 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers, LNCS (9499), pp.158-169, 2016, Approximation and Online Algorithms. 〈10.1007/978-3-319-28684-6_14〉. [DOI]
[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, 2015, Patras, Greece. 43, pp.139-150, 2015, Leibniz International Proceedings in Informatics (LIPIcs).
[5]Orienting triangulations. Boris Albar, Daniel Gonçalves, Kolja Knauer. EuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia. 31st European Workshop on Computational Geometry, EuroCG 2015, 〈http://eurocg15.fri.uni-lj.si〉.
[4]A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. Nathann Cohen, Daniel Gonçalves, Kim Eun Jung, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller. International Computer Science Symposium in Russia - CRS, 2015, Irkutsk, Russia. 9139, 2015, Lecture Notes in Computer Science.
[3]An O(log OPT)-approximation for covering and packing minor models of θr. Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos. 13th Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. Springer International Publishing, 13th Workshop on Approximation and Online Algorithms (WAOA 2015) ( 9499), pp.122-132, 2015, Lecture Notes in Computer Science.
[2]Induced minors and well-quasi-ordering. Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck. The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, Aug 2015, Bergen, Norway. 49, pp.197-201, 2015, 〈10.1016/j.endm.2015.06.029〉. [DOI]
[1]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. 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, LNCS (9210), pp.189-201, 2015, Fundamentals of Computation Theory. 〈10.1007/978-3-319-22177-9_15〉. [DOI]


Conférences 2014

[20]The role of planarity in connectivity problems parameterized by treewidth. Julien Baste, Ignasi Sau. IPEC: International Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. 9th International Symposium on Parameterized and Exact Computation, LNCS (8894), pp.63-74, 2014, Parameterized and Exact Computation. 〈10.1007/978-3-319-13524-3_6〉. [DOI]
[19]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. 9th International colloquium on graph theory and combinatorics, June 30-July 4, 2014, 2014, 〈http://oc.inpg.fr/conf/icgt2014/Main/HomePage〉.
[18]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. LNCS (8635), pp.299-310, 2014, Mathematical Foundations of Computer Science. 〈10.1007/978-3-662-44465-8_26〉. [DOI]
[17]Hadwiger Number of Graphs with Small Chordality. Petr A. Golovach, Pinar Heggernes, Pim Van 'T Hof, Christophe Paul. Graph Theoretical Concepts in Computer Science - WG, 2014, Orléans, France. 8747, pp.201-213, Lecture Notes in Computer Science.
[16]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. 2014, 9th International colloquium on graph theory and combinatorics, ICGT 2014.
[15]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. 2014.
[14]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. 9th International colloquium on graph theory and combinatorics, June 30-July 4, 2014, 2014.
[13]Contact Representations of Planar Graphs: Extending a Partial Representation is Hard. Steven Chaplick, Paul Dorbec, Jan Kratochvil, Mickaël Montassier, Juraj Stacho. WG: Graph-Theoretic Concepts in Computer Science, 2014, Nouan-le-fuzelier, France. 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, LNCS (8747), pp.139-151, 2014, Graph-Theoretic Concepts in Computer Science. 〈10.1007/978-3-319-12340-0_12〉. [DOI]
[12]A 14k-Kernel for Planar Feedback Vertex Set via Region Decomposition. Marthe Bonamy, Lukasz Kowalik. IPEC: International Symposium on Parameterized and Exact Computation, 2014, Wroclaw, Poland. 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers, LNCS (8894), pp.97-109, 2014, Parameterized and Exact Computation. 〈10.1007/978-3-319-13524-3_9〉. [DOI]
[11]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. 2014.
[10]Bidimensionality of Geometric Intersection Graphs. Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos. 39th International Conference on Current Trends in Theory and Practice of Computer Science, Jan 2014, Špindlerův Mlýn, Czech Republic. 〈10.1007/978-3-319-04298-5_26〉. [DOI]
[9]The Parameterized Complexity of Graph Cyclability. Petr A. Golovach, Marcin Kamiski, Spyridon Maniatis, Dimitrios M. Thilikos. ESA'2014: 19th Annual European Symposium on Algorithms, Sep 2014, Wrocław, Poland. Algorithms - ESA 2014, 8737, pp.492-504, 2014, LNCS. 〈10.1007/978-3-662-44777-2_41〉. [DOI]
[8]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. 30th Symposium on Theoretical Aspects of Computer Science, 2014.
[7]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. ICGT'2014: 9th International colloquium on graph theory and combinatorics, 2014, 〈http://oc.inpg.fr/conf/icgt2014/〉.
[6]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. Twenty-Sixth Annual Conference on Innovative Applications of Artificial Intelligence (IAAI-14), July 29–31, 2014 in Québec City, Québec, Canada., 2014.
[5]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. 2014.
[4]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. 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1424-1432, 2014, Proceedings of SODA '14. 〈https://www.siam.org/meetings/da14/〉. 〈10.1137/1.9781611973402.105〉. [DOI]
[3]Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs. Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant. SOFSEM: Current Trends in Theory and Practice of Computer Science, Jan 2014, High Tatras, Slovakia. 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings, 8327, pp.150-161, 2014, LNCS. 〈www.sofsem.sk〉. 〈10.1007/978-3-319-04298-5_14〉. [DOI]
[2]Recognition of dynamic circle graphs. Christophe Crespelle, Emeric Gioan, Christophe Paul. International Conference on Graph Theory, 2014, Grenoble, France.
[1]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. Siam, 14th SIAM International Conference on Data Mining, pp.668-676, 2014, 〈http://www.siam.org/meetings/sdm14/〉. 〈10.1137/1.9781611973440.77〉. [DOI]


Conférences 2013

[11]Recoloring bounded treewidth graphs. Marthe Bonamy, Nicolas Bousquet. LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, 2013, Playa del Carmen, Mexico. VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS) April 22-26, 2013 Playa del Carmen, Mexico, 44, pp.293-297, 2013, Electronic Notes in Discrete Mathematics. 〈10.1016/j.endm.2013.10.040〉. [DOI]
[10]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, 2013, The Seventh European Conference on Combinatorics, Graph Theory and Applications. 〈10.1007/978-88-7642-475-5_39〉. [DOI]
[9]Too many triangles. Boris Albar, Daniel Gonçalves. LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Apr 2013, Playa del Carmen, Mexico. VII Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS) April 22-26, 2013 Playa del Carmen, Mexico, 44, pp.293-297, 2013, Electronic Notes in Discrete Mathematics. 〈10.1016/j.endm.2013.10.046〉. [DOI]
[8]Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos. STAC: Symposium on Theoretical Aspects of Computer Science, Feb 2013, Kiel, Germany. 30th Symposium on Theoretical Aspects of Computer Science, 20, pp.92-103, 2013, 〈http://www.stacs2013.uni-kiel.de〉. 〈10.4230/LIPIcs.STACS.2013.92〉. [DOI]
[7]A linear kernel for planar red-blue dominating set. Garnero Valentin, Ignasi Sau, Dimitrios M. Thilikos. CTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2013, Enschede, Netherlands. 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp.117-120, 2013, 〈http://wwwhome.math.utwente.nl/~ctw/index.php?page=home〉.
[6]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. 2013.
[5]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. Springer, 7th European Conference on Combinatorics, Graph Theory and Applications, 16, pp.13-18, 2013, CRM Series. 〈http://www.eurocomb2013.it/index.php?pg=webshow&id=1〉. 〈10.1007/978-88-7642-475-5_3〉. [DOI]
[4]Excluding Graphs as Immersions in Surface Embedded Graphs. Archontia C. Giannopoulou, Marcin Kamiński, Dimitrios M. Thilikos. Graph-Theoretic Concepts in Computer Science - WG, Jun 2013, Lübeck, Germany. 39th International Workshop, WG 2013, Revised Papers, LNCS (8165), pp.274-285, 2013, Graph-Theoretic Concepts in Computer Science. 〈10.1007/978-3-642-45043-3_24〉. [DOI]
[3]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, 2013, The Seventh European Conference on Combinatorics, Graph Theory and Applications. 〈10.1007/978-88-7642-475-5_50〉. [DOI]
[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. 1 (7965), pp.613-624, 2013, Lecture Notes in Computer Science.
[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. 7th European Conference on Combinatorics, Graph Theory and Applications, pp.265-270, 2013, 〈http://www.eurocomb2013.it/index.php?pg=webshow&id=1〉. 〈10.1007/978-88-7642-475-5_43〉. [DOI]


Conférences 2012

[11]Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. Christof Loeding, Nicolas Bousquet. Dediu, Adrian Horia and Fernau, Henning and Martín-Vide, Carlos. LATA'10: Language and Automata Theory and Applications, Germany. Springer, 6031, pp.118-129, 2010, Lecture Notes in Computer Science.
[10]Contraction checking in graphs on surfaces. Marcin Kaminski, Dimitrios M. Thilikos. Christoph Dürr; Thomas Wilke. STACS'12: 29th Symposium on Theoretical Aspects of Computer Science, Feb 2012, Paris, France. LIPIcs, 14, pp.182-193, 2012.
[9]Multicut is FPT. Nicolas Bousquet, Jean Daligault, Stéphan Thomassé. STOC'11: Symposium on Theory of Computing, United States. pp.459-468, 2011.
[8]A Combinatorial Method for 3D Landmark-based Morphometry: Application to the Study of Coronal Craniosynostosis. Emeric Gioan, Kevin Sol, Gérard Subsol. Springer. MICCAI: Medical Image Computing and Computer-Assisted Intervention, Oct 2012, Nice, France. LNCS (7512), pp.533-541, 2012, 〈10.1007/978-3-642-33454-2_66〉. [DOI]
[7]Dynamic Programming for H-minor-free Graphs. Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos. Gudmundsson, Joachim and Mestre, Julien and Viglas, Taso. COCOON'12: 18th Annual International Computing and Combinatorics Conference, Australia. Springer Berlin Heidelberg, 7434, pp.86-97, 2012, 〈10.1007/978-3-642-32241-9_8〉. [DOI]
[6]Parameterized K_4-Cover in Single Exponential Time. Eunjung Kim, Christophe Paul, Geevarghese Philip. SWAT: Scandinavian Workshop on Algorithmic Theory, Jul 2012, Helsinki, Sweden. 13th Scandinavian Symposium and Workshops on Algorithm Theory, LNCS (7357), pp.199-130, 2012.
[5]On Exact Algorithms for Permutation CSP. Daniel Gonçalves, Eunjung Kim. APEX'12: International Workshop on Approximation, Parameterized and EXact Algorithms, Feb 2012, Paris, France. 2012.
[4]The Maximum Clique Problem in Multiple Interval Graphs. Mathew C. Francis, Daniel Gonçalves, Pascal Ochem. WG'12: 38th International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. LNCS (7551), pp.57-68, 2012.
[3]On Approximating the d-Girth of a Graph. David Peleg, Ignasi Sau, Mordechai Shalom. SOFSEM'11: Theory and Practice of Computer Science, Slovakia. Springer Berlin Heidelberg, 6543, pp.467-481, 2011, LNCS. 〈10.1007/978-3-642-18381-2_39〉. [DOI]
[2]Fast Minor Testing in Planar Graphs. Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos. ESA'10: 18th Annual European Symposium on Algorithms, United Kingdom. pp.97-109, 2010, LNCS.
[1]Parameterized Domination in Circle Graphs. Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé. WG'12: 38th International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. LNCS (7551), pp.308-319, 2012, Graph-Theoretic Concepts in Computer Science. 〈https://sites.google.com/site/wg2012conf/〉. 〈10.1007/978-3-642-34611-8_31〉. [DOI]


Conférences 2011

[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. Elsevier, 38, pp.155-160, 2011, Electronic Notes in Discrete Mathematics. 〈http://www.renyi.hu/conferences/ec11/〉. 〈10.1016/j.endm.2011.09.027〉. [DOI]
[12]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. Elsevier, pp.161-166, 2011, Electronic Notes in Discrete Mathematics.
[11]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. Elsevier, VI Latin-American Algorithms, Graphs and Optimization Symposium, 37, pp.87-92, 2011, Electronic Notes in Discrete Mathematics.
[10]Triangle Contact Representations and Duality. Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou. GD'10: Graph Drawing, Sep 2011, Konstanz, Germany. pp.262-273, 2011, Lecture Notes in Computer Science. 〈10.1007/978-3-642-18469-7_24〉. [DOI]
[9]Obtaining a Bipartite Graph by Contracting Few Edges. Pinar Heggerness, Pim Van'T Hof, Daniel Lokshtanov, Christophe Paul. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Dec 2011, Mumbai, India. 31st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp.217-228, 2011, 〈http://www.fsttcs.org/archives/2011/〉.
[8]Contracting Graphs to Paths and Trees. Pinar Heggerness, Pim Van'T Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul. IPEC: International Symposium on Parameterized and Exact Computation, Sep 2011, Saarbrücken, Germany. pp.55-66, 2011, LNCS.
[7]Hitting and Harvesting Pumpkins. Gwénaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé. ESA: European Symposium on Algorithms, Sep 2011, Saarbrücken, Germany. 19th European Symposium on Algorithms, LNCS (6942), pp.394-407, 2011, 〈http://esa2011.mpi-inf.mpg.de〉.
[6]Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs. Pascal Ochem, Alexandre Pinlou. Flavia Bonomo, Thomas Liebling, Javier Marenco, Jayme Szwarcfiter, Mario Valencia-Pabon. LAGOS'11: VI Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. 37, pp.123-128, 2011, Electronic Notes in Discrete Mathematics. 〈http://www-2.dc.uba.ar/lagos2011/〉. 〈10.1016/j.endm.2011.05.022〉. [DOI]
[5]Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices. Emeric Gioan, Kevin Sol, Gérard Subsol. CCCG: Canadian Conference on Computational Geometry, Aug 2011, Toronto, Canada. 23rd Canadian Conference on Computational Geometry, 2011, 〈http://2011.cccg.ca/〉.
[4]Conflict Packing Yield Linear Vertex-Kernels for k- Fast, k-Dense rti and a Related Problem. Christophe Paul, Anthony Perez, Stéphan Thomassé. Mfcs'11: 36th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland. Springer, pp.497-507, 2011, Lecture Notes in Computer Science.
[3]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. 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 Heuze, 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]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.


Conférences 2010

[10]A Quadratic Kernel for Feedback Vertex Set. Stéphan Thomassé. SODA'09: Symposium on Discrete Algorithms, New York, United States. pp.115-119, 2009, 〈http://www.siam.org/meetings/da09/〉.
[9]From Path Graphs to Directed Path Graphs. Steve Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia Tondato. WG'10: International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.256-265, 2010, LNCS. 〈http://wg2010.thilikos.info/〉.
[8]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'10: International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2010, Zarós, Greece. pp.12, 2010, LNCS. 〈http://wg2010.thilikos.info/〉.
[7]Dynamic programming for graphs on surfaces. Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos. ICALP: International Colloquium on Automata, Languages and Programming, 2010, Bordeaux, France. Springer-Verlag, 37th, pp.372-383, 2010.
[6]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, 2010, LNCS. 〈http://wg2010.thilikos.info/〉.
[5]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, 2010.
[4]Identifying colorings of graphs. Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau. 8FCC, 2010, Orsay, France.
[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]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, 2010, 〈http://jadt2010.uniroma1.it/en/〉.
[1]On the (Non-)Existence of Polynomial Kernels for Pl -Free Edge Modification Problems. Sylvain Guillemot, Christophe Paul, Anthony Perez. IPEC'10: International Symposium on Parameterized and Exact Computation, France. 12 p., 2010, Lecture Notes in Computer Science.


Conférences 2009

[20]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. V Latin-American Algorithms, Graphs and Optimization Symposium, pp.3-8, 2009, Electronic Notes in Discrete Mathematics.
[19]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, 2009.
[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, 2010, 〈http://www.lirmm.fr/wg2009/〉.
[17]Asteroids in rooted and directed path graphs. Kathie Cameron, Chinh Hoàng, Benjamin Lévêque. Algorithmic Graph Theory, Mar 2009, Warwick, United Kingdom. 32, pp.67-74, 2009.
[16]On Finding Directed Trees with Many Leaves. Jean Daligault, Stéphan Thomassé. IWPEC'09: International Workshop on Parameterized and Exact Computation, Copenhagen, Denmark. Elsevier, pp.86-97, 2009, LNCS. 〈10.1007/978-3-642-11269-0_7〉. [DOI]
[15]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, 2009, Lecture Notes in Computer Science.
[14]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. 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp.205-209, 2009, 〈http://www.lix.polytechnique.fr/ctw09/〉.
[13]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, 2009.
[12]A Polynomial Kernel For Multicut In Trees. Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo. Susanne Albers and Jean-Yves Marion. STACS'2009: 26th International Symposium on Theoretical Aspects of Computer Science, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.183-194, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science.
[11]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. Elsevier, 34, pp.363-367, 2009, Electronic Notes in Discrete Mathematics. 〈10.1016/j.endm.2009.07.060〉. [DOI]
[10]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. Elsevier, 34, pp.307-311, 2009, Electronic Notes in Discrete Mathematics.
[9]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, 2009, 〈http://www.umiacs.umd.edu/conferences/stoc2009/index.shtml〉.
[8]Kernels for Feedback Arc Set In Tournaments. Stéphane Bessy, Fedor Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé. FSTTCS'09: Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2009, IIT Kanpur, India. pp.N/A, 2009, Leibniz International Proceedings in Informatics. 〈http://www.fsttcs.org/archives/2009/〉.
[7]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. Springer Berlin / Heidelberg, 5874, pp.146-157, 2009, Lecture Notes in Computer Science. 〈http://graphs.vsb.cz/iwoca2009/〉. 〈10.1007/978-3-642-10217-2_17〉. [DOI]
[6]Visualising a Text with a Tree Cloud. Philippe Gambette, Jean Véronis. IFCS'09: International Federation of Classification Societies Conference, Mar 2009, Dresde, Germany. Springer Berlin / Heidelberg, pp.561-569, 2010, Studies in Classification, Data Analysis, and Knowledge Organization. 〈http://www.ifcs2009.de/〉. 〈10.1007/978-3-642-10745-0_61〉. [DOI]
[5]The Structure of Level-k Phylogenetic Networks. Philippe Gambette, Vincent Berry, Christophe Paul. CPM: Combinatorial Pattern Matching, Jun 2009, Lille, France. Springer Berlin / Heidelberg, 20th Annual Symposium on Combinatorial Pattern Matching, LNCS (5577), pp.289-300, 2009, 〈http://bioinfo.lifl.fr/cpm09/〉. 〈10.1007/978-3-642-02441-2_26〉. [DOI]
[4]Spanning galaxies in digraphs. Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. Jaroslav Nešetřil and André Raspaud. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. Elsevier, 34, pp.139-143, 2009, Electronic Notes in Discrete Mathematics. 〈http://eurocomb09.labri.fr/〉. 〈10.1016/j.endm.2009.07.023〉. [DOI]
[3]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. Elsevier, 34, pp.213-217, 2009, Electronic Notes in Discrete Mathematics.
[2]Mapping Computation with No Memory. Serge Burckel, Emeric Gioan, Emmanuel Thomé. UC'2009: 8th International Conference on Unconventional Computation, Sep 2009, Ponta Delgada, Portugal. Springer, 5715 (5715), pp.85-97, 2009, LNCS. 〈10.1007/978-3-642-03745-0_15〉. [DOI]
[1]Computing Galled Networks from Real Data. Daniel Huson, Regula Rupp, Vincent Berry, Philippe Gambette, Christophe Paul. ISMB/ECCB'09: 17th Annual Conference on Intelligent Systems for Molecular Biology & 8th European Conference on Computational Biology, Jun 2009, France. Oxford Journals, 25(12), pp.i85-i93, 2009, Bioinformatics. 〈http://www.iscb.org/ismbeccb2009/〉. 〈10.1093/bioinformatics/btp217〉. [DOI]


Conférences 2008

[12]Optimal Distance Labeling for Interval and Circular-Arc Graphs. C. Gavoille, Christophe Paul. Springer. ESA'03: 11th European Symposium on Algorithms, Budapest (Hungary), pp. 254-265, 2003, Lecture Notes in Computer Science.
[11]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'08: 5th International Conference on Theoretical Computer Science, Sep 2008, Milan, Italy. IFIP, pp.115-126, 2008.
[10]Algorithmic Generation of Graphs of Branch-width ≤ k. Christophe Paul, Andrzej Proskurowski, Jan Arne Telle. WG'06: Graph Theoretical Concepts in Computer Science, pp.206-216, 2006, Lecture Notes in Computer Science.
[9]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, 2008, Lecture Notes in Computer Science.
[8]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. LNCS (5344), pp.171-182, 2008, 〈10.1007/978-3-540-92248-3_16〉. [DOI]
[7]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. 5162, pp.335-346, 2008, 〈10.1007/978-3-540-85238-4_27〉. [DOI]
[6]A Representation Theorem for Union-Difference Families and Application. Binh-Minh Bui-Xuan, Michel Habib. Eduardo Sany Laber and Claudson Bornstein and Loana Tito Nogueira and Luerbio Faria. LATIN'08: 8th Latin American Symposium, Apr 2008, Búzios, Brazil. Springer Berlin / Heidelberg, pp.492-503, 2008, LNCS. 〈http://www.latin08.org〉. 〈10.1007/978-3-540-78773-0_43〉. [DOI]
[5]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'2008: 10emes rencontres francophones sur les Aspects Algorithmiques des Telecommunications, May 2008, Saint-Malo, France. pp.93-96, 2008.
[4]Perfect DCJ rearrangement. Annie Château, Cedric Chauve, Sèverine Bérard, Eric Tannier, Christophe Paul. C.E. Nelson; S. Vialette. RECOMB Comparative Genomics, Oct 2008, Paris, France. Springer-Verlag, 6th International Workshop on RECOMB Comparative Genomics, LNCS (5267), pp.158-169, 2008, Comparative Genomics. 〈http://igm.univ-mlv.fr/RCG08/〉. 〈10.1007/978-3-540-87989-3_12〉. [DOI]
[3]A Note on α-Drawable k-Trees. David Bremner, Jonathan Lenchner, Giuseppe Liotta, Christophe Paul, Marc Pouget, Svetlana Stolpner, Stephen Wismath. CCCG'08: Canadian Conference on Computational Geometry, Canada. pp.23-27, 2008.
[2]In Situ Design of Register Operations. Emeric Gioan, Serge Burckel. ISVLSI'08: IEEE Computer Society Annual Symposium on Very-Large-Scale Integration, Apr 2008, Montpellier, France, IEEE Computer Society, Trends in VLSI Technology and Design, pp.4, 2008, 〈http://www.lirmm.fr/isvlsi2008/〉.
[1]Guarding Art Galleries: The Extra Cost for Sculptures is Linear. Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé. SWAT'08: 11th Scandinavian Workshop on Algorithm Theory, Jul 2008, Gothenburg, Sweden. Springer, pp.41-52, 2008, LNCS. 〈http://www.dmist.net/swat2008/〉. 〈10.1007/978-3-540-69903-3〉. [DOI]

Conférences invitées 2008 - 2017


Conférences invitées 2016

[2]Vertex-partitions of graphs. Mickaël Montassier. International Conference on Graph Theory, Combinatorics and Applications, Oct 2016, Jinhua, China. 2nd International Conference on Graph Theory, Combinatorics and Applications, 2016, 〈http://icgca2016.zjnu.edu.cn/?lan=EN〉.
[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. 2016.


Conférences invitées 2015

[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. 2015, 〈https://conferences.matheo.si/event/6/page/12〉.
[3]Bidimensionality and Parameterized Algorithms *. Dimitrios M. Thilikos. IPEC: International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. 10th International Symposium on Parameterized and Exact Computation 43, pp.1-16, 2015, Leibniz International Proceedings in Informatics (LIPIcs). 〈http://algo2015.upatras.gr/ipec/〉. 〈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, Université de Bordeaux, France. 2015.
[1]A survey on the active bijection in graphs, hyperplane arrangements and oriented matroids. Emeric Gioan. Workshop on New Directions for the Tutte Polynomial: Extensions, Interrelations, and Applications, Jul 2015, Royal Holloway University of London, United Kingdom. 2015.


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. 23rd, 2014.
[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. 2016.


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. 2013.
[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, Nov 2013, Tabasco, Mexico. 2013, 〈http://paginas.matem.unam.mx/fmmiam/〉.
[1]Theory and Applications of Bidimensionality. Dimitrios M. Thilikos. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2013, Chengdu, China. 7th Annual International Conference on Combinatorial Optimization and Applications, 2013, Invited Lectures. 〈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. 2010, 〈http://www.lif.univ-mrs.fr/jga10/〉.
[4]Algorithmics of Modular Decomposition. Christophe Paul. Algorithms and Permutations, Feb 2012, Paris, France. 2012, 〈http://igm.univ-mlv.fr/AlgoB/algoperm2012/〉.
[3]Polynomial Kernels for Proper Interval Completion and Related Problems. Stéphane Bessy, Anthony Perez. Fundamentals of Computation Theory 2011, Norway. pp.229-239, 2011, LNCS.
[2]Limits of near-coloring of sparse graphs. Mickaël Montassier. 2012 International Conference on Graph Theory, Combinatorics and Applications, Oct 2012, Zhejiang, China. 2012, 〈http://discrete.zjnu.edu.cn/icgca2012/?action-channel-name-en〉.
[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. 2012, 〈http://www.math.nsysu.edu.tw/~comb/2012/〉.


Conférences invitées 2011

[2]Pattern Avoidance and HDOL Words. Pascal Ochem. WORDS'11: 8th International Conference on Combinatorics on Words, Czech Republic. 2011, 〈http://words2011.fjfi.cvut.cz/〉.
[1]Planar Graphs as Intersection Graphs. Daniel Gonçalves. LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina. VI Latin-American Algorithms, Graphs and Optimization Symposium, 2011, 〈http://www-2.dc.uba.ar/lagos2011/〉.


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. 2010.


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. 2009, Electronic Notes in Discrete Mathematics. 〈http://eurocomb09.labri.fr/pmwiki/pmwiki.php〉.


Conférences invitées 2008

[1]Branchwidth of Graphic Matroids. Stéphan Thomassé. BCC'07: British Combinatorial Conference, United Kingdom. Cambridge University Press, 2007, 〈http://www.dur.ac.uk/matthew.johnson2/bcc2007/home.html〉.

Ouvrages et chapitres d'ouvrages 2008 - 2017


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, 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, Springer, 2015.


Ouvrages et chapitres d'ouvrages 2014

[1]Report on GRASTA 2014. Fedor Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos. 2014.


Ouvrages et chapitres d'ouvrages 2013

[4]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, 〈http://shonan.nii.ac.jp/seminar/018/〉.
[3]Complexité et algorithmes paramétrés. Christophe Paul. Philippe Langlois. Informatique mathématique, une photographie en 2013, Presse universitaires de Perpignan, 2013.
[2]Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121). Erik D. Demaine, Fedor 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〉. 〈http://drops.dagstuhl.de/opus/volltexte/2013/4013/〉. [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. 〈http://www.lcdpu.fr/livre/?GCOI=27000100531990&fa=complements〉.


Ouvrages et chapitres d'ouvrages 2012

[1]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]


Ouvrages et chapitres d'ouvrages 2010

[2]WG'09: International Workshop on Theoretic Concepts in Computer Science. Christophe Paul, Michel Habib. 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 - 2017


Travaux d'édition 2016

[2]Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos. France. 199, pp.1-2, 2016, Discrete Applied Mathematics, 〈10.1016/j.dam.2015.10.004〉. [DOI]
[1]Forewords: Special issue on Theory and Applications of Graph Searching Problems. Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos. France. 655:1, 2016, Theoretical Computer Science - Special Issue on Theory and Applications of Graph Searching Problems, 〈10.1016/j.tcs.2016.11.001〉. [DOI]


Travaux d'édition 2015

[1]Combinatorial geometries: Matroids, oriented matroids and applications. Special issue in memory of Michel Las Vergnas. Raul Cordovil, Komei Fukuda, Emeric Gioan, Jorge Ramírez Alfonsín. France. 50, pp.208, 2015, European Journal of Combinatorics, 0195-6698. 〈10.1016/j.ejc.2015.05.012〉. [DOI]


Travaux d'édition 2014

[1]Report on NII Shonan Meeting 2013-018. Gregory Gutin, Dimitrios M. Thilikos. France. News and Conference Reports, 2014.


Travaux d'édition 2013

[1]6th Workshop on Graph Classes, Width Parameters and Optimization (GROW 2013). Dimitrios M. Thilikos. France. pp.1-20, 2013, 〈http://grow2013.isoftcloud.gr/〉.


Travaux d'édition 2012

[3]Parameterized and Exact Computation. Gerhard J. Woeginger, Dimitrios M. Thilikos. Dimitrios M. Thilikos; Gerhard J. Woeginger. Ljubljana, Slovenia. LNCS (7535), Springer, 2012, 978-3-642-33292-0. 〈10.1007/978-3-642-33293-7〉. 〈http://link.springer.com/book/10.1007%2F978-3-642-33293-7〉. [DOI]
[2]5th Workshop on GRAph Searching, Theory and Applications (GRASTA 2012). Fedor Fomin, Richard J. Nowakowski, Pawel Pralat, Dimitrios M. Thilikos. France. pp.1-12, 2012, 〈http://www.birs.ca/events/2012/5-day-workshops/12w5055〉.
[1]Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Dimitrios M. Thilikos, Pierre Fraigniaud, Fedor V. Fomin, Stephan Kreutzer. France. 463, Springer, 2012, Theoretical Computer Science, 〈10.1016/j.tcs.2012.10.006〉. 〈http://www.sciencedirect.com/science/article/pii/S0304397512009139〉. [DOI]