Publikationen von apl. Prof. Dr. Thomas Böhme

Publikationen der Lehrgruppe

Anzahl der Treffer: 55
Erstellt: Thu, 28 Mar 2024 23:09:14 +0100 in 0.3228 sec


Böhme, Thomas; Harant, Jochen; Kriesell, Matthias; Mohr, Samuel; Schmidt, Jens M.
Rooted minors and locally spanning subgraphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 105 (2024), 2, S. 209-229

Results on the existence of various types of spanning subgraphs of graphs are milestones in structural graph theory and have been diversified in several directions. In the present paper, we consider “local” versions of such statements. In 1966, for instance, D. W. Barnette proved that a 3-connected planar graph contains a spanning tree of maximum degree at most 3. A local translation of this statement is that if G is a planar graph, X is a subset of specified vertices of G such that X cannot be separated in G by removing two or fewer vertices of G, then G has a tree of maximum degree at most 3 containing all vertices of X. Our results constitute a general machinery for strengthening statements about k-connected graphs (for 1 ≤ k ≤ 4) to locally spanning versions, that is, subgraphs containing a set X ⊆ V (G) of a (not necessarily planar) graph G in which only X has high connectedness. Given a graph G and X ⊆ V (G), we say M is a minor of G rooted at X, if M is a minor of G such that each bag of M contains at most one vertex of X and X is a subset of the union of all bags. We show that G has a highly connected minor rooted at X if X ⊆ V (G) cannot be separated in G by removing a few vertices of G. Combining these investigations and the theory of Tutte paths in the planar case yields locally spanning versions of six well-known results about degree-bounded trees, Hamiltonian paths and cycles, and 2-connected subgraphs of graphs.



https://doi.org/10.1002/jgt.23012
Lutherdt, Stefan; Maron, Mandy; Hertlein, Anna; Henze, Nicola
Ein Ansatz für digitales, kompetenzorientiertes Prüfen in den Ingenieurwissenschaften. - Graz : Forum Neue Medien in der Lehre Austria (fnma). - 1 Online-Ressource (Seite 22-24)Online-Ausgabe: fnma Magazin. - Graz : Forum Neue Medien in der Lehre Austria (fnma), ISSN 2410-5244, (2023), 2

In dem Artikel wird ein Ansatz zur Verbesserung und Implementierung digitaler, kompetenzorientierter Prüfungsformate in ingenieurswissenschaftlichen Bachelorstudiengängen vorgestellt. Dazu wird das mit diesem Ziel geförderte Projekt examING des Zentralinstituts für Bildung der TU Ilmenau vorgestellt und die drei Säulen des Projekts erläutert. Zur Erarbeitung und Überprüfung von Lösungsansätzen wurden in allen Fakultäten der Universität insgesamt neun Teilprojekte initiiert, von denen eines (im FG Biomechatronik) zur Ausbildung der Bachelor in der Mechatronik und Biomedizinischen Technik näher vorgestellt wird.



https://doi.org/10.22032/dbt.57632
Kubek, Mario; Böhme, Thomas; Unger, Herwig
Empiric experiments with text-representing centroids. - In: Theory and application of text-representing centroids, (2019), S. 39-54

Kubek, Mario; Böhme, Thomas; Unger, Herwig
Spreading activation: a fast calculation method for text centroids. - In: Theory and application of text-representing centroids, (2019), S. 27-38

Kubek, Mario M.; Böhme, Thomas; Unger, Herwig
Spreading activation: a fast calculation method for text centroids. - In: Proceedings of 2017 the 3rd International Conference on Communication and Information Processing, ISBN 978-1-4503-5365-6, (2017), S. 24-27

https://doi.org/10.1145/3162957.3163014
Böhme, Thomas; Harant, Jochen; Kriesell, Matthias; Stiebitz, Michael
Horst Sachs (1927-2016). - In: Discrete mathematics, Bd. 340 (2017), 11, S. 2615

https://doi.org/10.1016/j.disc.2017.04.023
Sukjit, Panchalee; Kubek, Mario; Böhme, Thomas; Unger, Herwig
PDSearch: using pictures as queries. - In: Recent advances in information and communication technology, (2014), S. 255-262

http://dx.doi.org/10.1007/978-3-319-06538-0_25
Girlich, Franz; Roßberg, Michael; Schäfer, Günter; Böhme, Thomas; Schreyer, Jens
Bounds for the security of the Vivaldi network coordinate system. - In: 2013 Conference on Networked Systems (NetSys), ISBN 978-1-4673-5645-9, (2013), S. 66-75

