Katalog der Deutschen Nationalbibliothek

Go to:

Knowledge Web

Person
Person
Angelika Steger
Source
Renate Schmid
Wikimedia Commons
CC BY-SA 2.0 de

Person

Angelika Steger (1962-)

Informatikerin

Name

Angelika Steger

Time

1962- (Date of birth and death)

Place

Deutschland
Schweiz

Gender

weiblich

Academic degree

Prof. Dr.

Profession

Informatikerin (characteristic profession)
Mathematikerin

Variant

A. Steger

Related

Eidgenössische Technische Hochschule Zürich (2003-2026)
Rheinische Friedrich-Wilhelms-Universität Bonn (Promotion 1990, Habilitation 1994)

Further information

Forschungsinst. für Diskrete Mathematik, Univ. Bonn (1989)

Source

Internet: https://de.wikipedia.org/wiki/Angelika_Steger

Record type

Person

GND-Identifier

170730433

Record ID

170730433

Involved in

show all

An Optimal Decentralized (Δ + 1)-Coloring Algorithm

The Maximum Label Propagation Algorithm on Sparse Random Graphs

Voltage dependence of synaptic plasticity is essential for rate based learning with short stimuli

Note on the coefficient of variations of neuronal spike trains

A model of functional recovery after significant loss of neural tissue: biofeedback based healing of vestibular dysfunction

Diskrete Strukturen

Bd. 1. Kombinatorik, Graphentheorie, Algebra

Diskrete Strukturen

1. Kombinatorik, Graphentheorie, Algebra

The Steiner tree problem : a tour through graphs, algorithms, and complexity

Diskrete Strukturen

1. Kombinatorik, Graphentheorie, Algebra

Counting h-free graphs

Counting h-free graphs

Random ι-colorable [iota-colorable] graphs

Random ι-colorable [iota-colorable] graphs

A note on induced matchings

A note on induced matchings

Almost all Berge graphs are perfect

Coloring clique free graphs in linear expected time

Coloring clique free graphs in linear expected time

The asymptotic structure of H-free graphs

Die Kleitman-Rothschild-Methode

Die Kleitman-Rothschild-Methode

Excluding induced subgraphs II: extremal graphs

Excluding induced subgraphs II: extremal graphs

Excluding induced subgraphs III: a general asymptotic

Excluding induced subgraphs III: a general asymptotic

Excluding induced subgraphs: quadrilaterals

Partitioning graphs into dense subgraphs

Partitioning graphs into dense subgraphs

Steiner trees in VLSI layout

Steiner trees in VLSI layout

The asymptotic number of graphs not containing a fixed color-critical subgraph

The asymptotic number of graphs not containing a fixed color-critical subgraph

Vorlesung über das Steiner-Problem in Graphen
Please note

The beta version does not yet contain all functions and information of the DNB portal catalogue. If you are missing information or want to order a medium, please visit the page in the DNB portal catalogue via the following link:

DNB portal