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: Author="Frank, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Oriloc: Prediction of replication boundaries in unannotated bacterial chromosomes
A.C. Frank
,
J.R. Lobry
Bioinformatics
16
(6), 2000, pp. 560-561
How to make a strongly connected digraph two-connected
A. Frank
,
T. Jordán
Lecture Notes in Computer Science
920
, 1995, pp. 414-425
Edge-disjoint circuits in graphs on the torus
A. Frank
,
A. Schrijver
Journal of Combinatorial Theory Series B
55
, 1992, pp. 9-17
Augmenting graphs to meet edge-connectivity requirements
A. Frank
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 708-718
An application of simultaneous Diophantine approximation in combinatorial optimization
A. Frank
,
éva Tardos
Combinatorica
7
(1), 1987, pp. 49-66
An application of simultaneous approximation in combinatorial optimization
A. Frank
,
é. Tardos
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 459-463