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, Andr{\'{a}}s"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Note on the path-matching formula
András Frank
,
László Szegŏ
Journal of Graph Theory
41
(2), 2002, pp. 110-119
An orientation theorem with parity conditions
András Frank
,
Tibor Jordán
,
Zoltán Szigeti
Discrete Applied Mathematics
115
(1-3), 2001, pp. 37-47
An orientation theorem with parity conditions
András Frank
,
Tibor Jordán
,
Zoltán Szigeti
Lecture Notes in Computer Science
1610
, 1999, pp. 183-190
Parity constrained
k
-edge-connected orientations
András Frank
,
Zoltán Király
Lecture Notes in Computer Science
1610
, 1999, pp. 191-201
Finding minimum generators of path systems
András Frank
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 237-244
Minimum multiway cuts in trees
Péter L. Erdŏs
,
András Frank
,
László Székely
Discrete Applied Mathematics
87
(1-3), 1998, pp. 67-75
Two arc disjoint paths in Eulerian digraphs
András Frank
,
Toshihide Ibaraki
,
Hiroshi Nagamochi
Lecture Notes in Computer Science
1004
, 1995, pp. 92-101
Minimal edge-coverings of pairs of sets
András Frank
,
Tibor Jordán
Journal of Combinatorial Theory Series B
65
(1), 1995, pp. 73-110
Connectivity and network flows
András Frank
Handbook of Combinatorics
1
, 1995, pp. 111-177
On sparse subgraphs preserving connectivity properties
András Frank
,
Toshihide Ibaraki
,
Hiroshi Nagamochi
Journal of Graph Theory
17
(3), 1993, pp. 275-281