Michel Habib

Ontology type: schema:Person     

Person Info





Publications in SciGraph latest 50 shown

  • 2019-01-19 Maximum Induced Matching Algorithms via Vertex Ordering Characterizations in ALGORITHMICA
  • 2018 Fast Approximation of Centrality and Distances in Hyperbolic Graphs in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2017-11-16 A New Graph Parameter to Measure Linearity in COMBINATORIAL OPTIMIZATION AND APPLICATIONS
  • 2014-10 Computing H-Joins with Application to 2-Modular Decomposition in ALGORITHMICA
  • 2014 On the Solvability of the Six Degrees of Kevin Bacon Game in FUN WITH ALGORITHMS
  • 2014 Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2013-03 The Arboreal Jump Number of an Order in ORDER
  • 2012-04 Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs in ALGORITHMICA
  • 2012 Algorithms for Some H-Join Decompositions in LATIN 2012: THEORETICAL INFORMATICS
  • 2011 On a Conjecture about Compatibility of Multi-states Characters in ALGORITHMS IN BIOINFORMATICS
  • 2011 Unique Perfect Phylogeny Is NP-Hard in COMBINATORIAL PATTERN MATCHING
  • 2009 Polynomial-Time Algorithm for the Leafage of Chordal Graphs in ALGORITHMS - ESA 2009
  • 2009 Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time in COMBINATORIAL PATTERN MATCHING
  • 2008 Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2008 A Representation Theorem for Union-Difference Families and Application in LATIN 2008: THEORETICAL INFORMATICS
  • 2007 Unifying Two Graph Decompositions with Modular Decomposition in ALGORITHMS AND COMPUTATION
  • 2006 Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2005-06-20 A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata in STACS 98
  • 2005-06-12 Bit-vector encoding for partially ordered sets in ORDERS, ALGORITHMS, AND APPLICATIONS
  • 2005 Revisiting T. Uno and M. Yagiura’s Algorithm in ALGORITHMS AND COMPUTATION
  • 2004 Maximal Common Connected Sets of Interval Graphs in COMBINATORIAL PATTERN MATCHING
  • 2004 Bimodular Decomposition of Bipartite Graphs in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2004 A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension in ALGORITHM THEORY - SWAT 2004
  • 2003 A Simple Linear Time LexBFS Cograph Recognition Algorithm in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 2000 Polynomial Time Recognition of Clique-Width ≤ 3 Graphs in LATIN 2000: THEORETICAL INFORMATICS
  • 1998 Diameter Determination on Restricted Graph Families in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1995-06 A linear algorithm to decompose inheritance graphs into modules in ALGORITHMICA
  • 1994-03 Treewidth of cocomparability graphs and a new order-theoretic parameter in ORDER
  • 1994 A new linear algorithm for Modular Decomposition in TREES IN ALGEBRA AND PROGRAMMING — CAAP'94
  • 1993-06 Interval dimension and MacNeille completion in ORDER
  • 1991 Remarks on some concurrency measures in GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE
  • 1989 The Calculation of Invariants for Ordered Sets in ALGORITHMS AND ORDER
  • 1988-06 Computing the bump number is easy in ORDER
  • 1987-06 NP-completeness properties about linear extensions in ORDER
  • 1987 On Some Algorithms for Multiple Inheritance in Object Oriented Programming in ECOOP’ 87 EUROPEAN CONFERENCE ON OBJECT-ORIENTED PROGRAMMING
  • 1985-09 On the greedy dimension of a partial order in ORDER
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.462842.e", 
              "type": "Organization"
            "isCurrent": true, 
            "type": "OrganizationRole"
        "familyName": "Habib", 
        "givenName": "Michel", 
        "id": "sg:person.012600773121.44", 
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:47", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1566.json", 
        "type": "Person"

    Download the RDF metadata as:  json-ld nt turtle xml License info


    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.012600773121.44'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.012600773121.44'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.012600773121.44'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.012600773121.44'


    Preview window. Press ESC to close (or click here)