Frank Göring

	2012
15		Frank Göring, Christoph Helmberg, Susanna Reiss: Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian. Math. Program. 131(1-2): 95-111 (2012)
	2011
14		Piotr Borowiecki, Frank Göring: GreedyMAX-type Algorithms for the Maximum Independent Set Problem. SOFSEM 2011: 146-156
13		Frank Göring, Christoph Helmberg, Markus Wappler: The rotational dimension of a graph. Journal of Graph Theory 66(4): 283-302 (2011)
	2010
12		Frank Göring, Jochen Harant: Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. Discrete Mathematics 310(9): 1491-1494 (2010)
11		Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer: Random Procedures for Dominating Sets in Graphs. Electr. J. Comb. 17(1): (2010)
	2009
10		Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer: On F-independence in graphs. Discussiones Mathematicae Graph Theory 29(2): 377-383 (2009)
9		Thomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger: Learning of winning strategies for terminal games with linear-size memory. Int. J. Game Theory 38(2): 155-168 (2009)
	2008
8		Frank Göring, Christoph Helmberg, Markus Wappler: Embedded in the Shadow of the Separator. SIAM Journal on Optimization 19(1): 472-501 (2008)
	2007
7		Frank Göring, Gyula Y. Katona: Local Topological Toughness and Local Factors. Graphs and Combinatorics 23(4): 387-399 (2007)
	2006
6		Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác: On cycles through specified vertices. Discrete Mathematics 306(8-9): 831-835 (2006)
5		Frank Göring, Christoph Helmberg, Markus Wappler: The rotational Dimension of a graph. Electronic Notes in Discrete Mathematics 27: 37-38 (2006)
	2005
4		Frank Göring, Jochen Harant: On Domination in Graphs. Discussiones Mathematicae Graph Theory 25(1-2): 7-12 (2005)
	2004
3		Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza: On short cycles through prescribed vertices of a graph. Discrete Mathematics 286(1-2): 67-74 (2004)
	2002
2		Frank Göring: On 2-regular subgraphs in polyhedral graphs. Discrete Mathematics 251(1-3): 97-102 (2002)
	2000
1		Frank Göring: Short proof of Menger's Theorem. Discrete Mathematics 219(1-3): 295-296 (2000)

Coauthor Index

1	Sarah Artmann	[11]
2	Thomas Böhme	[9]
3	Piotr Borowiecki	[14]
4	Tobias Gerlach	[6]
5	Jochen Harant	[3] [4] [6] [10] [11] [12]
6	Christoph Helmberg	[5] [8] [13] [15]
7	Erhard Hexel	[3]
8	Gyula Y. Katona	[7]
9	Dieter Rautenbach	[10] [11]
10	Susanna Reiss	[15]
11	Ingo Schiermeyer	[10] [11]
12	Michal Tkác	[6]
13	Zsolt Tuza	[3] [9]
14	Herwig Unger	[9]
15	Markus Wappler	[5] [8] [13]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page