Остановите войну!
for scientists:
default search action
Michel Habib
- > Home > Persons > Michel Habib
Publications
- 2010
- [j43]Michel Habib, Christophe Paul:
A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1): 41-59 (2010) - [e3]Christophe Paul, Michel Habib:
Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Lecture Notes in Computer Science 5911, 2010, ISBN 978-3-642-11408-3 [contents] - 2009
- [i6]Michel Habib, Christophe Paul:
A survey on algorithmic aspects of modular decomposition. CoRR abs/0912.1457 (2009) - 2008
- [j34]Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discret. Math. 22(4): 1277-1296 (2008) - [j33]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul:
Competitive graph searches. Theor. Comput. Sci. 393(1-3): 72-80 (2008) - [c24]Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul:
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) 2008: 634-645 - 2007
- [j32]Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul:
Can transitive orientation make sandwich problems easier? Discret. Math. 307(16): 2030-2041 (2007) - [i5]Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul:
Simple, linear-time modular decomposition. CoRR abs/0710.3901 (2007) - 2005
- [j28]Michel Habib, Christophe Paul:
A simple linear time algorithm for cograph recognition. Discret. Appl. Math. 145(2): 183-197 (2005) - [c20]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul:
Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC 2005: 146-155 - 2004
- [c19]Michel Habib, Christophe Paul, Mathieu Raffinot:
Maximal Common Connected Sets of Interval Graphs. CPM 2004: 359-372 - [c18]Michel Habib, Fabien de Montgolfier, Christophe Paul:
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT 2004: 187-198 - 2003
- [j25]Michel Habib, Emmanuelle Lebhar, Christophe Paul:
A note on finding all homogeneous set sandwiches. Inf. Process. Lett. 87(3): 147-151 (2003) - [c16]Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG 2003: 119-130 - 2001
- [j22]Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul:
Diameter determination on restricted graph families. Discret. Appl. Math. 113(2-3): 143-166 (2001) - [j21]Michel Habib, Christophe Paul, Laurent Viennot:
Linear time recognition of P4-indifference graphs. Discret. Math. Theor. Comput. Sci. 4(2): 173-178 (2001) - [j20]Guillaume Damiand, Michel Habib, Christophe Paul:
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor. Comput. Sci. 263(1-2): 99-111 (2001) - 2000
- [j19]Michel 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. Theor. Comput. Sci. 234(1-2): 59-84 (2000) - 1999
- [j17]Michel Habib, Christophe Paul, Laurent Viennot:
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. Int. J. Found. Comput. Sci. 10(2): 147-170 (1999) - 1998
- [c12]Michel Habib, Christophe Paul, Laurent Viennot:
A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. STACS 1998: 25-38 - [c11]Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul:
Diameter Determination on Restricted Graph Faminlies. WG 1998: 192-202 - 1995
- [c9]Philippe Galinier, Michel Habib, Christophe Paul:
Chordal Graphs and Their Clique Graphs. WG 1995: 358-371
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-30 23:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint