Degree Bounds for Constrained Pseudo-triangulations (2009)
Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Toth
We introduce the concept of a constrained pointed pseudo-triangulation T G of a point set S with respect to a pointed planar straight line graph G = (S, E). Forthe case that G forms a simple polygon...
Maximizing Maximal Angles for Plane Straight-Line Graphs ⋆ (2009)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, ...
Abstract. Let G =(S, E) be a plane straight-line graph on a finite point set S ⊂ R 2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges of G that...
Abstract Degree Bounds for Constrained Pseudo-Triangulations (2008)
Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G =(S, E). For the case that G forms a simple polygon P...
PushPush-k is PSPACE-Complete (2008)
Erik D. Demaine, Michael Hoffmann, Markus Holzer
We prove that a pushing-block puzzle called PUSHPUSH-k is PSPACE-complete for any fixed k ≥ 1. In this puzzle, a robot moves on a finite grid. Each grid position is either empty or occupied by a...
Tóth, Pointed and colored binary encompassing trees (2008)
Michael Hoffmann, Csaba D. T'oth
Abstract For n disjoint line segments in the plane we construct in optimal O(n log n) time an en-compassing tree of maximum degree three such that at every vertex all incident edges lie in a...
Primate surveys and conservation assessments (editorial) (2008)
Rylands, Anthony, Williamson, Elizabeth A., Hoffmann, Michael, Mittermeier, Russell A.
From first paragraph: The conservation of the world’s primates demands basic, but elusive and hard-to-get, information. Enormous efforts are underway to accumulate this information, and the...
Michael Hoffmann, Yoshio Okamoto
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, points in the interior...
Pointed binary encompassing trees: simple and optimal (2008)
Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incident edges lie in a...
Prof Emo Welzl, Eth Zürich, Bernd Gärtner, Jochen Giesen, Matthias John, Michael Hoffmann, ...
citizen of Japan submitted to
Pointed binary encompassing trees: simple and optimal (2008)
Abstract. For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges lie in a...
Computing Minimum Spanning Trees with Uncertainty (2008)
Erlebach, Thomas, Hoffmann, Michael, Krizanc, Danny, Mihal'ák, Matús, Raman, Rajeev
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge $e$ of the graph only a set $A_e$, called...
Tóth, Pointed and colored binary encompassing trees (2008)
For n disjoint line segments in the plane we construct in optimal O(n log n) time an encompassing tree of maximum degree three such that at every vertex all incident edges lie in a halfplane defined...
Z. BEERLIOVA ET AL. 1 Network Discovery and Verification (2008)
Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Er Hall, Michael Hoffmann, L. Shankar Ram
Abstract — Due to its fast, dynamic, and distributed growth process, it is hard to obtain an accurate map of the Internet. In many cases such a map—representing the structure of the Internet as a...
Abstract Degree Bounds for Constrained Pseudo-Triangulations (2008)
Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G =(S, E). For the case that G forms a simple polygon P...
Chordless Paths Through Three Vertices (2008)
Abstract. Consider the following problem, that we call “Chordless Path through Three Vertices ” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and three...
Pointed binary encompassing trees: simple and optimal (2008)
Michael Hoffmann, Csaba D. T'oth
Abstract For n disjoint line segments in the plane we con-struct in optimal O(n log n) time an encompassingtree of maximal degree three such that every vertex is pointed. Moreover, at every segment...
Maximizing Maximal Angles for Plane Straight Line Graphs (2008)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Francisco Santos
Let G =(S, E) be a plane straight line graph on a finite point set S ⊂ R 2 in general position. For a point p ∈ S let the maximum incident angle of p in G be the maximum angle between any two...
Pointed Binary Encompassing Trees (2008)
Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T , that is, a spanning tree on the segment endpoints that contains all input segments,...
Computing Minimum Spanning Trees with Uncertainty (2008)
Erlebach, Thomas, Hoffmann, Michael, Krizanc, Danny, Mihal'ák, Matús, Raman, Rajeev
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge $e$ of the graph only a set $A_e$, called...
Computing Minimum Spanning Trees with Uncertainty (2008)
Erlebach, Thomas, Hoffmann, Michael, Krizanc, Danny, Mihal'ák, Matús, Raman, Rajeev
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge $e$ of the graph only a set $A_e$, called...
New results for the EIE-Surveyor project (2008)
Thiriet, Jean-Marc, Robert, Michel, Martins, Maria João, Ward, Anthony, Bonnaud, Olivier, Hoffmann, Michael, ...
The EIE-Surveyor ERASMUS thematic network has been launched in October 2005 for three years, the end will be in 2008. The purpose of this paper is to present a state of development of the outcomes...
New results for the EIE-Surveyor project (2008)
Thiriet, Jean-Marc, Robert, Michel, Martins, Maria João, Ward, Anthony, Bonnaud, Olivier, Hoffmann, Michael, ...
The EIE-Surveyor ERASMUS thematic network has been launched in October 2005 for three years, the end will be in 2008. The purpose of this paper is to present a state of development of the outcomes...
25. Computing Minimum Spanning Trees with Uncertainty (2008)
Hoffmann, Michael, Erlebach, Thomas, Krizanc, Danny, Mihal'ák, Matús, Raman, Rajeev
We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge $e$ of the graph only a set $A_e$, called...
Susan Hert, Michael Hoffmann, Sylvain Pion, Michael Seel
Abstract. Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constantsize geometric objects and...
We show that a particular pushing-block puzzle is NPhard, settling an open problem posed by O'Rourke et al [2, 4]. The puzzle consists of unit square blocks on an integer lattice. The robot may...
Automatic Semigroups with Subsemigroups of finite Rees index (2007)
Michael Hoffmann, Nik Ruskuc, Richard Thomas, Leicester Le Rh, Leicester Le Rh
The notion of automaticity has been widely studied in groups and some progress has been made in understanding this notion in the wider context of semigroups. The purpose of this paper is to study the...
Connecting Points in the Presence of Obstacles in the Plane (2007)
Michael Hoffmann, Csaba D. Tóth
Given a point set P and a set B of polygonal obstacles in the plane, we consider planar geometric graphs connecting the points of P and crossing few obstacles from B. We describe two finite...
Chordless Paths Through Three Vertices (2007)
Abstract. Consider the following problem, that we call "Chordless Path through Three Vertices " or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k,...
Udo Adamy, Michael Hoffmann, Jozsef Solymosi
Abstract. An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leaves of the...
No abstract available.
Maximizing Maximal Angles for Plane Straight-Line Graphs (2007)
Aichholzer, Oswin, Hackl, Thomas, Hoffmann, Michael, Huemer, Clemens, Por, Attila, Santos, Francisco, ...
Let $G=(S, E)$ be a plane straight-line graph on a finite point set $S\subset\R^2$ in general position. The \emph{incident angles} of a point $p \in S$ in $G$ are the angles between any two edges of...
Im Rahmen dieser Arbeit wurde die Funktion des planaren Zellpolaritäts- (PCP,“planar cell polarity“) Proteins VANG-1 auf die Musterbildung des Darmepithels von C. elegans untersucht. Es konnte...
Funktionale Varietäten des Deutschen - kurz gefasst (2007)
Bei dieser Publikation handelt es sich um ein Kompendium, gedacht als Selbststudienliteratur für linguistische Grundkurse und Einführungsveranstaltungen zur deutschen Sprache der Gegenwart. Im...
Funktionale Varietäten des Deutschen - kurz gefasst (2007)
Bei dieser Publikation handelt es sich um ein Kompendium, gedacht als Selbststudienliteratur für linguistische Grundkurse und Einführungsveranstaltungen zur deutschen Sprache der Gegenwart. Im...
An Adaptable and Extensible Geometry Kernel (2007)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constant-size geometric objects and operations on...
An Adaptable and Extensible Geometry Kernel (2007)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constant-size geometric objects and operations on...
An adaptable and extensible geometry kernel (2007)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constant-size geometric objects and operations on...
Die Pathophysiologie der chronischen Herzinsuffizienz nach Myokardinfarkt ist bestimmt durch neurohumorale Aktivierung und durch Umbauprozesse sowohl in der Infarktregion als auch im überlebenden...
Limits of Truth: Exploring Epistemological Approaches to Argumentation (2005)
Some proponents of epistemological approaches to argumentation (Biro, Siegel, Lumer, Goldman) assume that it should be possible to develop non-relative criteria of argument evaluation. By contrast,...
On the existence of paths and cycles / (2005)
Diss. no. 15897 techn. sc. SFIT Zurich.
Network discovery and verification (2005)
Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Er Hall, Michael Hoffmann, L. Shankar Ram
Abstract. Consider the problem of discovering (or verifying) the edges and non-edges of a network, modelled as a connected undirected graph, using a minimum number of queries. A query at a vertex v...
Network Discovery and Verification (2005)
Beerliova, Zuzana, Eberhard, Felix, Erlebach, Thomas, Hall, Alexander, Hoffmann, Michael, Mihalak, Matus, ...
Consider the problem of discovering (or verifying) the edges and non-edges of a network, modelled as a connected undirected graph, using a minimum number of queries. A query at a vertex v discovers...
Global Gap Analysis: Priority Regions for Expanding the Global Protected-Area Network (2004)
H. RESIT AKÇAKAYA, SANDY J. ANDELMAN, MOHAMED I. BAKARR, LUIGI BOITANI, THOMAS M. BROOKS, ...
Protected areas are the single most important conservation tool. The global protected-area network has grown substantially in recent decades, now occupying 11.5% of Earth's land surface, but such...
Effectiveness of the global protected area network in representing species diversity (2004)
Rodrigues, Ana S.L., Andelman, Sandy J., Bakarr, Mohamed I., Boitani, Luigi, Brooks, Thomas M., Cowling, Richard M., ...
The Fifth World Parks Congress in Durban, South Africa, announced in September 2003 that the global network of protected areas now covers 11.5% of the planet’s land surface. This surpasses the 10%...
Effectiveness of the global protected area network in representing species diversity (2004)
Rodrigues, Ana S.L., Andelman, Sandy J., Bakarr, Mohamed I., Boitani, Luigi, Brooks, Thomas M., Cowling, Richard M., ...
The Fifth World Parks Congress in Durban, South Africa, announced in September 2003 that the global network of protected areas now covers 11.5% of the planet’s land surface. This surpasses the 10%...
Hornung, Christian., Hoffmann, Michael.
Heidelberg, Univ., Diss., 2004.
Effectiveness of the global protected area network in representing species diversity (2004)
Rodrigues, Ana S. L., Andelman, Sandy J., Bakarr, Mohamed I., Boitani, Luigi, Brooks, Thomas M., Cowling, Richard M., ...
The Fifth World Parks Congress in Durban, South Africa, announced in September 2003 that the global network of protected areas now covers 11.5% of the planet's land surface(1). This surpasses the 10%...
Global gap analysis: Priority regions for expanding the global protected-area network (2004)
Rodrigues, Ana S. L., Akcakaya, H. Resit, Andelman, Sandy J., Bakarr, Mohamed I., Boitani, Luigi, Brooks, Thomas M., ...
Protected areas are the single most important conservation tool. The global protected-area network has grown substantially in recent decades, now occupying 11.5% of Earth's land surface, but such...
Effectiveness of the global protected area network in representing species diversity (2004)
Rodrigues, Ana S.L., Andelman, Sandy J., Bakarr, Mohamed I., Boitani, Luigi, Brooks, Thomas M., Cowling, Richard M., ...
The Fifth World Parks Congress in Durban, South Africa, announced in September 2003 that the global network of protected areas now covers 11.5% of the planet’s land surface. This surpasses the 10%...
Effectiveness of the global protected area network in representing species diversity (2004)
Rodrigues, Ana S. L., Andelman, Sandy J., Bakarr, Mohamed I., Boitani, Luigi, Brooks, Thomas M., Cowling, Richard M., ...
The Fifth World Parks Congress in Durban, South Africa, announced in September 2003 that the global network of protected areas now covers 11.5% of the planet's land surface(1). This surpasses the 10%...
Global gap analysis: Priority regions for expanding the global protected-area network (2004)
Rodrigues, Ana S. L., Akcakaya, H. Resit, Andelman, Sandy J., Bakarr, Mohamed I., Boitani, Luigi, Brooks, Thomas M., ...
Protected areas are the single most important conservation tool. The global protected-area network has grown substantially in recent decades, now occupying 11.5% of Earth's land surface, but such...
The traveling salesman problem with few inner points (2004)
Vladimir G. Deĭneko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
We propose two algorithms for the planar Euclidean traveling salesman problem. The first runs in O(k!kn) time and O(k) space, and the second runs in O(2 k k 2 n) time and O(2 k kn) space, where n...
Pointed binary encompassing trees, in (2004)
Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
Abstract. We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T, that is, a spanning tree on the segment endpoints that contains all input...
The minimum weight triangulation problem with few inner points (2004)
Michael Hoffmann, Yoshio Okamoto
Abstract. We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, points in the...
The Minimum Weight Triangulation Problem (2004)
With Few Inner, Michael Hoffmann, Yoshio Okamoto
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, points in the interior...
The Traveling Salesman Problem with Few Inner Points (2004)
Vladimir G. Deĭneko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
We study the traveling salesman problem (TSP) in the 2-dimensional Euclidean plane. The problem is NP-hard in general, but trivial if the points are in convex position. In this paper, we investigate...
The Traveling Salesman Problem with Few Inner Points (2004)
Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
We study the traveling salesman problem (TSP) in the 2-dimensional Euclidean plane. The problem is NP-hard in general, but trivial if the points are in convex position. In this paper, we investigate...
Tyrphostin AGL-2043 eluting stent reduces neointima formation in porcine coronary arteries (2004)
Banai, Shmuel, Gertz, S.David, Gavish, Lilach, Chorny, Michael, Perez, Louise S., Lazarovichi, Galila, ...
Objective: Tyrphostin AGL-2043 is a potent tricyclic quinoxaline inhibitor of PDGF β-receptor tyrosine kinase (PTK), Kit, and Flt3. We have shown previously that selective inhibition of PDGF...
Segment endpoint visibility graphs are Hamiltonian (2003)
Abstract. We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. This...
Alternating paths through disjoint line segments (2003)
Michael Hoffmann, Csaba D. Tóth
Abstract. We show that every segment endpoint visibility graph on Ò disjoint line segments in the plane admits an alternating path of length ¢ ÐÓ � Ò, answering a question of Bose. This bound...
Degree bounds for constrained pseudo-triangulations (2003)
Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G =(S, E). For the case that G forms a simple polygon P...
Die Arbeit untersucht ausgewählte (Gedenk-)Reden, die sich mit der faschistischen Vergangenheit der Deutschen auseinandersetzen. Die Vorträge werden dabei als integrale Texte einer...
Alternating Paths through Disjoint Line Segments (2002)
Michael Hoffmann And, Michael Hoffmann
We show that every segment endpoint visibility graph on n disjoint line segments in the plane admits an alternating path of length (log n), answering a question of Bose. This bound is optimal apart...
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
We present a theoretical and experimental study on the lowest electronically excited states in quasi-one-dimensional molecular crystals. The specific calculations and the experiments are performed...
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
Stuttgart, Universität, Thesis (doctoral), 2000.
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
An Adaptable and Extensible Geometry Kernel (2001)
Hert, Susan, Hoffmann, Michael, Kettner, Lutz, Pion, Sylvain, Seel, Michael
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects and operations on...
An adaptable and extensible geometry kernel (2001)
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
ii
Covering Polygons with Few Rectangles (Extended Abstract) (2001)
Abstract How to cover a set of planar polygons with two or three congruent axis-parallel squares of minimal size? I show that this natural generalization of the bounding-box can be computed in time...
An adaptable and extensible geometry kernel (2001)
Susan Hert, Michael Hoffmann, Lutz Kettner, Sophia Antipolis France
Abstract. Geometric algorithms are based on geometric objects such as points, lines and circles. The term kernel refers to a collection of representations for constantsize geometric objects and...
We present a theoretical and experimental study on the lowest electronically excited states in quasi-one-dimensional molecular crystals. The specific calculations and the experiments are performed...
Thesis (doctoral) - Universität, Trier, 1999.
Hoffmann, Michael., Verein Deutscher Ingenieure.
Thesis--Technische Universitat Berlin, 1999.
We present a theoretical and experimental study on the lowest electronically excited states in quasi-one-dimensional molecular crystals. The specific calculations and the experiments are performed...
We present a theoretical and experimental study on the lowest electronically excited states in quasi-one-dimensional molecular crystals. The specific calculations and the experiments are performed...
We present a theoretical and experimental study on the lowest electronically excited states in quasi-one-dimensional molecular crystals. The specific calculations and the experiments are performed...
A simple linear algorithm for computing rectangular three-centers (1999)
Rectangular p-centers of a finite planar point set P are the centers of at most p axis-parallel congruent squares of minimal size covering P. We give a simple linear time algorithm based on linear...
A Simple Linear Algorithm for Computing Rectilinear (1999)
Centers Michael Hoffmann, Michael Hoffmann
Rectilinear k-centers of a finite point set P \subset R² are the centers of at most k congruent axis-parallel squares of minimal size whose union covers P. This paper describes a linear time...
Freiburg (Breisgau), Univ., Diss., 1998 (Nicht für den Austausch).
Strategien zur gerichteten Induktion von Apoptose in Tumorzellen / (1997)
Freiburg (Breisgau), Univ., Diss., 1997.
Recyclierung von halogenfrei flammwidrigen Duroplastwerkstoffen für die Elektronik / (1997)
Halle, Universiẗat, Diss., 1997.
Strategien zur Gerichteten Induktion von Apoptose in Tumorzellen [microform] / (1997)
Thesis (doctoral)--Albert-Ludwigs-Universität Freiburg im Breisgau, 1997.
EXAFS-spektroskopische Untersuchungen in flüssigen Phasen. (1989)
Mikroreprod. e. Ms. Getr. Zählung : graph. Darst.
Das eschatologische Heil Israels nach den lukanischen Schriften. (1988)
Heidelberg, Univ., Diss., 1988 (Nicht f.d. Austausch).
Leipzig, Univ., Diss. B, 1987 (Nicht f.d. Austausch).
Ein Näherungsverfahren zur Ermittlung mehrachsig elastisch-plastischer Kerbbeanspruchungen / (1986)
Zugl.: Darmstadt, Techn. Hochsch., Diss., 1986.
Berlin, Freie Univ., Diss. : 1986.
Thesis (doctoral)--Ruhr-Universität Bochum, 1975.
citizen of Switzerland accepted on the recommendation of (1975)
Kaspar Fischer, Prof Dr, Emo Welzl, Eth Zürich, Dr. Bernd Gärtner, Eth Zürich, ...
I would like to thank all the people without whom this thesis would not have been written. In the first place, my thanks go to Emo Welzl for giving me the opportunity to work in his research group...
Göttingen, Univ., Med. Fak., Diss., 1975. (Nicht f. d. Austausch.).
Erfurt, Med. Ak., Diss. v. 18. Sept. 1968 (Nicht f. d. Aust.).
Aus: Zentralblatt f. Bakteriologie, Parasitenkunde, Infektionskrankheiten u. Hygiene. Abt. 1. Bd 198. 1965
Thesis (doctoral)--Eberhard-Karls-Universität zu Tübingen, 1965.
Erlangen, Phil. F., Diss. v. 1. Aug. 1948 (Nicht f. d. Austausch).
Über Veränderungen des Magen - Darmkanales bei Leukämie und Pseudoleukämie / (1905)
Thesis (doctoral)--Vereinigte Friedrichs-Universität Halle-Wittenberg, 1905.
Yeast Cycloheximide-resistant crl Mutants Are Proteasome Mutants Defective in Protein Degradation
Gerlinger, Uwe-M., Gückel, Roland, Hoffmann, Michael, Wolf, Dieter H., Hilt, Wolfgang
In 1988 McCusker and Haber generated a series of mutants which are resistant to the minimum inhibitory concentration of the protein synthesis inhibitor cycloheximide. These cycloheximide-resistant,...
Pinpointing and preventing imminent extinctions
Ricketts, Taylor H., Dinerstein, Eric, Boucher, Tim, Brooks, Thomas M., Butchart, Stuart H. M., Hoffmann, Michael, ...
Slowing rates of global biodiversity loss requires preventing species extinctions. Here we pinpoint centers of imminent extinction, where highly threatened species are confined to single sites....
Sit4 phosphatase is functionally linked to the ubiquitin-proteasome system.
Singer, Thorsten, Haefner, Stefan, Hoffmann, Michael, Fischer, Michael, Ilyina, Julia, Hilt, Wolfgang
Using a synthetic lethality screen we found that the Sit4 phosphatase is functionally linked to the ubiquitin-proteasome system. Yeast cells harboring sit4 mutations and an impaired proteasome (due...
Yeast Cycloheximide-resistant crl Mutants Are Proteasome Mutants Defective in Protein Degradation
Gerlinger, Uwe-M., Gückel, Roland, Hoffmann, Michael, Wolf, Dieter H., Hilt, Wolfgang
In 1988 McCusker and Haber generated a series of mutants which are resistant to the minimum inhibitory concentration of the protein synthesis inhibitor cycloheximide. These cycloheximide-resistant,...
Pinpointing and preventing imminent extinctions
Ricketts, Taylor H., Dinerstein, Eric, Boucher, Tim, Brooks, Thomas M., Butchart, Stuart H. M., Hoffmann, Michael, ...
Slowing rates of global biodiversity loss requires preventing species extinctions. Here we pinpoint centers of imminent extinction, where highly threatened species are confined to single sites....
Sit4 phosphatase is functionally linked to the ubiquitin-proteasome system.
Singer, Thorsten, Haefner, Stefan, Hoffmann, Michael, Fischer, Michael, Ilyina, Julia, Hilt, Wolfgang
Using a synthetic lethality screen we found that the Sit4 phosphatase is functionally linked to the ubiquitin-proteasome system. Yeast cells harboring sit4 mutations and an impaired proteasome (due...
Kappler, John W., Hoffmann, Michael, Dutton, Richard W.
The effect of passively transfered antiserum against sheep erythrocytes (SRBC) on the antigen stimulated increase of SRBC-specific plaque-forming cells (anti-SRBC-PFC) and SRBC-specific...
Kappler, John W., Hoffmann, Michael
The kinetics of the in vivo response to SRBC was studied in mouse spleen at both the B cell and T cell levels. The B cell response was assayed by following the appearance of antibody-secreting cells...
Hoffmann, Michael, Kappler, John W.
The specificity of antigen recognition by thymus-derived helper cells (T cells) and antibody was examined in mice, heterologous erythrocyte antigens from sheep (SRBC), goat (GRBC), burro (BRBC),...
Degree Bounds for Constrained Pseudo-Triangulations
Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Toth
We introduce the concept of a constrained pointed pseudo-triangulation T_G of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G forms a simple polygon...