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
[1]
Hilfe
Suche: Author="Wagner, David G."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The lattice of integer flows of a regular matroid
Yi Su
,
David G. Wagner
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 691-703
Weighted enumeration of spanning subgraphs with degree constraints
David G. Wagner
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 347-357
On the chromatic roots of generalized theta graphs
Jason I. Brown
,
Carl Hickman
,
Alan D. Sokal
,
David G. Wagner
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 272-297
Logarithmic concavity and
sl_2(C)
David G. Wagner
Journal of Combinatorial Theory Series A
94
(2), 2001, pp. 383-386
A Robinson-Schensted algorithm for a class of partial orders
Thomas S. Sundquist
,
David G. Wagner
,
Julian West
Journal of Combinatorial Theory Series A
79
(1), 1997, pp. 36-52
The partition polynomial of a finite set system
David G. Wagner
Journal of Combinatorial Theory Series A
56
, 1991, pp. 138-159