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: Journal=Discrete Appl.~Math. AND Volume=108
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graphs with bounded induced distance
Serafino Cicerone
,
Gabriele Di Stefano
Discrete Applied Mathematics
108
(1-2), 2001, pp. 3-21
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
B. Courcelle
,
J.A. Makowsky
,
U. Rotics
Discrete Applied Mathematics
108
(1-2), 2001, pp. 23-52
Minus domination in small-degree graphs
Peter Damaschke
Discrete Applied Mathematics
108
(1-2), 2001, pp. 53-64
Splitting number is
NP
-complete
L. Faria
,
C.M.H. de Figueiredo
,
C.F.X. Mendonça
Discrete Applied Mathematics
108
(1-2), 2001, pp. 65-83
Tree spanners in planar graphs
Sándor P. Fekete
,
Jana Kremer
Discrete Applied Mathematics
108
(1-2), 2001, pp. 85-103
Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
Dagmar Handke
Discrete Applied Mathematics
108
(1-2), 2001, pp. 105-127
Upgrading bottleneck constrained forests
S.O. Krumke
,
M.V. Marathe
,
H. Noltemeier
,
S.S. Ravi
,
H.-C. Wirth
Discrete Applied Mathematics
108
(1-2), 2001, pp. 129-142
Efficient embeddings of grids into grids
M. Röttger
,
U.-P. Schroeder
Discrete Applied Mathematics
108
(1-2), 2001, pp. 143-173
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem
Farhad Shahrokhi
,
László A. Székely
Discrete Applied Mathematics
108
(1-2), 2001, pp. 175-191
Representing graphs implicitly using almost optimal space
Maurizio Talamo
,
Paola Vocca
Discrete Applied Mathematics
108
(1-2), 2001, pp. 193-210
Maximum-entropy remote sampling
Kurt M. Anstreicher
,
Marcia Fampa
,
Jon Lee
,
Joy Williams
Discrete Applied Mathematics
108
(3), 2001, pp. 211-226
Very fast parallel algorithms for approximate edge coloring
Yijie Han
,
Weifa Liang
,
Xiaojun Shen
Discrete Applied Mathematics
108
(3), 2001, pp. 227-238
An approximation algorithm for scheduling dependent tasks on
m
processors with small communication delays
C. Hanen
,
A. Munier
Discrete Applied Mathematics
108
(3), 2001, pp. 239-257
Ray shooting from convex ranges
Evangelos Kranakis
,
Danny Krizanc
,
Anil Maheshwari
,
Jörg-Rüdiger Sack
,
Jorge Urrutia
Discrete Applied Mathematics
108
(3), 2001, pp. 259-267
Polyhedral methods for piecewise-linear functions I: The lambda method
Jon Lee
,
Dan Wilson
Discrete Applied Mathematics
108
(3), 2001, pp. 269-285
Extended finite automata over groups
Victor Mitrana
,
Ralf Stiebe
Discrete Applied Mathematics
108
(3), 2001, pp. 287-300
A note on
\alpha
-redundant vertices in graphs
Andreas Brandstädt
,
V.V. Lozin
Discrete Applied Mathematics
108
(3), 2001, pp. 301-308
On the number of generators for transeunt triangles
J.T. Butler
,
G.W. Dueck
,
S.N. Yanushkevich
,
V.P. Shmerko
Discrete Applied Mathematics
108
(3), 2001, pp. 309-316
The new FIFA rules are hard: Complexity aspects of sports competitions
Walter Kern
,
Daniël Paulusma
Discrete Applied Mathematics
108
(3), 2001, pp. 317-323
A note on the depth function of combinatorial optimization problems
Gerhard J. Woeginger
Discrete Applied Mathematics
108
(3), 2001, pp. 325-328
An on-line bin-batching problem
Gouchuan Zhang
Discrete Applied Mathematics
108
(3), 2001, pp. 329-333