http://dx.doi.org/10.1109/NetSys.2013.21
Böhme, Thomas; Schreyer, Jens; Škrabul'áková, Erika
A note on semi-steady states in stochastic cellular automata. - In: Autonomous systems: developments and trends, (2011), S. 313-323

Böhme, Thomas; Kostochka, Alexander; Thomason, Andrew
Minors in graphs with high chromatic number. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 20 (2011), 4, S. 513-518

https://doi.org/10.1017/S0963548311000174
Böhme, Thomas; Kostochka, Alexandr; Thomason, Andrew
Hadwiger numbers and over-dominating colourings. - In: Discrete mathematics, Bd. 310 (2010), 20, S. 2662-2665

http://dx.doi.org/10.1016/j.disc.2010.03.024
Girlich, Franz; Roßberg, Michael; Schäfer, Günter; Böhme, Thomas; Schreyer, Jens
Scrubbing the Vivaldi network coordinate system. - In: Crossing borders within the ABC, (2010), S. 754-760

http://www.db-thueringen.de/servlets/DocumentServlet?id=17361
Böhme, Thomas; Schreyer, Jens;
A game theoretic approach to graph problems. - In: 9th International Conference on Innovative Internet Community Systems, I2CS 2009, (2009), S. 149-156

Böhme, Thomas; Göring, Frank; Tuza, Zsolt; Unger, Herwig
Learning of winning strategies for terminal games with linear-size memory. - In: International journal of game theory, ISSN 1432-1270, Bd. 38 (2009), 2, S. 155-168

http://dx.doi.org/10.1007/s00182-008-0142-5
Böhme, Thomas; Kawarabayashi, Ken-ichi; Maharry, John; Mohar, Bojan
Linear connectivity forces large complete bipartite minors. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 99 (2009), 3, S. 557-582

http://dx.doi.org/10.1016/j.jctb.2008.07.006
Böhme, Thomas; Gerlach, Tobias; Stiebitz, Michael;
Ordered and linked chordal graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 28 (2008), 2, S. 367-373

https://doi.org/10.7151/dmgt.1412
Böhme, Thomas; Knor, Martin; Niepel, L'udovít
Linkability in iterated line graphs. - In: Discrete mathematics, Bd. 306 (2006), 7, S. 666-669

http://dx.doi.org/10.1016/j.disc.2005.11.018
Böhme, Thomas
Innovative internet community systems : 4th international workshop, IICS 2004, Guadalajara, Mexico, June 21 - 23, 2004 ; revised papers. - Berlin : Springer, 2006. - XI, 306 S.. - (Lecture notes in computer science ; 3473) ISBN 3-540-28880-5
Literaturangaben

Witschel, Hans Friedrich; Böhme, Thomas
Evaluating profiling and query expansion methods for P2P information retrieval. - In: Proceedings of the 2005 ACM Workshop on Information Retrieval in Peer-to-Peer Networks, (2005), S. 1-8

Böhme, Thomas; Kostochka, Alexandr
Disjoint Kr-minors in large graphs with given average degree. - In: European journal of combinatorics, Bd. 26 (2005), 3/4, S. 289-292
Im Titel ist "r" tiefgestellt

https://doi.org/10.1016/j.ejc.2003.12.017
Böhme, Thomas; Mohar, Bojan; Krekovski, Riste; Stiebitz, Michael
Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 45 (2004), 4, S. 270-274

https://doi.org/10.1002/jgt.10161
Böhme, Thomas; Mohar, Bojan
Domination, packing and excluded minors. - In: The electronic journal of combinatorics, ISSN 1077-8926, Volume 10 (2003), N9, Seite 1-6

https://doi.org/10.37236/1749
Böhme, Thomas; Heyer, Gerhard; Unger, Herwig
Innovative internet community systems : third international workshop ; revised papers. - Berlin : Springer, 2003. - VIII, 262 S.. - (Lecture notes in computer science ; 2877) ISBN 3-540-20436-9
Includes bibliographical references and index

Böhme, Thomas; Mohar, Bojan; Thomassen, Carsten
Long cycles in graphs on a fixed surface. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 85 (2002), 2, S. 338-347

http://dx.doi.org/10.1006/jctb.2001.2108
Böhme, Thomas; Mohar, Bojan
Labeled K2,t minors in plane graphs. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 84 (2002), 2, S. 291-300

