88 Infos zu Jochen Harant

3 Aktuelle Nachrichten

Technologieregion Ilmenau-Arnstadt

Dr. Jochen Harant Technische Universität :00 Uhr, Dr. Joachim Schoeck Sulzer Innotec Uni Köln, Lehrvortrag: Die Michaelis-Menten-Gleichungen ...

1 Firmen-Mitarbeiter

Jochen Harant i. R. Besucheranschrift: (Curiebau) Ilmenau. Postanschrift: Postfach Ilmenau. jochen.Missing: Pennewitz" | Must include:Pennewitz" Jochen Harant i. R. Besucheranschrift: (Curiebau) Ilmenau. Postanschrift: Postfach Ilmenau. jochen. Missing: Pennewitz" | Must include:Pennewitz"

1 Infos zur Ausbildung

Professur Algorithmische und Diskrete Mathematik: Algorithmische und Diskrete Mathematik

2 Angaben zur Herkunft

According to our current on-line database, Jochen Harant has 5 students and 5 descendants. We welcome any additional information. If you have additional ...

11 Bücher zum Namen

Ellibs Ebookstore - Ebook: Research Trends in Combinatorial Optimization - Author: Cook, William - Price: 111,54€

Title, Packing of Induced Subgraphs Preprint, Technische Universität Chemnitz Fakultät für Mathematik. Authors, Jochen Harant, Sebastian Richter, Horst Sachs. Publisher, Techn. Univ., Fak. für Mathematik, Length, 15 pages. Export Citation, BiBTeX EndNote RefMan ...

Herzlich verbunden bin ich den Herren Dipl.-Math. GEoRGEHNERT, Dr. HANS-JOACHIM FINCK and cand. math. JoCHEN HARANT für ihre Hilfe beim Lesen ...

By (author) Stanislav Jendrol , By (author) Jochen Harant , By (author) Igor Fabrici , Series edited by Zuhair Nashed , Series edited by Earl Taft.

8 Dokumente

:41:02 Bachelor Informatik erstellt aus dem Fächerkatalog-Repsitory am: Modulhandbuch des Studiengangs

Authors:Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt. (Submitted on 25 Jun (v1), last revised 14 Nov (this version, v2)).

Dec 11, · Mitgliedsgemeinden: Gehren (Jesuborn, Möhrenbach) m Pennewitz ... Dr. Dr. h.c. Jochen Harant, Großbreitenbacher Straße. 4a, Pennewitz ...

Title: On Selkow's Bound on the Independence Number of Graphs. Authors: Jochen Harant, Samuel Mohr. (Submitted on 9 May 2017). Abstract: For a graph with vertex set and independence number , S. M. Selkow (Discrete Mathematics, 132(1994) ) established the famous lower bound on , where and denote the ...

15 Wissenschaftliche Publikationen

Jochen Harant Angela Hellemeister Michael Hoschek Stanislav Jendrol' Torsten Korneffel Arie Koster Bodo Lass Liwei Li Sebastian Milz Jaroslav Nešetřil Tuan-Anh ...

Thomas Bohme | Jochen Harant | th Cracow Conference on Graph Theory, Rytro Rafal Kalinowski | Monika Pilsniak | ... View All. 不论您是正在查找 ...

List of computer science publications by Jochen Harant

(joint work with Jochen Harant). Electronic Notes in Discrete Mathematics 53 (2016) Doi: j.endm Sum List Edge Colorings of ...

2 Allgemeine Veröffentlichungen

On the Existence of Specific Stars in Planar Graphs. Authors; Authors and affiliations. Jochen Harant; Stanislav Jendrol' Email author. Jochen Harant. 1.

On cycles and independence in graphs [Elektronische Ressource] / Friedrich Regen. Gutachter: Jochen Harant ; Eberhard Triesch. Betreuer: Dieter Rautenbach : TECHNISCHE UNIVERSITÄT ILMENAUFAKULTÄT FÜR MATHEMATIK UND NATURWISSENSCHAFTENINSTITUT FÜR MATHEMATIKOn Cycles and ...

2 Meinungen & Artikel

Граф Аполлония — это неориентированный граф, образованный рекурсивным Thomas Böhme, Jochen Harant, Michal Tkáč More than one tough chordal planar graphs are Hamiltonian // Journal of Graph Theory. — — Т. 32, вып.

