M. Habib

发表

Probabilistic methods for algorithmic discrete mathematics

M. Habib, 1998 .

Chordal Graphs and Their Clique Graphs

Michel Habib, Christophe Paul, Philippe Galinier, 1995, WG.

Monotonic conflict resolution mechanisms for inheritance

Marie-Laure Mugnier, Roland Ducournau, Michel Habib, 1992, OOPSLA.

A linear algorithm to decompose inheritance graphs into modules

Jeremy P. Spinrad, Michel Habib, Marianne Huchard, 1995, Algorithmica.

The Calculation of Invariants for Ordered Sets

M. Habib, V. Bouchitté, 1989 .

Treewidth of cocomparability graphs and a new order-theoretic parameter

M. Habib, R. Möhring, 1994 .

Proposal for a Monotonic Multiple Inheritance Linearization

Marie-Laure Mugnier, Roland Ducournau, Michel Habib, 1994, OOPSLA.

A survey of the algorithmic aspects of modular decomposition

Michel Habib, Christophe Paul, M. Habib, 2009, Comput. Sci. Rev..

A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

Michel Habib, Christophe Paul, Guillaume Damiand, 2001, Theor. Comput. Sci..

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs

Feodor F. Dragan, Victor Chepoi, Michel Habib, 2008, Electron. Notes Discret. Math..

A simple linear time algorithm for cograph recognition

Michel Habib, Christophe Paul, M. Habib, 2005, Discret. Appl. Math..

D S ] 8 O ct 2 01 9 Fast Diameter Computation within Split Graphs

M. Habib, L. Viennot, G. Ducoffe, 2019 .

Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Laurent Viennot, Michel Habib, Christophe Paul, 2000, Theor. Comput. Sci..

Common Connected Components of Interval Graphs

M. Habib, C. Paul, M. Raffinot, 2016 .

Unified View of Graph Searching and LDFS-Based Certifying Algorithms

M. Habib, D. Corneil, 2016, Encyclopedia of Algorithms.

Partition refinement and graph decomposition

M. Habib, C. Paul, L. Viennot, 1999, SODA 1999.

Notes on diameters , centers , and approximating trees of δ-hyperbolic geodesic spaces and graphs

M. Habib, F. Dragan, V. Chepoi, 2008 .

Computing the bump number is easy

Rolf H. Möhring, Michel Habib, George Steiner, 1988 .

A new tractable combinatorial decomposition

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2007 .

Polynomial Time Recognition of Clique-Width ≤ 3 Graphs

B. Reed, M. Habib, D. Corneil, 2000 .

A representation theorem for lattices via set-colored posets

M. Habib, Lhouari Nourine, 2015 .

Constructing a Minimum-Level Phylogenetic Network from a Dense Triplet Set in Polynomial Time

M. Habib, Thu-Hien To, 2011, 1103.2266.

On the calculation of transitive reduction - closure of orders

Jean-Xavier Rampon, Michel Habib, Michel Morvan, 1993, Discret. Math..

N-FREE POSETS AS GENERALIZATIONS OF

M. Habib, R. Jégou, 1985 .

Representation theorems for two set families and applications to combinatorial decompositions

Michel Habib, Michaël Rao, Binh-Minh Bui-Xuan, 2008 .

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit

Laurent Viennot, Michel Habib, Christophe Paul, 1999, Int. J. Found. Comput. Sci..

Se p 20 06 A new tractable combinatorial decomposition

M. Habib, F. D. Montgolfier, V. Limouzy, 2006 .

A General Algorithmic Scheme for Combinatorial Decompositions with Application to Modular Decompositions of Hypergraphs

M. Habib, Lalla Mouatadid, Fabien de Montgolfier, 2022, Theoretical Computer Science.

(α, β)-Modules in Graphs

Michel Habib, Eric Sopena, Lalla Mouatadid, 2021, ArXiv.

Simple, linear-time modular decomposition

M. Habib, D. Corneil, C. Paul, 2007, ArXiv.

D M ] 2 1 O ct 2 00 7 Simple , Linear-time Modular Decomposition ∗ ( extended abstract )

M. Habib, D. Corneil, C. Paul, 2007 .

CSP techniques using partial orderson domain valuesAmit

M. Habib, C. Capelle, Bellicha, 1994 .

Fast Diameter Computation within Split Graphs

M. Habib, L. Viennot, G. Ducoffe, 2019, COCOA.

Graphs, networks and algorithms

Diego Perino, Laurent Viennot, Pierre Fraigniaud, 2007 .

Divide and Conquer Revisited. Application to Graph Algorithms

M. Habib, C. Paul, Binh-Minh Bui-Xuan, 2020 .

A Linear-Time Algorithm for Recognition of Catval Graphs

M. Habib, C. Paul, J. A. Telle, 2003 .

Identifying Common Connected Components of Graphs

M. Habib, C. Paul, M. Raffinot, 2020 .

On Poset Sandwich Problems

M. Habib, C. Paul, David Kelly, 2003 .

