Nombre de documents

66

CV de Michel Habib


Autre publication1 document

  • Jérémie Dusart, Michel Habib, Derek G. Corneil. Maximal cliques structure for cocomparability graphs and applications. Il s'agit d'une recherche sur les relations entre les graphes d'intervalles et les graphes de coc.. 2016. <hal-01393927>

Article dans une revue30 documents

  • Jérémie Dusart, Michel Habib. A new LBFS-based algorithm for cocomparability graph recognition. Discrete Mathematics, Elsevier, 2016, To A. Brandstädt, <10.1016/j.dam.2015.07.016>. <hal-01274023>
  • Derek G. Corneil, Jérémie Dusart, Michel Habib, Ekkerhard Köhler. On the power of graph searching for cocomparability graphs. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2016. <hal-01273687>
  • Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien De Montgolfier. A tie-break model for graph search. Discrete Applied Mathematics, Elsevier, 2016, 199, pp.89-100. <10.1016/j.dam.2015.06.011>. <hal-01255055>
  • Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter Kosters, Andrea Marino, et al.. Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separationgames. Theoretical Computer Science, Elsevier, 2015, 586, pp.21. <10.1016/j.tcs.2015.02.033>. <hal-01255125>
  • Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, et al.. Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 586, pp.59-80. <10.1016/j.tcs.2015.02.033>. <hal-01248555>
  • Pierre Charbit, Michel Habib, Antoine Mamcarz. Influence of the tie-break rule on the end-vertex problem. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, pp.57-72. <hal-01101514>
  • Michel Habib, Antoine Mamcarz, Fabien De Montgolfier. Computing H-Joins with Application to 2-Modular Decomposition. Algorithmica, Springer Verlag, 2014, 70 (2), pp.245-266. <10.1007/s00453-013-9820-1>. <hal-00921775>
  • Derek G. Corneil, Barnaby Dalton, Michel Habib. LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2013, 42 (3), pp.792-807. <10.1137/11083856X>. <hal-00936300>
  • Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino. On computing the diameter of real-world undirected graphs. Theoretical Computer Science, Elsevier, 2013, Graph Algorithms and Applications: in Honor of Professor Giorgio Ausiello, 514, pp.84-95. <10.1016/j.tcs.2012.09.018>. <hal-00936304>
  • Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce Reed, Udi Rotics. Polynomial-time recognition of clique-width ≤3 graphs. Discrete Applied Mathematics, Elsevier, 2012, 160 (6), <10.1016/j.dam.2011.03.020>. <hal-01274081>
  • Julie Chobert, Clément François, Michel Habib, Mireille Besson. Deficit in the preattentive processing of syllabic duration and VOT in children with dyslexia. Neuropsychologia, Elsevier, 2012, 50 (8), pp.2044-2055. <10.1016/j.neuropsychologia.2012.05.004>. <hal-01384132>
  • Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao. Tree-representation of set families and applications to combinatorial decompositions. European Journal of Combinatorics, Elsevier, 2012, 33 (5), pp.688-711. <hal-00555520>
  • Charbit Pierre, Michel Habib, Trotignon Nicolas, Vuskovic Kristina. Detecting 2-joins faster. Journal of Discrete Algorithms, Elsevier, 2012, 17, pp.60-66. <ensl-00800019>
  • Michel Habib, Christophe Paul. A Survey on Algorithmic Aspects of Modular Decomposition. Computer Science Review, Elsevier, 2010, 4 (1), pp.41-59. <10.1016/j.cosrev.2010.01.001>. <lirmm-00533514>
  • Clémence Magnien, Matthieu Latapy, Michel Habib. Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. ACM Journal on Experimental Algorithmics, Association for Computing Machinery, 2009, 13, pp.10. <10.1145/1412228.1455266>. <hal-01146069>
  • Anna Bretscher, Derek Corneil, Michel Habib, Christophe Paul. A Simple Linear Time LexBFS Cograph Recongition Algorithm. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2008, 22 (4), pp.1277-1296. <lirmm-00324572>
  • Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. Competitive Graph Searches. Theoretical Computer Science, Elsevier, 2008, 393 (1-3), pp.72-80. <lirmm-00324565>
  • Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul. Can Transitive Orientation Make Sandwich Problems Easier?. Discrete Mathematics, Elsevier, 2007, 307 (16), pp.2030-2041. <10.1016/j.disc.2005.12.048>. <lirmm-00189518>
  • D.G. Corneil, Michel Habib, J.M. Lanlignel, U. Rotics, B. Reed. Polynomial Recognition of Clique-Width <=3 Graphs. Journal of Graph Algorithms and Applications (JGAA), Brown University, 2006, V nd. <lirmm-00102628>
  • Michel Habib, Lhouari Nourine. The Number of Moore Families on n=6. Discrete Mathematics, Elsevier, 2005, 294 (3), pp.291-296. <lirmm-00105351>
  • Michel Habib, Christophe Paul. A Simple Linear Time Algorithm for Cograph Recognition. Discrete Applied Mathematics, Elsevier, 2005, 145 (2), pp.183-197. <lirmm-00105298>
  • Michel Habib, Lhouari Nourine, O. Raynaud, E. Thierry. Computational Aspects of the 2-Dimension of Partially Ordered Sets. Theoretical Computer Science, Elsevier, 2004, 312 (2-3), pp.401-431. <lirmm-00108552>
  • Michel Habib, Lhouari Nourine, Olivier Raynaud, Eric Thierry. Computational aspects of the 2-dimension of partially ordered sets. Theoretical Computer Science, Elsevier, 2004, 312 (2-3), pp.401-431. <10.1016/j.tcs.2003.10.029>. <inria-00099966>
  • Michel Habib, E. Lebhar, Christophe Paul. A Note on Finding All Homogeneous Set Sandwiches. Information Processing Letters, Elsevier, 2003, 87, pp. 147-151. <lirmm-00269575>
  • Christian Capelle, Michel Habib, Fabien Montgolfier. Graph Decompositions and Factorizing Permutations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.55-70. <hal-00958972>
  • Michel Habib, Christophe Paul, Laurent Viennot. Linear time recognition of P4-indifference graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.173-178. <http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/157>. <inria-00471619>
  • G. Damiand, Michel Habib, Christophe Paul. A Simple Paradigm for Graph Recognition : Application to Cographs and Distance Hereditary Graphs. Theoretical Computer Science, Elsevier, 2001, 263 (1-2), pp.99-111. <lirmm-00090372>
  • D.G. Corneil, F.F. Dragan, Michel Habib, Christophe Paul. Diameter Determination on Restricted Graph Families. Discrete Applied Mathematics, Elsevier, 2001, 113 (2-3), pp.146-166. <lirmm-00090363>
  • Michel Habib, Ross Mac Connell, Christophe Paul, Laurent Viennot. Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testing. Theoretical Computer Science, Elsevier, 2000, 234. <inria-00471613>
  • Andreas Dietz, Christophe Fiorio, Michel Habib, Claude Lorenço. Topology-based stereochemistry representation. Comptes rendus de l’Académie des sciences. Série IIc, Chimie, Elsevier, 1998, 1 (II), pp.95-100. <10.1016/S1251-8069(97)86267-7>. <lirmm-01167951>