Posts about lower bound theory written by C. E. Larson

42 Webfunde aus dem Netz

Mathematik und Praxis Mathematik lebendig und gesellig Herausgeber: Institut für Mathematik der TU Ilmenau Direktor des Instituts Prof. Dr. rer. nat. habil....

Jochen Harant's Publications submitted papers are available as PS-files ; Van Bang Le's Publications and Preprints preprints and submitted papers are partly available as

Jochen Harant Kontaktadresse Prof. Dr. Silvia Vogel (Geschäftsführer) Tele – PD Dr. Werner Neundorf ...

Download Polyhedral Graphs (Pure And Applied Mathematics) - Stanislav Jendrol, Jochen Harant, Igor Fabrici on thidoper.cf.

Nach einem Jahr Berufstätigkeit wechselte Frau Meyer zum Kölner ... Dr. Jochen Harant studierte von Mathematik an der damaligen TH Ilmenau, gefolgt von ...

Dr. Dr. h.c. Jochen HarantPennewitz zum Anbau eines unbeheizten Wintergartens in der Gemarkung Pennewitz, Flur 4, ...

Aug 17, · Ein gewichtiges Stück Familien- und auch Heimatgeschichte vor der Haustür haben Sabine und Jochen Harant in Pennewitz.

Closures, Cycles, and Paths Jochen Harant,1 Arnfried Kemnitz,2 Akira Saito,3 and Ingo Schiermeyer4 1INSTITUT FUR MATHEMATIK TECHNISCHE UNIVERSITAT ILMENAU,

Similar topics of scientific paper in Mathematics , author of scholarly article — Igor Fabrici, Jochen Harant, Stanislav Jendrol', Roman Soták. A note on face ...

JOURNAL OF COMBINATORIAI THEORY, %!fieS B 30, (1981) Note On the Radius of Graphs JOCHEN HARANT AND HANSJOACHIM WALTHER …

Jiří Fiala (Prague, CZE), Jun Fujisawa (Tokyo, JPN), Jochen Harant (Ilmenau, GER). František Kardoš (Bordeaux, FRA), Arnfried Kemnitz (Braunschweig, GER) ...

Jochen Harant, Matthias Kriesell, and Michael Stiebitz. Ilmenau, Germany. November 7--8, Utrecht Combinatorics Workshop. Ross J. Kang and Tobias ...

JOCHEN HARANT, Technical University of Ilmenau Packing of isomorphic induced independent subgraphs [PDF] [SLIDES]: Lower bounds on the ...

The neighbour-sum-distinguishing edge-colouring game. Panon Sinsap and Chariya Uiyyasathian. On Group Divisible Designs $\GDD(m,n;2,\lambda)$. Marcin Wrochna. Square-free graphs are multiplicative. Arnfried Kemnitz, Jochen Harant, Massimiliano Marangio and Margit Voigt. Bounds for the Sum Choice Number.

A list of links to homepages of graph theorists accompanied by data concerning location, reasearch interests and remarkable features

Title: Even Longer Cycles in Essentially 4-Connected Planar Graphs. Authors: Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt.

Jochen Harant · Heiko Harborth · Sven Hartmann · Egbert Harzheim · Christoph Helmberg · Martin Henk · Volker Heun · Winfried Hochst ttler · Stefan Hougardy.

Jochen Harant: A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs. Tibor Jordan: Body-bar graphs with unique d-dimensional realizations. Ken-ichi Kawarabayashi: Graphs without subdivisions. Zoltan Kiraly: Maximum number of cycles and hamiltonian cycles in sparse graphs

Lightweight paths in graphs. Jochen Harant Stanislav Jendrol'. Abstract. Let k be a positive integer, G be a graph on V(G) containing a path on k vertices, and w ...

... an algorithmic consequence of this result, we describe linear time algorithms which decide whether a given graph satisfies $\mu(G)-\nu(G)\leq k$ ($\mu(G)-\nu '(G)\leq k$) for some fixed $k\geq 0$ and also construct optimal cycle packings in this case. Observações: Joint work with Jochen Harant, Peter Recht, and Friedrich ...