New Results - Understanding graph representations

Jean-Sébastien Sereni, Laurent Viennot, Roberto Grossi, 2013 .

Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

Michel Habib, Jérémie Dusart, Derek G. Corneil, 2021, SIAM J. Comput..

Unified View of Graph Searching and LDFS-Based Certifying Algorithms

Michel Habib, Derek G. Corneil, M. Habib, 2016, Encyclopedia of Algorithms.

Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)

Udi Rotics, Michel Habib, Jean-Marc Lanlignel, 2000, Latin American Symposium on Theoretical Informatics.

Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension

M. Habib, L. Viennot, G. Ducoffe, 2022, SIAM J. Comput..

Mémoire d’habilitation à diriger des recherches Studying Graphs: Structure via Rank-Width, and Listing of Minimal Dominating Sets

M. Habib, B. Courcelle, F. Fomin, 2016 .

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension pdf

Laurent Viennot, Michel Habib, Guillaume Ducoffe, 2019, SODA.

A Simple Linear Time LexBFS Cograph Recognition Algorithm

Michel Habib, Christophe Paul, Derek G. Corneil, 2003, WG.

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations

Michel Habib, Christophe Paul, Derek G. Corneil, 2008, ICALP.

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension

Michel Habib, Christophe Paul, Fabien de Montgolfier, 2004, SWAT.

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit

M. Habib, C. Paul, L. Viennot, 1999, Int. J. Found. Comput. Sci..

A New Linear Algorithm for Modular Decomposition

Michel Habib, Alain Cournier, M. Habib, 1994, CAAP.

On the X-join decomposition for undirected graphs

Michel Habib, M. C. Maurer, M. Habib, 1979, Discret. Appl. Math..

On some complexity properties of N-free posets and posets with bounded decomposition diameter

Rolf H. Möhring, Michel Habib, M. Habib, 1987, Discret. Math..

Maximal Common Connected Sets of Interval Graphs

Mathieu Raffinot, Michel Habib, Christophe Paul, 2004, CPM.

Graph classes and forbidden patterns on three vertices pdf

Michel Habib, Laurent Feuilloley, M. Habib, 2018, SIAM J. Discret. Math..

Partitive hypergraphs

Michel Habib, M. Chein, M. C. Maurer, 1981, Discret. Math..

Maximum Induced Matching Algorithms via Vertex Ordering Characterizations pdf

Michel Habib, Lalla Mouatadid, M. Habib, 2017, Algorithmica.

Towards A Unified View of Linear Structure on Graph Classes pdf

Michel Habib, Reza Naserasr, Pierre Charbit, 2017, ArXiv.

Maximal cliques structure for cocomparability graphs and applications pdf

Michel Habib, Jérémie Dusart, Derek G. Corneil, 2016, ArXiv.

A tie-break model for graph search

Michel Habib, Jérémie Dusart, Fabien de Montgolfier, 2015, Discret. Appl. Math..

Reduced clique graphs of chordal graphs

Michel Habib, Juraj Stacho, M. Habib, 2012, Eur. J. Comb..

Unique Perfect Phylogeny Is NP-Hard pdf

Michel Habib, Juraj Stacho, M. Habib, 2010, CPM.

Algorithmic aspects of a general modular decomposition theory

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2006, Discret. Appl. Math..

Into the Square: On the Complexity of Some Quadratic-time Solvable Problems

Michel Habib, Pierluigi Crescenzi, Michele Borassi, 2016, ICTCS.

Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games

Andrea Marino, Walter A. Kosters, Michel Habib, 2015, Theor. Comput. Sci..

Into the Square - On the Complexity of Quadratic-Time Solvable Problems pdf

Michel Habib, Pierluigi Crescenzi, Michele Borassi, 2014, ArXiv.

On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method

Andrea Marino, Walter A. Kosters, Michel Habib, 2014, FUN.

Unique perfect phylogeny is intractable

Michel Habib, Juraj Stacho, M. Habib, 2013, Theor. Comput. Sci..

Polynomial-time recognition of clique-width ≤3 graphs

Udi Rotics, Michel Habib, Jean-Marc Lanlignel, 2012, Discret. Appl. Math..

A Decomposition Theorem for Chordal Graphs and its Applications

Michel Habib, Juraj Stacho, M. Habib, 2009, Electron. Notes Discret. Math..

Polynomial-Time Algorithm for the Leafage of Chordal Graphs

Michel Habib, Juraj Stacho, M. Habib, 2009, ESA.

Classifying grounded intersection graphs via ordered forbidden patterns pdf

Michel Habib, Laurent Feuilloley, M. Habib, 2021, ArXiv.

A new LBFS-based algorithm for cocomparability graph recognition

Michel Habib, Jérémie Dusart, M. Habib, 2017, Discret. Appl. Math..

Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs

M. Habib, G. Ducoffe, Pierre Berg'e, 2021, STACS.

Diameter, radius and all eccentricities in linear time for constant-dimension median graphs pdf

