Frank Göring

Publication Activity (10 Years)

Years Active: 2000-2022
Publications (10 Years): 3

Top Topics

Spectral Graph Partitioning

Top Venues

Discret. Appl. Math.

Ars Math. Contemp.

Discuss. Math. Graph Theory

Publications

Frank Göring, Martin Winter
The edge-transitive polytopes that are not vertex-transitive. Ars Math. Contemp. 23 (2) (2022)
Frank Göring, Tobias Hofmann, Manuel Streicher
Uniformly connected graphs. J. Graph Theory 101 (2) (2022)
Igor Fabrici, Frank Göring
Unique-maximum coloring of plane graphs. Discuss. Math. Graph Theory 36 (1) (2016)
Frank Göring, Jochen Harant
Prescribed edges and forbidden edges for a cycle in a planar graph. Discret. Appl. Math. 161 (12) (2013)
Frank Göring, Christoph Helmberg, Susanna Reiss
On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations. SIAM J. Optim. 23 (2) (2013)
Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach
The potential of greed for independence. J. Graph Theory 71 (3) (2012)
Frank Göring, Christoph Helmberg, Susanna Reiss
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian. Math. Program. 131 (1-2) (2012)
Frank Göring, Christoph Helmberg, Markus Wappler
The rotational dimension of a graph. J. Graph Theory 66 (4) (2011)
Piotr Borowiecki, Frank Göring
GreedyMAX-type Algorithms for the Maximum Independent Set Problem. SOFSEM (2011)
Frank Göring, Jochen Harant
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. Discret. Math. 310 (9) (2010)
Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
Random Procedures for Dominating Sets in Graphs. Electron. J. Comb. 17 (1) (2010)
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) (2009)
Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
-independence in graphs. Discuss. Math. Graph Theory 29 (2) (2009)
Frank Göring, Jochen Harant
Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach. Bonn Workshop of Combinatorial Optimization (2008)
Frank Göring, Christoph Helmberg, Markus Wappler
Embedded in the Shadow of the Separator. SIAM J. Optim. 19 (1) (2008)
Frank Göring, Gyula Y. Katona
Local Topological Toughness and Local Factors. Graphs Comb. 23 (4) (2007)
Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác
On cycles through specified vertices. Discret. Math. 306 (8-9) (2006)
Frank Göring, Christoph Helmberg, Markus Wappler
The rotational Dimension of a graph. Electron. Notes Discret. Math. 27 (2006)
Frank Göring, Jochen Harant
On Domination in Graphs. Discuss. Math. Graph Theory 25 (1-2) (2005)
Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza
On short cycles through prescribed vertices of a graph. Discret. Math. 286 (1-2) (2004)
Frank Göring
On 2-regular subgraphs in polyhedral graphs. Discret. Math. 251 (1-3) (2002)
Frank Göring
A proof of Menger's Theorem by contraction. Discuss. Math. Graph Theory 22 (1) (2002)
Thomas Böhme, Frank Göring, Jochen Harant
Menger's Theorem. J. Graph Theory 37 (1) (2001)
Frank Göring
Short proof of Menger's Theorem. Discret. Math. 219 (1-3) (2000)