Rapport13 documents

  • Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien De Montgolfier. A new tractable combinatorial decomposition. RR-07016, 2007. <lirmm-00157502v2>
  • Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. From Permutations to Graph Algorithms. 05021, 2005, pp.14. <lirmm-00106625>
  • Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. Revisiting T. Uno and M. Yagiura's Algorithm. 05049, 2005, 14 p. <lirmm-00106693>
  • Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. Divide and Conquer Revisited. Application to Graph Algorithms. 04027, 2004, pp.14. <lirmm-00109200>
  • Michel Habib, Fabien De Montgolfier, Christophe Paul. A Simple Linear-Time Modular Decomposition Algorithm for Modular Decomposition. 03007, 2003, pp.P nd. <lirmm-00269514>
  • Michel Habib, Christophe Paul, Mathieu Raffinot. Common Connected Components of Interval Graphs. 03014, 2003, pp.13. <lirmm-00269548>
  • A.T. Gai, Michel Habib, Christophe Paul, Mathieu Raffinot. Identifying Common Connected Components of Graphs. 03016, 2003, pp.13. <lirmm-00269551>
  • A.T. Gai, Michel Habib, Christophe Paul, Mathieu Raffinot. Identifying Common Connected Components of Graphs. 03016, 2003, pp.13. <lirmm-00269440>
  • Michel Habib, Christophe Paul, Mathieu Raffinot. Common Connected Components of Interval Graphs. 03014, 2003, pp.13. <lirmm-00191918>
  • A.T. Gai, Michel Habib, Christophe Paul, Mathieu Raffinot. Identifying Common Connected Components of Graphs. 03016, 2003, pp.13. <lirmm-00191920>
  • Michel Habib, Christophe Paul, Mathieu Raffinot. Common Connected Components of Interval Graphs. [Research Report] 03014, LIRMM (UM, CNRS). 2003, pp.13. <lirmm-00269438>
  • Michel Habib, E. Lebhar, Christophe Paul. A Note on Finding all Homogeneous Set Sandwiches. 02141, 2002, pp.7. <lirmm-00090365>
  • Michel Habib, Christophe Paul, Laurent Viennot. Linear Time Recognition of P4-Indifference Graphs. [Research Report] RR-3779, INRIA. 1999. <inria-00072882>

