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 Math. AND Volume=114
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
Ephraim Korach
,
Zvi Ostfeld
Discrete Mathematics
114
(1-3), 1993, pp. 305-327
Maintenance of 2- and 3-edge-connected components of graphs I
J.A. La Poutré
,
J. van Leeuwen
,
M.H. Overmars
Discrete Mathematics
114
(1-3), 1993, pp. 329-359
A note on a counting problem arising in percolation theory
Rafi Levy
,
Eli Shamir
Discrete Mathematics
114
(1-3), 1993, pp. 361-365
On subset sums of
r
-sets
E. Lipkin
Discrete Mathematics
114
(1-3), 1993, pp. 367-377
Another variation on the common subexpression problem
Maurice Nivat
,
Andreas Podelski
Discrete Mathematics
114
(1-3), 1993, pp. 379-401
Poset matching - a distributive analog of independent matching
Uri N. Peled
,
Murali K. Srinivasan
Discrete Mathematics
114
(1-3), 1993, pp. 403-424
Parallel searching of multidimensional cubes
Miklos Santha
,
Umesh V. Vazirani
Discrete Mathematics
114
(1-3), 1993, pp. 425-433
A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs
Ron Shamir
Discrete Mathematics
114
(1-3), 1993, pp. 435-444
Seiten
<
1
2