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

• Unsatisfiable CNF formulas contain many conflicts
  Dominik Scheder
  Lecture Notes in Computer Science 8283, 2013, pp. 273-283
• Pursuit evasion on polyhedral surfaces
  Kyle Klein, Subhash Suri
  Lecture Notes in Computer Science 8283, 2013, pp. 284-294
• Algorithms for tolerated Tverberg partitions
  Wolfgang Mulzer, Yannik Stein
  Lecture Notes in Computer Science 8283, 2013, pp. 295-305
• Abstract Voronoi diagrams with disconnected regions
  Cecilia Bohler, Rolf Klein
  Lecture Notes in Computer Science 8283, 2013, pp. 306-316
• Terrain visibility with multiple viewpoints
  Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán, Maria Saumell, Rodrigo I. Silveira, Frank Staals
  Lecture Notes in Computer Science 8283, 2013, pp. 317-327
• Exact algorithms for maximum independent set
  Mingyu Xiao, Hiroshi Nagamochi
  Lecture Notes in Computer Science 8283, 2013, pp. 328-338
• On the enumeration and counting of minimal dominating sets in interval and permutation graphs
  Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
  Lecture Notes in Computer Science 8283, 2013, pp. 339-349
• Testing mutual duality of planar graphs
  Patrizio Angelini, Thomas Bläsius, Ignaz Rutter
  Lecture Notes in Computer Science 8283, 2013, pp. 350-360
• Effective and efficient data reduction for the Subset Interconnection Design problem
  Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondȓej Suchý, Mathias Weller
  Lecture Notes in Computer Science 8283, 2013, pp. 361-371
• Myhill-Nerode methods for hypergraphs
  René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
  Lecture Notes in Computer Science 8283, 2013, pp. 372-382
• Augmenting graphs to minimize the diameter
  Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson
  Lecture Notes in Computer Science 8283, 2013, pp. 383-393
• Top-k document retrieval in compact space and near-optimal time
  Gonzalo Navarro, Sharma V. Thankachan
  Lecture Notes in Computer Science 8283, 2013, pp. 394-404
• Faster, space-efficient selection algorithms in read-only memory for integers
  Timothy M. Chan, J. Ian Munro, Venkatesh Raman
  Lecture Notes in Computer Science 8283, 2013, pp. 405-412
• Trajectory-based dynamic map labeling
  Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
  Lecture Notes in Computer Science 8283, 2013, pp. 413-423
• Asynchronous rumor spreading on random graphs
  Konstantinos Panagiotou, Leo Speidel
  Lecture Notes in Computer Science 8283, 2013, pp. 424-434
• Unit cost buyback problem
  Yasushi Kawase, Xin Han, Kazuhisa Makino
  Lecture Notes in Computer Science 8283, 2013, pp. 435-445
• Faster rumor spreading with multiple calls
  Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald
  Lecture Notes in Computer Science 8283, 2013, pp. 446-456
• Approximating the value of a concurrent reachability game in the polynomial time hierarchy
  Sren Kristoffer Stiil Frederiksen, Peter Bro Miltersen
  Lecture Notes in Computer Science 8283, 2013, pp. 457-467
• Computing a Walrasian equilibrium in iterative auctions with multiple differentiated items
  Kazuo Murota, Akiyoshi Shioura, Zaifu Yang
  Lecture Notes in Computer Science 8283, 2013, pp. 468-478
• New results on the online pricing problem
  Xiangzhong Xiang
  Lecture Notes in Computer Science 8283, 2013, pp. 479-490
• RAM-efficient external memory sorting
  Lars Arge, Mikkel Thorup
  Lecture Notes in Computer Science 8283, 2013, pp. 491-501
• Succinct data structures for representing equivalence classes
  Moshe Lewenstein, J. Ian Munro, Venkatesh Raman
  Lecture Notes in Computer Science 8283, 2013, pp. 502-512
• Sliding bloom filters
  Moni Naor, Eylon Yogev
  Lecture Notes in Computer Science 8283, 2013, pp. 513-523
• Vertex-weighted matching in two-directional orthogonal ray graphs
  C. Gregory Plaxton
  Lecture Notes in Computer Science 8283, 2013, pp. 524-534
• Bounded representations of interval and proper interval graphs
  Martin Balko, Pavel Klavík, Yota Otachi
  Lecture Notes in Computer Science 8283, 2013, pp. 535-546