Andreas Brandstädt
   HOME
*





Andreas Brandstädt
Andreas Brandstädt (born 17 January 1949 in Arnstadt, East Germany) is a German mathematician and computer scientist. Life and work He graduated from the Friedrich Schiller University of Jena, Germany, with a Ph.D. (Dr. rer. nat.) in stochastics in 1976 and a habilitation (Dr. sc. nat.) in complexity theory in 1983. Since 1974 he worked there in the group of his academic teacher Gerd Wechsung. From 1991 to 1994, he was the professor for Computer Science in the Department of Mathematics, at the University of Duisburg, Germany, and from 1994 to 2014 he was the professor for Theoretical Computer Science at the University of Rostock, Germany. He was a visiting professor at the universities of Metz, Amiens, and Clermont-Ferrand (France) and at the University of Primorska in Koper (Slovenia). He was Invited Speaker at various conferences in Argentina, Austria, Belarus, Brasil, Canada, China, France,Greece, India, Israel, Norway, Poland, Slovenia, and Switzerland. Brandstädt is an ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Arnstadt
Arnstadt () is a town in Ilm-Kreis, Thuringia, Germany, on the river Gera about south of Erfurt, the capital of Thuringia. Arnstadt is one of the oldest towns in Thuringia, and has a well-preserved historic centre with a partially preserved town wall. The town is nicknamed ("The Gateway to the Thuringian Forest") because of its location on the northern edge of that forest. Arnstadt has a population of some 27,000. Geography The town centre is on the west side of Gera. The municipality has absorbed several neighbouring municipalities: Angelhausen–Oberndorf (1922), Siegelbach (1994), Rudisleben (1999) and Wipfratal (2019). The neighbouring municipalities are Amt Wachsenburg, Alkersleben, Dornheim, Bösleben-Wüllersleben, Stadtilm, Ilmenau, Plaue and Geratal. Climate The annual precipitation averages 487 mm. History A deed of gift issued 1 May 704 in Würzburg by the Thuringian Duke Hedan II to the Anglo-Saxon bishop Willibrord of Utrecht is the first written reference ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Slovenia
Slovenia ( ; sl, Slovenija ), officially the Republic of Slovenia (Slovene: , abbr.: ''RS''), is a country in Central Europe. It is bordered by Italy to the west, Austria to the north, Hungary to the northeast, Croatia to the southeast, and the Adriatic Sea to the southwest. Slovenia is mostly mountainous and forested, covers , and has a population of 2.1 million (2,108,708 people). Slovenes constitute over 80% of the country's population. Slovene, a South Slavic language, is the official language. Slovenia has a predominantly temperate continental climate, with the exception of the Slovene Littoral and the Julian Alps. A sub-mediterranean climate reaches to the northern extensions of the Dinaric Alps that traverse the country in a northwest–southeast direction. The Julian Alps in the northwest have an alpine climate. Toward the northeastern Pannonian Basin, a continental climate is more pronounced. Ljubljana, the capital and largest city of Slovenia, is geogr ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Theory Of Computation
In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: ''"What are the fundamental capabilities and limitations of computers?".'' In order to perform a rigorous study of computation, computer scientists work with a mathematical abstraction of computers called a model of computation. There are several models in use, but the most commonly examined is the Turing machine. Computer scientists study the Turing machine because it is simple to formulate, can be analyzed and used to prove results, and because it represents what many consider the most powerful possible "reasonable" mo ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

1949 Births
Events January * January 1 – A United Nations-sponsored ceasefire brings an end to the Indo-Pakistani War of 1947. The war results in a stalemate and the division of Kashmir, which still continues as of 2022. * January 2 – Luis Muñoz Marín becomes the first democratically elected Governor of Puerto Rico. * January 11 – The first "networked" television broadcasts take place, as KDKA-TV in Pittsburgh, Pennsylvania goes on the air, connecting east coast and mid-west programming in the United States. * January 16 – Şemsettin Günaltay forms the new government of Turkey. It is the 18th government, last One-party state, single party government of the Republican People's Party. * January 17 – The first Volkswagen Beetle, VW Type 1 to arrive in the United States, a 1948 model, is brought to New York City, New York by Dutch businessman Ben Pon Sr., Ben Pon. Unable to interest dealers or importers in the Volkswagen, Pon sells the sample car to pay his ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

