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=3353
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing bounded-degree phylogenetic roots of disconnected graphs
Zhi-Zhong Chen
,
Tatsuie Tsukiji
Lecture Notes in Computer Science
3353
, 2004, pp. 308-319
Octagonal drawings of plane graphs with prescribed face areas
Md. Saidur Rahman
,
Kazuyuki Miura
,
Takao Nishizeki
Lecture Notes in Computer Science
3353
, 2004, pp. 320-331
Crossing reduction in circular layouts
Michael Baur
,
Ulrik Brandes
Lecture Notes in Computer Science
3353
, 2004, pp. 332-343
Characterization and recognition of generalized clique-Helly graphs
Mitre Costa Dourado
,
Fábio Protti
,
Jayme Luiz Szwarcfiter
Lecture Notes in Computer Science
3353
, 2004, pp. 344-354
Edge-connectivity augmentation and network matrices
Michele Conforti
,
Anna Galluccio
,
Guido Proietti
Lecture Notes in Computer Science
3353
, 2004, pp. 355-364
Partitioning a weighted graph to connected subgraphs of almost uniform size
Takehiro Ito
,
Xiao Zhou
,
Takao Nishizeki
Lecture Notes in Computer Science
3353
, 2004, pp. 365-376
The hypocoloring problem: Complexity and approximability results when the chromatic number is small
Dominique de Werra
,
Marc Demange
,
Jerome Monnot
,
Vangelis Th. Paschos
Lecture Notes in Computer Science
3353
, 2004, pp. 377-388
Core stability of minimum coloring games
Thomas Bietenhader
,
Yoshio Okamoto
Lecture Notes in Computer Science
3353
, 2004, pp. 389-401
Seiten
<
1
2