| * | 2009 |
|---|
| 6 | EE | Pinar Heggernes,
Rodica Mihai:
Edge Search Number of Cographs in Linear Time.
FAW 2009: 16-26 |
| 5 | EE | Rodica Mihai,
Ioan Todinca:
Pathwidth is NP-Hard for Weighted Trees.
FAW 2009: 181-195 |
| 2008 |
|---|
| 4 | EE | Pinar Heggernes,
Rodica Mihai:
Mixed Search Number of Permutation Graphs.
FAW 2008: 196-207 |
| 3 | EE | Martin R. Ehmsen,
Lene M. Favrholdt,
Jens S. Kohrt,
Rodica Mihai:
Comparing First-Fit and Next-Fit for Online Edge Coloring.
ISAAC 2008: 89-99 |
| 2 | EE | Pinar Heggernes,
Daniel Lokshtanov,
Rodica Mihai,
Charis Papadopoulos:
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.
WG 2008: 218-229 |
| 2007 |
|---|
| 1 | EE | Fedor V. Fomin,
Pinar Heggernes,
Rodica Mihai:
Mixed Search Number and Linear-Width of Interval and Split Graphs.
WG 2007: 304-315 |
