Search results for "cographs"

Found 213 publication records. Showing 213 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul	A Simple Linear Time LexBFS Cograph Recognition Algorithm.	WG	2003	DBLP DOI BibTeX RDF
17	Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger	Radio Labeling with Pre-assigned Frequencies.	ESA	2002	DBLP DOI BibTeX RDF	Radio labeling, k-colorling, computational complexity, approximation algorithm, graph algorithms, frequency assignment, cograph
17	Hans L. Bodlaender, Fedor V. Fomin	Tree Decompositions with Small Cost.	SWAT	2002	DBLP DOI BibTeX RDF
17	Tiziana Calamoneri, Rossella Petreschi	L(2, 1)-Coloring Matrogenic Graphs.	LATIN	2002	DBLP DOI BibTeX RDF
17	Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong	The Kr-Packing Problem.	Computing	2001	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C70, 68Q20, 05C85
17	Jirí Fiala 0001, Klaus Jansen, Van Bang Le, Eike Seidel	Graph Subcolorings: Complexity and Algorithms.	WG	2001	DBLP DOI BibTeX RDF
17	Vadim V. Lozin	On a Generalization of Bi-Complement Reducible Graphs.	MFCS	2000	DBLP DOI BibTeX RDF
17	Öjvind Johansson	NLC2-Decomposition in Polynomial Time.	WG	1999	DBLP DOI BibTeX RDF
17	H. N. de Ridder, Hans L. Bodlaender	Graph Automorphisms with Maximal Projection Distances.	FCT	1999	DBLP DOI BibTeX RDF
17	Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong	The Vertex-Disjoint Triangles Problem.	WG	1998	DBLP DOI BibTeX RDF
17	Luitpold Babel, Stephan Olariu	On the Isomorphism of Graphs with Few P4s.	WG	1995	DBLP DOI BibTeX RDF
17	Hans L. Bodlaender	Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory.	WG	1992	DBLP DOI BibTeX RDF
17	Beverly Jamison, Stephan Olariu	A Linear-Time Recognition Algorithm for P4-Reducible Graphs.	FSTTCS	1989	DBLP DOI BibTeX RDF

Displaying result #201 - #213 of 213 (100 per page; Change: )
Pages: [<<][1][2][3]