# Jan Arne Telle

> computer scientist

**Wikidata**: [Q131629077](https://www.wikidata.org/wiki/Q131629077)  
**Source**: https://4ort.xyz/entity/jan-arne-telle

## Summary
Jan Arne Telle is a Norwegian computer scientist specializing in graph theory. He has been affiliated with the University of Bergen since 1994 and earned his doctorate at the University of Oregon with research on vertex partitioning problems.

## Biography
- Born: May 15, 1962 in Bærum Municipality, Norway
- Nationality: Norway
- Education: 
  - Bachelor of Science in Computer Science and Engineering, California State University, Long Beach (1983-1987)
  - Doctor of Philosophy in Computer Science, University of Oregon (1988-1994)
- Known for: Research in graph theory and vertex partitioning problems
- Employer(s):
  - University of Bergen (1994-present)
  - Department of Computer Science at the University of Oregon (1988-1994)
  - Cornell University (1995-1996)
  - Paris Diderot University (1999)
- Field(s): Graph theory, computer science

## Contributions
Jan Arne Telle has made significant contributions to graph theory and algorithmic research, particularly on vertex partitioning problems. His doctoral thesis "Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial K-trees" (1994) established foundational work on partial k-trees. He has published extensively and maintained active research profiles across multiple academic databases (DBLP, Scopus, zbmath, Google Scholar). His research has advanced understanding of graph algorithms and complexity theory, with applications to various computational problems. He has served as an academic advisor and supervised doctoral students, contributing to the next generation of computer scientists.

## FAQs
### Q: Where did Jan Arne Telle receive his education?
A: Jan Arne Telle earned his Bachelor of Science in Computer Science and Engineering from California State University, Long Beach (1983-1987) and his Doctor of Philosophy in Computer Science from the University of Oregon (1988-1994).

### Q: What is the focus of Jan Arne Telle's research?
A: Jan Arne Telle's primary research focuses on graph theory, particularly vertex partitioning problems, partial k-trees, and related algorithmic approaches in theoretical computer science.

### Q: What academic positions has Jan Arne Telle held?
A: Telle has held positions at the University of Bergen (1994-present), Cornell University (1995-1996), Paris Diderot University (1999), and previously worked at the Department of Computer Science at the University of Oregon (1988-1994).

## Why They Matter
Jan Arne Telle's research in graph theory and vertex partitioning problems has provided foundational insights into algorithmic complexity and graph structures. His doctoral work on partial k-trees established important frameworks that continue to influence theoretical computer science. As a professor at the University of Bergen since 1994, he has contributed to both research and education, mentoring the next generation of computer scientists. His international collaborations have helped strengthen the global network of researchers working on graph theory problems.

## Notable For
- Groundbreaking doctoral thesis on vertex partitioning problems and partial k-trees (1994)
- Long-standing academic career at University of Bergen since 1994
- Research profile across multiple international academic databases
- International academic collaborations with institutions in the US and Europe
- Academic supervision and mentorship in computer science

## Body
### Early Life and Education
Jan Arne Telle was born on May 15, 1962, in Bærum Municipality, Norway. He holds Norwegian citizenship.

Telle earned his Bachelor of Science in Computer Science and Engineering from California State University, Long Beach between 1983 and 1987. He then pursued his Doctor of Philosophy in Computer Science at the University of Oregon, completing his studies in 1994. His doctoral thesis was titled "Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial K-trees."

### Academic Career
Telle began his academic career at the Department of Computer Science at the University of Oregon, where he worked from 1988 to 1994. After completing his doctorate, he joined Cornell University in 1995 and worked there until 1996. In 1999, he had an affiliation with Paris Diderot University.

Since 1994, Telle has been affiliated with the University of Bergen in Norway, where he continues to work.

### Research Focus
Telle's primary field of work is graph theory, with a specific focus on vertex partitioning problems. His research has contributed to the understanding of partial k-trees and related graph structures. He has supervised doctoral students, including Lars Jaffke.

### Professional Networks
Telle is part of various academic networks and has been assigned several person identifiers:
- mr_author_id: 338828
- nva_person_id: 49371
- dblp_author_id: 53/4123
- scopus_author_id: 7005533390
- zbmath_author_id: telle.jan-arne
- mathematics_genealogy_project_id: 280312

### Online Presence
Telle maintains an active online presence with websites in both English (https://www.ii.uib.no/~telle/) and Norwegian (https://www.ii.uib.no/~telle/norsk), and his curriculum vitae is available at https://www.ii.uib.no/~telle/cv.pdf.

## References

1. [Source](https://www.ii.uib.no/~telle/cv.pdf)