Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=2003

• Hypergraph decomposition and secret sharing
  Giovanni Di Crescenzo, Clemente Galdi
  Lecture Notes in Computer Science 2906, 2003, pp. 645-654
• Upper bounds on the complexity of some Galois theory problems
  V. Arvind, Piyush P. Kurur
  Lecture Notes in Computer Science 2906, 2003, pp. 716-725
• Unfolded modular multiplication
  Wieland Fischer, Jean-Pierre Seifert
  Lecture Notes in Computer Science 2906, 2003, pp. 726-735
• Erratum to ''Cycles in generalized networks''
  Franz J. Brandenburg
  Lecture Notes in Computer Science 2880, 2003, pp. 383
• Blow-ups, win/win's, and crown rules: Some new directions in FPT
  Michael R. Fellows
  Lecture Notes in Computer Science 2880, 2003, pp. 1-12
• Minimum flow time graph ordering
  Claudio Arbib, Michele Flammini, Fabrizio Marinelli
  Lecture Notes in Computer Science 2880, 2003, pp. 23-33
• Searching is not jumping
  Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 2880, 2003, pp. 34-45
• Incremental integration tools for chemical engineering: An industrial application of triple graph grammars
  Simon M. Becker, Bernhard Westfechtel
  Lecture Notes in Computer Science 2880, 2003, pp. 46-57
• The minimum degree heuristic and the minimal triangulation process
  Anne Berry, Pinar Heggernes, Geneviève Simonet
  Lecture Notes in Computer Science 2880, 2003, pp. 58-70
• Generalized parametric multi-terminal flows problem
  Pascal Berthomé, Madiagne Diallo, Afonso Ferreira
  Lecture Notes in Computer Science 2880, 2003, pp. 71-80
• Canonical decomposition of outerplanar maps and application to enumeration, coding, and generation
  Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
  Lecture Notes in Computer Science 2880, 2003, pp. 81-92
• The complexity of the matching-cut problem for planar graphs and other graph classes
  Paul Bonsma
  Lecture Notes in Computer Science 2880, 2003, pp. 93-105
• Tree spanners for bipartite graphs and probe interval graphs
  Andreas Brandstädt, Feodor F. Dragan, Hoang-Oanh Le, Van Bang Le, Ryuhei Uehara
  Lecture Notes in Computer Science 2880, 2003, pp. 106-118
• A simple linear time LexBFS cograph recognition algorithm
  Anna Bretscher, Derek Corneil, Michel Habib, Christophe Paul
  Lecture Notes in Computer Science 2880, 2003, pp. 119-130
• Backbone colorings for networks
  Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
  Lecture Notes in Computer Science 2880, 2003, pp. 131-142
• Greedy edge-disjoint paths in complete graphs
  Paz Carmi, Thomas Erlebach, Yoshio Okamoto
  Lecture Notes in Computer Science 2880, 2003, pp. 143-155
• Error-correcting graphs for software watermarking
  Christian Collberg, Stephen Kobourov, Edward Carter, Clark Thomborson
  Lecture Notes in Computer Science 2880, 2003, pp. 156-167
• Completely connected clustered graphs
  Sabine Cornelsen, Dorothea Wagner
  Lecture Notes in Computer Science 2880, 2003, pp. 168-179
• An FPT algorithm for set splitting
  Frank Dehne, Michael R. Fellows, Frances A. Rosamond
  Lecture Notes in Computer Science 2880, 2003, pp. 180-191
• Drawing planar graphs on a curve
  E. Di Di Ciacomo, W. Didimo, G. Liotta, S.K. Wismath
  Lecture Notes in Computer Science 2880, 2003, pp. 192-204
• Tree-partitions of k-trees with applications in graph layout
  Vida Dujmović, David R. Wood
  Lecture Notes in Computer Science 2880, 2003, pp. 205-217
• Resource allocation problems in multifiber WDM tree networks
  Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos
  Lecture Notes in Computer Science 2880, 2003, pp. 218-229
• An improved upper bound on the crossing number of the hypercube
  Luerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrt'o
  Lecture Notes in Computer Science 2880, 2003, pp. 230-236
• Sublinear computing
  Bernard Chazelle
  Lecture Notes in Computer Science 2832, 2003, pp. 1-1
• I/O-efficient structures for orthogonal range-max and stabbing-max queries
  Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi
  Lecture Notes in Computer Science 2832, 2003, pp. 7-18