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 Volume=4708

• Hardness results for tournament isomorphism and automorphism
  Fabian Wagner
  Lecture Notes in Computer Science 4708, 2007, pp. 572-583
• Relating complete and partial solution for problems similar to graph automorphism
  Takayuki Nagoya, Seinosuke Toda
  Lecture Notes in Computer Science 4708, 2007, pp. 584-595
• Well supported approximate equilibria in bimatrix games: A graph theoretic approach
  Spyros G. Kontogiannis, Paul G. Spirakis
  Lecture Notes in Computer Science 4708, 2007, pp. 596-608
• Selfish load balancing under partial knowledge
  Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis
  Lecture Notes in Computer Science 4708, 2007, pp. 609-620
• Extending the notion of rationality of selfish agents: Second order Nash equilibria
  Vittorio Bilò, Michele Flammini
  Lecture Notes in Computer Science 4708, 2007, pp. 621-632
• Congestion games with player-specific constants
  Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
  Lecture Notes in Computer Science 4708, 2007, pp. 633-644
• Finding patterns in given intervals
  Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
  Lecture Notes in Computer Science 4708, 2007, pp. 645-656
• The power of two prices: Beyond cross-monotonicity
  Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
  Lecture Notes in Computer Science 4708, 2007, pp. 657-668
• Semisimple algebras of almost minimal rank over the reals
  Markus Bläser, Andreas Meyer de Voltaire
  Lecture Notes in Computer Science 4708, 2007, pp. 669-680
• Structural analysis of gapped motifs of a string
  Esko Ukkonen
  Lecture Notes in Computer Science 4708, 2007, pp. 681-690
• Online and offline access to short lists
  Torben Hagerup
  Lecture Notes in Computer Science 4708, 2007, pp. 691-702
• Optimal randomized comparison based algorithms for collision
  Riko Jacob
  Lecture Notes in Computer Science 4708, 2007, pp. 703-714
• Randomized and approximation algorithms for blue-red matching
  Christos Nomikos, Aris Pagourtzis, Stathis Zachos
  Lecture Notes in Computer Science 4708, 2007, pp. 715-725
• Real computational universality: The word problem for a class of groups with infinite presentation
  Klaus Meer, Martin Ziegler
  Lecture Notes in Computer Science 4708, 2007, pp. 726-737
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
  Paul Bonsma, Luis Cereceda
  Lecture Notes in Computer Science 4708, 2007, pp. 738-749
• Shuffle expressions and words with nested data
  Henrik Björklund, Mikoƚaj Bojańczyk
  Lecture Notes in Computer Science 4708, 2007, pp. 750-761