The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Michel Habib" ( http://dblp.L3S.de/Authors/Michel_Habib )

URL (Homepage):  https://www.irif.fr/~habib/  Author page on DBLP  Author page in RDF  Community of Michel Habib in ASPL-2

Publication years (Num. hits)
1979-1992 (15) 1993-1999 (16) 2000-2004 (16) 2005-2008 (22) 2009-2010 (15) 2011-2013 (18) 2014-2016 (15) 2017-2019 (14)
Publication types (Num. hits)
article(90) incollection(1) inproceedings(37) proceedings(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 33 occurrences of 30 keywords

Results
Found 132 publication records. Showing 131 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Omid Etesami, Narges Ghareghani, Michel Habib, Mohammad Reza Hooshmandasl, Reza Naserasr, Pouyeh Sharifani When an optimal dominating set with given constraints exists. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Guillaume Ducoffe, Michel Habib, Laurent Viennot Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Guillaume Ducoffe, Michel Habib, Laurent Viennot Fast Diameter Computation within Split Graphs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. Search on Bibsonomy IWOCA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Feodor F. Dragan, Michel Habib, Laurent Viennot Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Al-Rasheed Fast approximation of centrality and distances in hyperbolic graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Laurent Feuilloley, Michel Habib Graph classes and forbidden patterns on three vertices. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Michel Habib, Lhouari Nourine Representation of lattices via set-colored posets. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed Fast Approximation of Centrality and Distances in Hyperbolic Graphs. Search on Bibsonomy COCOA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr Towards A Unified View of Linear Structure on Graph Classes. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Michel Habib, Lalla Mouatadid Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Jérémie Dusart, Michel Habib A new LBFS-based algorithm for cocomparability graph recognition. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michel Habib, Lalla Mouatadid Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. Search on Bibsonomy ISAAC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr A New Graph Parameter to Measure Linearity. Search on Bibsonomy COCOA (2) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Derek G. Corneil, Michel Habib Unified View of Graph Searching and LDFS-Based Certifying Algorithms. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michele Borassi, Pierluigi Crescenzi, Michel Habib Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mourad Baïou, Michel Habib, Lhouari Nourine Preface. Search on Bibsonomy RAIRO - Operations Research The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Derek G. Corneil, Jérémie Dusart, Michel Habib, Ekkehard Köhler On the Power of Graph Searching for Cocomparability Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Finn Völkel, Eric Bapteste, Michel Habib, Philippe Lopez, Chloe Vigliotti Read networks and k-laminar graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Jérémie Dusart, Michel Habib, Derek G. Corneil Maximal cliques structure for cocomparability graphs and applications. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier A tie-break model for graph search. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier Algorithmic aspects of switch cographs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michele 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. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Derek G. Corneil, Jérémie Dusart, Michel Habib, Fabien de Montgolfier A tie-break model for graph search. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Pierre Charbit, Michel Habib, Antoine Mamcarz Influence of the tie-break rule on the end-vertex problem. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2014 DBLP  BibTeX  RDF
1Michel Habib, Antoine Mamcarz, Fabien de Montgolfier Computing H-Joins with Application to 2-Modular Decomposition. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michele Borassi, Pierluigi Crescenzi, Michel Habib Into the Square - On the Complexity of Quadratic-Time Solvable Problems. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Michel Habib, Antoine Mamcarz Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs. Search on Bibsonomy WG The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michele 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. Search on Bibsonomy FUN The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Adriana P. Figueiredo, Michel Habib, Sulamita Klein, Jayme Luiz Szwarcfiter The Arboreal Jump Number of an Order. Search on Bibsonomy Order The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino On computing the diameter of real-world undirected graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michel Habib, Juraj Stacho Unique perfect phylogeny is intractable. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ismael Belghiti, Michel Habib A general method for common intervals. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier Algorithmic Aspects of Switch Cographs. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Derek G. Corneil, Barnaby Dalton, Michel Habib LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michel Habib, Juraj Stacho Reduced clique graphs of chordal graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao Tree-representation of set families and applications to combinatorial decompositions. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic Detecting 2-joins faster. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michel Habib, Thu-Hien To Constructing a Minimum phylogenetic Network from a Dense triplet Set. Search on Bibsonomy J. Bioinformatics and Computational Biology The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics Polynomial-time recognition of clique-width ≤3 graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michel Habib, Antoine Mamcarz, Fabien de Montgolfier Algorithms for Some H-Join Decompositions. Search on Bibsonomy LATIN The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic Detecting 2-joins faster Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Michel Habib, Thu-Hien To On a conjecture of compatibility of multi-states characters Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Arnaud Durand 0001, Michel Habib Complexity issues for the sandwich homogeneous set problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michel Habib, Juraj Stacho Unique Perfect Phylogeny Is NP-Hard. Search on Bibsonomy CPM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michel Habib, Thu-Hien To On a Conjecture about Compatibility of Multi-states Characters. Search on Bibsonomy WABI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michel Habib, Christophe Paul A survey of the algorithmic aspects of modular decomposition. Search on Bibsonomy Computer Science Review The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michel Habib, Thu-Hien To Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Michel Habib, Juraj Stacho Unique perfect phylogeny is NP-hard Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Christophe Paul, Michel Habib (eds.) Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers Search on Bibsonomy WG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michel Habib, Juraj Stacho A Decomposition Theorem for Chordal Graphs and its Applications. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib Unifying the representation of symmetric crossing families and weakly partitive families. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michel Habib, Vincent Limouzy On some simplicial elimination schemes for chordal graphs. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michel Habib, Juraj Stacho Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michel Habib, Christophe Paul A survey on algorithmic aspects of modular decomposition Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Clémence Magnien, Matthieu Latapy, Michel Habib Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Michel Habib, Vincent Limouzy On some simplicial elimination schemes for chordal graphs Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier Algorithmic aspects of a general modular decomposition theory. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michel Habib Diameter and Center Computations in Networks. Search on Bibsonomy CTW The full citation details ... 2009 DBLP  BibTeX  RDF
1Thu-Hien To, Michel Habib Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. Search on Bibsonomy CPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michel Habib, Juraj Stacho Polynomial-Time Algorithm for the Leafage of Chordal Graphs. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Victor 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. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao A note on computing set overlap classes. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul A Simple Linear Time LexBFS Cograph Recognition Algorithm. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul Competitive graph searches. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Clémence Magnien, Matthieu Latapy, Michel Habib Fast computation of empirically tight bounds for the diameter of massive graphs. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Diameter bounds, graph diameter
1Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2008 DBLP  DOI  BibTeX  RDF delta-hyperbolic space, diameter, center, radius
1Binh-Minh Bui-Xuan, Michel Habib A Representation Theorem for Union-Difference Families and Application. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter On transitive orientations with restricted covering graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao A Note On Computing Set Overlap Classes Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul Simple, linear-time modular decomposition Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul Can transitive orientation make sandwich problems easier? Search on Bibsonomy Discrete Mathematics The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier Unifying Two Graph Decompositions with Modular Decomposition. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier On Modular Decomposition Concepts: the case for Homogeneous Relations. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Michel Habib Foreword. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier Homogeneity vs. Adjacency: generalising some graph decomposition algorithms Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier Unifying two Graph Decompositions with Modular Decomposition Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier Algorithmic Aspects of a Novel Modular Decomposition Theory Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michel Habib, Christophe Paul A simple linear time algorithm for cograph recognition. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michel Habib, Lhouari Nourine The number of Moore families on n=6. Search on Bibsonomy Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul Revisiting T. Uno and M. Yagiura's Algorithm . Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Michel Habib, Lhouari Nourine, Olivier Raynaud, Eric Thierry Computational aspects of the 2-dimension of partially ordered sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michel Habib, Christophe Paul, Mathieu Raffinot Maximal Common Connected Sets of Interval Graphs. Search on Bibsonomy CPM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe Bimodular Decomposition of Bipartite Graphs. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Michel Habib (eds.) STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michel Habib, Fabien de Montgolfier, Christophe Paul A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. Search on Bibsonomy SWAT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michel Habib, Emmanuelle Lebhar, Christophe Paul A note on finding all homogeneous set sandwiches. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul A Simple Linear Time LexBFS Cograph Recognition Algorithm. Search on Bibsonomy WG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Helmut Alt, Michel Habib (eds.) STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Christian Capelle, Michel Habib, Fabien de Montgolfier Graph Decompositions andFactorizing Permutations. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2002 DBLP  BibTeX  RDF
1Noël Nguyen, Ludovic Jankowski, Michel Habib The perception of stop consonant sequences in dyslexic and normal children. Search on Bibsonomy INTERSPEECH The full citation details ... 2002 DBLP  BibTeX  RDF
1Michel Habib, Christophe Paul, Laurent Viennot Linear time recognition of P4-indifference graphs. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2001 DBLP  BibTeX  RDF
1Guillaume Damiand, Michel Habib, Christophe Paul A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul Diameter determination on restricted graph families. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner Efficient algorithms on distributive lattices. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). Search on Bibsonomy LATIN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 131 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license