☰

Michel Habib - Publications

Affiliations: 
Computer Science Université Paris Diderot - Paris 7, Paris, Île-de-France, France 
Tree Info Similar researchers PubMed Report error

59 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Chepoi V, Dragan FF, Habib M, Vaxès Y, Alrasheed H. Fast approximation of eccentricities and distances in hyperbolic graphs Journal of Graph Algorithms and Applications. 23: 393-433. DOI: 10.7155/Jgaa.00496  0.533
2019 Etesami O, Ghareghani N, Habib M, Hooshmandasl MR, Naserasr R, Sharifani P. When an optimal dominating set with given constraints exists Theoretical Computer Science. 780: 54-65. DOI: 10.1016/J.Tcs.2019.02.012  0.496
2019 Habib M, Mouatadid L. Maximum Induced Matching Algorithms via Vertex Ordering Characterizations Algorithmica. 82: 1-19. DOI: 10.1007/S00453-018-00538-5  0.551
2018 Habib M, Nourine L. Representation of lattices via set-colored posets Discrete Applied Mathematics. 249: 64-73. DOI: 10.1016/J.Dam.2018.03.068  0.327
2016 Corneil DG, Dusart J, Habib M, Köhler E. On the power of graph searching for cocomparability graphs Siam Journal On Discrete Mathematics. 30: 569-591. DOI: 10.1137/15M1012396  0.501
2016 Borassi M, Crescenzi P, Habib M. Into the Square Electronic Notes in Theoretical Computer Science. 322: 51-67. DOI: 10.1016/J.Entcs.2016.03.005  0.554
2016 Cohen-Addad V, Habib M, De Montgolfier F. Algorithmic aspects of switch cographs Discrete Applied Mathematics. 200: 23-42. DOI: 10.1016/J.Dam.2015.07.008  0.557
2015 Borassi M, Crescenzi P, Habib M, Kosters WA, Marino A, Takes FW. Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games Theoretical Computer Science. 586: 59-80. DOI: 10.1016/J.Tcs.2015.02.033  0.455
2014 Dusart J, Habib M. A new LBFS-based algorithm for cocomparability graph recognition Discrete Applied Mathematics. DOI: 10.1016/J.Dam.2015.07.016  0.582
2014 Corneil DG, Dusart J, Habib M, Mamcarz A, de Montgolfier F. A tie-break model for graph search Discrete Applied Mathematics. DOI: 10.1016/J.Dam.2015.06.011  0.47
2014 Habib M, Mamcarz A, Montgolfier F. Computing H-Joins with Application to 2-Modular Decomposition Algorithmica. 70: 245-266. DOI: 10.1007/S00453-013-9820-1  0.518
2013 Corneil DG, Dalton B, Habib M. Ldfs-based certifying algorithm for the minimum path cover problem on cocomparability graphs Siam Journal On Computing. 42: 792-807. DOI: 10.1137/11083856X  0.579
2013 Habib M, Stacho J. Unique perfect phylogeny is intractable Theoretical Computer Science. 476: 47-66. DOI: 10.1016/J.Tcs.2012.12.048  0.355
2013 Crescenzi P, Grossi R, Habib M, Lanzi L, Marino A. On computing the diameter of real-world undirected graphs Theoretical Computer Science. 514: 84-95. DOI: 10.1016/J.Tcs.2012.09.018  0.498
2013 Figueiredo AP, Habib M, Klein S, Szwarcfiter JL. The Arboreal Jump Number of an Order Order. 30: 339-350. DOI: 10.1007/S11083-012-9246-4  0.385
2012 Habib M, To TH. Constructing a minimum phylogenetic network from a dense triplet set. Journal of Bioinformatics and Computational Biology. 10: 1250013. PMID 22849368 DOI: 10.1142/S0219720012500138  0.327
2012 Charbit P, Habib M, Trotignon N, VušKović K. Detecting 2-joins faster Journal of Discrete Algorithms. 17: 60-66. DOI: 10.1016/J.Jda.2012.11.003  0.537
2012 Bui-Xuan B, Habib M, Rao M. Tree-representation of set families and applications to combinatorial decompositions European Journal of Combinatorics. 33: 688-711. DOI: 10.1016/J.Ejc.2011.09.032  0.343
2012 Habib M, Stacho J. Reduced clique graphs of chordal graphs European Journal of Combinatorics. 33: 712-735. DOI: 10.1016/J.Ejc.2011.09.031  0.544
2012 Corneil DG, Habib M, Lanlignel JM, Reed B, Rotics U. Polynomial-time recognition of clique-width ≤3 graphs Discrete Applied Mathematics. 160: 834-865. DOI: 10.1016/J.Dam.2011.03.020  0.567
2011 Durand A, Habib M. Complexity issues for the sandwich homogeneous set problem Discrete Applied Mathematics. 159: 574-580. DOI: 10.1016/J.Dam.2010.08.008  0.515
2010 Habib M, Paul C. A survey of the algorithmic aspects of modular decomposition Computer Science Review. 4: 41-59. DOI: 10.1016/J.Cosrev.2010.01.001  0.516
2010 Chepoi V, Dragan FF, Estellon B, Habib M, Vaxès Y, Xiang Y. Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs Algorithmica (New York). 1-20. DOI: 10.1007/S00453-010-9478-X  0.436
2009 Magnien C, Latapy M, Habib M. Fast computation of empirically tight bounds for the diameter of massive graphs Acm Journal of Experimental Algorithms. 13: 10. DOI: 10.1145/1412228.1455266  0.479
2009 Habib M, Stacho J. A Decomposition Theorem for Chordal Graphs and its Applications Electronic Notes in Discrete Mathematics. 34: 561-565. DOI: 10.1016/J.Endm.2009.07.093  0.548
2009 Bui-Xuan B, Habib M. Unifying the representation of symmetric crossing families and weakly partitive families Electronic Notes in Discrete Mathematics. 34: 329-333. DOI: 10.1016/J.Endm.2009.07.054  0.367
2009 Habib M, Limouzy V. On some simplicial elimination schemes for chordal graphs Electronic Notes in Discrete Mathematics. 32: 125-132. DOI: 10.1016/J.Endm.2009.02.017  0.509
2009 Habib M, Stacho J. Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage Electronic Notes in Discrete Mathematics. 32: 99-108. DOI: 10.1016/J.Endm.2009.02.014  0.521
2009 Bui-Xuan BM, Habib M, Limouzy V, Montgolfier Fd. Algorithmic aspects of a general modular decomposition theory Discrete Applied Mathematics. 157: 1993-2009. DOI: 10.1016/J.Dam.2008.11.001  0.554
2008 Bretscher A, Corneil D, Habib M, Paul C. A Simple linear time LexBFS cograph recognition algorithm Siam Journal On Discrete Mathematics. 22: 1277-1296. DOI: 10.1137/060664690  0.446
2008 Bui-Xuan B, Habib M, Paul C. Competitive graph searches Theoretical Computer Science. 393: 72-80. DOI: 10.1016/J.Tcs.2007.10.048  0.546
2008 Chepoi V, Dragan FF, Estellon B, Habib M, Vaxès Y. Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs Electronic Notes in Discrete Mathematics. 31: 231-234. DOI: 10.1016/J.Endm.2008.06.046  0.503
2007 Dobson MP, Gutierrez M, Habib M, Szwarcfiter JL. On transitive orientations with restricted covering graphs Information Processing Letters. 101: 119-125. DOI: 10.1016/J.Ipl.2006.08.008  0.553
2007 Habib M, Kelly D, Lebhar E, Paul C. Can transitive orientation make sandwich problems easier Discrete Mathematics. 307: 2030-2041. DOI: 10.1016/J.Disc.2005.12.048  0.495
2006 Bui-Xuan B, Habib M, Limouzy V, Montgolfier Fd. On Modular Decomposition Concepts: the case for Homogeneous Relations Electronic Notes in Discrete Mathematics. 27: 13-14. DOI: 10.1016/J.Endm.2006.08.033  0.559
2005 Habib M, Nourine L. The number of Moore families on n=6 Discrete Mathematics. 294: 291-296. DOI: 10.1016/J.Disc.2004.11.010  0.315
2005 Habib M, Paul C. A simple linear time algorithm for cograph recognition Discrete Applied Mathematics. 145: 183-197. DOI: 10.1016/J.Dam.2004.01.011  0.514
2004 Habib M, Nourine L, Raynaud O, Thierry E. Computational aspects of the 2-dimension of partially ordered sets Theoretical Computer Science. 312: 401-431. DOI: 10.1016/J.Tcs.2003.10.029  0.387
2003 Habib M, Lebhar E, Paul C. A note on finding all homogeneous set sandwiches Information Processing Letters. 87: 147-151. DOI: 10.1016/S0020-0190(03)00265-5  0.497
2001 Damiand G, Habib M, Paul C. A simple paradigm for graph recognition: application to cographs and distance hereditary graphs Theoretical Computer Science. 263: 99-111. DOI: 10.1016/S0304-3975(00)00234-6  0.557
2001 Corneil DG, Dragan FF, Habib M, Paul C. Diameter determination on restricted graph families Discrete Applied Mathematics. 113: 143-166. DOI: 10.1016/S0166-218X(00)00281-X  0.577
2001 Habib M, Medina R, Nourine L, Steiner G. Efficient algorithms on distributive lattices Discrete Applied Mathematics. 110: 169-187. DOI: 10.1016/S0166-218X(00)00258-4  0.415
2000 Habib M, McConnell R, Paul C, Viennot L. Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing Theoretical Computer Science. 234: 59-84. DOI: 10.1016/S0304-3975(97)00241-7  0.572
1999 Habib M, Paul C, Viennot L. Partition Refinement Techniques: An Interesting Algorithmic Tool Kit International Journal of Foundations of Computer Science. 10: 147-170. DOI: 10.1142/S0129054199000125  0.408
1997 Habib M, Nourine L, Steiner G. Gray Codes for the Ideals of Interval Orders Journal of Algorithms. 25: 52-66. DOI: 10.1006/Jagm.1997.0863  0.455
1996 Habib M, Nourine L. Tree structure for distributive lattices and its applications Theoretical Computer Science. 165: 391-405. DOI: 10.1016/0304-3975(95)00232-4  0.387
1995 Habib M, Huchard M, Spinrad JP. A linear algorithm to decompose inheritance graphs into modules Algorithmica. 13: 573-591. DOI: 10.1007/Bf01189070  0.525
1994 Habib M, Möhring RH. Treewidth of cocomparability graphs and a new order-theoretic parameter Order. 11: 47-60. DOI: 10.1007/Bf01462229  0.503
1993 Habib M, Morvan M, Rampon J-. On the calculation of transitive reduction-closure of orders Discrete Mathematics. 111: 289-303. DOI: 10.1016/0012-365X(93)90164-O  0.548
1993 Habib M, Morvan M, Pouzet M, Rampon J. Interval dimension and MacNeille completion Order. 10: 147-151. DOI: 10.1007/Bf01111299  0.309
1991 Habib M, Kelly D, Mohring RH. Interval dimension is a comparability invariant Discrete Mathematics. 87: 211-229. DOI: 10.1016/0012-365X(91)90010-Y  0.388
1985 Habib M, Jegou R. N-free posets as generalizations of series-parallel posets Discrete Applied Mathematics. 12: 279-291. DOI: 10.1016/0166-218X(85)90030-7  0.374
1985 Habib M, Maurer MC. 1-Intersecting families Discrete Mathematics. 53: 91-101. DOI: 10.1016/0012-365X(85)90132-3  0.388
1985 Bouchitte V, Habib M, Jegou R. On the Greedy Dimension of a Partial Order Order. 1: 219-224. DOI: 10.1007/Bf00383597  0.365
1984 Bermond J, Fouquet J, Habib M, Péroche B. On linear k-arboricity Discrete Mathematics. 52: 123-132. DOI: 10.1016/0012-365X(84)90075-X  0.414
1982 Habib M, Peroche B. Some problems about linear arboricity Discrete Mathematics. 41: 219-220. DOI: 10.1016/0012-365X(82)90209-6  0.425
1980 Habib M, Peroche B. A Construction Method For Minimally K-Edge-Connected Graphs Annals of Discrete Mathematics. 9: 199-204. DOI: 10.1016/S0167-5060(08)70062-1  0.483
1980 Chein M, Habib M. The Jump Number of Dags and Posets: An Introduction Annals of Discrete Mathematics. 9: 189-194. DOI: 10.1016/S0167-5060(08)70060-8  0.488
1979 Habib M, Maurer MC. On the X-join decomposition for undirected graphs Discrete Applied Mathematics. 1: 201-207. DOI: 10.1016/0166-218X(79)90043-X  0.545
Show low-probability matches.