Michel Habib

ORCID

Publication Activity (10 Years)

Years Active: 1979-2024
Publications (10 Years): 48

Top Venues

CoRR

Discret. Appl. Math.

Theor. Comput. Sci.

SIAM J. Discret. Math.

Publications

Pierre Bergé, Guillaume Ducoffe, Michel Habib
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. Theory Comput. Syst. 68 (1) (2024)
Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs. SIAM J. Discret. Math. 38 (1) (2024)
Jérémie Dusart, Michel Habib, Derek G. Corneil
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications. Order 41 (1) (2024)
Meirun Chen, Michel Habib, Cheng-Kuan Lin
A novel edge connectivity based on edge partition for hypercube and folded hypercube. Appl. Math. Comput. 470 (2024)
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
A new graph parameter to measure linearity. J. Graph Theory 103 (3) (2023)
Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. CoRR (2023)
Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot
Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. SSS (2023)
Meirun Chen, Michel Habib, Cheng-Kuan Lin
Diagnosability for a family of matching composition networks. J. Supercomput. 79 (7) (2023)
Guillaume Ducoffe, Laurent Feuilloley, Michel Habib, François Pitois
Pattern detection in ordered graphs. CoRR (2023)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension. SIAM J. Comput. 51 (5) (2022)
Abderaouf Gacem, Mohammed Haddad, Hamida Seba, Gaetan Berthe, Michel Habib
Guiding Random Walks by Effective Resistance for Effective Node Embedding. ICPRAI (1) (2022)
Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. Theor. Comput. Sci. 923 (2022)
Hong Chen, Meirun Chen, Michel Habib, Cheng-Kuan Lin
Connectivity for some families of composition networks. Theor. Comput. Sci. 922 (2022)
Pierre Bergé, Guillaume Ducoffe, Michel Habib
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. STACS (2022)
Jérémie Dusart, Derek G. Corneil, Michel Habib
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM J. Comput. 50 (3) (2021)
Pierre Bergé, Guillaume Ducoffe, Michel Habib
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs. CoRR (2021)
Laurent Feuilloley, Michel Habib
Classifying grounded intersection graphs via ordered forbidden patterns. CoRR (2021)
Pierre Bergé, Michel Habib
Diameter in linear time for constant-dimension median graphs. LAGOS (2021)
Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou
(α, β)-Modules in Graphs. CoRR (2021)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
Fast Diameter Computation within Split Graphs. Discret. Math. Theor. Comput. Sci. 23 (3) (2021)
Pierre Bergé, Michel Habib
Diameter, radius and all eccentricities in linear time for constant-dimension median graphs. CoRR (2021)
Laurent Feuilloley, Michel Habib
Graph Classes and Forbidden Patterns on Three Vertices. SIAM J. Discret. Math. 35 (1) (2021)
Michel Habib, Lalla Mouatadid
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. Algorithmica 82 (2) (2020)
Michel Habib, Lalla Mouatadid, Mengchuan Zou
Approximating Modular Decomposition Is Hard. CALDAM (2020)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
-minor free graphs and graphs of bounded (distance) VC-dimension. SODA (2020)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. CoRR (2019)
Omid Etesami, Narges Ghareghani, Michel Habib, Mohammad Reza Hooshmandasl, Reza Naserasr, Pouyeh Sharifani
When an optimal dominating set with given constraints exists. Theor. Comput. Sci. 780 (2019)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
Fast Diameter Computation within Split Graphs. CoRR (2019)
Guillaume Ducoffe, Michel Habib, Laurent Viennot
Fast Diameter Computation Within Split Graphs. COCOA (2019)
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
Fast approximation of eccentricities and distances in hyperbolic graphs. J. Graph Algorithms Appl. 23 (2) (2019)
Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. IWOCA (2019)
Laurent Feuilloley, Michel Habib
Graph classes and forbidden patterns on three vertices. CoRR (2018)
Michel Habib, Lhouari Nourine
Representation of lattices via set-colored posets. Discret. Appl. Math. 249 (2018)
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Al-Rasheed
Fast approximation of centrality and distances in hyperbolic graphs. CoRR (2018)
Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
Fast Approximation of Centrality and Distances in Hyperbolic Graphs. COCOA (2018)
Feodor F. Dragan, Michel Habib, Laurent Viennot
Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. CoRR (2018)
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
A New Graph Parameter to Measure Linearity. COCOA (2) (2017)
Michel Habib, Lalla Mouatadid
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. ISAAC (2017)
Michel Habib, Lalla Mouatadid
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. CoRR (2017)
Jérémie Dusart, Michel Habib
A new LBFS-based algorithm for cocomparability graph recognition. Discret. Appl. Math. 216 (2017)
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
Towards A Unified View of Linear Structure on Graph Classes. CoRR (2017)
Jérémie Dusart, Michel Habib, Derek G. Corneil
Maximal cliques structure for cocomparability graphs and applications. CoRR (2016)
Finn Völkel, Eric Bapteste, Michel Habib, Philippe Lopez, Chloe Vigliotti
Read networks and k-laminar graphs. CoRR (2016)
Michele Borassi, Pierluigi Crescenzi, Michel Habib
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. Electron. Notes Theor. Comput. Sci. 322 (2016)
Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier
Algorithmic aspects of switch cographs. Discret. Appl. Math. 200 (2016)
Mourad Baïou, Michel Habib, Lhouari Nourine
Preface. RAIRO Oper. Res. 50 (2) (2016)
Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
A tie-break model for graph search. Discret. Appl. Math. 199 (2016)
Derek G. Corneil, Jérémie Dusart, Michel Habib, Ekkehard Köhler
On the Power of Graph Searching for Cocomparability Graphs. SIAM J. Discret. Math. 30 (1) (2016)
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. Theor. Comput. Sci. 586 (2015)
Derek G. Corneil, Jérémie Dusart, Michel Habib, Fabien de Montgolfier
A tie-break model for graph search. CoRR (2015)
Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. FUN (2014)
Pierre Charbit, Michel Habib, Antoine Mamcarz
Influence of the tie-break rule on the end-vertex problem. Discret. Math. Theor. Comput. Sci. 16 (2) (2014)
Michele Borassi, Pierluigi Crescenzi, Michel Habib
Into the Square - On the Complexity of Quadratic-Time Solvable Problems. CoRR (2014)
Michel Habib, Antoine Mamcarz
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs. WG (2014)
Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
Computing H-Joins with Application to 2-Modular Decomposition. Algorithmica 70 (2) (2014)
Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier
Algorithmic Aspects of Switch Cographs. CoRR (2013)
Ismael Belghiti, Michel Habib
A general method for common intervals. CoRR (2013)
Derek G. Corneil, Barnaby Dalton, Michel Habib
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM J. Comput. 42 (3) (2013)
Michel Habib, Juraj Stacho
Unique perfect phylogeny is intractable. Theor. Comput. Sci. 476 (2013)
Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino
On computing the diameter of real-world undirected graphs. Theor. Comput. Sci. 514 (2013)
Adriana P. Figueiredo, Michel Habib, Sulamita Klein, Jayme Luiz Szwarcfiter
The Arboreal Jump Number of an Order. Order 30 (1) (2013)
Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics
Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. 160 (6) (2012)
Michel Habib, Juraj Stacho
Reduced clique graphs of chordal graphs. Eur. J. Comb. 33 (5) (2012)
Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
Detecting 2-joins faster. J. Discrete Algorithms 17 (2012)
Michel Habib, Thu-Hien To
Constructing a Minimum phylogenetic Network from a Dense triplet Set. J. Bioinform. Comput. Biol. 10 (5) (2012)
Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao
Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33 (5) (2012)
Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica 62 (3-4) (2012)
Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
Algorithms for Some H-Join Decompositions. LATIN (2012)
Arnaud Durand, Michel Habib
Complexity issues for the sandwich homogeneous set problem. Discret. Appl. Math. 159 (7) (2011)
Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
Detecting 2-joins faster CoRR (2011)
Michel Habib, Juraj Stacho
-Hard. CPM (2011)
Michel Habib, Thu-Hien To
On a Conjecture about Compatibility of Multi-states Characters. WABI (2011)
Michel Habib, Thu-Hien To
On a conjecture of compatibility of multi-states characters CoRR (2011)
Michel Habib, Juraj Stacho
Unique perfect phylogeny is NP-hard CoRR (2010)
Michel Habib, Christophe Paul
A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4 (1) (2010)
Michel Habib, Thu-Hien To
Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time CoRR (2010)
Michel Habib, Vincent Limouzy
On some simplicial elimination schemes for chordal graphs. Electron. Notes Discret. Math. 32 (2009)
Michel Habib
Diameter and Center Computations in Networks. CTW (2009)
Michel Habib, Juraj Stacho
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. Electron. Notes Discret. Math. 32 (2009)
Binh-Minh Bui-Xuan, Michel Habib
Unifying the representation of symmetric crossing families and weakly partitive families. Electron. Notes Discret. Math. 34 (2009)
Thu-Hien To, Michel Habib
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. CPM (2009)
Michel Habib, Vincent Limouzy
On some simplicial elimination schemes for chordal graphs CoRR (2009)
Michel Habib, Christophe Paul
A survey on algorithmic aspects of modular decomposition CoRR (2009)
Michel Habib, Juraj Stacho
Polynomial-Time Algorithm for the Leafage of Chordal Graphs. ESA (2009)
Michel Habib, Juraj Stacho
A Decomposition Theorem for Chordal Graphs and its Applications. Electron. Notes Discret. Math. 34 (2009)
Clémence Magnien, Matthieu Latapy, Michel Habib
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs CoRR (2009)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. 157 (9) (2009)
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
Competitive graph searches. Theor. Comput. Sci. 393 (1-3) (2008)
Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discret. Math. 22 (4) (2008)
Binh-Minh Bui-Xuan, Michel Habib
A Representation Theorem for Union-Difference Families and Application. LATIN (2008)
Clémence Magnien, Matthieu Latapy, Michel Habib
Fast computation of empirically tight bounds for the diameter of massive graphs. ACM J. Exp. Algorithmics 13 (2008)
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
A note on computing set overlap classes. Inf. Process. Lett. 108 (4) (2008)
Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. Electron. Notes Discret. Math. 31 (2008)
Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. SCG (2008)
Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) (2008)
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
Unifying Two Graph Decompositions with Modular Decomposition. ISAAC (2007)
Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
Simple, linear-time modular decomposition CoRR (2007)
Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul
Can transitive orientation make sandwich problems easier? Discret. Math. 307 (16) (2007)
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
A Note On Computing Set Overlap Classes CoRR (2007)
Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter
On transitive orientations with restricted covering graphs. Inf. Process. Lett. 101 (3) (2007)

Michel Habib.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michel Habib