Graph-theoretic concepts in computer science (Smolenice, 18-20 June 1998)Hromkovic, Juraj; Sýkora, Ondrej.Lecture notes in computer science. 1998, issn 0302-9743, isbn 3-540-65195-0, X, 383 p, isbn 3-540-65195-0Conference Proceedings

Contributing to general education by teaching informaticsHROMKOVIC, Juraj.Lecture notes in computer science. 2006, pp 25-37, issn 0302-9743, isbn 3-540-48218-0, 1Vol, 13 p.Conference Paper

Randomized communication protocols (a survey)HROMKOVIC, Juraj.Lecture notes in computer science. 2001, pp 1-32, issn 0302-9743, isbn 3-540-43025-3Conference Paper

On probabilistic pushdown automataHROMKOVIC, Juraj; SCHNITGER, Georg.Information and computation (Print). 2010, Vol 208, Num 8, pp 982-995, issn 0890-5401, 14 p.Article

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

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

Internally typed second-order term graphsKAHL, W.Lecture notes in computer science. 1998, pp 149-163, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Minus domination in small-degree graphsDAMASCHKE, P.Lecture notes in computer science. 1998, pp 17-25, issn 0302-9743, isbn 3-540-65195-0Conference Paper

An estimate of the tree-width of a planar graph which has not a given planar grid as a minorGORBUNOV, K. Yu.Lecture notes in computer science. 1998, pp 372-383, issn 0302-9743, isbn 3-540-65195-0Conference 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

Linear algorithms for a k-partition problem of planar graphs without specifying basesWADA, K; WEI CHEN.Lecture notes in computer science. 1998, pp 324-336, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Rankings of directed graphsKRATOCHVIL, J; TUZA, Z.Lecture notes in computer science. 1998, pp 114-123, issn 0302-9743, isbn 3-540-65195-0Conference Paper

A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic εLBAADER, Franz.Lecture notes in computer science. 2004, pp 177-188, issn 0302-9743, isbn 3-540-24132-9, 12 p.Conference Paper

Communication in the two-way listen-in vertex-disjoint paths modeBÖCKENHAUER, H.-J.Lecture notes in computer science. 1998, pp 38-49, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Improved compressions of cube-connected cycles networksKLASING, R.Lecture notes in computer science. 1998, pp 242-256, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Families of Graphs having broadcasting and gossiping propertiesFERTIN, G; RASPAUD, A.Lecture notes in computer science. 1998, pp 63-77, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Compact implicit representation of graphsTALAMO, M; VOCCA, P.Lecture notes in computer science. 1998, pp 164-176, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Independent tree spanners : Fault-tolerant spanning trees with constant distance guaranteesHANDKE, D.Lecture notes in computer science. 1998, pp 203-214, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Optical all-to-all communication in inflated networksTOGNI, O.Lecture notes in computer science. 1998, pp 78-87, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Representing graphs implicitly using almost optimal spaceTALAMO, Maurizio; VOCCA, Paola.Discrete applied mathematics. 2001, Vol 108, Num 1-2, pp 193-210, issn 0166-218XArticle

On the power of randomized multicounter machinesHROMKOVIC, Juraj; SCHNITGER, Georg.Theoretical computer science. 2005, Vol 330, Num 1, pp 135-144, issn 0304-3975, 10 p.Article

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

A polynomial-time algorithm for finding total colorings of partial k-treesISOBE, S; XIAO ZHOU; NISHIZEKI, T et al.Lecture notes in computer science. 1998, pp 100-113, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Graphs with bounded induced distanceCICERONE, S; DI STEFANO, G.Lecture notes in computer science. 1998, pp 177-191, issn 0302-9743, isbn 3-540-65195-0Conference Paper

Interval completion with the smallest max-degreeFOMIN, F. V; GOLOVACH, P. A.Lecture notes in computer science. 1998, pp 359-371, issn 0302-9743, isbn 3-540-65195-0Conference Paper