| 2008 |
|---|
| 18 | EE | Fanica Gavril:
Minimum weight feedback vertex sets in circle graphs.
Inf. Process. Lett. 107(1): 1-6 (2008) |
| 17 | EE | Fanica Gavril,
Ron Y. Pinter,
Shmuel Zaks:
Intersection representations of matrices by subtrees and unicycles on graphs.
J. Discrete Algorithms 6(2): 216-228 (2008) |
| 2007 |
|---|
| 16 | EE | Fanica Gavril:
3D-interval-filament graphs.
Discrete Applied Mathematics 155(18): 2625-2636 (2007) |
| 2002 |
|---|
| 15 | EE | Fanica Gavril:
Algorithms for maximum weight induced paths.
Inf. Process. Lett. 81(4): 203-208 (2002) |
| 2000 |
|---|
| 14 | EE | Fanica Gavril:
Maximum weight independent sets and cliques in intersection graphs of filaments.
Inf. Process. Lett. 73(5-6): 181-188 (2000) |
| 1998 |
|---|
| 13 | EE | Fanica Gavril,
Oded Shmueli:
Intersection Graphs of k-Acyclic Families of Subtrees and Relational Database Query Processing.
Inf. Process. Lett. 66(1): 1-6 (1998) |
| 1996 |
|---|
| 12 | EE | Fanica Gavril:
Intersection Graphs of Helly Families of Subtrees.
Discrete Applied Mathematics 66(1): 45-56 (1996) |
| 1994 |
|---|
| 11 | EE | Fanica Gavril,
Jorge Urrutia:
Intersection Graphs of Concatenable Subtrees of Graphs.
Discrete Applied Mathematics 52(2): 195-209 (1994) |
| 10 | | Fanica Gavril,
V. Toledano Laredo,
Dominique de Werra:
Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions.
J. Algorithms 17(2): 207-221 (1994) |
| 1993 |
|---|
| 9 | | Fanica Gavril:
An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible.
Inf. Process. Lett. 45(6): 285-290 (1993) |
| 1992 |
|---|
| 8 | | Jorge Urrutia,
Fanica Gavril:
An Algorithm for Fraternal Orientation of Graphs.
Inf. Process. Lett. 41(5): 271-274 (1992) |
| 1987 |
|---|
| 7 | | Mihalis Yannakakis,
Fanica Gavril:
The Maximum k-Colorable Subgraph Problem for Chordal Graphs.
Inf. Process. Lett. 24(2): 133-137 (1987) |
| 6 | | Fanica Gavril:
Generating the Maximum Spanning Trees of a Weighted Graph.
J. Algorithms 8(4): 592-597 (1987) |
| 1985 |
|---|
| 5 | | Fanica Gavril,
Johanan Schönheim:
Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs.
J. Algorithms 6(2): 239-252 (1985) |
| 1977 |
|---|
| 4 | | Fanica Gavril:
Testing for Equality Between Maximum Matching and Minimum Node Covering.
Inf. Process. Lett. 6(6): 199-202 (1977) |
| 1975 |
|---|
| 3 | | Fanica Gavril:
Merging with Parallel Processors.
Commun. ACM 18(10): 588-591 (1975) |
| 2 | | Fanica Gavril:
An Algorithm for Testing Chordality of Graphs.
Inf. Process. Lett. 3(4): 110-112 (1975) |
| 1972 |
|---|
| 1 | | Fanica Gavril:
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph.
SIAM J. Comput. 1(2): 180-187 (1972) |
