 |
 |
 |
 |
|
|
||
|---|---|---|
|
hal-00920842v1
Communication dans un congrès
Arnaud Pêcher, Mickaël Montassier, André Raspaud. Strong chromatic index of planar graphs with large girth 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> |
||
|
hal-00920932v1
Article dans une revue
Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud. Strong chromatic index of planar graphs with large girth Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2014, 34 (4), pp.723-733. <10.7151/dmgt.1763> |
||
|
lirmm-01346642v1
Article dans une revue
Stanislav Jendrol, Mária Maceková, Mickaël Montassier, Roman Soták. 3-path in graphs with bounded average degree Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2016, 36 (2), pp.339-353. <10.7151/dmgt.1859> |
||
|
lirmm-01348863v1
Article dans une revue
Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato. Asteroidal quadruples in non rooted path graphs Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2015, 35 (4), pp.603-614. <10.7151/dmgt.1821> |
||
|
lirmm-01483628v1
Article dans une revue
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh et al. (Meta) Kernelization Journal of the ACM (JACM), Association for Computing Machinery, 2016, 63 (5), pp.#44. <10.1145/2973749> |
||
|
lirmm-00108788v1
Communication dans un congrès
Michel Habib, Fabien De Montgolfier, Christophe Paul. A Simple Linear-Time Modular Decomposition Algorithm Hagerup T. SWAT'04: 9th Scandinavian Workshop on Algorithm Theory, 2004, pp.187-198, 2004, Lecture Notes in Computer Science |
||
|
lirmm-00106693v1
Rapport
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. Revisiting T. Uno and M. Yagiura's Algorithm 05049, 2005, 14 p |
||
|
lirmm-00106696v1
Rapport
Anne Berry, J. Blair, Jean-Paul Bordat, Geneviève Simonet. Graph Extremities Defined by Search Algorithms 05055, 2005, 17 p |
||
|
lirmm-00106678v1
Rapport
Christophe Paul, Jan Arne Telle. New Tools and Results for Branchwidth 05017, 2005, pp.14 |
||
|
lirmm-00106625v1
Rapport
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. From Permutations to Graph Algorithms 05021, 2005, pp.14 |
||
|
lirmm-01349277v1
Communication dans un congrès
Jarosław Błasiok, Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck. Induced minors and well-quasi-ordering 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> |
||
|
lirmm-00327258v1
Communication dans un congrès
Annie Château, Cedric Chauve, Sèverine Bérard, Eric Tannier, Christophe Paul. Perfect DCJ rearrangement 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> |
||
|
hal-00678173v1
Communication dans un congrès
Marcin Kaminski, Dimitrios M. Thilikos. Contraction checking in graphs on surfaces 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 |
||
|
lirmm-00432674v1
Communication dans un congrès
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé. A Linear Vertex Kernel for Maximum Internal Spanning Tree ISAAC'09: 20th International Symposium on Algorithms and Computation, pp.9, 2009 |
||
|
tel-00660089v1
Thèse
Anthony Perez. Algorithmes de noyau pour des problèmes d'édition de graphes et autres structures Algorithme et structure de données [cs.DS]. Université Montpellier II - Sciences et Techniques du Languedoc, 2011. Français |
||
|
hal-01345283v1
Pré-publication, Document de travail
Marin Bougeret, Artur Pessoa, Michael Poss. Robust scheduling with budgeted uncertainty 2016 |
||
|
lirmm-00191916v1
Communication dans un congrès
Anne Berry, Pinar Heggernes, Geneviève Simonet. The Minimum Degree Heuristic and the Minimal Triangulation Process H. Bodlaender. WG: Workshop on Graph-Theoretic Concepts in Computer Science, May 2003, Elspeet, Netherlands. 29th International Workshop on Graph-Theoretic Concepts in Computer Science, pp.58-70, 2003, Lecture Notes in Computer Science |
||
|
lirmm-00191918v1
Rapport
Michel Habib, Christophe Paul, Mathieu Raffinot. Common Connected Components of Interval Graphs 03014, 2003, pp.13 |
||
|
lirmm-00191920v1
Rapport
A.T. Gai, Michel Habib, Christophe Paul, Mathieu Raffinot. Identifying Common Connected Components of Graphs 03016, 2003, pp.13 |
||
|
|
||
|
lirmm-00108959v1
Communication dans un congrès
P. Fraigniaud, C. Gavoille, Christophe Paul. Eclectisme dans les Petits Mondes AlgoTel'04 : 6èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, 2004, 2004 |
||
|
lirmm-00373643v2
Communication dans un congrès
Philippe Gambette, Jean Véronis. Visualising a Text with a Tree Cloud 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> |
||
|
hal-00159601v1
Communication dans un congrès
Michel Habib, Fabien De Montgolfier, Christophe Paul. A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension Torben Hagerup, Jyrki Katajainen. 9th Scandinavian Workshop on Algorithm Theory, 2004, Humlebaek,, Denmark. springer, pp.187-198, 2004, LNCS vol. 3111 |
||
|
lirmm-00106466v1
Communication dans un congrès
Christophe Paul, Jan Arne Telle. New Tools and Simpler Algorithms for Branchwidth G.S. Brodal, S. Leonardini. ESA'05: 13rd Annual European Symposium on Algorithms, 2005, pp.379-390, 2005, Lecture Notes in Computer Science |
||
|
lirmm-00808045v1
Communication dans un congrès
Daniel Gonçalves. Planar Graphs as Intersection Graphs 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/> |
||
|
lirmm-00108770v1
Communication dans un congrès
Christophe Paul. Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs Hromkovic J.;Nagl M. WG'04: 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2004, Bad Honnef (Germany), pp.93-104, 2004, Lecture Notes in Computer Science |
||
|
lirmm-00108787v1
Communication dans un congrès
Michel Habib, Christophe Paul, Mathieu Raffinot. Maximal Common Connected Sets of Interval Graphs Cenk Sahinalp S.; Muthukrishnan S. CPM: Combinatorial Pattern Matching, 2004, Istanbul, Turkey. 15th Annual Symposium on Combinatorial Pattern Matching, LNCS (3109), pp.359-372, 2004, Combinatorial Pattern Matching. <10.1007/978-3-540-27801-6_27> |
||
|
lirmm-00106039v1
Communication dans un congrès
Christophe Paul. Fully Dynamic Algorithm for Modular Decomposition and Recognition of Permutation Graphs WG'05: 31st International Workshop on Graph Theoretical Concepts in Computer Science, Jun 2005, Metz, France. LNCS (3787), pp.38-48, 2005, <10.1007/11604686_4> |
||
|
|
||