Frank Göring

25 papers B 1Journal 23Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
Properties of uniformly 3-connected graphs.
Discret. Math. Theor. Comput. Sci.
Frank Göring, Tobias Hofmann
2022 J jnl
The edge-transitive polytopes that are not vertex-transitive.
Ars Math. Contemp.
Frank Göring, Martin Winter
2022 J jnl
Uniformly connected graphs.
J. Graph Theory
Frank Göring, Tobias Hofmann, Manuel Streicher
2016 J jnl
Unique-maximum coloring of plane graphs.
Discuss. Math. Graph Theory
Igor Fabrici, Frank Göring
2013 J jnl
On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations.
SIAM J. Optim.
Frank Göring, Christoph Helmberg, Susanna Reiss
2013 J jnl
Prescribed edges and forbidden edges for a cycle in a planar graph.
Discret. Appl. Math.
Frank Göring, Jochen Harant
2012 J jnl
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian.
Math. Program.
Frank Göring, Christoph Helmberg, Susanna Reiss
2012 J jnl
The potential of greed for independence.
J. Graph Theory
Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach
2011 B conf
GreedyMAX-type Algorithms for the Maximum Independent Set Problem.
SOFSEM
Piotr Borowiecki, Frank Göring
2011 J jnl
The rotational dimension of a graph.
J. Graph Theory
Frank Göring, Christoph Helmberg, Markus Wappler
2010 J jnl
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs.
Discret. Math.
Frank Göring, Jochen Harant
2010 J jnl
Random Procedures for Dominating Sets in Graphs.
Electron. J. Comb.
Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
2009 J jnl
Learning of winning strategies for terminal games with linear-size memory.
Int. J. Game Theory
Thomas Böhme, Frank Göring, Zsolt Tuza, Herwig Unger
2009 J jnl
On
Discuss. Math. Graph Theory
Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
2008 J jnl
Embedded in the Shadow of the Separator.
SIAM J. Optim.
Frank Göring, Christoph Helmberg, Markus Wappler
2008 — conf
Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach.
Bonn Workshop of Combinatorial Optimization
Frank Göring, Jochen Harant
2007 J jnl
Local Topological Toughness and Local Factors.
Graphs Comb.
Frank Göring, Gyula Y. Katona
2006 J jnl
On cycles through specified vertices.
Discret. Math.
Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác
2006 J jnl
The rotational Dimension of a graph.
Electron. Notes Discret. Math.
Frank Göring, Christoph Helmberg, Markus Wappler
2005 J jnl
On Domination in Graphs.
Discuss. Math. Graph Theory
Frank Göring, Jochen Harant
2004 J jnl
On short cycles through prescribed vertices of a graph.
Discret. Math.
Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza
2002 J jnl
A proof of Menger's Theorem by contraction.
Discuss. Math. Graph Theory
Frank Göring
2002 J jnl
On 2-regular subgraphs in polyhedral graphs.
Discret. Math.
Frank Göring
2001 J jnl
Menger's Theorem.
J. Graph Theory
Thomas Böhme, Frank Göring, Jochen Harant
2000 J jnl
Short proof of Menger's Theorem.
Discret. Math.
Frank Göring