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="K{\"u}ndgen, Andr{\'e}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Covering complete hypergraphs with cuts of minimum total size
Sebastian M. Cioabȃ
,
André Kündgen
Graphs and Combinatorics
28
(1), 2012, pp. 109-122
Switchings, extensions, and reductions in central digraphs
André Kündgen
,
Gregor Leander
,
Carsten Thomassen
Journal of Combinatorial Theory Series A
118
(7), 2011, pp. 2025-2034
k
-robust single-message transmission
André Kündgen
,
Michael J. Pelsmajer
,
Radhika Ramamurthi
SIAM Journal on Discrete Mathematics
24
(1), 2010, pp. 301-321
On decompositions of complete hypergraphs
Sebastian M. Cioabȃ
,
André Kündgen
,
Jacques Verstraëte
Journal of Combinatorial Theory Series A
116
(7), 2009, pp. 1232-1234
Moments of graphs in monotone families
Zoltán Füredi
,
André Kündgen
Journal of Graph Theory
51
(1), 2006, pp. 37-48
Graph minors and reliable single message transmission
Faith Ellen Fich
,
André Kündgen
,
Michael J. Pelsmajer
,
Radhika Ramamurthi
SIAM Journal on Discrete Mathematics
19
(4), 2005-2006, pp. 815-847
Probabilistic methods for decomposition dimension of graphs
Mariko Hagita
,
André Kündgen
,
Douglas B. West
Graphs and Combinatorics
19
(4), 2003, pp. 493-503
Erratum to ''Minimal completely separating systems of
k
-sets''
André Kündgen
,
Dhruv Mubayi
,
Prasad Tetali
Journal of Combinatorial Theory Series A
103
(2), 2003, pp. 403-404
Turán problems for integer-weighted graphs
Zoltán Füredi
,
André Kündgen
Journal of Graph Theory
40
(4), 2002, pp. 195-225