Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("WG 2004 : graph-theoretic concepts in computer science (Bad Honnef, 21-23 June 2004, revised papers)")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 34

  • Page / 2

Export

Selection :

  • and

WG 2004 : graph-theoretic concepts in computer science (Bad Honnef, 21-23 June 2004, revised papers)Hromkovic, Juraj; Nagl, Manfred; Westfechtel, Bernhard et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-24132-9, XI, 404 p, isbn 3-540-24132-9Conference Proceedings

Crossing reduction in circular layoutsBAUR, Michael; BRANDES, Ulrik.Lecture notes in computer science. 2004, pp 332-343, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Tolerance based algorithms for the ATSPGOLDENGORINL, Boris; SIERKSMA, Gerard; TURKENSTEEN, Marcel et al.Lecture notes in computer science. 2004, pp 222-234, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Coloring a graph using split decompositionRAO, Michaël.Lecture notes in computer science. 2004, pp 129-141, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Decremental clique problemGRANDONI, Fabrizio; ITALIANO, Giuseppe F.Lecture notes in computer science. 2004, pp 142-153, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Bimodular decomposition of bipartite graphsFOUQUET, Jean-Luc; HABIB, Michel; DE MONTGOLFIER, Fabien et al.Lecture notes in computer science. 2004, pp 117-128, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Edge-connectivity augmentation and network matricesCONFORTI, Michele; GALLUCCIO, Anna; PROIETTI, Guido et al.Lecture notes in computer science. 2004, pp 355-364, issn 0302-9743, isbn 3-540-24132-9, 10 p.Conference Paper

Core stability of minimum coloring gamesBIETENHADER, Thomas; OKAMOTO, Yoshio.Lecture notes in computer science. 2004, pp 389-401, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Elegant distance constrained labelings of treesFIALA, Jiri; GOLOVACH, Petr A; KRATOCHVIL, Jan et al.Lecture notes in computer science. 2004, pp 58-67, issn 0302-9743, isbn 3-540-24132-9, 10 p.Conference Paper

Wireless networking: Graph theory unpluggedWATTENHOFER, Roger.Lecture notes in computer science. 2004, pp 20-32, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Computing bounded-degree phylogenetic roots of disconnected graphsCHEN, Zhi-Zhong; TSUKIJI, Tatsuie.Lecture notes in computer science. 2004, pp 308-319, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

A symbolic approach to the all-pairs shortest-paths problemSAWITZKI, Daniel.Lecture notes in computer science. 2004, pp 154-167, issn 0302-9743, isbn 3-540-24132-9, 14 p.Conference Paper

Recognizing HHD-free and welsh-powell opposition graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2004, pp 105-116, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

The hypocoloring problem: Complexity and approximability results when the chromatic number is smallDE WERRA, Dominique; DEMANGE, Marc; MONNOT, Jerome et al.Lecture notes in computer science. 2004, pp 377-388, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Constant time generation of trees with specified diameterNAKANO, Shin-Ichi; UNO, Takeaki.Lecture notes in computer science. 2004, pp 33-45, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

Fully-dynamic recognition algorithm and certificate for directed cographsCRESPELLE, Christophe; PAUL, Christophe.Lecture notes in computer science. 2004, pp 93-104, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Linear kernels in linear time, or how to save k colors in O(n2) stepsCHOR, Benny; FELLOWS, Mike; JUEDES, David et al.Lecture notes in computer science. 2004, pp 257-269, issn 0302-9743, isbn 3-540-24132-9, 13 p.Conference Paper

A robust PTAS for maximum weight independent sets in unit disk graphsNIEBERG, Tim; HURINK, Johann; KERN, Walter et al.Lecture notes in computer science. 2004, pp 214-221, issn 0302-9743, isbn 3-540-24132-9, 8 p.Conference Paper

Finding k disjoint triangles in an arbitrary graphFELLOWS, Mike; HEGGERNES, Pinar; ROSAMOND, Frances et al.Lecture notes in computer science. 2004, pp 235-244, issn 0302-9743, isbn 3-540-24132-9, 10 p.Conference Paper

Minimal de Bruijn sequence in a language with forbidden substringsMORENO, Eduardo; MATAMALA, Martin.Lecture notes in computer science. 2004, pp 168-176, issn 0302-9743, isbn 3-540-24132-9, 9 p.Conference Paper

Efficient computation of the Lovász Theta function for a class of circulant graphsBRIMKOV, Valentin E; BARNEVA, Reneta P; KLETTE, Reinhard et al.Lecture notes in computer science. 2004, pp 285-295, issn 0302-9743, isbn 3-540-24132-9, 11 p.Conference Paper

Lexicographic Breadth First search: A surveyCORNEIL, Derek G.Lecture notes in computer science. 2004, pp 1-19, issn 0302-9743, isbn 3-540-24132-9, 19 p.Conference Paper

Characterization and recognition of generalized Clique-Helly graphsCOSTA DOURADO, Mitre; PROTTI, Fabio; SZWARCFITER, Jayme Luiz et al.Lecture notes in computer science. 2004, pp 344-354, issn 0302-9743, isbn 3-540-24132-9, 11 p.Conference Paper

The computational complexity of the minimum weight processor assignment problemBROERSMA, Hajo J; PAULUSMA, Daniel; SMIT, Gerard J. M et al.Lecture notes in computer science. 2004, pp 189-200, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

On the Maximum Cardinality Search lower bound for treewidthBODLAENDER, Hans L; KOSTER, Arie M. C. A.Lecture notes in computer science. 2004, pp 81-92, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

  • Page / 2