 | 2012 |
|---|
| 25 |       | Sebastian M. Cioaba,
André Kündgen:
Covering Complete Hypergraphs with Cuts of Minimum Total Size.
Graphs and Combinatorics 28(1): 109-122 (2012) |
| 2011 |
|---|
| 24 | | Sebastian M. Cioaba,
André Kündgen,
Craig Timmons,
Vladislav V. Vysotsky:
Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs.
Combinatorics, Probability & Computing 20(4): 519-527 (2011) |
| 23 | | André Kündgen,
Gregor Leander,
Carsten Thomassen:
Switchings, extensions, and reductions in central digraphs.
J. Comb. Theory, Ser. A 118(7): 2025-2034 (2011) |
| 2010 |
|---|
| 22 | | André Kündgen,
Craig Timmons:
Star coloring planar graphs from small lists.
Journal of Graph Theory 63(4): 324-337 (2010) |
| 21 | | André Kündgen,
Michael J. Pelsmajer,
Radhika Ramamurthi:
k-Robust Single-Message Transmission.
SIAM J. Discrete Math. 24(1): 301-321 (2010) |
| 2009 |
|---|
| 20 | | Sebastian M. Cioaba,
André Kündgen,
Jacques Verstraëte:
On decompositions of complete hypergraphs.
J. Comb. Theory, Ser. A 116(7): 1232-1234 (2009) |
| 19 | | Hal A. Kierstead,
André Kündgen,
Craig Timmons:
Star coloring bipartite planar graphs.
Journal of Graph Theory 60(1): 1-10 (2009) |
| 2008 |
|---|
| 18 | | André Kündgen,
Michael J. Pelsmajer:
Nonrepetitive colorings of graphs of bounded tree-width.
Discrete Mathematics 308(19): 4473-4478 (2008) |
| 2006 |
|---|
| 17 | | Joan Hutchinson,
André Kündgen:
Orthogonal art galleries with interior walls.
Discrete Applied Mathematics 154(11): 1563-1569 (2006) |
| 16 | | Zoltán Füredi,
André Kündgen:
Moments of graphs in monotone families.
Journal of Graph Theory 51(1): 37-48 (2006) |
| 2005 |
|---|
| 15 | | André Kündgen,
Megan Spangler:
A bound on the total size of a cut cover.
Discrete Mathematics 296(1): 121-128 (2005) |
| 14 | | Faith Ellen Fich,
André Kündgen,
Michael J. Pelsmajer,
Radhika Ramamurthi:
Graph Minors and Reliable Single Message Transmission.
SIAM J. Discrete Math. 19(4): 815-847 (2005) |
| 2004 |
|---|
| 13 | | André Kündgen,
Michael J. Pelsmajer,
Radhika Ramamurthi:
k-Robust Single-Message Transmission.
CAAN 2004: 90-101 |
| 12 | | Michael O. Albertson,
Glenn G. Chappell,
Henry A. Kierstead,
André Kündgen,
Radhika Ramamurthi:
Coloring with no 2-Colored P4's.
Electr. J. Comb. 11(1): (2004) |
| 11 | | Maria Axenovich,
Tao Jiang,
André Kündgen:
Bipartite anti-Ramsey numbers of cycles.
Journal of Graph Theory 47(1): 9-28 (2004) |
| 2003 |
|---|
| 10 | | Mariko Hagita,
André Kündgen,
Douglas B. West:
Probabilistic Methods for Decomposition Dimension of Graphs.
Graphs and Combinatorics 19(4): 493-503 (2003) |
| 2002 |
|---|
| 9 | | André Kündgen:
Minimum average distance subsets in the hamming cube.
Discrete Mathematics 249(1-3): 149-165 (2002) |
| 8 | | André Kündgen,
Radhika Ramamurthi:
Coloring Face-Hypergraphs of Graphs on Surfaces.
J. Comb. Theory, Ser. B 85(2): 307-337 (2002) |
| 2001 |
|---|
| 7 | | Maria Axenovich,
André Kündgen:
On a Generalized Anti-Ramsey Problem.
Combinatorica 21(3): 335-349 (2001) |
| 6 | | Zoltán Füredi,
André Kündgen:
Covering a graph with cuts of minimum total size.
Discrete Mathematics 237(1-3): 129-148 (2001) |
| 5 | | Daniel Kobler,
André Kündgen:
Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs.
Electr. J. Comb. 8(1): (2001) |
| 4 | | André Kündgen,
Dhruv Mubayi,
Prasad Tetali:
Minimal Completely Separating Systems of k-Sets.
J. Comb. Theory, Ser. A 93(1): 192-198 (2001) |
| 2000 |
|---|
| 3 | | Hirotsugu Asari,
Tao Jiang,
André Kündgen,
Douglas B. West:
Perfection thickness of graphs.
Discrete Mathematics 215: 263-264 (2000) |
| 2 | | André Kündgen,
Eric Mendelsohn,
Vitaly I. Voloshin:
Colouring Planar Mixed Hypergraphs.
Electr. J. Comb. 7: (2000) |
| 1999 |
|---|
| 1 | | André Kündgen:
Art Galleries with Interior Walls.
Discrete & Computational Geometry 22(2): 249-258 (1999) |
Data released under the ODC-BY 1.0 license — See also our legal information page