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=6196

• Understanding and inductive inference
  Manuel Blum
  Lecture Notes in Computer Science 6196, 2010, pp. 1-1
• Computing with cells: Membrane systems
  Oscar H. Ibarra
  Lecture Notes in Computer Science 6196, 2010, pp. 2-2
• Boxicity and poset dimension
  Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
  Lecture Notes in Computer Science 6196, 2010, pp. 3-12
• On the hardness against constant-depth linear-size circuits
  Chi-Jen Lu, Hsin-Lung Wu
  Lecture Notes in Computer Science 6196, 2010, pp. 13-22
• A k-provers parallel repetition theorem for a version of no-signaling model
  Ricky Rosen
  Lecture Notes in Computer Science 6196, 2010, pp. 23-33
• The curse of connectivity: t-total vertex (edge) cover
  Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh
  Lecture Notes in Computer Science 6196, 2010, pp. 34-43
• Counting paths in VPA is complete for \#NC^{1}
  Andreas Krebs, Nutan Limaye, Meena Mahajan
  Lecture Notes in Computer Science 6196, 2010, pp. 44-53
• Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
  Rahul Jain, Hartmut Klauck, Shengyu Zhang
  Lecture Notes in Computer Science 6196, 2010, pp. 54-59
• Multiplying pessimistic estimators: Deterministic approximation of max TSP and maximum triangle packing
  Anke van Zuylen
  Lecture Notes in Computer Science 6196, 2010, pp. 60-69
• Clustering with or without the approximation
  Frans Schalekamp, Michael Yu, Anke van Zuylen
  Lecture Notes in Computer Science 6196, 2010, pp. 70-79
• A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
  Sayaka Kamei, Hirotsugu Kakugawa, Stéphane Devismes, Sébastien Tixeuil
  Lecture Notes in Computer Science 6196, 2010, pp. 80-89
• Approximate weighted farthest neighbors and minimum dilation stars
  John Augustine, David Eppstein, Kevin A. Wortman
  Lecture Notes in Computer Science 6196, 2010, pp. 90-99
• Approximated distributed minimum vertex cover algorithms for bounded degree graphs
  Yong Zhang, Francis Y.L. Chin, Hing-Fung Ting
  Lecture Notes in Computer Science 6196, 2010, pp. 100-109
• Maximum upward planar subgraph of a single-source embedded digraph
  Aimal Rextin, Patrick Healy
  Lecture Notes in Computer Science 6196, 2010, pp. 110-119
• Triangle-free 2-matchings revisited
  Maxim Babenko, Alexey Gusakov, Ilya Razenshteyn
  Lecture Notes in Computer Science 6196, 2010, pp. 120-129
• The cover time of deterministic random walks
  Tobias Friedrich, Thomas Sauerwald
  Lecture Notes in Computer Science 6196, 2010, pp. 130-139
• Finding maximum edge bicliques in convex bipartite graphs
  Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh
  Lecture Notes in Computer Science 6196, 2010, pp. 140-149
• A note on vertex cover in graphs with maximum degree 3
  Mingyu Xiao
  Lecture Notes in Computer Science 6196, 2010, pp. 150-159
• Computing graph spanners in small memory: Fault-tolerance and streaming
  Giorgio Ausiello, Paolo G. Franciosa, Giuseppe F. Italiano, Andrea Ribichini
  Lecture Notes in Computer Science 6196, 2010, pp. 160-172
• Factorization of Cartesian products of hypergraphs
  Alain Bretto, Yannick Silvestre
  Lecture Notes in Computer Science 6196, 2010, pp. 173-181
• Minimum-segment convex drawings of 3-connected cubic plane graphs
  Sudip Biswas, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman
  Lecture Notes in Computer Science 6196, 2010, pp. 182-191
• On three parameters of invisibility graphs
  Josef Cibulka, Jan Kync̑l, Viola Mészáros, Rudolf Stolaȓ, Pavel Valtr
  Lecture Notes in Computer Science 6196, 2010, pp. 192-198
• Imbalance is fixed parameter tractable
  Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
  Lecture Notes in Computer Science 6196, 2010, pp. 199-208
• The Ramsey number for a linear forest versus two identical copies of complete graphs
  I.W. Sudarsana, Adiwijaya, S. Musdalifah
  Lecture Notes in Computer Science 6196, 2010, pp. 209-215
• Optimal binary space partitions in the plane
  Mark de Berg, Amirali Khosravi
  Lecture Notes in Computer Science 6196, 2010, pp. 216-225