http://dx.doi.org/10.1006/jctb.2001.2083
Böhme, Thomas; Maharry, John; Mohar, Bojan
Ka,k minors in graphs of bounded tree-width. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 86 (2002), 1, S. 133-147

http://dx.doi.org/10.1006/jctb.2002.2119
Unger, Herwig; Böhme, Thomas; Mikler, Armin
Innovative internet computing systems : proceedings. - Berlin : Springer, 2002. - VIII, 249 S.. - (Lecture notes in computer science ; 2346) ISBN 3-540-43790-8
Includes bibliographical references and index

Böhme, Thomas; Unger, Herwig
Innovative Internet Computing Systems : International Workshop IICS 2001 Ilmenau, Germany, June 21–22, 2001 Proceedings. - Berlin : Springer, 2001. - Online-Ressource. - (Lecture Notes in Computer Science ; 2060) ISBN 978-3-540-48206-2

Workshop Innovative Internet Computing Systems -- Multicast Protocols For Jinni Agents -- Modern Software Engineering Methods for IP-QoS Resource Pool Management -- Adaptive Quality of Service Management Using QoS Proxy and User Feedback for Wireless Links -- Sharing Extendible Arrays in a Distributed Environment -- Pini — A Jini-Like Plug&Play Technology for the KVM/CLDC -- Discovering Internet Services: Integrating Intelligent Home Automation Systems to Plug and Play Networks -- Reusing Single-User Applications to Create Multi-user Internet Applications -- Graph-Theoretic Web Algorithms: An Overview -- Prefetching Tiled Internet Data Using a Neighbor Selection Markov Chain -- A General Adaptive Cache Coherency-Replacement Scheme for Distributed Systems -- Agents Based Collaborative Framework for B2C Business Model and Related Services -- Agent-Based Distributed Computing with JMessengers -- Agent-Based Wave Computation: Towards Controlling the Resource Demand -- A Design for JTrader, an Internet Trading Service -- Computer-Supported Deliberations for Distributed Teams -- Hardware Security Concept for Spontaneous Network Integration of Mobile Devices.



https://doi.org/10.1007/3-540-48206-7
Böhme, Thomas; Göring, Frank; Harant, Jochen;
Menger's theorem. - In: Journal of graph theory, ISSN 1097-0118, Bd. 37 (2001), 1, S. 35-36

https://doi.org/10.1002/jgt.1001
Unger, Herwig; Wulff, Markus; Böhme, Thomas
Community-based information management : an empiric approach. - In: Rostocker Informatik-Berichte, ISSN 0233-0784, (2001), 26, S. 89-107

Böhme, Thomas; Mohar, Bojan
Domination, packing and excluded minors. - Ljubljana : Institute of Mathematics, Physics and Mechanics, Department of Mathematics, University of Ljubljana, 2001. - 6 Seiten. - (Preprint series ; 39,734)Literaturverzeichnis: Seite 6

Nützel, Jürgen; Fengler, Wolfgang; Böhme, Thomas
Objektorientierter Entwurf verteilter eingebetteter Echtzeitsysteme auf Basis höherer Petri-Netze. - In: Entwicklung und Betrieb komplexer Automatisierungssysteme, (1999), S. 151-170

Böhme, Thomas; Mohar, Bojan; Stiebitz, Michael;
Dirac's map-color theorem for choosability. - In: Journal of graph theory, ISSN 1097-0118, Bd. 32 (1999), 4, S. 327-339

https://doi.org/10.1002/(SICI)1097-0118(199912)32:4<327::AID-JGT2>3.0.CO;2-B
Böhme, Thomas; Harant, Jochen; Harant, Jochen *1954-*; Tkáč, Michal
More than one tough chordal planar graphs are Hamiltonian. - In: Journal of graph theory, ISSN 1097-0118, Bd. 32 (1999), 4, S. 405-410

https://doi.org/10.1002/(SICI)1097-0118(199912)32:4<405::AID-JGT8>3.0.CO;2-Z
Böhme, Thomas; Harant, Jochen; Harant, Jochen *1954-*; Tkáč, Michal
On certain Hamiltonian cycles in planar graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 32 (1999), 1, S. 81-96

https://doi.org/10.1002/(SICI)1097-0118(199909)32:1<81::AID-JGT8>3.0.CO;2-9
Böhme, Thomas;
Über Kreise in eingebetteten Graphen. - 96 Bl. Ilmenau : Techn. Univ., Habil.-Schr., 1999

