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	Hilfe

Suche: Series=LNCS AND YEAR=2007

• Properties of symmetric incentive compatible auctions
  Xiaotie Deng, Kazuo Iwama, Qi Qi, Aries Wei Sun, Toyotaka Tasaka
  Lecture Notes in Computer Science 4598, 2007, pp. 264-273
• Efficient testing of forecasts
  Ching-Lueh Chang, Yuh-Dauh Lyuu
  Lecture Notes in Computer Science 4598, 2007, pp. 285-295
• When does greedy learning of relevant attributes succeed? - A Fourier-based characterization
  Jan Arpe, Rüdiger Reischuk
  Lecture Notes in Computer Science 4598, 2007, pp. 296-306
• Optimal offline extraction of irredundant motif bases
  Alberto Apostolico, Claudia Tagliacollo
  Lecture Notes in Computer Science 4598, 2007, pp. 360-371
• Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
  Noga Alon, Shai Gutner
  Lecture Notes in Computer Science 4598, 2007, pp. 394-405
• Can a graph have distinct regular partitions?
  Noga Alon, Asaf Shapira, Uri Stav
  Lecture Notes in Computer Science 4598, 2007, pp. 428-438
• On the complexity of finding an unknown cut via vertex queries
  Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh
  Lecture Notes in Computer Science 4598, 2007, pp. 459-469
• An improved algorithm for tree edit distance incorporating structural linearity
  Shihyen Chen, Kaizhong Zhang
  Lecture Notes in Computer Science 4598, 2007, pp. 482-492
• Distributed approximation algorithms for weighted problems in minor-closed families
  A. Czygrinow, M. Hańćkowiak
  Lecture Notes in Computer Science 4598, 2007, pp. 515-525
• A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs
  Francis Y.L. Chin, Yong Zhang, Hong Zhu
  Lecture Notes in Computer Science 4598, 2007, pp. 526-536
• Improved algorithms for weighted and unweighted set splitting problems
  Jianer Chen, Songjian Lu
  Lecture Notes in Computer Science 4598, 2007, pp. 537-547
• Approximation algorithms for the black and white Traveling Salesman Problem
  Binay Bhattacharya, Yuzhuang Hu, Alexander Kononov
  Lecture Notes in Computer Science 4598, 2007, pp. 559-567
• Ushering in a new era of algorithm design
  Bernard Chazelle
  Lecture Notes in Computer Science 4596, 2007, pp. 1-1
• A ``proof-reading'' of some issues in cryptography
  Ivan Damgård
  Lecture Notes in Computer Science 4596, 2007, pp. 2-11
• Subexponential parameterized algorithms
  Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 4596, 2007, pp. 15-27
• Competitive algorithms for due date scheduling
  Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
  Lecture Notes in Computer Science 4596, 2007, pp. 28-39
• Mechanism design for fractional scheduling on unrelated machines
  George Christodoulou, Elias Koutsoupias, Annamária Kovács
  Lecture Notes in Computer Science 4596, 2007, pp. 40-52
• Sampling methods for shortest vectors, closest vectors and successive minima
  Johannes Blömer, Stefanie Naewe
  Lecture Notes in Computer Science 4596, 2007, pp. 65-77
• Minimum weight 2-edge-connected spanning subgraphs in planar graphs
  André Berger, Michelangelo Grigni
  Lecture Notes in Computer Science 4596, 2007, pp. 90-101
• Separating deterministic from nondeterministic NOF multiparty communication complexity
  Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel
  Lecture Notes in Computer Science 4596, 2007, pp. 134-145
• An optimal decomposition algorithm for tree edit distance
  Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
  Lecture Notes in Computer Science 4596, 2007, pp. 146-157
• On commutativity based edge lean search
  Dragan Bos̑nac̑ki, Edith Elkind, Blaise Genest, Doron Peled
  Lecture Notes in Computer Science 4596, 2007, pp. 158-170
• Exotic quantifiers, complexity classes, and complete problems
  Peter Bürgisser, Felipe Cucker
  Lecture Notes in Computer Science 4596, 2007, pp. 207-218
• Online conflict-free colorings for hypergraphs
  Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
  Lecture Notes in Computer Science 4596, 2007, pp. 219-230
• Constant-round private database queries
  Nenad Dedic, Payman Mohassel
  Lecture Notes in Computer Science 4596, 2007, pp. 255-266