Jochen Harant
Orcid: 0000-0003-0456-624X
According to our database1,
Jochen Harant
authored at least 69 papers
between 1981 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
1
1
1
1
3
1
1
1
4
2
3
2
3
3
5
3
3
2
2
2
2
3
4
1
4
3
1
1
1
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
2023
Discuss. Math. Graph Theory, 2023
2022
2021
J. Graph Algorithms Appl., 2021
2020
J. Graph Theory, 2020
J. Graph Algorithms Appl., 2020
Discuss. Math. Graph Theory, 2020
2019
Discuss. Math. Graph Theory, 2019
2018
2017
2016
Electron. Notes Discret. Math., 2016
Electron. Notes Discret. Math., 2016
Discret. Appl. Math., 2016
2015
2014
Discret. Appl. Math., 2014
2013
Discret. Appl. Math., 2013
2012
2011
J. Graph Theory, 2011
2010
Discuss. Math. Graph Theory, 2010
Discret. Math., 2010
Discret. Math., 2010
On Hamiltonian Cycles through Prescribed Edges of a Planar Graph.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
Discret. Math., 2009
2008
Discuss. Math. Graph Theory, 2008
Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New Approach.
Proceedings of the Research Trends in Combinatorial Optimization, 2008
2007
2006
Discuss. Math. Graph Theory, 2006
2005
2004
2002
Discret. Math., 2002
2001
On weights of induced paths and cycles in claw-free and <i>K</i><sub>1</sub><sub><i>, r</i></sub>-free graphs.
J. Graph Theory, 2001
Discret. Math., 2001
2000
Discuss. Math. Graph Theory, 2000
1999
1998
Discret. Math., 1998
1996
5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one.
Discret. Math., 1996
1995
1994
Discret. Appl. Math., 1994
1993
1981