The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

André Kündgen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
    k-Robust Single-Message Transmission. [Citation Graph (0, 0)][DBLP]
    CAAN, 2004, pp:90-101 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]

  18. Nonrepetitive colorings of graphs of bounded tree-width. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002