Böhme, Thomas; Harant, Jochen
On Hamiltonian cycles in 4- and 5-connected plane triangulations. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 25-30

http://dx.doi.org/10.1016/S0012-365X(98)00089-2
Böhme, Thomas; Harant, Jochen; Pruchnewski, Anja; Schiermeyer, Ingo
A planarity criterion bipartite graphs. - In: Discrete mathematics, Bd. 191 (1998), 1, S. 31-43

http://dx.doi.org/10.1016/S0012-365X(98)00090-9
Böhme, Thomas; Broersma, Hajo; Göbel, F.; Kostochka, Alexandr V.; Stiebitz, Michael
Spanning trees with pairwise nonadjacent endvertices. - In: Discrete mathematics, Bd. 170 (1997), 1/3, S. 219-222

http://dx.doi.org/10.1016/S0012-365X(96)00306-8
Unger, Herwig; Böhme, Thomas
Ein multikriterielles, fuzzybasiertes Lastverteilungssystem. - In: Informatik und Automatisierung im Zeitalter der Informationsgesellschaft ; Bd. 1:[Vortragsreihen / Gens, Wolfgang *1933-*. - Ilmenau : Technische Univ., 1997, (1997), S. 269-274

Böhme, Thomas; Broersma, H. J.; Veldman, H. J.
Toughness and longest cycles in 2-connected planar graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 23 (1996), 3, S. 257-263

https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-R
Böhme, Thomas; Harant, Jochen; Harant, Jochen *1954-*; Tkác, Michal
On the minimal number of separating 3-cycles in non-Hamiltonian maximal planar graphs. - In: Cycles and colourings '94, (1996), S. 97-102

Unger, Herwig; Böhme, Thomas
Zur Generation von Software aus Petrinetzen auf der Basis der Markenflußanalyse. - In: Internationales wissenschaftliches Kolloquium / Technische Hochschule Ilmenau, ISSN 0374-3365, Bd. 36 (1991), 4, S. 781-786

Böhme, Thomas;
A note on metric properties of infinite graphs. - In: International Conference Discrete Mathematics, (1990), S. 9-11

Wolf, Axel;
Konjugationen und ihre Anwendung in der nichtkonvexen Optimierung, 1988. - 68 Bl Ilmenau : Techn. Hochsch., Diss., 1988
Literaturverz. Bl. 63 - 68. - Enth außerdem: Thesen (10 Bl.)

Böhme, Thomas;
Über räumliche Darstellungen endlicher Graphen, 1988. - X, 86, 7 Bl. Ilmenau : Techn. Hochsch., Diss., 1988
Enth. außerdem: Thesen

Elster, Karl-Heinz; Wolf, Axel
Comparison between several conjugation concepts. - In: Optimal control, (1987), S. 79-93

https://doi.org/10.1007/BFb0040200
Elster, Karl-Heinz; Wolf, Axel
On a conjugation concept and its application in nonconvex optimization. - In: Vortragsauszüge, (1987), S. 34-37

Böhme, Thomas; Schild, Göran
Über ein elementargeometrisches Problem. - In: Algebra und Graphentheorie, (1986), S. 17-20

Elster, Karl-Heinz; Wolf, Axel
Neuere Ergebnisse über verallgemeinerte Konjugation in der nichtlinearen Optimierung. - In: Internationales wissenschaftliches Kolloquium / Technische Hochschule Ilmenau, ISSN 0374-3365, Bd. 30 (1985), 4, S. 41-43

Böhme, Thomas;
[Rezension von: Fried, Ervin, Abstrakte Algebra, eine elementare Einführung]. - In: Wissenschaftliche Zeitschrift / Technische Hochschule Ilmenau. - Ilmenau : Technische Hochschule, ISSN 0043-6917, 3, S. 185-186
, Rezension von : Abstrakte Algebra / Fried, Ervin. - Thun, Frankfurt/M. : Deutsch, 1983
Böhme, Thomas; Zernitz, Holger
Zur Konstruktion stabiler Mengen von konvexen Bereichen im 3-dimensionalen euklidischen Raum. - In: Wissenschaftliche Zeitschrift / Technische Hochschule Ilmenau, ISSN 0043-6917, Bd. 30 (1984), 3, S. 33-38

Sachs, Horst; Böhme, Thomas
Über räumliche Darstellungen endlicher Graphen. - In: Internationales wissenschaftliches Kolloquium / Technische Hochschule Ilmenau, ISSN 0374-3365, Bd. 27 (1982), 6, S. 27-28