ALGCO: Algorithmes, Graphes et Combinatoire
Les recherches de l’équipe AlGCo se concentrent sur l’étude théorique et algorithmique de structures combinatoires classiques : principalement les graphes, mais aussi les graphes orientés, matroïdes et matroïdes orientés. Nos motivations sont d’ordre fondamental (questions de partitionnement, coloration, plongement, isomorphisme), algorithmique (notamment autour de la complexité paramétrée : algorithmes FPT, existence de noyau polynomiaux) ou applicatif, en provenance d’autres domaines de l’informatique théorique (bio-informatique, imagerie, morphométrie, modélisation de réseaux...).
- Site web de l'équipe
- Publications (depuis 2008)
- Séminaires
Membres
Permanents
- Stephane Bessy, Maître de Conférences UM
- Marin Bougeret, Maître de Conférences UM
- Emeric Gioan, Chargé de Recherche CNRS
- Daniel Gonçalves, Chargé de Recherche CNRS
- Philippe Janssen, Maître de Conférences UM
- Mickael Montassier, Professeur des Universités UM
- Pascal Ochem, Chargé de Recherche CNRS
- Christophe Paul, Directeur de Recherche CNRS
- Alexandre Pinlou, Professeur des Universités UM
- Ignasi Sau, Chargé de Recherche CNRS
- Geneviève Simonet, Maître de Conférences UM
- Dimitrios Thilikos Touloupas, Directeur de Recherche CNRS
- Petru Valicov, Maître de Conférences UM
Non permanents
- Fabien Jacques, Doctorant UM
- Xuan Hoang La, Doctorant UM
- Ana Karolinna Maia De Oliveira, CDD Enseignant-Chercheur Universidade Federal do Ceará BR
- Matthieu Rosenfeld, CDD Enseignant-Chercheur UM
- Julio Silva Araujo, CDD Enseignant-Chercheur Universidade Federal do Ceará BR
- Giannos Stamoulis, Doctorant UM
Publications depuis 2014 - Evaluation 2019
Articles de revues internationales
2021
- A Menger-like property of tree-cut widthArchontia Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. ThilikosJournal of Combinatorial Theory, Series B, Elsevier, 2021, 148, pp.1-22.
- Compactors for parameterized counting problemsDimitrios M. ThilikosComputer Science Review, Elsevier, 2021, 39, pp.100344.
2020
- Edge degeneracy: Algorithmic and structural resultsStratis Limnios, Christophe Paul, Joanny Perret, Dimitrios M. ThilikosTheoretical Computer Science, Elsevier, 2020, 839, pp.164-175.
- Structure and enumeration of $K_4$- minor-free links and link-diagramsJuanjo Rué, Dimitrios M. Thilikos, Vasiliki VelonaEuropean Journal of Combinatorics, Elsevier, 2020, 89, pp.103147.
- Complexity of planar signed graph homomorphisms to cyclesFrançois Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo PierronDiscrete Applied Mathematics, Elsevier, 2020, 284, pp.166-178.
- Minor-obstructions for apex sub-unicyclic graphsAlexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki VelonaDiscrete Applied Mathematics, Elsevier, 2020, 284, pp.538-555.
- Dual Parameterization of Weighted ColoringJúlio Araújo, Victor Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau Valls, Ana SilvaAlgorithmica, Springer Verlag, 2020, 82 (8), pp.2316-2336.
- Dushnik–Miller dimension of TD-Delaunay complexesDaniel Gonçalves, Lucas IsenmannEuropean Journal of Combinatorics, Elsevier, 2020, 88, pp.#103110.
- Partitioning sparse graphs into an independent set and a graph with bounded size componentsIlkyoo Choi, François Dross, Pascal OchemDiscrete Mathematics, Elsevier, 2020, 343 (8), pp.111921.
- Subgraph ComplementationFedor V. Fomin, Petr A. Golovach, Torstein Strømme, Dimitrios M. ThilikosAlgorithmica, Springer Verlag, 2020, 82 (7), pp.1859-1880.
- Maximum cuts in edge-colored graphsLuerbio Faria, Sulamita Klein, Ignasi Sau Valls, Uéverton dos Santos Souza, Rubens SucupiraDiscrete Applied Mathematics, Elsevier, 2020, 281, pp.229-234.
- On the Complexity of Finding Internally Vertex-Disjoint Long Directed PathsJúlio Araújo, Victor Campos, Ana Karolinna Maia, Ignasi Sau Valls, Ana SilvaAlgorithmica, Springer Verlag, 2020, 82 (6), pp.1616-1639.
- Not all planar graphs are in PURE-4-DIRDaniel GonçalvesJournal of Graph Algorithms and Applications, Brown University, 2020, 24 (3), pp.293-301.
- On non-repetitive sequences of arithmetic progressions: The cases k ∈ { 4 , 5 , 6 , 7 , 8 }Borut Lužar, Martina Mockovčiaková, Pascal Ochem, Alexandre Pinlou, Roman SotakDiscrete Applied Mathematics, Elsevier, 2020, 279, pp.106-117.
- On independent set in B1-EPG graphsStéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe PaulDiscrete Applied Mathematics, Elsevier, 2020, 278, pp.62-72.
- Sparse obstructions for minor-covering parametersDimitris Chatzidimitriou, Dimitrios M. Thilikos, Dimitris ZorosDiscrete Applied Mathematics, Elsevier, 2020, 278, pp.28-50.
- Hitting minors on bounded treewidth graphs. III. Lower boundsJulien Baste, Ignasi Sau Valls, Dimitrios M. ThilikosJournal of Computer and System Sciences, Elsevier, 2020, 109, pp.56-77.
- Hitting minors on bounded treewidth graphs. II. Single-exponential algorithmsJulien Baste, Ignasi Sau Valls, Dimitrios M. ThilikosTheoretical Computer Science, Elsevier, 2020, 814, pp.135-152.
- Acyclic coloring of graphs and entropy compression methodDaniel Gonçalves, Mickaël Montassier, Alexandre PinlouDiscrete Mathematics, Elsevier, 2020, 343 (4), pp.#111772.
- On the Parameterized Complexity of Graph Modification to First-Order Logic PropertiesFedor V. Fomin, Petr A. Golovach, Dimitrios M. ThilikosTheory of Computing Systems, Springer Verlag, 2020, 64 (2), pp.251-271.
- Every Collinear Set in a Planar Graph is FreeVida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter RoteDiscrete and Computational Geometry, Springer Verlag, In press. <10.1007/s00454-019-00167-x>
- Parameterized complexity of finding a spanning tree with minimum reload cost diameterJulien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau Valls, Mordechai Shalom, Dimitrios M. ThilikosNetworks, Wiley, 2020, 75 (3), pp.259-277.
- Exact square coloring of subcubic planar graphsFlorent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Eric Sopena, Petru ValicovDiscrete Applied Mathematics, Elsevier, In press.
- Avoiding conjugacy classes on the 5-letter alphabetGolnaz Badkobeh, Pascal OchemRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2020, 54 (2), pp.1-4.
- Bidimensionality and KernelsFedor Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. ThilikosSIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2020, 49 (6), pp.1397-1422.
- Oriented cliques and colorings of graphs with low maximum degreeJanusz Dybizbański, Pascal Ochem, Alexandre Pinlou, Andrzej SzepietowskiDiscrete Mathematics, Elsevier, 2020, 343 (5), pp.#111829.
- Enumerating $k$-arc-connected orientationsSarah Blind, Kolja Knauer, Petru ValicovAlgorithmica, Springer Verlag, 2020, 82 (12). <10.1007/s00453-020-00738-y>
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper BoundsJulien Baste, Ignasi Sau Valls, Dimitrios M. ThilikosSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2020, 34 (3), pp.1623-1648.
2019
- Relating broadcast independence and independenceStéphane Bessy, Dieter RautenbachDiscrete Mathematics, Elsevier, 2019, 342 (12), pp.#111589.
- Preface to special issue on Theory and Applications of Graph SearchingSpyros Angelopoulos, Nicolas Nisse, Dimitrios M. ThilikosTheoretical Computer Science, Elsevier, 2019, 794, pp.1-2.
- Vertex partitions of ($C 3 , C 4 , C 6$) -free planar graphsFrançois Dross, Pascal OchemDiscrete Mathematics, Elsevier, 2019, 342 (11), pp.3229-3236.
- Some further results on squarefree arithmetic progressions in infinite wordsJames Currie, Tero Harju, Pascal Ochem, Narad RampersadTheoretical Computer Science, Elsevier, 2019, 799, pp.140-148.
- Repetition avoidance in products of factorsPamela Fleischmann, Pascal Ochem, Kamellia ReshadiTheoretical Computer Science, Elsevier, 2019, 791, pp.123-126.
- How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?Marin Bougeret, Ignasi Sau VallsAlgorithmica, Springer Verlag, 2019, 81 (10), pp.4043-4068.
- Bipartite spanning sub(di)graphs induced by 2-partitionsJørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders YeoJournal of Graph Theory, Wiley, 2019, 92 (2), pp.130-151.
- Counting Gallai 3-colorings of complete graphsJosefran de Oliveira Bastos, Fabrício Siqueira Benevides, Guilherme Oliveira Mota, Ignasi Sau VallsDiscrete Mathematics, Elsevier, 2019, 342 (9), pp.2618-2631.
- Approximating maximum uniquely restricted matchings in bipartite graphsJulien Baste, Dieter Rautenbach, Ignasi Sau VallsDiscrete Applied Mathematics, Elsevier, 2019, 267, pp.30-40.
- Adapting The Directed Grid Theorem into an FPT AlgorithmVictor Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau VallsElectronic Notes in Theoretical Computer Science, Elsevier, 2019, 346, pp.229-240.
- Degree-constrained 2-partitions of graphsJørgen Bang-Jensen, Stéphane BessyTheoretical Computer Science, Elsevier, 2019, 776, pp.64-74.
- Weighted proper orientations of trees and graphs of bounded treewidthJulio Araujo, Cláudia Linhares Sales, Ignasi Sau Valls, Ana SilvaTheoretical Computer Science, Elsevier, 2019, 771, pp.39-48.
- Parameterized complexity of a coupled-task scheduling problemStéphane Bessy, Rodolphe GiroudeauJournal of Scheduling, Springer Verlag, 2019, 22 (3), pp.305-313.
- On the Kőnig-Egerváry theorem for $k$-pathsStéphane Bessy, Pascal Ochem, Dieter RautenbachJournal of Graph Theory, Wiley, 2019, 91 (1), pp.73-87.
- Dynamic monopolies for interval graphs with bounded thresholdsStéphane Bessy, Stefan Ehard, Lucia Penso, Dieter RautenbachDiscrete Applied Mathematics, Elsevier, 2019, 260, pp.256-261.
- On the number of circuit–cocircuit reversal classes of an oriented matroidEmeric Gioan, Chi Ho YuenDiscrete Mathematics, Elsevier, 2019, 342 (4), pp.1056-1059.
- A lower bound on the order of the largest induced linear forest in triangle-free planar graphsFrançois Dross, Mickael Montassier, Alexandre PinlouDiscrete Mathematics, Elsevier, 2019, 342 (4), pp.943-950.
- Explicit Linear Kernels for Packing ProblemsValentin Garnero, Christophe Paul, Ignasi Sau Valls, Dimitrios M. ThilikosAlgorithmica, Springer Verlag, 2019, 81 (4), pp.1615-1656.
- The active bijection for graphsEmeric Gioan, Michel Las VergnasAdvances in Applied Mathematics, Elsevier, 2019, 104, pp.165-236.
- Large induced forests in planar graphs with girth 4François Dross, Mickaël Montassier, Alexandre PinlouDiscrete Applied Mathematics, Elsevier, 2019, 254, pp.96-106.
- Cutwidth: Obstructions and Algorithmic AspectsArchontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin WrochnaAlgorithmica, Springer Verlag, 2019, 81 (2), pp.557-588.
- On some interesting ternary formulasPascal Ochem, Matthieu RosenfeldThe Electronic Journal of Combinatorics, Open Journal Systems, 2019, 26 (1), pp.P1.12.
- Induced minors and well-quasi-orderingJarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile TrunckJournal of Combinatorial Theory, Series B, Elsevier, 2019, 134, pp.110-142.
- Strong immersion is a well-quasi-ordering for semicomplete digraphsFlorian Barbero, Christophe Paul, Michał PilipczukJournal of Graph Theory, Wiley, 2019, 90, pp.484-496.
- Homothetic triangle representations of planar graphsDaniel Gonçalves, Benjamin Lévêque, Alexandre PinlouJournal of Graph Algorithms and Applications, Brown University, 2019, 23 (4), pp.745-753.
- On the structure of Schnyder woods on orientable surfacesDaniel Gonçalves, Kolja Knauer, Benjamin LévêqueJournal of Computational Geometry, Carleton University, Computational Geometry Laboratory, 2019, 10 (1), pp.127-164.
- Oriented incidence colourings of digraphsChristopher Duffy, Gary Macgillivray, Pascal Ochem, André RaspaudDiscussiones Mathematicae Graph Theory, University of Zielona Góra, 2019, 39 (1), pp.191-210.
2018
- Upper bounds on the uniquely restricted chromatic indexJulien Baste, Dieter Rautenbach, Ignasi Sau VallsJournal of Graph Theory, Wiley, 2018, 91 (3), pp.251-258.
- On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphsSancrey Rodrigues Alves, Konrad Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau Valls, Uéverton dos Santos SouzaTheoretical Computer Science, Elsevier, 2018, 746, pp.36-48.
- Structured Connectivity AugmentationFedor V. Fomin, Petr A. Golovach, Dimitrios M. ThilikosSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (4), pp.2612-2635.
- Approximability and exact resolution of the multidimensional binary vector assignment problemMarin Bougeret, Guillerme Duvillié, Rodolphe GiroudeauJournal of Combinatorial Optimization, Springer Verlag, 2018, 36 (3), pp.1059-1073.
- Well-quasi-ordering $H$-contraction-free graphsMarcin Kamiński, Jean-Florent Raymond, Théophile TrunckDiscrete Applied Mathematics, Elsevier, 2018, 248, pp.18-27.
- Complexity dichotomies for the Minimum F -Overlay problemNathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau Valls, Rémi WatrigantJournal of Discrete Algorithms, Elsevier, 2018, 52-53, pp.133-142.
- Robust scheduling with budgeted uncertaintyMarin Bougeret, Artur Alves Pessoa, Michael PossDiscrete Applied Mathematics, Elsevier, 2018, 261 (31), pp.93-107.
- Multigraphs without large bonds are wqo by contractionMarcin Kamiński, Jean-Florent Raymond, Théophile TrunckJournal of Graph Theory, Wiley, 2018, 88 (4), pp.558-565.
- Structure and Enumeration of $K4$-minor-free links and link diagramsJuanjo Rué, Dimitrios M. Thilikos, Vasiliki VelonaElectronic Notes in Discrete Mathematics, Elsevier, 2018, 68, pp.119-124.
- On triangles in $Kr$-minor free graphsBoris Albar, Daniel GonçalvesJournal of Graph Theory, Wiley, 2018, 88 (1), pp.154-173.
- Out-degree reducing partitions of digraphsJoergen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders YeoTheoretical Computer Science, Elsevier, 2018, 719, pp.64-72.
- An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. ThilikosAlgorithmica, Springer Verlag, 2018, 80 (4), pp.1330-1356.
- Degenerate matchings and edge coloringsJulien Baste, Dieter RautenbachDiscrete Applied Mathematics, Elsevier, 2018, 239, pp.38-44.
- Improved FPT algorithms for weighted independent set in bull-free graphsHenri Perret Du Cray, Ignasi Sau VallsDiscrete Mathematics, Elsevier, 2018, 341 (2), pp.451-462.
- Kernels for (Connected) Dominating Set on Graphs with Excluded Topological MinorsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. ThilikosACM Transactions on Algorithms, Association for Computing Machinery, 2018, 14 (1), pp.1-31.
- Hitting minors, subdivisions, and immersions in tournamentsJean-Florent RaymondDiscrete Mathematics and Theoretical Computer Science, DMTCS, 2018, 20 (1), pp.4212.
- Multicut Is FPTNicolas Bousquet, Jean Daligault, Stéphan ThomasséSIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2018, 47 (1), pp.166-207.
- An FPT 2-Approximation for Tree-Cut DecompositionEun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau Valls, Dimitrios M. ThilikosAlgorithmica, Springer Verlag, 2018, 80 (1), pp.116-135.
- The Geodetic Hull Number is Hard for Chordal GraphsStéphane Bessy, Mitre Dourado, Lucia Penso, Dieter RautenbachSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (1), pp.543-547.
- Avoidability of circular formulasGuilhem Gamard, Pascal Ochem, Gwenaël Richomme, Patrice SééboldTheoretical Computer Science, Elsevier, 2018, 726, pp.1-4.
- A Tight Erdös-Pósa Function for Wheel MinorsPierre Aboulker, Samuel Fiorini, Tony Huynh, Gwénaël Joret, Jean-Florent Raymond, Ignasi Sau VallsSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (3), pp.2302-2312.
- Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded DegreeFrançois Dross, Mickaël Montassier, Alexandre PinlouThe Electronic Journal of Combinatorics, Open Journal Systems, 2018, 25 (1), pp.#P1.45.
- Bounds on the burning numberStéphane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, Elham RoshanbinDiscrete Applied Mathematics, Elsevier, 2018, 235, pp.16-22.
- Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete DigraphsFlorian Barbero, Christophe Paul, Michał PilipczukACM Transactions on Algorithms, Association for Computing Machinery, 2018, 14 (3), pp.#38.
- The $k$-strong induced arboricity of a graphMaria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten UeckerdtEuropean Journal of Combinatorics, Elsevier, 2018, 67, pp.1-20.
- Polynomial expansion and sublinear separatorsLouis Esperet, Jean-Florent RaymondEuropean Journal of Combinatorics, Elsevier, 2018, 69, pp.49-53.
- On repetition thresholds of caterpillars and trees of bounded degreeBorut Lužar, Pascal Ochem, Alexandre PinlouThe Electronic Journal of Combinatorics, Open Journal Systems, 2018, 25 (1), pp.#P1.61.
2017
- Burning a graph is hardStéphane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, Elham RoshanbinDiscrete Applied Mathematics, Elsevier, 2017, 232, pp.73-87.
- 2-subcoloring is NP-complete for planar comparability graphsPascal OchemInformation Processing Letters, Elsevier, 2017, 128, pp.46-48.
- A polynomial-time algorithm for Outerplanar Diameter ImprovementNathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos, Mathias WellerJournal of Computer and System Sciences, Elsevier, 2017, 89, pp.315 - 327.
- Ruling out FPT algorithms for Weighted Coloring on forestsJulio Araujo, Julien Baste, Ignasi Sau VallsElectronic Notes in Discrete Mathematics, Elsevier, 2017, 62, pp.195-200.
- On the difference between the Szeged and the Wiener indexMarthe Bonamy, Martin Knor, Borut Lužar, Alexandre Pinlou, Riste ŠkrekovskiApplied Mathematics and Computation, Elsevier, 2017, 312, pp.202-213.
- Möbius Stanchion SystemsLucas Isenmann, Timothée PecatteElectronic Notes in Discrete Mathematics, Elsevier, 2017, 62, pp.177-182.
- The Geodetic Hull Number is Hard for Chordal GraphsStéphane Bessy, Mitre Dourado, Lucia Penso, Dieter RautenbachElectronic Notes in Discrete Mathematics, Elsevier, 2017, 62, pp.291-296.
- Maximum Cuts in Edge-colored GraphsRubens Sucupira, Luerbio Faria, Sulamita Klein, Ignasi Sau Valls, Uéverton dos Santos SouzaElectronic Notes in Discrete Mathematics, Elsevier, 2017, 62, pp.87 - 92.
- Avoidability of Formulas with Two VariablesPascal Ochem, Matthieu RosenfeldThe Electronic Journal of Combinatorics, Open Journal Systems, 2017, 24 (4), pp.#P4.30.
- Colouring diamond-free graphsKonrad K. Dabrowski, François Dross, Daniël PaulusmaJournal of Computer and System Sciences, Elsevier, 2017, 89, pp.410-431.
- Parameterized Complexity Dichotomy for (r, ℓ)-Vertex DeletionJulien Baste, Luerbio Faria, Sulamita Klein, Ignasi Sau VallsTheory of Computing Systems, Springer Verlag, 2017, 61 (3), pp.777-794.
- An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex DeletionMamadou Moustapha Kanté, Eun Jung Kim, O-Joung Kwon, Christophe PaulAlgorithmica, Springer Verlag, 2017, 79 (1), pp.66-95.
- Parameterized complexity of the MINCCA problem on graphs of bounded decomposabilityDidem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau Valls, Mordechai ShalomTheoretical Computer Science, Elsevier, 2017, 690, pp.91-103.
- Dushnik-Miller dimension of contact systems of d -dimensional boxesMathew Francis, Daniel GonçalvesElectronic Notes in Discrete Mathematics, Elsevier, 2017, 61, pp.467-473.
- Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang ConjectureStéphane Bessy, Jocelyn ThiebautElectronic Notes in Discrete Mathematics, Elsevier, 2017, 61, pp.115-121.
- Extremal Values of the Chromatic Number for a Given Degree SequenceStéphane Bessy, Dieter RautenbachGraphs and Combinatorics, Springer Verlag, 2017, 33 (4), pp.789-799.
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphismsNazanin Movarraei, Pascal OchemInformation Processing Letters, Elsevier, 2017, 123, pp.42-46.
- Colorful paths for 3-chromatic graphsNicolas Bousquet, Stéphane BessyDiscrete Mathematics, Elsevier, 2017, 340 (5), pp.1000-1007.
- Editing to a planar graph of given degreesKonrad K. Dabrowski, Petr A. Golovach, Pim van 'T Hof, Daniël Paulusma, Dimitrios M. ThilikosJournal of Computer and System Sciences, Elsevier, 2017, 85, pp.168-182.
- Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizationsMarin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi WatrigantDiscrete Mathematics and Theoretical Computer Science, DMTCS, 2017, FCT '15, 19 (4). <10.23638/DMTCS-19-4-3>
- Parameterized algorithms for min-max multiway cut and list digraph homomorphismEun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. ThilikosJournal of Computer and System Sciences, Elsevier, 2017, 86, pp.191-206.
- On the parameterized complexity of the Edge Monitoring problemJulien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau VallsInformation Processing Letters, Elsevier, 2017, 121, pp.39-44.
- Bounds on the exponential domination numberStéphane Bessy, Pascal Ochem, Dieter RautenbachDiscrete Mathematics, Elsevier, 2017, 340 (3), pp.494-503.
- Acyclic edge coloring through the Lovász Local LemmaDimitrios M. Thilikos, Ioannis Giotis, Lefteris Kirousis, Kostas I. PsaromiligkosTheoretical Computer Science, Elsevier, 2017, 665, pp.40 - 50.
- On the complexity of computing the k-restricted edge-connectivity of a graphLuis Pedro Montejano, Ignasi Sau VallsTheoretical Computer Science, Elsevier, 2017, 662, pp.31-39.
- A linear kernel for planar red–blue dominating setValentin Garnero, Ignasi Sau Valls, Dimitrios M. ThilikosDiscrete Applied Mathematics, Elsevier, 2017, 217, pp.536-547.
- Computing a Clique Tree with the Algorithm Maximal Label SearchAnne Berry, Geneviève SimonetAlgorithms, MDPI, 2017, 10 (1), pp.#20.
- The complexity of partitioning into disjoint cliques and a triangle-free graphMarin Bougeret, Pascal OchemDiscrete Applied Mathematics, Elsevier, 2017, 217, pp.438-445.
- Antistrong digraphsJørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias KriesellJournal of Combinatorial Theory, Series B, Elsevier, 2017, 122, pp.68-90.
- List Coloring with a Bounded PaletteMarthe Bonamy, Ross J. KangJournal of Graph Theory, Wiley, 2017, 84 (1), pp.93-103.
- Irrelevant vertices for the planar Disjoint Paths ProblemIsolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. ThilikosJournal of Combinatorial Theory, Series B, Elsevier, 2017, 122, pp.815-843.
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiabilityIyad Kanj, Dimitrios M. Thilikos, Ge XiaInformation and Computation, Elsevier, 2017, 257 (139-156). <10.1016/j.ic.2017.11.002>
- Recent techniques and results on the Erdős-Pósa propertyJean-Florent Raymond, Dimitrios M. ThilikosDiscrete Applied Mathematics, Elsevier, 2017, 231, pp.25-43.
- Minors in graphs of large θr-girthDimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. ThilikosEuropean Journal of Combinatorics, Elsevier, 2017, 65, pp.106-121.
- The Parameterized Complexity of Graph CyclabilityPetr A. Golovach, Marcin Kamiński, Spyridon Maniatis, Dimitrios M. ThilikosSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2017, 31 (1), pp.511 - 541.
- Low Polynomial Exclusion of Planar Graph PatternsJean-Florent Raymond, Dimitrios M. ThilikosJournal of Graph Theory, Wiley, 2017, 84 (1), pp.26-44.
- Homomorphisms of 2-edge-colored triangle-free planar graphsPascal Ochem, Alexandre Pinlou, Sagnik SenJournal of Graph Theory, Wiley, 2017, 85 (1), pp.258-277.
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degreeFrançois Dross, Mickaël Montassier, Alexandre PinlouEuropean Journal of Combinatorics, Elsevier, 2017, 66, pp.81-94.
- Encoding toroidal triangulationsVincent Despré, Daniel Gonçalves, Benjamin LévêqueDiscrete and Computational Geometry, Springer Verlag, 2017, 57 (3), pp.507-544.
- Packing and covering immersion-expansions of planar sub-cubic graphsArchontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. ThilikosEuropean Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167.
2016
- (Meta) KernelizationHans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. ThilikosJournal of the ACM (JACM), Association for Computing Machinery, 2016, 63 (5), pp.#44.
- Exponential Domination in Subcubic GraphsStéphane Bessy, Pascal Ochem, Dieter RautenbachThe Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (4), pp.#P4.42.
- Orienting TriangulationsBoris Albar, Daniel Gonçalves, Kolja KnauerJournal of Graph Theory, Wiley, 2016, 83 (4), pp.392-405.
- On the complexity of Wafer-to-Wafer IntegrationMarin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe GiroudeauDiscrete Optimization, Elsevier, 2016, 22 (part B), pp.255-269.
- An edge variant of the Erdős–Pósa propertyJean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. ThilikosDiscrete Mathematics, Elsevier, 2016, 339 (8), pp.2027-2035.
- Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosableMarthe Bonamy, Benjamin Lévêque, Alexandre PinlouDiscrete Mathematics and Theoretical Computer Science, DMTCS, 2016, 17 (3), pp.131-146.
- Parameterized certificate dispersal and its variantsValentin Garnero, Mathias WellerTheoretical Computer Science, Elsevier, 2016, 622, pp.66-78.
- Detecting minors in matroids through trianglesBoris Albar, Daniel Gonçalves, Jorge Luis Ramírez AlfonsínEuropean Journal of Combinatorics, Elsevier, 2016, 53, pp.50-58.
- Approximating the sparsest $k$-subgraph in chordal graphRémi Watrigant, Marin Bougeret, Rodolphe GiroudeauTheory of Computing Systems, Springer Verlag, 2016, 58 (1), pp.111-132.
- On interval representations of graphsAquiles Braga de Queiroz, Valentin Garnero, Pascal OchemDiscrete Applied Mathematics, Elsevier, 2016, 202, pp.30-36.
- Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing techniqueChristophe Paul, Anthony Perez, Stéphan ThomasséJournal of Computer and System Sciences, Elsevier, 2016, 82 (2). <10.1016/j.jcss.2015.08.002>
- Doubled patterns are 3-avoidablePascal OchemThe Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (1), pp.P1.19.
- Linear Kernels and Single-Exponential Algorithms Via Protrusion DecompositionsEun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau Valls, Somnath SikdarACM Transactions on Algorithms, Association for Computing Machinery, 2016, 12 (2), pp.No. 21.
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girthStanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman SotákDiscrete Mathematics, Elsevier, 2016, 339 (2), pp.780 - 789.
- On the consistency of orthology relationshipsMark Jones, Christophe Paul, Celine ScornavaccaBMC Bioinformatics, BioMed Central, 2016, 17 (S14), pp.11-14.
- Fractional Triangle Decompositions in Graphs with Large Minimum DegreeFrançois DrossSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (1), pp.36-42.
- Scattered packings of cyclesAistis Atminas, Marcin Kamiński, Jean-Florent RaymondTheoretical Computer Science, Elsevier, 2016, 647, pp.33 - 42.
- 3-path in graphs with bounded average degreeStanislav Jendrol, Mária Maceková, Mickaël Montassier, Roman SotákDiscussiones Mathematicae Graph Theory, University of Zielona Góra, 2016, 36 (2), pp.339-353.
- Minimal disconnected cuts in planar graphsMarcin Kamiński, Daniël Paulusma, Anthony Stewart, Dimitrios M. ThilikosNetworks, Wiley, 2016, 68 (4), pp.250-259.
- A lower bound on the order of the largest induced forest in planar graphs with high girthFrançois Dross, Mickaël Montassier, Alexandre PinlouDiscrete Applied Mathematics, Elsevier, 2016, 214, pp.99-107.
- Coloring non-crossing stringsLouis Esperet, Daniel Gonçalves, Arnaud LabourelThe Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (4), pp.4.4.
- Islands in graphs on surfacesLouis Esperet, Pascal OchemSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016, 30 (1), pp.206-219.
- A short proof that shuffle squares are 7-avoidableGuillaume Guégan, Pascal OchemRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2016, 50 (1), pp.101-103.
- Contraction Obstructions for Connected Graph SearchingBest Micah J, Arvind Gupta, Dimitrios M. Thilikos, Dimitris ZorosDiscrete Applied Mathematics, Elsevier, 2016, 209, pp.27-47.
2015
- Independent Domination in Cubic GraphsPaul Dorbec, Michael A. Henning, Mickaël Montassier, Justin SoutheyJournal of Graph Theory, Wiley, 2015, 80 (4), pp.329-349.
- Planar Disjoint-Paths CompletionIsolde Adler, Stavros G. Kolliopoulos, Dimitrios M. ThilikosAlgorithmica, Springer Verlag, 2015, 76 (2), pp.401-425.
- Strong edge coloring sparse graphsJulien Bensmail, Marthe Bonamy, Hervé HocquardElectronic Notes in Discrete Mathematics, Elsevier, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.773-778.
- Complexity dichotomy for oriented homomorphism of planar graphs with large girthGuillaume Guégan, Pascal OchemTheoretical Computer Science, Elsevier, 2015, 596, pp.142-148.
- Cycle Transversals in Tournaments with Few Vertex Disjoint CyclesJørgen Bang-Jensen, Stéphane BessyJournal of Graph Theory, Wiley, 2015, 79 (4), pp.249-266.
- Characterization of some binary words with few squaresGolnaz Badkobeh, Pascal OchemTheoretical Computer Science, Elsevier, 2015, 588, pp.73-80.
- The Maximum Clique Problem in Multiple Interval GraphsMathew C. Francis, Daniel Gonçalves, Pascal OchemAlgorithmica, Springer Verlag, 2015, 71 (4), pp.812-836.
- The role of planarity in connectivity problems parameterized by treewidthJulien Baste, Ignasi Sau VallsTheoretical Computer Science, Elsevier, 2015, 570, pp.1-14.
- A single-exponential FPT algorithm for the $K_4$-minor cover problemEun Jung Kim, Christophe Paul, Geevarghese PhilipJournal of Computer and System Sciences, Elsevier, 2015, 81 (1), pp.186-207.
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosableMarthe BonamySIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (3), pp.1735-1763.
- Design of fault-tolerant on-board networks with variable switch sizesOlivier Delmas, Frédéric Havet, Mickaël Montassier, Stéphane PérennesTheoretical Computer Science, Elsevier, 2015, 562, pp.75-89.
- Two floor building needing eight colorsStéphane Bessy, Daniel Gonçalves, Jean-Sébastien SereniJournal of Graph Algorithms and Applications, Brown University, 2015, 19 (1), pp.1--9.
- Excluding cycles with a fixed number of chordsPierre Aboulker, Nicolas BousquetDiscrete Applied Mathematics, Elsevier, 2015, 180, pp.11-24.
- The Erdős–Hajnal conjecture for paths and antipathsNicolas Bousquet, Aurélie Lagoutte, Stéphan ThomasséJournal of Combinatorial Theory, Series B, Elsevier, 2015, 113, pp.261-264.
- Forbidding Kuratowski Graphs as ImmersionsArchontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. ThilikosJournal of Graph Theory, Wiley, 2015, 78 (1), pp.43-60.
- Explicit Linear Kernels via Dynamic ProgrammingValentin Garnero, Christophe Paul, Ignasi Sau Valls, Dimitrios M. ThilikosSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (4), pp.1864-1894.
- Asteroidal quadruples in non rooted path graphsMarisa Gutierrez, Benjamin Lévêque, Silvia B. TondatoDiscussiones Mathematicae Graph Theory, University of Zielona Góra, 2015, 35 (4), pp.603-614.
- Classification of Coupled Dynamical Systems with Multiple Delays: Finding the Minimal Number of DelaysLeonhard Lücken, Jan Philipp Pade, Kolja KnauerSIAM Journal on Applied Dynamical Systems, Society for Industrial and Applied Mathematics, 2015, 14 (1), pp.286-304.
- Identifying codes in hereditary classes of graphs and VC-dimensionNicolas 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.
- Near-colorings: non-colorable graphs and NP-completenessMickaël Montassier, Pascal OchemThe Electronic Journal of Combinatorics, Open Journal Systems, 2015, 22 (1), pp.#P1.57.
- Hadwiger Number of Graphs with Small ChordalityPetr A. Golovach, Pinar Heggernes, Pim van 'T Hof, Christophe PaulSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2015, 29 (3), pp.1427-1451.
2014
- On the bend-number of planar and outerplanar graphsDaniel Heldt, Kolja Knauer, Torsten UeckerdtDiscrete Applied Mathematics, Elsevier, 2014, 179, pp.109-119.
- Organizing the atoms of the clique separator decomposition into an atom treeAnne Berry, Romain Pogorelcnik, Geneviève SimonetDiscrete Applied Mathematics, Elsevier, 2014, 177, pp.1-13.
- 2-Distance Coloring of Sparse GraphsMarthe Bonamy, Benjamin Lévêque, Alexandre PinlouJournal of Graph Theory, Wiley, 2014, 77 (3), pp.190-218.
- Binary patterns in binary cube-free words: Avoidability and growthRobert Mercaş, Pascal Ochem, Alexey V. Samsonov, Arseny M. ShurRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2014, 48 (4), pp.369-389.
- List coloring the square of sparse graphs with large degreeMarthe Bonamy, Benjamin Lévêque, Alexandre PinlouEuropean Journal of Combinatorics, Elsevier, 2014, 41, pp.128-137.
- On the number of prime factors of an odd perfect numberPascal Ochem, Michael RaoMathematics of Computation, American Mathematical Society, 2014, 83 (289), pp.2435-2439.
- Another remark on the radical of an ODD perfect numberPascal Ochem, Michaël RaoThe Fibonacci Quarterly, Dalhousie University, 2014, 52 (3). <315-317>
- Brooks’ theorem on powers of graphsMarthe Bonamy, Nicolas BousquetDiscrete Mathematics, Elsevier, 2014, 325, pp.12-16.
- Computation with No Memory, and Rearrangeable Multicast NetworksEmeric Gioan, Serge Burckel, Emmanuel ThoméDiscrete Mathematics and Theoretical Computer Science, DMTCS, 2014, 16 (1), pp.121-142.
- (Arc-)disjoint flows in networksJørgen Bang-Jensen, Stéphane BessyTheoretical Computer Science, Elsevier, 2014, 526, pp.28-40.
- Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar GraphsPascal Ochem, Alexandre PinlouGraphs and Combinatorics, Springer Verlag, 2014, 30 (2), pp.439-453.
- Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for TournamentsJørgen Bang-Jensen, Stéphane Bessy, Stéphan ThomasséJournal of Graph Theory, Wiley, 2014, 75 (3), pp.284-302.
- Outerplanar obstructions for matroid pathwidthAthanassios Koutsonas, Dimitrios M. Thilikos, Koichi YamazakiDiscrete Mathematics, Elsevier, 2014, 315, pp.95-101.
- Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorableMarthe Bonamy, Benjamin Lévêque, Alexandre PinlouDiscrete Mathematics, Elsevier, 2014, 317, pp.19-32.
- Strong chromatic index of planar graphs with large girthGerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André RaspaudDiscussiones Mathematicae Graph Theory, University of Zielona Góra, 2014, 34 (4), pp.723-733.
- Practical and Efficient Split Decomposition via Graph-Labelled TreesEmeric Gioan, Christophe Paul, Marc Tedder, Derek CorneilAlgorithmica, Springer Verlag, 2014, 69 (4), pp.789-843.
- Practical and Efficient Circle Graph RecognitionEmeric Gioan, Christophe Paul, Marc Tedder, Derek CorneilAlgorithmica, Springer Verlag, 2014, 69 (4), pp.759-788.
- Application of entropy compression in pattern avoidancePascal Ochem, Alexandre PinlouThe Electronic Journal of Combinatorics, Open Journal Systems, 2014, 21 (2), pp.1-12.
- More on square-free words obtained from prefixes by permutationsPascal OchemFundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2014, Russian-Finnish Symposium in Discrete Mathematics, 132 (1), pp.109-112.
- Parameterized domination in circle graphsChristophe Paul, Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Ignasi Sau Valls, Stéphan ThomasséTheory of Computing Systems, Springer Verlag, 2014, 54 (1), pp.45-72.
- Clique versus Independent SetNicolas Bousquet, Aurélie Lagoutte, Stéphan ThomasséEuropean Journal of Combinatorics, Elsevier, 2014, 40, pp.73-92.
- Square roots of minor closed graph classesNestor Nestoridis, Dimitrios M. ThilikosDiscrete Applied Mathematics, Elsevier, 2014, 168, pp.34 - 39.
- Lift-contractionsPetr A. Golovach, Daniël Paulusma, Marcin Kamiski, Dimitrios M. ThilikosEuropean Journal of Combinatorics, Elsevier, 2014, 35, pp.286-296.
- Hitting and harvesting pumpkinsGwénaël Joret, Christophe Paul, Ignasi Sau Valls, Saket Saurabh, Stéphan ThomasséSIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2014, 28 (3), pp.1363-1390.
- Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line RepresentationsDaniel Gonçalves, Benjamin LévêqueDiscrete and Computational Geometry, Springer Verlag, 2014, 51 (1), pp.67-131.
- Dynamic Programming for Graphs on SurfacesJuanjo Rué, Ignasi Sau Valls, Dimitrios M. ThilikosACM Transactions on Algorithms, Association for Computing Machinery, 2014, 10 (2), pp.8.
- Contracting Graphs to Paths and TreesPinar Heggernes, Pim Van ’t Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe PaulAlgorithmica, Springer Verlag, 2014, 68 (1), pp.109-132.
- Contracting chordal graphs and bipartite graphs to paths and treesPinar Heggernes, Pim van ’t Hof, Benjamin Lévêque, Christophe PaulDiscrete Applied Mathematics, Elsevier, 2014, LAGOS’11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina, 164, pp.444-449.
Communications internationales
2021
- Hcore-Init: Neural Network Initialization based on Graph DegeneracyStratis Limnios, George Dasoulas, Dimitrios M. Thilikos, Michalis Vazirgiannis25th International Conference on Pattern Recognition (ICPR), Jan 2021, Milan, Italy. <https://www.micc.unifi.it/icpr2020/>
2020
- A linear fixed parameter tractable algorithm for connected pathwidthMamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos28th Annual European Symposium on Algorithms (ESA), Sep 2020, Milan, Italy. pp.64:1-64:16.
- An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOLFedor V. Fomin, Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos28th Annual European Symposium on Algorithms (ESA), Sep 2020, Pisa, Italy. pp.51:1-51:17.
- Hierarchical Clusterings of Unweighted GraphsSvein Hogemo, Christophe Paul, Jan Arne Telle45th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2020, Prague, Czech Republic. pp.47:1-47:13.
- Reducing Graph Transversals via Edge ContractionsPaloma Lima, Vinicius Fernandes dos Santos, Ignasi Sau Valls, Uéverton dos Santos Souza45th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2020, Prague, Czech Republic. pp.64:1-64:15.
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth GraphsIgnasi Sau Valls, Uéverton dos Santos Souza45th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2020, Prague, Czech Republic. pp.82:1-82:15.
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric HelpsRaul Lopes, Ignasi Sau Valls45th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2020, Prague, Czech Republic. pp.68:1-68:15.
- Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial KernelMarin Bougeret, Bart Jansen, Ignasi Sau Valls47th International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2020, Saarbrücken, Germany. pp.16:1--16:19.
- An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph ClassesIgnasi Sau Valls, Giannos Stamoulis, Dimitrios M. Thilikos47th International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2020, Saarbrücken, Germany. pp.95:1-95:20.
- On the complexity of finding large odd induced subgraphs and odd coloringsRémy Belmonte, Ignasi Sau Valls46th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2020, Leeds, United Kingdom. pp.67-79.
- Hitting topological minor models in planar graphs is fixed parameter tractablePetr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2020, Salt Lake City, UT, United States. pp.931-950.
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundaryJulien Baste, Ignasi Sau Valls, Dimitrios M. Thilikos31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2020, Salt Lake City, UT, United States. pp.951-970.
2019
- Connected Search for a Lazy RobberIsolde Adler, Christophe Paul, Dimitrios M. Thilikos39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2019, Bombay, India. pp.7:1--7:14.
- The chromatic number and switching chromatic number of 2-edge-colored graphs of bounded degreeFabien Jacques, Mickaël Montassier, Alexandre Pinlou5th Bordeaux Graph Workshop (BGW), Oct 2019, Bordeaux, France. <https://bgw.labri.fr/2019/>
- r-hued coloring of planar graphs with girth at least 8Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov5th Bordeaux Graph Workshop (BGW), Oct 2019, Bordeaux, France. <https://bgw.labri.fr/2019/>
- Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and KernelizationGuilherme Gomes, Ignasi Sau Valls14th International Symposium on Parameterized and Exact Computation (IPEC), Sep 2019, Munich, Germany. pp.19:1--19:15.
- Clustering to Given ConnectivitiesPetr A. Golovach, Dimitrios M. Thilikos14th International Symposium on Parameterized and Exact Computation (IPEC), Sep 2019, Munich, Germany. pp.18:1-18:17.
- Approximation results for makespan minimization with budgeted uncertaintyMarin Bougeret, Klaus Jansen, Michael Poss, Lars RohwedderWAOA 2019, Sep 2019, Munich, Germany.
- Packing Arc-Disjoint Cycles in TournamentsStéphane Bessy, Marin Bougeret, Ramaswamy Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav ZehaviMFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1 - 23.
- 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 SlopesDaniel Gonçalves45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2019, Vall de Núria, Spain. pp.351-363.
- Lean Tree-Cut Decompositions: Obstructions and AlgorithmsArchontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. ThilikosSTACS: Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.32:1--32:14.
- Modification to Planarity is Fixed Parameter TractableFedor V. Fomin, Petr A. Golovach, Dimitrios M. ThilikosSTACS: Symposium on Theoretical Aspects of Computer Science, Mar 2019, Berlin, Germany. pp.28:1--28:17.
- Minimum Reload Cost Graph FactorsJulien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. ThilikosSOFSEM, Jan 2019, Nový Smokovec, Slovakia. pp.67-80.
- Connected tree-width and connected cops and robber gameChristophe PaulCAALM: Complexity, Algorithms, Automata and Logic Meet, Jan 2019, Chennai, India. <https://www.cmi.ac.in/~sri/CAALM2019/>
- Every Collinear Set in a Planar Graph Is FreeVida Dujmović, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter RoteSODA: Symposium on Discrete Algorithms, Jan 2019, San Diego, CA, United States. pp.1521-1538.
2018
- Data-Compression for Parametrized Counting Problems on Sparse GraphsEun Jung Kim, Maria Serna, Dimitrios M. ThilikosISAAC: International Symposium on Algorithms and Computation, Dec 2018, Jiaoxi, Yilan County, Taiwan. pp.20:1--20:13.
- A polynomial Turing kernel to compute the cut-width of semi-complete digraphChristophe PaulFILOFOCS: French-Israeli Workshop on Foundations of Computer Science, Oct 2018, Paris, France. <https://www.irif.fr/~adiro/filofocs/filofocs2018/index.html>
- A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by TreewidthJulien Baste, Ignasi Sau Valls, Dimitrios M. ThilikosIPEC: International Symposium on Parameterized and Exact Computation, Aug 2018, Helsinki, Finland. pp.2:1--2:13.
- Dual parameterization of Weighted ColoringJulio Araujo, Victor Campos, Carlos Vinícius G. C. Lima, Vinicius Fernandes dos Santos, Ignasi Sau Valls, Ana Silva13th International Symposium on Parameterized and Exact Computation (IPEC), Aug 2018, Helsinki, Finland. pp.12:1--12:14.
- Discrete Morse theory for the collapsibility of supremum sectionsBalthazar Bauer, Lucas IsenmannICGT: International Colloquium on Graph Theory and combinatorics, Jul 2018, Lyon, France. <https://projet.liris.cnrs.fr/~icgt2018/>
- Computing Small Pivot-MinorsKonrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-Joung Kwon, Sang-Il Oum, Daniël PaulusmaWG: Graph-Theoretic Concepts in Computer Science, Jun 2018, Cottbus, Germany. pp.125-138.
- Partial complementation of graphsFedor V. Fomin, Petr A. Golovach, Torstein Strømme, Dimitrios M. ThilikosSWAT: Scandinavian Workshops on Algorithm Theory, Jun 2018, Malmö, Sweden. pp.21:1--21:13.
- Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemmaIoannis Giotis, Lefteris Kirousis, John Livieratos, Kostas Psaromiligkos, Dimitrios M. ThilikosGASCom: Random and Exhaustive Generation of Combinatorial Structures, Jun 2018, Athens, Greece. pp.148-155.
- Temporal matching in link stream: kernel and approximationJulien Baste, Binh-Minh Bui-Xuan16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2018), Jun 2018, Paris, France.
- On the complexity of finding internally vertex-disjoint long directed pathsJulio Araujo, Victor Campos, Ana Karolinna Maia, Ignasi Sau Valls, Ana Silva13th Latin American Symposium on Theoretical Informatics (LATIN), Apr 2018, Buenos Aires, Argentina. pp.66-79.
- Planar Graphs as L-intersection or L-contact graphsDaniel Gonçalves, Lucas Isenmann, Claire PennarunSODA: Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.172-184.
2017
- On Some Interesting Ternary FormulasPascal Ochem, Matthieu RosenfeldWORDS, Sep 2017, Montreal, Canada. pp.30-35.
- Contraction-Bidimensionality of Geometric Intersection GraphsJulien Baste, Dimitrios M. ThilikosIPEC: International symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.5:1--5:13.
- Triangle packing in (sparse) tournaments: approximation and kernelizationStéphane Bessy, Marin Bougeret, Jocelyn ThiebautESA: European Symposium on Algorithms, Sep 2017, Vienne, Austria. pp.14:1--14:13.
- Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost DiameterJulien Baste, Didem Gözüpek, Ignasi Sau Valls, Mordechai Shalom, Dimitrios M. ThilikosIPEC: International symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.3:1--3:12.
- Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded TreewidthJulien Baste, Ignasi Sau Valls, Dimitrios M. ThilikosIPEC: International symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.4:1--4:12.
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?Marin Bougeret, Ignasi Sau VallsIPEC: International symposium on Parameterized and Exact Computation, Sep 2017, Vienne, Austria. pp.10:1--10:13.
- Structured Connectivity AugmentationFedor V. Fomin, Petr A. Golovach, Dimitrios M. ThilikosMFCS: Mathematical Foundations of Computer Science, Aug 2017, Aalborg, Denmark. pp.29:1--29:13.
- Integer vectors and combinatorial properties of affine dependencies of ±1 vectors over the realsEmeric Gioan, Ilda da SilvaSymmetry in Finite and Infinite Structures, Jul 2017, Lisbonne, Portugal.
- Complexity Dichotomies for the Minimum $F$-Overlay ProblemNathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau Valls, Rémi Watrigant28th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2017, Newcastle, Australia. pp.116-127.
- Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete DigraphsFlorian Barbero, Christophe Paul, Michał PilipczukICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Warsaw, Poland. pp.70:1--70:13.
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph ClassesArchontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin WrochnaICALP: International Colloquium on Automata, Languages, and Programming, Jul 2017, Varsovie, Poland. pp.1-15.
- On the Number of Labeled Graphs of Bounded TreewidthJulien Baste, Marc Noy, Ignasi Sau Valls43rd International on Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2017, Eindhoven, Netherlands. pp.88-99.
- Uniquely Restricted Matchings and Edge ColoringsJulien Baste, Dieter Rautenbach, Ignasi Sau VallsWG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2017, Eindhoven, Netherlands. pp.100-112.
- Dushnik-Miller dimension of TD-Delaunay complexesDaniel Gonçalves, Lucas IsenmannEuroCG: European Workshop on Computational Geometry, Apr 2017, Malmo, Sweden.
2016
- On the (Parameterized) Complexity of Recognizing Well-Covered $(r,l)$-graphsSancrey Rodrigues Alves, Konrad K. Dabrowski, Luerbio Faria, Sulamita Klein, Ignasi Sau Valls, Uéverton dos Santos SouzaCOCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.423-437.
- Partitioning sparse graphs into an independent set and a forest of bounded degreeFrançois Dross, Mickaël Montassier, Alexandre PinlouBGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France. <http://bgw.labri.fr/2016/>
- On a conjecture on k-Thue sequencesBorut Lužar, Martina Mockovčiaková, Pascal Ochem, Alexandre Pinlou, Roman SotákBGW: Bordeaux Graph Workshop, Nov 2016, Bordeaux, France. <http://bgw.labri.fr/2016/>
- Vertex-partitions of graphsMickaël MontassierICGCA: International Conference on Graph theory, Combinatorics and their Applications, Oct 2016, Jinhua, China.
- Cutwidth: obstructions and algorithmic aspectsArchontia C. Giannopoulou, Michał Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin WrochnaIPEC: International symposium on Parameterized and Exact Computation, Aug 2016, Aarhus, Denmark. pp.15:1--15:13.
- FPT Algorithms for Plane Completion ProblemsDimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris ZorosMFCS: Mathematical Foundations of Computer Science, Aug 2016, Kraków, Poland. pp.26:1-26:13.
- Avoidability of Formulas with Two VariablesPascal Ochem, Matthieu RosenfeldDLT: Developments in Language Theory, Laboratoire de combinatoire et d'informatique mathématique (LaCIM), Université du Québec à Montréal, Jul 2016, Montréal, Canada. pp.344-354.
- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic TreesJulien Baste, Christophe Paul, Ignasi Sau Valls, Celine ScornavaccaAAIM: Algorithmic Aspects in Information and Management, Jul 2016, Bergamo, Italy. pp.53-64.
- Parameterized Complexity of the MINCCA Problem on Graphs of Bounded DecomposabilityDidem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau Valls, Mordeshai ShalomWG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.195-206.
- Packing and Covering Immersion Models of Planar subcubic GraphsArchontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, Dimitrios M. ThilikosWG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2016, Istanbul, Turkey. pp.74-84.
- On six expressions of the Tutte polynomial of a graph (on a linearly ordered set of edges)Emeric GioanGraph Polynomials: Towards a Comparative Theory, Jun 2016, Dagstuhl seminar, Germany.
- Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment ProblemMarin Bougeret, Guillerme Duvillié, Rodolphe GiroudeauISCO: International Symposium on Combinatorial Optimization, May 2016, Vietri sul Mare, Italy. pp.148-159.
- Colouring Diamond-free GraphsKonrad K. Dabrowski, François Dross, Daniël PaulusmaSWAT: Scandinavian Workshops on Algorithm Theory, 2016, Reykjavik, Iceland. pp.16:1--16:14.
2015
- Filling the Complexity Gaps for Colouring Planar and Bounded Degree GraphsKonrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma25th International Workshop on Combinatorial Algorithms (IWOCA), Oct 2015, Verona, Italy. pp.100-111.
- An FPT 2-Approximation for Tree-cut DecompositionEun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau Valls, Dimitrios M. ThilikosWAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.35-46.
- An $O(log OPT)$-Approximation for Covering/Packing Minor Models of $θ _r$Dimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. ThilikosWAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.122-132.
- On Independent Set on B1-EPG GraphsMarin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe PaulWAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169.
- An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex DeletionChristophe Paul, Eun Jung Kim, Mamadou Moustapha Kanté, O-Joung KwonIPEC: International symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.139-150.
- Variants of Plane Diameter CompletionClément Requilé, Dimitrios M. Thilikos, Petr A. GolovachIPEC: International Symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.30-42.
- Bidimensionality and Parameterized AlgorithmsDimitrios M. ThilikosIPEC: International symposium on Parameterized and Exact Computation, Sep 2015, Patras, Greece. pp.1-16.
- Parameterized Algorithms for Min-Max Multiway Cut and List Digraph HomomorphismEun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos10th International Symposium on Parameterized and Exact Computation (IPEC 2015), Sep 2015, Patras, Greece. pp.78-89.
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degreeFrançois Dross, Mickaël Montassier, Alexandre PinlouEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.269-275.
- Induced minors and well-quasi-orderingJarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile TrunckEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.197-201.
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee ParameterizationsMarin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi WatrigantFCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.189-201.
- Minimal Disconnected Cuts in Planar GraphsMarcin Kaminski, Daniël Paulusma, Stewart Anthony, Dimitrios M. ThilikosFCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. pp.243-254.
- A Polynomial-Time Algorithm for Outerplanar Diameter ImprovementNathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau Valls, Dimitrios M. Thilikos, Mathias WellerCSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142.
- Editing to a Planar Graph of Given DegreesKonrad K. Dabrowski, Petr A. Golovach, Pim Van'T Hof, Daniël Paulusma, Dimitrios M. ThilikosCSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.143-156.
- A survey on the active bijection in graphs, hyperplane arrangements and oriented matroidsEmeric GioanWorkshop on the Tutte polynomial, Jul 2015, London, United Kingdom. <https://tutte2015.ma.rhul.ac.uk>
- Algorithms and Combinatorics on the Erdős–Pósa propertyDimitrios M. ThilikosAGTAC: Algorithmic Graph Theory on the Adriatic Coast, Jun 2015, Koper, Slovenia. <https://conferences.matheo.si/event/6/page/12>
- An alternative proof for the constructive Asymmetric Lovász Local LemmaIoannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. ThilikosCTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, İstanbul, Turkey. <http://ctw2015.eng.marmara.edu.tr>
- A Fixed Parameter Algorithm for Plane Subgraph CompletionDimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris ZorosCTW: Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2015, Istanbul, Turkey. <http://ctw2015.eng.marmara.edu.tr>
- Orienting triangulationsBoris Albar, Daniel Gonçalves, Kolja KnauerEuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia. <http://eurocg15.fri.uni-lj.si>
- On the Algorithmic Lovász Local Lemma and Acyclic Edge ColoringIoannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos, Dimitrios M. ThilikosANALCO: Analytic Algorithmics and Combinatorics, Jan 2015, San Diego, California, United States. <10.1137/1.9781611973761.2>
- Introduction to parameterized complexity and some algorithmic consequences of the graph minor theoryChristophe PaulWorkshop on Graph Theory and its Applications, 2015, Istanbul, Turkey.
2014
- The role of planarity in connectivity problems parameterized by treewidthJulien Baste, Ignasi Sau VallsIPEC: International symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.63-74.
- A 14$k$-Kernel for Planar Feedback Vertex Set via Region DecompositionMarthe Bonamy, Lukasz KowalikIPEC: International Symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.97-109.
- The Parameterized Complexity of Graph CyclabilityPetr A. Golovach, Marcin Kamiski, Spyridon Maniatis, Dimitrios M. ThilikosESA: European Symposium on Algorithms, Sep 2014, Wrocław, Poland. pp.492-504.
- Intersection Graphs of L-Shapes and Segments in the PlaneStefan Felsner, Kolja Knauer, George B. Mertzios, Torsten UeckerdtMFCS: Mathematical Foundations of Computer Science, Aug 2014, Budapest, Hungary. pp.299-310.
- Quantifying trust dynamics in signed graphs, the S-Cores approachChristos Giatsidis, Bogdan Cautis, Silviu Maniu, Michalis Vazirgiannis, Dimitrios M. ThilikosSDM: SIAM Data Mining, Aug 2014, Philadelphia, United States. pp.668-676.
- CORECLUSTER: A Degeneracy Based Graph Clustering FrameworkChristos Giatsidis, Fragkiskos Malliaros, Dimitrios M. Thilikos, Michalis VazirgiannisIAAA: Innovative Applications of Artificial Intelligence, Jul 2014, Quebec City, Canada.
- Recognition of dynamic circle graphsChristophe Crespelle, Emeric Gioan, Christophe PaulICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. <http://oc.inpg.fr/conf/icgt2014/>
- Entropy compression method applied to graph coloringsDaniel Gonçalves, Mickaël Montassier, Alexandre PinlouICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France.
- Covering and packing pumpkin modelsDimitris Chatzidimitriou, Jean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. ThilikosICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. <http://oc.inpg.fr/conf/icgt2014/>
- Structure of W_4 -immersion free graphsRémy Belmonte, Archontia C. Giannopoulou, Daniel Lokshtanov, Dimitrios M. ThilikosICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
- Geometric Extensions of Cutwidth in any DimensionMenelaos Karavelas, Dimitris Zoros, Spyridon Maniatis, Dimitrios M. ThilikosICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
- An edge variant of the Erdős-Pósa propertyJean-Florent Raymond, Ignasi Sau Valls, Dimitrios M. ThilikosICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
- Detecting minors in matroids throughout trianglesBoris Albar, Daniel Gonçalves, Jorge Ramírez AlfonsínICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. <http://oc.inpg.fr/conf/icgt2014/>
- Contraction Obstructions for Connected Graph SearchingBest Micah J, Arvind Gupta, Dimitrios M. Thilikos, Dimitris ZorosICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France.
- Hadwiger Number of Graphs with Small ChordalityPetr A. Golovach, Pinar Heggernes, Pim van 'T Hof, Christophe PaulWG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-Fuzelier, France. pp.201-213.
- Contact Representations of Planar Graphs: Extending a Partial Representation is HardSteven Chaplick, Paul Dorbec, Jan Kratochvil, Mickaël Montassier, Juraj StachoWG: Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2014, Nouan-le-fuzelier, France. pp.139-151.
- Convexity in partial cubes: the Hull numberMarie Albenque, Kolja Knauer11th Latin American Symposium on Theoretical Informatics (LATIN), Mar 2014, Montevideo, Uruguay. pp.421-432.
- Explicit linear kernels via dynamic programmingValentin Garnero, Christophe Paul, Ignasi Sau Valls, Dimitrios M. ThilikosSTACS: Symposium on Theoretical Aspects of Computer Science, Mar 2014, Lyon, France. pp.312-324.
- Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal GraphsMarin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi WatrigantSOFSEM: Theory and Practice of Computer Science, Jan 2014, Nový Smokovec, Slovakia. pp.150-161.
- Bidimensionality of Geometric Intersection GraphsAlexander Grigoriev, Athanassios Koutsonas, Dimitrios M. ThilikosSOFSEM: Theory and Practice of Computer Science, Jan 2014, Špindlerův Mlýn, Czech Republic. pp.293-305.
- Entropy compression method and graph coloring problemsMickaël MontassierC&C: Cycles and Colourings, 2014, Novy Smokovec, Slovakia.
Dernière mise à jour le 07/01/2019
Fiche-équipe ALGCO
Télécharger la fiche-équipe ALGCO du rapport d'activité 2008-2013 :