Rodica Mihai

Petr A. Golovach, Pinar Heggernes, Rodica Mihai: Edge search number of cographs. Discrete Applied Mathematics 160(6): 734-743 (2012)

Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos: Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discrete Math. 25(3): 1418-1437 (2011)

Fedor V. Fomin, Pinar Heggernes, Rodica Mihai: Mixed search number and linear-width of interval and split graphs. Networks 56(3): 207-214 (2010)

Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai: Comparing First-Fit and Next-Fit for online edge coloring. Theor. Comput. Sci. 411(16-18): 1734-1741 (2010)

Jean R. S. Blair, Fredrik Manne, Rodica Mihai: Efficient Self-stabilizing Graph Searching in Tree Networks. SSS 2010: 111-125

Pinar Heggernes, Rodica Mihai: Edge Search Number of Cographs in Linear Time. FAW 2009: 16-26

Rodica Mihai, Ioan Todinca: Pathwidth is NP-Hard for Weighted Trees. FAW 2009: 181-195

Rodica Mihai, Morten Mjelde: A Self-stabilizing Algorithm for Graph Searching in Trees. SSS 2009: 563-577

Pinar Heggernes, Rodica Mihai: Mixed Search Number of Permutation Graphs. FAW 2008: 196-207

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

Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos: Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG 2008: 218-229

Fedor V. Fomin, Pinar Heggernes, Rodica Mihai: Mixed Search Number and Linear-Width of Interval and Split Graphs. WG 2007: 304-315