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

• Efficient computation of balanced structures
  David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
  Lecture Notes in Computer Science 7966, 2013, pp. 581-593
• A refined complexity analysis of degree anonymization in graphs
  Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondȓej Suchý
  Lecture Notes in Computer Science 7966, 2013, pp. 594-606
• Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks
  Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai
  Lecture Notes in Computer Science 7966, 2013, pp. 607-619
• Locally stable marriage with strict preferences
  Martin Hoefer, Lisa Wagner
  Lecture Notes in Computer Science 7966, 2013, pp. 620-631
• Distributed deterministic broadcasting in wireless networks of weak devices
  Tomasz Jurdzinski, Dariusz R. Kowalski, Grzegorz Stachowiak
  Lecture Notes in Computer Science 7966, 2013, pp. 632-644
• Secure equality and greater-than tests with sublinear online complexity
  Helger Lipmaa, Tomas Toft
  Lecture Notes in Computer Science 7966, 2013, pp. 645-656
• Temporal network optimization subject to connectivity constraints
  George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis
  Lecture Notes in Computer Science 7966, 2013, pp. 657-668
• Strong bounds for evolution in networks
  George B. Mertzios, Paul G. Spirakis
  Lecture Notes in Computer Science 7966, 2013, pp. 669-680
• Fast distributed coloring algorithms for triangle-free graphs
  Seth Pettie, Hsin-Hao Su
  Lecture Notes in Computer Science 7966, 2013, pp. 681-693