21st-century German Mathematicians
The 1st century was the century spanning AD 1 ( I) through AD 100 ( C) according to the Julian calendar. It is often written as the or to distinguish it from the 1st century BC (or BCE) which preceded it. The 1st century is considered part of the Classical era, epoch, or historical period. The 1st century also saw the appearance of Christianity. During this period, Europe, North Africa and the Near East fell under increasing domination by the Roman Empire, which continued expanding, most notably conquering Britain under the emperor Claudius (AD 43). The reforms introduced by Augustus during his long reign stabilized the empire after the turmoil of the previous century's civil wars. Later in the century the Julio-Claudian dynasty, which had been founded by Augustus, came to an end with the suicide of Nero in AD 68. There followed the famous Year of Four Emperors, a brief period of civil war and instability, which was finally brought to an end by Vespasian, ninth Roman emperor ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Discrete Applied Mathematics
''Discrete Applied Mathematics'' is a peer-reviewed scientific journal covering algorithmic and applied areas of discrete mathematics. It is published by Elsevier and the editor-in-chief is Endre Boros (Rutgers University). The journal was split off from another Elsevier journal, ''Discrete Mathematics'', in 1979, with that journal's founder Peter Ladislaw Hammer as its founding editor-in-chief. Abstracting and indexing The journal is abstracted and indexing in: According to the ''Journal Citation Reports'', the journal has a 2020 impact factor The impact factor (IF) or journal impact factor (JIF) of an academic journal is a scientometric index calculated by Clarivate that reflects the yearly mean number of citations of articles published in the last two years in a given journal, as i ... of 1.139. References External links *{{official website, http://www.journals.elsevier.com/discrete-applied-mathematics/ Combinatorics journals Publications established in 1979 Englis ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Editorial Board
The editorial board is a group of experts, usually at a publication, who dictate the tone and direction the publication's editorial policy will take. Mass media At a newspaper, the editorial board usually consists of the editorial page editor, and editorial writers. Some newspapers include other personnel as well. Editorial boards for magazines may include experts in the subject area that the magazine focuses on, and larger magazines may have several editorial boards grouped by subject. An executive editorial board may oversee these subject boards, and usually includes the executive editor and representatives from the subject focus boards. Editorial boards meet on a regular basis to discuss the latest news and opinion trends and discuss what the newspaper should say on a range of issues. They will then decide who will write what editorials and for what day. When such an editorial appears in a newspaper, it is considered the institutional opinion of that newspaper. At some newspap ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Chordal Graph
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a ''chord'', which is an edge that is not part of the cycle but connects two vertices of the cycle. Equivalently, every induced cycle in the graph should have exactly three vertices. The chordal graphs may also be characterized as the graphs that have perfect elimination orderings, as the graphs in which each minimal separator is a clique, and as the intersection graphs of subtrees of a tree. They are sometimes also called rigid circuit graphs. or triangulated graphs.. Chordal graphs are a subset of the perfect graphs. They may be recognized in linear time, and several problems that are hard on other classes of graphs such as graph coloring may be solved in polynomial time when the input is chordal. The treewidth of an arbitrary graph may be characterized by the size of the cliques in the chordal graphs that contain it. Perfect elimination and efficient recognit ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Combinatorial Optimization
Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead. Combinatorial optimization is related to operations research, algorithm theory, and computational complexity theory. It has important applications in several fields, including artificial intelligence, machine learning, auction theory, software engineering, VLSI, applied mathematics and theoretical computer science. Some research literature considers discrete o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]