Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND YEAR=2002

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Maximum cardinality search for computing minimal triangulations
Anne Berry, Jean R.S. Blair, Pinar Heggernes
Lecture Notes in Computer Science 2573, 2002, pp. 1-12
DNA sequencing, Eulerian graphs
Jacek Bƚażewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger
Lecture Notes in Computer Science 2573, 2002, pp. 13-24
On the minimum size of a contraction-universal tree
Olivier Bodini
Lecture Notes in Computer Science 2573, 2002, pp. 25-34
Optimal area algorithm for planar polyline drawings
Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah
Lecture Notes in Computer Science 2573, 2002, pp. 35-46
Cycles in generalized networks
Franz J. Brandenburg
Lecture Notes in Computer Science 2573, 2002, pp. 47-56
New graph classes of bounded clique-width
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca
Lecture Notes in Computer Science 2573, 2002, pp. 57-67
More about subcolorings
Hajo Broersma, Fedor V. Fomin, Jaroslav Nes̑etȓil, Gerhard J. Woeginger
Lecture Notes in Computer Science 2573, 2002, pp. 68-79
Search in indecomposable graphs
Alain Cournier
Lecture Notes in Computer Science 2573, 2002, pp. 80-91
On the complexity of (k,l)-graph sandwich problems
Simone Dantas, Celina M.H. de Figueiredo, Luerbio Faria
Lecture Notes in Computer Science 2573, 2002, pp. 92-101
Algorithms and models for the on-line vertex-covering
Marc Demange, Vangelis Th. Paschos
Lecture Notes in Computer Science 2573, 2002, pp. 102-113
Weighted node coloring: When stable sets are expensive
Marc Demange, D. de Werra, J. Monnot, Vangelis Th. Paschos
Lecture Notes in Computer Science 2573, 2002, pp. 114-125
The complexity of restrictive H-coloring
Josep Díaz, Maria Serna, Dimitrios M. Thilikos
Lecture Notes in Computer Science 2573, 2002, pp. 126-137
A new 3-color criterion for planar graphs
Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski
Lecture Notes in Computer Science 2573, 2002, pp. 138-149
An additive stretched routing scheme for chordal graphs
Yon Dourisboure
Lecture Notes in Computer Science 2573, 2002, pp. 150-163
Local normal forms for logics over traces
Bharat Adsul, Milind Sohoni
Lecture Notes in Computer Science 2556, 2002, pp. 47-58
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic̑, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
Lecture Notes in Computer Science 2556, 2002, pp. 59-70
Communication interference in mobile boxed ambients
Michele Bugliesi, Silvia Crafa, Massimo Merro, Vladimiro Sassone
Lecture Notes in Computer Science 2556, 2002, pp. 71-84
The seal calculus revisited: Contextual equivalence and bisimilarity
Giuseppe Castagna, Francesco Zappa Nardelli
Lecture Notes in Computer Science 2556, 2002, pp. 85-96
Composing strand spaces
Federico Crazzolara, Glynn Winskel
Lecture Notes in Computer Science 2556, 2002, pp. 97-108
Generalising automaticity to modal properties of finite structures
A. Dawar, S. Kreutzer
Lecture Notes in Computer Science 2556, 2002, pp. 109-120
An automata-theoretic approach to constraint LTL
Stéphane Demri, Deepak D'Souza
Lecture Notes in Computer Science 2556, 2002, pp. 121-132
Sketch-driven orthogonal graph drawing
Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner
Lecture Notes in Computer Science 2528, 2002, pp. 1-11
Graphs, they are changing - Dynamic graph drawing for a sequence of graphs
Stephan Diehl, Carsten Görg
Lecture Notes in Computer Science 2528, 2002, pp. 23-30
Drawing graphs on two and three lines
Sabine Cornelsen, Thomas Schank, Dorothea Wagner
Lecture Notes in Computer Science 2528, 2002, pp. 31-41
Drawing outer-planar graphs in O(n \log n) area
Therese Biedl
Lecture Notes in Computer Science 2528, 2002, pp. 54-65

Seiten 1 2 3 4 5 6 7 8 9 10 11 12 >