Henning Bruhn - RankMe

57 papers A* 1B 2Journal 54

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Even A-cycles have the edge-Erdős-Pósa property. J. Graph Theory Henning Bruhn
2022	J	`jnl`	Packing A-paths of length zero modulo four. Eur. J. Comb. Henning Bruhn, Arthur Ulmer
2021	J	`jnl`	Erdös-Pósa Property for Labeled Minors: 2-Connected Minors. SIAM J. Discret. Math. Henning Bruhn, Felix Joos, Oliver Schaudt
2021	J	`jnl`	K SIAM J. Discret. Math. Henning Bruhn, Matthias Heinlein
2021	J	`jnl`	The Edge-Erdős-Pósa Property. Comb. Henning Bruhn, Matthias Heinlein, Felix Joos
2019	J	`jnl`	Long Cycles have the Edge-Erdős-Pósa Property. Comb. Henning Bruhn, Matthias Heinlein, Felix Joos
2018	J	`jnl`	A Stronger Bound for the Strong Chromatic Index. Comb. Probab. Comput. Henning Bruhn, Felix Joos
2018	J	`jnl`	Chromatic Index, Treewidth and Maximum Degree. Electron. J. Comb. Henning Bruhn, Laura Gellert, Richard Lang
2018	J	`jnl`	Frames, A-Paths, and the Erdös-Pósa Property. SIAM J. Discret. Math. Henning Bruhn, Matthias Heinlein, Felix Joos
2018	J	`jnl`	Long cycles through prescribed vertices have the Erdős-Pósa property. J. Graph Theory Henning Bruhn, Felix Joos, Oliver Schaudt
2017	J	`jnl`	Fast Algorithms for Delta-Separated Sparsity Projection. CoRR Henning Bruhn, Oliver Schaudt
2017	J	`jnl`	Jacobsthal Numbers in Generalized Petersen Graphs. J. Graph Theory Henning Bruhn, Laura Gellert, Jacob Günther
2017	J	`jnl`	K Electron. Notes Discret. Math. Henning Bruhn, Matthias Heinlein
2017	J	`jnl`	The union-closed sets conjecture almost holds for almost all random bipartite graphs. Eur. J. Comb. Henning Bruhn, Oliver Schaudt
2017	J	`jnl`	t-Perfection in P SIAM J. Discret. Math. Henning Bruhn, Elke Fuchs
2016	J	`jnl`	Chromatic index, treewidth and maximum degree. Electron. Notes Discret. Math. Henning Bruhn, Laura Gellert, Richard Lang
2016	J	`jnl`	Claw-Free t-Perfect Graphs Can Be Recognized in Polynomial Time. SIAM J. Discret. Math. Henning Bruhn, Oliver Schaudt
2016	J	`jnl`	List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. J. Graph Theory Henning Bruhn, Richard Lang, Maya Stein
2016	J	`jnl`	Structural Parameterizations for Boxicity. Algorithmica Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
2015	J	`jnl`	A stronger bound for the strong chromatic index. CoRR Henning Bruhn, Felix Joos
2015	J	`jnl`	A stronger bound for the strong chromatic index. Electron. Notes Discret. Math. Henning Bruhn, Felix Joos
2015	J	`jnl`	Jacobsthal numbers in generalised Petersen graphs. Electron. Notes Discret. Math. Henning Bruhn, Laura Gellert, Jacob Günther
2015	J	`jnl`	The Journey of the Union-Closed Sets Conjecture. Graphs Comb. Henning Bruhn, Oliver Schaudt
2015	J	`jnl`	The graph formulation of the union-closed sets conjecture. Eur. J. Comb. Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle
2014	B	`conf`	Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. IPCO Henning Bruhn, Oliver Schaudt
2014	J	`jnl`	Matroid and Tutte-connectivity in Infinite Graphs. Electron. J. Comb. Henning Bruhn
2014	J	`jnl`	Minimal bricks have many vertices of small degree. Eur. J. Comb. Henning Bruhn, Maya Stein
2014	B	`conf`	Structural Parameterizations for Boxicity. WG Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
2013	J	`jnl`	Claw-free t-perfect graphs can be recognised in polynomial time. CoRR Henning Bruhn, Oliver Schaudt
2013	J	`jnl`	Colouring stability two unit disk graphs. Contributions Discret. Math. Henning Bruhn
2013	J	`jnl`	Small degree vertices in minimal bricks. Electron. Notes Discret. Math. Henning Bruhn, Maya Stein
2013	J	`jnl`	The journey of the union-closed sets conjecture. CoRR Henning Bruhn, Oliver Schaudt
2012	J	`jnl`	Clique or hole in claw-free graphs. J. Comb. Theory B Henning Bruhn, Akira Saito
2012	J	`jnl`	Finite connectivity in infinite matroids. Eur. J. Comb. Henning Bruhn, Paul Wollan
2012	J	`jnl`	On claw-free t-perfect graphs. Math. Program. Henning Bruhn, Maya Stein
2011	J	`jnl`	Eulerian edge sets in locally finite graphs. Comb. Eli Berger, Henning Bruhn
2011	J	`jnl`	Infinite matroids in graphs. Discret. Math. Henning Bruhn, Reinhard Diestel
2011	J	`jnl`	Twins of rayless graphs. J. Comb. Theory B Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
2010	J	`jnl`	Duality of Ends. Comb. Probab. Comput. Henning Bruhn, Maya Jakobine Stein
2010	J	`jnl`	Every rayless graph has an unfriendly partition. Comb. Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
2010	J	`jnl`	t-Perfection Is Always Strong for Claw-Free Graphs. SIAM J. Discret. Math. Henning Bruhn, Maya Stein
2009	J	`jnl`	Bicycles and left-right tours in locally finite graphs. Eur. J. Comb. Henning Bruhn, Stefanie Kosuch, Melanie Win Myint
2009	J	`jnl`	Characterising claw-free t-perfect graphs. Electron. Notes Discret. Math. Maya Stein, Henning Bruhn
2009	J	`jnl`	Every rayless graph has an unfriendly partition. Electron. Notes Discret. Math. Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
2009	J	`jnl`	MacLane's theorem for arbitrary surfaces. J. Comb. Theory B Henning Bruhn, Reinhard Diestel
2008	J	`jnl`	Degree Constrained Orientations in Countable Graphs. Electron. J. Comb. Attila Bernáth, Henning Bruhn
2008	J	`jnl`	Hamilton Cycles in Planar Locally Finite Graphs. SIAM J. Discret. Math. Henning Bruhn, Xingxing Yu
2008	J	`jnl`	Periodical states and marching groups in a closed owari. Discret. Math. Henning Bruhn
2008	J	`jnl`	Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. Theory Comput. Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall
2007	J	`jnl`	On end degrees and infinite cycles in locally finite graphs. Comb. Henning Bruhn, Maya Stein
2007	A*	`conf`	Single source multiroute flows and cuts on uniform capacity networks. SODA Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman
2006	J	`jnl`	Duality in Infinite Graphs. Comb. Probab. Comput. Henning Bruhn, Reinhard Diestel
2006	J	`jnl`	MacLane's planarity criterion for locally finite graphs. J. Comb. Theory B Henning Bruhn, Maya Jakobine Stein
2005	J	`jnl`	Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. J. Graph Theory Henning Bruhn, Reinhard Diestel, Maya Stein
2005	J	`jnl`	Menger's theorem for infinite graphs with ends. J. Graph Theory Henning Bruhn, Reinhard Diestel, Maya Stein
2004	J	`jnl`	The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits. J. Comb. Theory B Henning Bruhn
2003	J	`jnl`	Generating cycles in graphs with at most one end. J. Graph Theory Henning Bruhn