AbnerCYH's Habib:M [13 articles] Export Sort

Recent papers posted to AbnerCYH's library by the author Habib:M. You can also see everyone's Habib:M.

Hide details

	Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations [My Copy] Automata, Languages and Programming (2008), pp. 634-645. by Marc Tedder, Derek Corneil, Michel Habib, Christophe Paul posted to algorithms graph order by AbnerCYH on 2008-07-18 18:43:02 as along with 1 person muraken
	On the Interplay Between Interval Dimension and Dimension [My Copy] SIAM Journal on Discrete Mathematics, Vol. 7, No. 1. (1994), pp. 32-40. by S. Felsner, M. Habib, R. H. Möhring posted to algorithms combinatorics order by AbnerCYH on 2008-04-01 01:58:06 as
	Interval dimension is a comparability invariant [My Copy] Discrete Mathematics, Vol. 88, No. 2-3. (19 April 1991), pp. 211-229. by Michel Habib, David Kelly, Rolf H. Mohring posted to combinatorics order by AbnerCYH on 2008-03-14 02:08:43 as
	Diameter determination on restricted graph families [My Copy] Discrete Applied Mathematics, Vol. 113, No. 2-3. (15 October 2001), pp. 143-166. by Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul posted to algorithms graph by AbnerCYH on 2007-12-26 10:46:37 as
	A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata [My Copy] In STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (1998), pp. 25-38. by Michel Habib, Christophe Paul, Laurent Vienot posted to algorithms automata graph math by AbnerCYH on 2007-12-17 18:46:57 as
	Homogeneity vs. Adjacency: generalising some graph decomposition algorithms [My Copy] (13 Mar 2006) by Binh, Michel Habib, Vincent Limouzy, Fabien De Montgolfier posted to algorithms graph order by AbnerCYH on 2007-12-12 18:52:40 as
	Partition Refinement Techniques: An Interesting Algorithmic Tool Kit [My Copy] Int. J. Found. Comput. Sci., Vol. 10, No. 2. (1999), pp. 147-170. by Michel Habib, Christophe Paul, Laurent Viennot posted to algorithms graph order by AbnerCYH on 2007-12-12 10:19:30 as
	Graph Decompositions and Factorizing Permutations [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 5, No. 1. (2002), pp. 55-70. by Christian Capelle, Michel Habib, Fabien de Montgolfier posted to algorithms combinatorics graph order by AbnerCYH on 2007-12-12 10:10:51 as
	Simple, linear-time modular decomposition [My Copy] (21 Oct 2007) by Marc Tedder, Derek Corneil, Michel Habib, Christophe Paul posted to algorithms graph order by AbnerCYH on 2007-12-12 09:04:11 as
	Can transitive orientation make sandwich problems easier? [My Copy] Discrete Mathematics In EuroComb '03 - Graphs and Algorithms, EuroComb '03 - Graphs and Agorithms, Vol. 307, No. 16. (28 July 2007), pp. 2030-2041. by Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul posted to combinatorics graph by AbnerCYH on 2007-12-11 11:05:40 as
	Algorithmic Aspects of a General Modular Decomposition Theory [My Copy] (20 Nov 2007) by Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien De Montgolfier posted to algorithms graph order topology by AbnerCYH on 2007-11-21 16:31:06 as
	A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension [My Copy] Algorithm Theory - SWAT 2004 In Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings, Vol. 3111 (2004), pp. 187-198. by Michel Habib, Fabien Montgolfier, Christophe Paul posted to algorithms graph order topology by AbnerCYH on 2007-11-21 16:27:43 as
	Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing [My Copy] Theoretical Computer Science, Vol. 234, No. 1-2. (6 March 2000), pp. 59-84. by Michel Habib, Ross Mcconnell, Christophe Paul, Laurent Viennot posted to algorithms graph testing by AbnerCYH on 2007-10-10 14:49:35 as

Note: You may cite this page as: http://www.citeulike.org/user/AbnerCYH/author/Habib:M

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

Sort by:
Order:	Default Ascending Descending
Empty fields:	Default First Last

algorithms	687
graph	478
complexity	189
combinatorics	150
kdd	128
biology	128
math	127
complex	125
stochastic	113
topology	82
optimization	63
geometries	62
order	61
algebra	56
data_structure	52
dynamics	43
parameterized	38
testing	32
information	28
logic	27
automata	22
game	19
parallel	18
distributed	15
economic	14
sys_performance	14
string	7
neuro	6
history	4

AbnerCYH's Habib:M [13 articles] Export Sort

AbnerCYH's tags