# Bernd Gärtner

> German computer scientist

**Wikidata**: [Q54506665](https://www.wikidata.org/wiki/Q54506665)  
**Source**: https://4ort.xyz/entity/bernd-gartner

## Summary
Bernd Gärtner is a German computer scientist specializing in theoretical computer science, combinatorial algorithms, and discrete optimization. He is affiliated with ETH Zurich and has mentored notable researchers like Martin Jaggi and Sven Schönherr.

## Biography
- Born: 1966
- Nationality: Germany
- Education: Doctorate from Freie Universität Berlin (1995)
- Known for: Contributions to theoretical computer science, combinatorial algorithms, and discrete optimization
- Employer(s): ETH Zurich
- Field(s): Theoretical computer science, combinatorial algorithm, discrete optimization

## Contributions
Bernd Gärtner has made significant contributions to theoretical computer science, particularly in combinatorial algorithms and discrete optimization. His doctoral work, completed in 1995 under the supervision of Emo Welzl, laid the foundation for his research. He has mentored several doctoral students, including Martin Jaggi and Sven Schönherr, further advancing the field. His work has been recognized through various academic identifiers, including his ISNI, VIAF, and Google Scholar profile, which highlight his publications and research impact.

## FAQs
### Q: What is Bernd Gärtner known for?
A: Bernd Gärtner is known for his work in theoretical computer science, particularly in combinatorial algorithms and discrete optimization. He has mentored several notable researchers and is affiliated with ETH Zurich.

### Q: Where did Bernd Gärtner earn his doctorate?
A: Bernd Gärtner earned his doctorate from Freie Universität Berlin in 1995.

### Q: Who were Bernd Gärtner's doctoral students?
A: Bernd Gärtner mentored Martin Jaggi and Sven Schönherr during their doctoral studies.

### Q: What are Bernd Gärtner's academic affiliations?
A: Bernd Gärtner is currently affiliated with ETH Zurich.

### Q: What fields does Bernd Gärtner specialize in?
A: Bernd Gärtner specializes in theoretical computer science, combinatorial algorithms, and discrete optimization.

## Why They Matter
Bernd Gärtner's contributions to theoretical computer science have had a lasting impact on the field of combinatorial algorithms and discrete optimization. His mentorship of doctoral students like Martin Jaggi and Sven Schönherr has further advanced research in these areas. His work has been recognized through various academic identifiers, including his ISNI, VIAF, and Google Scholar profile, which highlight his publications and research impact. Bernd Gärtner's research has influenced the development of algorithms and optimization techniques, making him a significant figure in the field of theoretical computer science.

## Notable For
- Mentored notable researchers including Martin Jaggi and Sven Schönherr.
- Affiliated with ETH Zurich, a leading institution in computer science.
- Specializes in theoretical computer science, combinatorial algorithms, and discrete optimization.
- Recognized through various academic identifiers, including ISNI, VIAF, and Google Scholar.
- Contributions to the field of combinatorial algorithms and discrete optimization.

## Body
### Early Life and Education
Bernd Gärtner was born in 1966. He completed his doctorate from Freie Universität Berlin in 1995 under the supervision of Emo Welzl. His doctoral work laid the foundation for his subsequent research in theoretical computer science.

### Academic Career
Bernd Gärtner is currently affiliated with ETH Zurich, where he continues to contribute to the field of theoretical computer science. His research focuses on combinatorial algorithms and discrete optimization, areas that have seen significant advancements due to his work.

### Mentorship and Influence
Bernd Gärtner has mentored several doctoral students, including Martin Jaggi and Sven Schönherr. His guidance has helped shape the careers of these researchers and has contributed to the development of new algorithms and optimization techniques.

### Recognition and Publications
Bernd Gärtner's work has been recognized through various academic identifiers, including his ISNI, VIAF, and Google Scholar profile. These identifiers highlight his publications and research impact, demonstrating his significant contributions to the field of theoretical computer science.

## Schema Markup
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Bernd Gärtner",
  "jobTitle": "Computer Scientist",
  "worksFor": {"@type": "Organization", "name": "ETH Zurich"},
  "nationality": {"@type": "Country", "name": "Germany"},
  "birthDate": "1966",
  "alumniOf": [{"@type": "EducationalOrganization", "name": "Freie Universität Berlin"}],
  "knowsAbout": ["Theoretical Computer Science", "Combinatorial Algorithms", "Discrete Optimization"],
  "sameAs": ["https://people.inf.ethz.ch/gaertner/index.html"],
  "description": "German computer scientist specializing in theoretical computer science, combinatorial algorithms, and discrete optimization."
}

## References

1. Czech National Authority Database
2. Mathematics Genealogy Project
3. Virtual International Authority File
4. [Source](https://people.inf.ethz.ch/gaertner/subdir/texts/diss/thesis.pdf)
5. NUKAT