Students of Pinar Heggernes

Graduated PhDs (main supervisor):

Paloma Lima, PhD, November 26, 2019.
Thesis: Structural and Algorithmich Graph Theory Through the Lenses of Graph Classes.
Current position: Assistant professor, IT University of Copenhagen, Denmark

Reza Saei, PhD, May 29, 2015.
Thesis:Algorithmic and Combinatorial Problems on Graph Classes.
Current position: Associate professor, Nord University, Bodø, Norway

Rémy Belmonte, PhD, November 1, 2013.
Thesis: Algorithmic and Combinatorial Aspects of Containment Relations in Graphs
Current position: Assistant professor, The University of Electro-Communications, Tokyo, Japan.

Jesper Nederlof, PhD, December 9, 2011.
Thesis: Space and Time Efficient Structural Improvements of Dynamic Programming Algorithms.
Current position: Assistant Professor, Technical University of Eindhoven, The Netherlands.
Jesper received an ERC starting grant in 2019.

Rodica Mihai, PhD, March 15, 2010.
Thesis: Games on graphs: searching and online coloring.
Current position: Senior research scientist, NORCE Research, Bergen, Norway.

Daniel Lokshtanov, PhD, June 22, 2009.
Thesis: New methods in parameterized algorithms and complexity.
Current position: Associate professor, University of California Santa Barbara, USA.
Daniel received an ERC starting grant in 2016.

Federico Mancini, PhD, September 18, 2008.
Thesis: Graph modification problems related to graph classes.
Current position: Senior researcher, Norwegian Defence Research Establishment, Oslo, Norway.

Yngve Villanger, PhD, April 25, 2006.
Thesis: New results on minimal triangulations.
Current position: Senior data scientist, Karsten Moholt AS, Bergen, Norway.

A photo of me with my first three doctors (2009).
A photo of me with my fourth doctor (2010).
A photo of me with my fifth doctor (2011).
And here is one with my sixth doctor (2013).
And a photo with my seventh doctor (2015).
And finally a photo with my eighth and so far last doctor (2019).

Co-supervisor of "countless" PhD students.

Graduated master students:

Håvard Stuberg, MSc, June 14, 2019.
Thesis: Maximum Number of Edges in Graphs Under Various Constraints
First job after graduation: Knowit Reaktor Solutions, Bergen.

Ida Rydland, MSc, June 15, 2017.
Thesis: New lower bounds on the maximum number of minimal connected vertex covers in graphs
First job after graduation: Computas, Oslo.

Ida B Skjørten, MSc, June 15, 2017.
Subject: Faster enumeration of minimal connected dominating sets in split graphs
First job after graduation: Knowit, Oslo.

Marit Hellestø, MSc, June 23, 2015.
Thesis: Maximum number of objects in graph classes
First job after graduation: Knowit, Bergen.

Erik Måland, MSc, May 28, 2015.
Thesis: Maximum number of edges in graph classes under degree and matching constraints
First job after graduation: Future Home, Stavanger.

Simen Lilleeng, MSc, June 19, 2014.
Thesis: A polynomial-time solvable case for the NP-hard problem CUTWITDTH
First job after graduation: Snapsale, Oslo.

Markus S Dregi, MSc, June 28, 2012.
Thesis: Computation of treespan: a generalization of bandwidth to treelike structures
First job after graduation: PhD student, University of Bergen.

Sigve H Sæther, MSc, June 16, 2011.
Thesis: Optimal broadcast domination on some perfect graph classes
First job after graduation: PhD student, University of Bergen.

Rune A Wallmark, Siv.Ing., June 25, 2007.
Thesis: Analysis of public bus transport in Bergen
First job after graduation: Reaktor, Bergen.

Kjartan Storli, MSc, January 12, 2007.
Thesis: Tiebreaking strategies for Minimum Degree
First job after graduation: Webstep, Bergen.

Audun Hegranes, MSc, June 19, 2006.
Thesis: Chordal graph recognition through depth-first search
First job after graduation: PSWinCom AS.

Daniel Lokshtanov, MSc, June 12, 2006.
Thesis: Broadcast Domination
First job after graduation: PhD student, University of Bergen.

Lars Tore Løvtangen, Cand. Scient., October 21, 2005.
Thesis: Parallel recognition of chordal graphs
First job after graduation: Pride ASA, Stavanger.

Tore Nedretvedt, MSc, August 10, 2005.
Thesis: Implementation of a minimal triangulation algorithm for studying properties of the Minimum Degree heuristic
First job after graduation: Accenture, Oslo.

Kjetil Watnedal, MSc, August 10, 2005.
Thesis: Avgjøre små trespenn (Deciding small treespan)
First job after graduation: Tinden Consulting, Bergen.

Helge Holm, MSc, January 31, 2005.
Thesis: Implementation of Broadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees
First job after graduation: Wizrt, Bergen.

Camilla N Nilsen, Cand. Scient., December 20, 2004.
Thesis: Minimal Triangulations in LEDA
First job after graduation: Nordea, Bergen.

Lars S Skeide, Cand. Scient., December 17, 2002.
Thesis: Recognizing weakly chordal graphs.
First job after graduation: Vesta Forsikring, Bergen.

Yngve Villanger, Cand. Scient., June 20, 2002.
Thesis: Efficient minimal triangulation of graphs by using tree decompositions.
First job after graduation: PhD Student, University of Bergen.

Jan Storenes, Cand. Scient., December 5, 2001.
Thesis: Implementation and application of a fully dynamic algorithm for chordal graphs.
First job after graduation: University of Bergen.

Ole-Martin Kvinge, Cand. Scient., November 18, 1999.
Thesis: Practical aspects of fill reduction on sparse matrices and graphs.
First job after graduation: Statistisk Sentralbyrå, Oslo.