Michel Habib, Pierre Berg'e, M. Habib, 2021, ArXiv.

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension

M. Habib, L. Viennot, G. Ducoffe, 2019, SODA.

Diameter in linear time for constant-dimension median graphs

Michel Habib, Pierre Bergé, M. Habib, 2021, LAGOS.

Diameter determination on restricted graph families

Feodor F. Dragan, Michel Habib, Christophe Paul, 1998, Discret. Appl. Math..

Fast approximation of eccentricities and distances in hyperbolic graphs

Feodor F. Dragan, Victor Chepoi, Michel Habib, 2019, J. Graph Algorithms Appl..

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates pdf

Laurent Viennot, Feodor F. Dragan, Michel Habib, 2018, ArXiv.

Maximum Induced Matching Algorithms via Vertex Ordering Characterizations

M. Habib, Lalla Mouatadid, 2019, Algorithmica.

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs

Feodor F. Dragan, Victor Chepoi, Michel Habib, 2008, SCG '08.

On computing the diameter of real-world undirected graphs

Roberto Grossi, Andrea Marino, Michel Habib, 2013, Theor. Comput. Sci..

Fast computation of empirically tight bounds for the diameter of massive graphs

Matthieu Latapy, Michel Habib, Clémence Magnien, 2009, JEAL.

LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

Michel Habib, Derek G. Corneil, Barnaby Dalton, 2013, SIAM J. Comput..

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor

M. Habib, L. Viennot, M. Rabie, 2023, ArXiv.

Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time

Michel Habib, Thu-Hien To, M. Habib, 2009, CPM.

Tree Structure for Distributive Lattices and its Applications

Lhouari Nourine, Michel Habib, M. Habib, 1996, Theor. Comput. Sci..

Representation of lattices via set-colored posets

Lhouari Nourine, Michel Habib, M. Habib, 2018, Discret. Appl. Math..

On a Conjecture about Compatibility of Multi-states Characters pdf

Michel Habib, Thu-Hien To, M. Habib, 2011, WABI.

A Simple Linear-Time Modular Decomposition Algorithm for Modular Decomposition

Michel Habib, Christophe Paul, Fabien de Montgolfier, 2003 .

Partitive hypergraphs

M. Habib, M. C. Maurer, Michel Chein, 1981, Discret. Math..

On transitive orientations with restricted covering graphs

Jayme Luiz Szwarcfiter, Michel Habib, Maria Patricia Dobson, 2007, Inf. Process. Lett..

Gray Codes for the Ideals of Interval Orders

Lhouari Nourine, Michel Habib, George Steiner, 1997, J. Algorithms.

Remarks on Some Concurrency Measures

Jean-Xavier Rampon, Michel Habib, Michel Morvan, 1990, WG.

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms pdf

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2006, WG.

Algorithmic Aspects of a Novel Modular Decomposition Theory pdf

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2006, ArXiv.

A new graph parameter to measure linearity

Michel Habib, Reza Naserasr, Pierre Charbit, 2017, COCOA.

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit

M. Habib, C. Paul, L. Viennot, 1999, Int. J. Found. Comput. Sci..

A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata

Laurent Viennot, Michel Habib, Christophe Paul, 1998, STACS.

On the Power of Graph Searching for Cocomparability Graphs

Ekkehard Köhler, Michel Habib, Jérémie Dusart, 2016, SIAM J. Discret. Math..

Unifying Two Graph Decompositions with Modular Decomposition

Michel Habib, Fabien de Montgolfier, Binh-Minh Bui-Xuan, 2006, ISAAC.

Can transitive orientation make sandwich problems easier?

Michel Habib, Christophe Paul, David Kelly, 2007, Discret. Math..

Influence of the tie-break rule on the end-vertex problem

M. Habib, Antoine Mamcarz, Pierre Charbit, 2014, Discret. Math. Theor. Comput. Sci..

Pattern detection in ordered graphs

M. Habib, G. Ducoffe, Laurent Feuilloley, 2023, arXiv.org.

Topology-based stereochemistry representation

M. Habib, C. Fiorio, A. Dietz, 1998 .

Efficient algorithms on distributive lattices

Lhouari Nourine, Michel Habib, Raoul Medina, 2001, Discret. Appl. Math..

Revisiting T. Uno and M. Yagiura's Algorithm

Michel Habib, Christophe Paul, Binh-Minh Bui-Xuan, 2005, ISAAC.

Fast approximation of centrality and distances in hyperbolic graphs

V. Chepoi, F. F. Dragan, M. Habib, 2018, COCOA.

Computational aspects of the 2-dimension of partially ordered sets

Lhouari Nourine, Michel Habib, Eric Thierry, 2004, Theor. Comput. Sci..

Encoding of Multiple Inheritance Hierarchies and Partial Orders

Lhouari Nourine, Michel Habib, Olivier Raynaud, 1999, Comput. Intell..

When an optimal dominating set with given constraints exists

Omid Etesami, Michel Habib, Reza Naserasr, 2019, Theor. Comput. Sci..