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

• Colored simultaneous geometric embeddings
  U. Brandes, C. Erten, J. Fowler, F. Frati, M. Geyer, C. Gutwenger, S. Hong, M. Kaufmann, S.G. Kobourov, G. Liotta, P. Mutzel, A. Symvonis
  Lecture Notes in Computer Science 4598, 2007, pp. 254-263
• 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
• Finding equilibria in games of no chance
  Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Srensen
  Lecture Notes in Computer Science 4598, 2007, pp. 274-284
• 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
• The informational content of canonical disjoint NP-pairs
  Christian Glaßer, Alan L. Selman, Liyu Zhang
  Lecture Notes in Computer Science 4598, 2007, pp. 307-317
• On the representations of NC and Log-space real numbers
  Fuxiang Yu
  Lecture Notes in Computer Science 4598, 2007, pp. 318-326
• Bounded computable enumerability and hierarchy of computably enumerable reals
  Xizhong Zheng
  Lecture Notes in Computer Science 4598, 2007, pp. 327-337
• Streaming algorithms measured in terms of the computed quantity
  Shengyu Zhang
  Lecture Notes in Computer Science 4598, 2007, pp. 338-348
• A randomized approximation algorithm for parameterized 3-D matching counting problem
  Yunlong Liu, Jianer Chen, Jianxin Wang
  Lecture Notes in Computer Science 4598, 2007, pp. 349-359
• Optimal offline extraction of irredundant motif bases
  Alberto Apostolico, Claudia Tagliacollo
  Lecture Notes in Computer Science 4598, 2007, pp. 360-371
• Linear algorithm for broadcasting in unicyclic graphs
  Hovhannes Harutyunyan, Edward Maraachlian
  Lecture Notes in Computer Science 4598, 2007, pp. 372-382
• An improved algorithm for online unit clustering
  Hamid Zarrabi-Zadeh, Timothy M. Chan
  Lecture Notes in Computer Science 4598, 2007, pp. 383-393
• 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
• Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
  Pinar Heggernes, Charis Papadopoulos
  Lecture Notes in Computer Science 4598, 2007, pp. 406-416
• On the hardness of optimization in power law graphs
  Alessandro Ferrante, Gopal Pandurangan, Kihong Park
  Lecture Notes in Computer Science 4598, 2007, pp. 417-427
• Can a graph have distinct regular partitions?
  Noga Alon, Asaf Shapira, Uri Stav
  Lecture Notes in Computer Science 4598, 2007, pp. 428-438
• Algorithms for core stability, core largeness, exactness, and extendability of flow games
  Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun
  Lecture Notes in Computer Science 4598, 2007, pp. 439-447
• Computing symmetric Boolean functions by circuits with few exact threshold gates
  Kristoffer Arnsfelt Hansen
  Lecture Notes in Computer Science 4598, 2007, pp. 448-458
• 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
• ``Resistant'' polynomials and stronger lower bounds for depth-three arithmetical formulas
  Maurice J. Jansen, Kenneth W. Regan
  Lecture Notes in Computer Science 4598, 2007, pp. 470-481
• An improved algorithm for tree edit distance incorporating structural linearity
  Shihyen Chen, Kaizhong Zhang
  Lecture Notes in Computer Science 4598, 2007, pp. 482-492
• Approximation algorithms for reconstructing the duplication history of tandem repeats
  Lusheng Wang, Zhanyong Wang, Zhizhong Chen
  Lecture Notes in Computer Science 4598, 2007, pp. 493-503
• Priority algorithms for the subset-sum problem
  Yuli Ye, Allan Borodin
  Lecture Notes in Computer Science 4598, 2007, pp. 504-514
• 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