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
[3]
Hilfe
Suche: Series=LNCS AND Volume=3787
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Locally consistent constraint satisfaction problems with binary constraints
Manuel Bodirsky
,
Daniel Král'
Lecture Notes in Computer Science
3787
, 2005, pp. 295-306
On randomized broadcasting in star graphs
Robert Elsässer
,
Thomas Sauerwald
Lecture Notes in Computer Science
3787
, 2005, pp. 307-318
Finding disjoint paths on directed acyclic graphs
Torsten Tholey
Lecture Notes in Computer Science
3787
, 2005, pp. 319-330
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Eric Angel
,
Evripidis Bampis
,
Laurent Gourvès
Lecture Notes in Computer Science
3787
, 2005, pp. 331-340
Approximation algorithms for the weighted independent set problem
Akihisa Kako
,
Takao Ono
,
Tomio Hirata
,
Magnús M. Halldórsson
Lecture Notes in Computer Science
3787
, 2005, pp. 341-350
Approximation algorithms for unit disk graphs
Erik Jan van Leeuwen
Lecture Notes in Computer Science
3787
, 2005, pp. 351-361
Computation of chromatic polynomials using triangulations and clique trees
Pascal Berthomé
,
Sylvain Lebresne
,
Kim Nguyên
Lecture Notes in Computer Science
3787
, 2005, pp. 362-373
Computing branchwidth via efficient triangulations and blocks
Fedor Fomin
,
Frédéric Mazoit
,
Ioan Todinca
Lecture Notes in Computer Science
3787
, 2005, pp. 374-384
Algorithms based on the treewidth of sparse graphs
Joachim Kneis
,
Daniel Mölle
,
Stefan Richter
,
Peter Rossmanith
Lecture Notes in Computer Science
3787
, 2005, pp. 385-396
Extending the tractability border for closest leaf powers
Michael Dom
,
Jiong Guo
,
Falk Hüffner
,
Rolf Niedermeier
Lecture Notes in Computer Science
3787
, 2005, pp. 397-408
Bounding the misclassification error in spectral partitioning in the planted partition model
Joachim Giesen
,
Dieter Mitsche
Lecture Notes in Computer Science
3787
, 2005, pp. 409-420
Algebraic operations on
PQ
trees and modular decomposition trees
Ross M. McConnell
,
Fabien de Montgolfier
Lecture Notes in Computer Science
3787
, 2005, pp. 421-432
Linear-time counting algorithms for independent sets in chordal graphs
Yoshio Okamoto
,
Takeaki Uno
,
Ryuhei Uehara
Lecture Notes in Computer Science
3787
, 2005, pp. 433-444
Faster dynamic algorithms for chordal graphs, and an application to phylogeny
Anne Berry
,
Alain Sigayret
,
Jeremy Spinrad
Lecture Notes in Computer Science
3787
, 2005, pp. 445-455
Recognizing HHDS-free graphs
Stavros D. Nikolopoulos
,
Leonidas Palios
Lecture Notes in Computer Science
3787
, 2005, pp. 456-467
Seiten
<
1
2