Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=903

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

Domino treewidth
Hans L. Bodlaender, Joost Engelfriet
Lecture Notes in Computer Science 903, 1995, pp. 1-13
A lower bound for treewidth and its consequences
Siddharthan Ramachandramurthi
Lecture Notes in Computer Science 903, 1995, pp. 14-25
Tree-width and path-width of comparability graphs of interval orders
Renate Garbe
Lecture Notes in Computer Science 903, 1995, pp. 26-37
A declarative approach to graph based modeling
Jürgen Ebert, Angelika Franzke
Lecture Notes in Computer Science 903, 1995, pp. 38-50
Multilevel graph grammars
Francesco Parisi-Presicce, Gabriele Piersanti
Lecture Notes in Computer Science 903, 1995, pp. 51-64
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Andreas Brandstädt, Victor D. Chepoi, Feodor F. Dragan
Lecture Notes in Computer Science 903, 1995, pp. 65-80
On domination elimination orderings and domination graphs
Elias Dahlhaus, Peter Hammer, Frédéric Maffray, Stephan Olariu
Lecture Notes in Computer Science 903, 1995, pp. 81-92
Complexity of graph covering problems
Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle
Lecture Notes in Computer Science 903, 1995, pp. 93-105
Dominoes
T. Kloks, D. Kratsch, H. Müller
Lecture Notes in Computer Science 903, 1995, pp. 106-120
GLB-closures in directed acyclic graphs and their applications
Volker Turau, Weimin Chen
Lecture Notes in Computer Science 903, 1995, pp. 121-129
Minimum vertex cover, distributed decision-making, and communication complexity
Pierluigi Crescenzi, Luca Trevisan
Lecture Notes in Computer Science 903, 1995, pp. 130-139
Cartesian products of graphs as spanning subgraphs of de Bruijn graphs
Thomas Andreae, Michael Nölle, Gerald Schreiber
Lecture Notes in Computer Science 903, 1995, pp. 140-150
Specification of graph translators with triple graph grammars
Andy Schürr
Lecture Notes in Computer Science 903, 1995, pp. 151-163
Using programmed graph rewriting for the formal specification of a configuration management system
Bernhard Westfechtel
Lecture Notes in Computer Science 903, 1995, pp. 164-179
Exponential time analysis of confluent and boundary eNCE graph languages
K. Skodinis, E. Wanke
Lecture Notes in Computer Science 903, 1995, pp. 180-192
Time-optimal tree computations on sparse meshes
D. Bhagavathi, V. Bokka, H. Gurla, S. Olariu, J.L. Schwing
Lecture Notes in Computer Science 903, 1995, pp. 193-205
Prefix graphs and their applications
Shiva Chaudhuri, Torben Hagerup
Lecture Notes in Computer Science 903, 1995, pp. 206-218
The complexity of broadcasting in planar and decomposable graphs
Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer
Lecture Notes in Computer Science 903, 1995, pp. 219-231
The maximal f-dependent set problem for planar graphs is in NC
Zhi-Zhong Chen
Lecture Notes in Computer Science 903, 1995, pp. 232-241
On-line convex planarity testing
Giuseppe di Battista, Roberto Tamassia, Luca Vismara
Lecture Notes in Computer Science 903, 1995, pp. 242-255
Book embeddings and crossing numbers
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrt'o
Lecture Notes in Computer Science 903, 1995, pp. 256-268
Measuring the distance to series-parallelity by path expressions
Valeska Naumann
Lecture Notes in Computer Science 903, 1995, pp. 269-281
Labelled trees and pairs of input-output permutations in priority queues
M. Golin, S. Zaks
Lecture Notes in Computer Science 903, 1995, pp. 282-291
Rankings of graphs
H.L. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller, Zs. Tuza
Lecture Notes in Computer Science 903, 1995, pp. 292-304
Bypass strong V-structures and find an isomorphic labelled subgraph in linear time
Heiko Dörr
Lecture Notes in Computer Science 903, 1995, pp. 305-318

Seiten 1 2 >