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 YEAR=2014

• Robust distance queries on massive networks
  Daniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck
  Lecture Notes in Computer Science 8737, 2014, pp. 321-333
• A dynamic data structure for MSO properties in graphs with bounded tree-depth
  Zdenȇk Dvoȓák, Martin Kupec, Vojtȇch Tůma
  Lecture Notes in Computer Science 8737, 2014, pp. 334-345
• Large independent sets in triangle-free planar graphs
  Zdenȇk Dvoȓák, Matthias Mnich
  Lecture Notes in Computer Science 8737, 2014, pp. 346-357
• GRASP. Extending graph separators for the single-source shortest-path problem
  Alexandros Efentakis, Dieter Pfoser
  Lecture Notes in Computer Science 8737, 2014, pp. 358-370
• Switching colouring of G(n,d/n) for sampling up to Gibbs uniqueness threshold
  Charilaos Efthymiou
  Lecture Notes in Computer Science 8737, 2014, pp. 371-381
• From graph to hypergraph multiway partition: Is the single threshold the only route?
  Alina Ene, Huy L. Nguy\skew1\tilde{\mbox{\^e}}n
  Lecture Notes in Computer Science 8737, 2014, pp. 382-393
• Deterministic stateless centralized local algorithms for bounded degree graphs
  Guy Even, Moti Medina, Dana Ron
  Lecture Notes in Computer Science 8737, 2014, pp. 394-405
• Bicriteria data compression: Efficient and usable
  Andrea Farruggia, Paolo Ferragina, Rossano Venturini
  Lecture Notes in Computer Science 8737, 2014, pp. 406-417
• Amortized \tilde{O}(|V|)-delay algorithm for listing chordless cycles in undirected graphs
  Rui Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot
  Lecture Notes in Computer Science 8737, 2014, pp. 418-429
• LP approaches to improved approximation for clique transversal in perfect graphs
  Samuel Fiorini, R. Krithika, N.S. Narayanaswamy, Venkatesh Raman
  Lecture Notes in Computer Science 8737, 2014, pp. 430-442
• Representative sets of product families
  Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
  Lecture Notes in Computer Science 8737, 2014, pp. 443-454
• Weighted ancestors in suffix trees
  Paweƚ Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson
  Lecture Notes in Computer Science 8737, 2014, pp. 455-466
• Computable infinite power series in the role of coefficients of linear differential systems
  Sergei A. Abramov, Moulay A. Barkatou
  Lecture Notes in Computer Science 8660, 2014, pp. 1-12
• Relation algebra, RelView, and plurality voting
  Rudolf Berghammer
  Lecture Notes in Computer Science 8660, 2014, pp. 13-27
• An algorithm for converting nonlinear differential equations to integral equations with an application to parameter estimation from noisy data
  François Boulier, Anja Korporal, François Lemaire, Wilfrid Perruquetti, Adrien Poteaux, Rosane Ushirobira
  Lecture Notes in Computer Science 8660, 2014, pp. 28-43
• Truth table invariant cylindrical algebraic decomposition by regular chains
  Russell Bradford, Changbo Chen, James H. Davenport, Matthew England, Marc Moreno Maza, David Wilson
  Lecture Notes in Computer Science 8660, 2014, pp. 44-58
• Computing the topology of an arrangement of implicit and parametric curves given by values
  Jorge Caravantes, Mario Fioravanti, Laureano Gonzalez-Vega, Ioana Necula
  Lecture Notes in Computer Science 8660, 2014, pp. 59-73
• Finding a deterministic generic position for an algebraic space curve
  Jin-San Cheng, Kai Jin
  Lecture Notes in Computer Science 8660, 2014, pp. 74-84
• Optimal estimations of Seiffert-type means by some special Gini means
  Iulia Costin, Gheorghe Toader
  Lecture Notes in Computer Science 8660, 2014, pp. 85-98
• CAS application to the construction of high-order difference schemes for solving poisson equation
  Grigoriy M. Drozdov, Vasily P. Shapeev
  Lecture Notes in Computer Science 8660, 2014, pp. 99-110
• Partial-observation stochastic reachability and parity games
  Krishnendu Chatterjee
  Lecture Notes in Computer Science 8634, 2014, pp. 1-4
• Sofic-Dyck shifts
  Marie-Pierre Béal, Michel Blockelet, Cȃtȃlin Dima
  Lecture Notes in Computer Science 8634, 2014, pp. 63-74
• A logical characterization of timed (non-)regular languages
  Marcello M. Bersani, Matteo Rossi, Pierluigi San Pietro
  Lecture Notes in Computer Science 8634, 2014, pp. 75-86
• Asymptotic monadic second-order logic
  Achim Blumensath, Olivier Carton, Thomas Colcombet
  Lecture Notes in Computer Science 8634, 2014, pp. 87-98
• Towards efficient reasoning under guarded-based disjunctive existential rules
  Pierre Bourhis, Michael Morak, Andreas Pieris
  Lecture Notes in Computer Science 8634, 2014, pp. 99-110