Communication dans un congrès14 documents

  • Michel Habib, Antoine Mamcarz. Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs. Graph-Theoretic Concepts in Computer Science - 40th International Workshop (WG 2014), Jun 2014, Orléans, France. Springer-verlag, LNCS, 8747, pp.12, LNCS. <hal-01273669>
  • Binh-Minh Bui-Xuan, Michel Habib. Unifying the representation of symmetric crossing families and weakly partitive families. European Conference on Combinatorics, Graph Theory and Applications (Eurocomb'09), 2009, Bordeaux, France. 34, pp.329-333, 2009, <10.1016/j.endm.2009.07.054>. <hal-00555314>
  • Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao. Representation theorems for two set families and applications to combinatorial decompositions. International Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS'08), 2008, Tunisia. pp.532-546, 2008. <hal-00555315>
  • Marc Tedder, Derek Corneil, Michel Habib, Christophe Paul. Simple, Linear-Time Modular Decomposition. ICALP: International Colloquium on Automata, Languages and Programming, Jul 2008, Reykjavik, Iceland. pp.634-645, 2008, Lecture Notes in Computer Science. <lirmm-00324557>
  • Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul. Revisiting Uno and Yagiura's Algorithms. ISAAC'05: 16th Annual Symposium on Algorithms and Computation, 2005, 2005, Lecture Notes in Computer Science. <lirmm-00106037>
  • 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-00108787>
  • 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. <hal-00159601>
  • 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-00108788>
  • J.L. Fouquet, Michel Habib, Fabien De Montgolfier, J.M. Vanherpe. Bimodular Decomposition of Bipartite Graphs. WG'04: 30th International Workshop on Graph-Theoretic Concepts in Computer Science, 2004, pp.117-128, 2004, Lecture Notes in Computer Science. <lirmm-00108942>
  • Michel Habib, Christophe Paul, Jan Arne Telle. A Linear-Time Algorithm for Recognition of Catval Graphs. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic. 2003. <lirmm-00269443>
  • Michel Habib, J.P. Kelly, E. Lebhar, Christophe Paul. On Poset Sandwich Problems. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, 2003, Prague, Czech Republic. 2003. <lirmm-00269577>
  • Michel Habib, Christophe Paul, Laurent Viennot. Partition refinement and graph decomposition. Symposium on Discrete Algorithms (SODA), 1999, Baltimore, United States. pp.1-2, 1999. <inria-00471612>
  • Christophe Fiorio, Michel Habib, Andreas Dietz. Representation of Stereochemistry using Combinatorial Maps. Pierre Hansen; Patrick Fowler; Maolin Zheng. DIMACS Workshop, Mar 1998, Rutgers University, New Brunswick, NJ, Canada. 51, pp.117-128, 2000, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. <http://www.ams.org/mathscinet/search/publdoc.html?pg1=MR&s1=1762928>. <lirmm-01168505>
  • Michel Habib, Christophe Paul, Laurent Viennot. A Synthesis on Partition Refinement: a Usefull Routine for Strings, Graphs, Boolean Matrices and Automata. Michel Morvan AND C. Meinel AND D. Krob. 15th Symposium on Theoretical Aspects of Computer Science (STACS), 1998, Paris, France. Springer Berlin / Heidelberg, 1373, pp.25-38, 1998, Lecture Notes in Computer Science; STACS 98. <10.1007/BFb0028546>. <inria-00471611>

Direction d'ouvrage, Proceedings1 document

  • Helmut Alt, Michel Habib. STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science Berlin, Germany, February 27 – March 1, 2003 Proceedings. France. Lecture Notes in Computer Science (2607), 2003, 978-3-540-00623-7 (Print) 978-3-540-36494-8 (Online). <10.1007/3-540-36494-3>. <lirmm-00269587>

Pré-publication, Document de travail4 documents

  • Finn Völkel, Eric Bapteste, Michel Habib, Philippe Lopez, Chloe Vigliotti. Read networks and k-laminar graphs. 2016. <hal-01282715>
  • Michele Borassi, Pierluigi Crescenzi, Michel Habib. Into the Square - On the Complexity of Quadratic-Time Solvable Problems. 2014. <hal-01274008>
  • Vincent Cohen-Addad, Michel Habib, Fabien De Montgolfier. Algorithmic Aspects of Switch Cographs. 2013. <hal-00921760>
  • Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien De Montgolfier. Algorithmic Aspects of a General Modular Decomposition Theory. 2007. <hal-00111235v2>

Chapitre d'ouvrage2 documents

  • Derek G. Corneil, Michel Habib. Unified View of Graph Searching and LDFS-Based Certifying Algorithms. Encyclopedia of Algorithms, Springer-verlag, 2016, <10.1007/978-3-642-27848-8_685-1>. <hal-01255083>
  • V. Diekert, Michel Habib. STACS'04: Symposium on Theoretical Aspects of Computer Science. V. Diekert, M. Habib. n.d., Springer, p. 658, 2004, Lecture Notes in Computer Science, 3-540-21236-1. <lirmm-00109150>

Ouvrage (y compris édition critique et traduction)1 document

  • Christophe Paul, Michel Habib. WG'09: International Workshop on Theoretic Concepts in Computer Science. 352 p., 2010, Lecture Notes in Computer Science. <lirmm-00533518>