default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré Kündgen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j38]John Gimbel, André Kündgen
, Michael Molloy:
Fractional Cocoloring of Graphs. Graphs Comb. 38(3): 64 (2022)
2010 – 2019
- 2019
- [j37]André Kündgen, Janina Silvana P. Patno:
Expected reliability of communication protocols. Discret. Math. 342(10): 2867-2874 (2019) - [j36]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): 1415-1430 (2019) - 2017
- [j35]André Kündgen, Tonya Talbot:
Nonrepetitive edge-colorings of trees. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j34]André Kündgen, Binlong Li, Carsten Thomassen:
Cycles through all finite vertex sets in infinite graphs. Eur. J. Comb. 65: 259-275 (2017) - 2015
- [j33]André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
Finding Minors in Graphs with a Given Path Structure. J. Graph Theory 79(1): 30-47 (2015) - 2012
- [j32]Sebastian M. Cioaba, André Kündgen:
Covering Complete Hypergraphs with Cuts of Minimum Total Size. Graphs Comb. 28(1): 109-122 (2012) - 2011
- [j31]André Kündgen, R. Bruce Richter:
On 2-factors with long cycles in cubic graphs. Ars Math. Contemp. 4(1): 79-93 (2011) - [j30]Sebastian M. Cioaba, André Kündgen, Craig Timmons, Vladislav V. Vysotsky:
Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs. Comb. Probab. Comput. 20(4): 519-527 (2011) - [j29]André Kündgen, Gregor Leander, Carsten Thomassen:
Switchings, extensions, and reductions in central digraphs. J. Comb. Theory A 118(7): 2025-2034 (2011) - 2010
- [j28]André Kündgen, Craig Timmons:
Star coloring planar graphs from small lists. J. Graph Theory 63(4): 324-337 (2010) - [j27]André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
k-Robust Single-Message Transmission. SIAM J. Discret. Math. 24(1): 301-321 (2010)
2000 – 2009
- 2009
- [j26]Sebastian M. Cioaba, André Kündgen, Jacques Verstraëte:
On decompositions of complete hypergraphs. J. Comb. Theory A 116(7): 1232-1234 (2009) - [j25]Hal A. Kierstead, André Kündgen, Craig Timmons:
Star coloring bipartite planar graphs. J. Graph Theory 60(1): 1-10 (2009) - 2008
- [j24]André Kündgen, Michael J. Pelsmajer:
Nonrepetitive colorings of graphs of bounded tree-width. Discret. Math. 308(19): 4473-4478 (2008) - 2006
- [j23]Joan P. Hutchinson, André Kündgen:
Orthogonal art galleries with interior walls. Discret. Appl. Math. 154(11): 1563-1569 (2006) - [j22]Zoltán Füredi, André Kündgen:
Moments of graphs in monotone families. J. Graph Theory 51(1): 37-48 (2006) - 2005
- [j21]André Kündgen, Megan Spangler:
A bound on the total size of a cut cover. Discret. Math. 296(1): 121-128 (2005) - [j20]Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
Graph Minors and Reliable Single Message Transmission. SIAM J. Discret. Math. 19(4): 815-847 (2005) - 2004
- [j19]Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi:
Coloring with no 2-Colored P4's. Electron. J. Comb. 11(1) (2004) - [j18]Maria Axenovich, Tao Jiang, André Kündgen:
Bipartite anti-Ramsey numbers of cycles. J. Graph Theory 47(1): 9-28 (2004) - [c1]André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi:
k-Robust Single-Message Transmission. CAAN 2004: 90-101 - 2003
- [j17]Mariko Hagita, André Kündgen, Douglas B. West:
Probabilistic Methods for Decomposition Dimension of Graphs. Graphs Comb. 19(4): 493-503 (2003) - [j16]André Kündgen, Radhika Ramamurthi, Reiner Martin:
Maximal Paths in Bipartite Graphs: 10920. Am. Math. Mon. 110(8): 747 (2003) - 2002
- [j15]André Kündgen:
Minimum average distance subsets in the hamming cube. Discret. Math. 249(1-3): 149-165 (2002) - [j14]André Kündgen, Radhika Ramamurthi:
Coloring Face-Hypergraphs of Graphs on Surfaces. J. Comb. Theory B 85(2): 307-337 (2002) - [j13]André Kündgen, Michael Molloy:
Extremal problems for chromatic neighborhood sets. J. Graph Theory 40(1): 68-74 (2002) - [j12]Zoltán Füredi, André Kündgen:
Turán problems for integer-weighted graphs. J. Graph Theory 40(4): 195-225 (2002) - [j11]André Kündgen, Radhika Ramamurthi:
Problem 10920. Am. Math. Mon. 109(1): 78 (2002) - 2001
- [j10]Maria Axenovich, André Kündgen:
On a Generalized Anti-Ramsey Problem. Comb. 21(3): 335-349 (2001) - [j9]Daniel Kobler, André Kündgen:
Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs. Electron. J. Comb. 8(1) (2001) - [j8]Zoltán Füredi, André Kündgen:
Covering a graph with cuts of minimum total size. Discret. Math. 237(1-3): 129-148 (2001) - [j7]André Kündgen, Dhruv Mubayi, Prasad Tetali:
Minimal Completely Separating Systems of k-Sets. J. Comb. Theory A 93(1): 192-198 (2001) - 2000
- [j6]André Kündgen, Eric Mendelsohn, Vitaly I. Voloshin:
Colouring Planar Mixed Hypergraphs. Electron. J. Comb. 7 (2000) - [j5]Hirotsugu Asari, Tao Jiang, André Kündgen, Douglas B. West:
Perfection thickness of graphs. Discret. Math. 215: 263-264 (2000) - [j4]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): 179 (2000) - [j3]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): 278-279 (2000)
1990 – 1999
- 1999
- [j2]André Kündgen:
Art Galleries with Interior Walls. Discret. Comput. Geom. 22(2): 249-258 (1999) - 1998
- [j1]André Kündgen:
Covering cliques with spanning bicliques. J. Graph Theory 27(4): 223-227 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
