André Kündgen

Publication Activity (10 Years)

Years Active: 1998-2022
Publications (10 Years): 5

Top Topics

Communication Protocols

Attributed Graphs

Graph Theoretical

Top Venues

SIAM J. Discret. Math.

Discret. Math. Theor. Comput. Sci.

Publications

John Gimbel, André Kündgen, Michael Molloy
Fractional Cocoloring of Graphs. Graphs Comb. 38 (3) (2022)
John Gimbel, André Kündgen, Binlong Li, Carsten Thomassen
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces. SIAM J. Discret. Math. 33 (3) (2019)
André Kündgen, Janina Silvana P. Patno
Expected reliability of communication protocols. Discret. Math. 342 (10) (2019)
André Kündgen, Tonya Talbot
Nonrepetitive edge-colorings of trees. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
André Kündgen, Binlong Li, Carsten Thomassen
Cycles through all finite vertex sets in infinite graphs. Eur. J. Comb. 65 (2017)
André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
Finding Minors in Graphs with a Given Path Structure. J. Graph Theory 79 (1) (2015)
Sebastian M. Cioaba, André Kündgen
Covering Complete Hypergraphs with Cuts of Minimum Total Size. Graphs Comb. 28 (1) (2012)
André Kündgen, Gregor Leander, Carsten Thomassen
Switchings, extensions, and reductions in central digraphs. J. Comb. Theory, Ser. A 118 (7) (2011)
André Kündgen, R. Bruce Richter
On 2-factors with long cycles in cubic graphs. Ars Math. Contemp. 4 (1) (2011)
Sebastian M. Cioaba, André Kündgen, Craig Timmons, Vladislav V. Vysotsky
-Graphs. Comb. Probab. Comput. 20 (4) (2011)
André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
k-Robust Single-Message Transmission. SIAM J. Discret. Math. 24 (1) (2010)
André Kündgen, Craig Timmons
Star coloring planar graphs from small lists. J. Graph Theory 63 (4) (2010)
Hal A. Kierstead, André Kündgen, Craig Timmons
Star coloring bipartite planar graphs. J. Graph Theory 60 (1) (2009)
Sebastian M. Cioaba, André Kündgen, Jacques Verstraëte
On decompositions of complete hypergraphs. J. Comb. Theory, Ser. A 116 (7) (2009)
André Kündgen, Michael J. Pelsmajer
Nonrepetitive colorings of graphs of bounded tree-width. Discret. Math. 308 (19) (2008)
Joan P. Hutchinson, André Kündgen
Orthogonal art galleries with interior walls. Discret. Appl. Math. 154 (11) (2006)
Zoltán Füredi, André Kündgen
Moments of graphs in monotone families. J. Graph Theory 51 (1) (2006)
André Kündgen, Megan Spangler
A bound on the total size of a cut cover. Discret. Math. 296 (1) (2005)
Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
Graph Minors and Reliable Single Message Transmission. SIAM J. Discret. Math. 19 (4) (2005)
André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
k-Robust Single-Message Transmission. CAAN (2004)
Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi
's. Electron. J. Comb. 11 (1) (2004)
Maria Axenovich, Tao Jiang, André Kündgen
Bipartite anti-Ramsey numbers of cycles. J. Graph Theory 47 (1) (2004)
André Kündgen, Radhika Ramamurthi, Reiner Martin
Maximal Paths in Bipartite Graphs: 10920. Am. Math. Mon. 110 (8) (2003)
Mariko Hagita, André Kündgen, Douglas B. West
Probabilistic Methods for Decomposition Dimension of Graphs. Graphs Comb. 19 (4) (2003)
André Kündgen
Minimum average distance subsets in the hamming cube. Discret. Math. 249 (1-3) (2002)
André Kündgen, Radhika Ramamurthi
Coloring Face-Hypergraphs of Graphs on Surfaces. J. Comb. Theory, Ser. B 85 (2) (2002)
André Kündgen, Radhika Ramamurthi
Problem 10920. Am. Math. Mon. 109 (1) (2002)
André Kündgen, Michael Molloy
Extremal problems for chromatic neighborhood sets. J. Graph Theory 40 (1) (2002)
Zoltán Füredi, André Kündgen
Turán problems for integer-weighted graphs. J. Graph Theory 40 (4) (2002)
Maria Axenovich, André Kündgen
On a Generalized Anti-Ramsey Problem. Comb. 21 (3) (2001)
Daniel Kobler, André Kündgen
Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs. Electron. J. Comb. 8 (1) (2001)
André Kündgen, Dhruv Mubayi, Prasad Tetali
Minimal Completely Separating Systems of k-Sets. J. Comb. Theory, Ser. A 93 (1) (2001)
Zoltán Füredi, André Kündgen
Covering a graph with cuts of minimum total size. Discret. Math. 237 (1-3) (2001)
Jerrold R. Griggs, Michael Woltermann, B. Borchers, David Callan, Robin J. Chapman, J. Chilcott, Paul Cull, A. Ferguson, K. Martin, G. G. Gagola, Solomon W. Golomb, J. Guilford, S. Louis Hakimi, Edward F. Schmeichel, J. K. Haugland, C. H. Jepson, R. Johnsonbaugh, André Kündgen, S. Levandosky, J. T. Lewis, John H. Lindsey II, O. P. Lossers, Reiner Martin, R. Morris, Gerald Myerson, José Heber Nieto, E. Rykken, J. Sorensen, J. Schlosberg, W. Seaman, J. T. Ward, Z. Zeuge
Tiling Rectangles with Trominoes: 10641. Am. Math. Mon. 107 (2) (2000)
David Callan, Knut Dale, Ivar Skau, John Henry Steelman, Jany C. Binz, Robin J. Chapman, F. Herzig, André Kündgen, Reiner Martin, José Heber Nieto, O. A. Saleh, S. Byrd, Edward F. Schmeichel, Isaac Sofair, Michael Vowe
An Identity Involving Derangements: 10643. Am. Math. Mon. 107 (3) (2000)
Hirotsugu Asari, Tao Jiang, André Kündgen, Douglas B. West
Perfection thickness of graphs. Discret. Math. 215 (2000)
André Kündgen, Eric Mendelsohn, Vitaly I. Voloshin
Colouring Planar Mixed Hypergraphs. Electron. J. Comb. 7 (2000)
André Kündgen
Art Galleries with Interior Walls. Discret. Comput. Geom. 22 (2) (1999)
André Kündgen
Covering cliques with spanning bicliques. J. Graph Theory 27 (4) (1998)