Search the dblp DataBase
André Kündgen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
k-Robust Single-Message Transmission. [Citation Graph (0, 0)][DBLP]
CAAN, 2004, pp:90-101 [Conf] - Maria Axenovich, André Kündgen
On a Generalized Anti-Ramsey Problem. [Citation Graph (0, 0)][DBLP]
Combinatorica, 2001, v:21, n:3, pp:335-349 [Journal] - Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi
Coloring with no 2-Colored P4's. [Citation Graph (0, 0)][DBLP]
Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal] - André Kündgen, Eric Mendelsohn, Vitaly I. Voloshin
Colouring Planar Mixed Hypergraphs. [Citation Graph (0, 0)][DBLP]
Electr. J. Comb., 2000, v:7, n:, pp:- [Journal] - Daniel Kobler, André Kündgen
Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs. [Citation Graph (0, 0)][DBLP]
Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal] - Joan Hutchinson, André Kündgen
Orthogonal art galleries with interior walls. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2006, v:154, n:11, pp:1563-1569 [Journal] - André Kündgen
Art Galleries with Interior Walls. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1999, v:22, n:2, pp:249-258 [Journal] - Hirotsugu Asari, Tao Jiang, André Kündgen, Douglas B. West
Perfection thickness of graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2000, v:215, n:, pp:263-264 [Journal] - Zoltán Füredi, André Kündgen
Covering a graph with cuts of minimum total size. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2001, v:237, n:1-3, pp:129-148 [Journal] - André Kündgen
Minimum average distance subsets in the hamming cube. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2002, v:249, n:1-3, pp:149-165 [Journal] - André Kündgen, Megan Spangler
A bound on the total size of a cut cover. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 2005, v:296, n:1, pp:121-128 [Journal] - Mariko Hagita, André Kündgen, Douglas B. West
Probabilistic Methods for Decomposition Dimension of Graphs. [Citation Graph (0, 0)][DBLP]
Graphs and Combinatorics, 2003, v:19, n:4, pp:493-503 [Journal] - André Kündgen, Dhruv Mubayi, Prasad Tetali
Minimal Completely Separating Systems of k-Sets. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 2001, v:93, n:1, pp:192-198 [Journal] - André Kündgen, Radhika Ramamurthi
Coloring Face-Hypergraphs of Graphs on Surfaces. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 2002, v:85, n:2, pp:307-337 [Journal] - Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
Graph Minors and Reliable Single Message Transmission. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2005, v:19, n:4, pp:815-847 [Journal] - Zoltán Füredi, André Kündgen
Moments of graphs in monotone families. [Citation Graph (0, 0)][DBLP]
Journal of Graph Theory, 2006, v:51, n:1, pp:37-48 [Journal] - Maria Axenovich, Tao Jiang, André Kündgen
Bipartite anti-Ramsey numbers of cycles. [Citation Graph (0, 0)][DBLP]
Journal of Graph Theory, 2004, v:47, n:1, pp:9-28 [Journal]
Nonrepetitive colorings of graphs of bounded tree-width. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002