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

• Simultaneous embeddings with vertices mapping to pre-specified points
  Taylor Gordon
  Lecture Notes in Computer Science 7434, 2012, pp. 299-310
• Multilevel drawings of clustered graphs
  Fabrizio Frati
  Lecture Notes in Computer Science 7434, 2012, pp. 311-322
• Outerplanar graph drawings with few slopes
  Kolja Knauer, Piotr Micek, Bartosz Walczak
  Lecture Notes in Computer Science 7434, 2012, pp. 323-334
• Fáry's theorem for 1-planar graphs
  Seok-Hee Hong, Peter Eades, Giuseppe Liotta, Sheung-Hung Poon
  Lecture Notes in Computer Science 7434, 2012, pp. 335-346
• Constant time enumeration of bounded-size subtrees in trees and its application
  Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura
  Lecture Notes in Computer Science 7434, 2012, pp. 347-359
• External memory soft heap, and hard heap, a meldable priority queue
  Alka Bhushan, Sajith Gopalan
  Lecture Notes in Computer Science 7434, 2012, pp. 360-371
• Partially specified nearest neighbor search
  Tomas Hruz, Marcel Schöngens
  Lecture Notes in Computer Science 7434, 2012, pp. 372-383
• Multi-pattern matching with bidirectional indexes
  Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki
  Lecture Notes in Computer Science 7434, 2012, pp. 384-395
• Succinct representations of binary trees for range minimum queries
  Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
  Lecture Notes in Computer Science 7434, 2012, pp. 396-407
• Lower bounds against weakly uniform circuits
  Ruiwen Chen, Valentine Kabanets
  Lecture Notes in Computer Science 7434, 2012, pp. 408-419
• On \mbox{TC}^0 lower bounds for the permanent
  Jeff Kinne
  Lecture Notes in Computer Science 7434, 2012, pp. 420-432
• Formula complexity of ternary majorities
  Kenya Ueno
  Lecture Notes in Computer Science 7434, 2012, pp. 433-444
• On the kernelization complexity of problems on graphs without long odd cycles
  Fahad Panolan, Ashutosh Rai
  Lecture Notes in Computer Science 7434, 2012, pp. 445-457
• The complexity of unary subset sum
  Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
  Lecture Notes in Computer Science 7434, 2012, pp. 458-469
• On the advice complexity of tournaments
  Sebastian Ben Daniel
  Lecture Notes in Computer Science 7434, 2012, pp. 470-481
• A remark on one-wayness versus pseudorandomness
  Periklis A. Papakonstantinou, Guang Yang
  Lecture Notes in Computer Science 7434, 2012, pp. 482-494
• Integral mixed unit interval graphs
  Van Bang Le, Dieter Rautenbach
  Lecture Notes in Computer Science 7434, 2012, pp. 495-506
• Complementary vertices and adjacency testing in polytopes
  Benjamin A. Burton
  Lecture Notes in Computer Science 7434, 2012, pp. 507-518
• Online coloring of bipartite graphs with and without advice
  Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic̑, Lucia Keller
  Lecture Notes in Computer Science 7434, 2012, pp. 519-530
• Deep coalescence reconciliation with unrooted gene trees: Linear time algorithms
  Paweƚ Górecki, Oliver Eulenstein
  Lecture Notes in Computer Science 7434, 2012, pp. 531-542
• On the 2-central path problem
  Yongding Zhu, Jinhui Xu
  Lecture Notes in Computer Science 7434, 2012, pp. 543-555
• Making profit in a prediction market
  Jen-Hou Chou, Chi-Jen Lu, Mu-En Wu
  Lecture Notes in Computer Science 7434, 2012, pp. 556-567
• Computing Shapley value in supermodular coalitional games
  David Liben-Nowell, Alexa Sharp, Tom Wexler, Kevin Woods
  Lecture Notes in Computer Science 7434, 2012, pp. 568-579
• Equilibria of GSP for range auction
  H.F. Ting, Xiangzhong Xiang
  Lecture Notes in Computer Science 7434, 2012, pp. 580-591
• Stretch in bottleneck games
  Costas Busch, Rajgopal Kannan
  Lecture Notes in Computer Science 7434, 2012, pp. 592-603