The SCEAS System
| |||||||

## Search the dblp DataBase
Fanica Gavril:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Fanica Gavril
**Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph.**[Citation Graph (4, 0)][DBLP] SIAM J. Comput., 1972, v:1, n:2, pp:180-187 [Journal] - Fanica Gavril
**Merging with Parallel Processors.**[Citation Graph (0, 0)][DBLP] Commun. ACM, 1975, v:18, n:10, pp:588-591 [Journal] - Fanica Gavril
**Intersection Graphs of Helly Families of Subtrees.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:66, n:1, pp:45-56 [Journal] - Fanica Gavril, Jorge Urrutia
**Intersection Graphs of Concatenable Subtrees of Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:52, n:2, pp:195-209 [Journal] - Fanica Gavril
**Maximum weight independent sets and cliques in intersection graphs of filaments.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:73, n:5-6, pp:181-188 [Journal] - Fanica Gavril
**Algorithms for maximum weight induced paths.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:4, pp:203-208 [Journal] - Fanica Gavril
**An Algorithm for Testing Chordality of Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1975, v:3, n:4, pp:110-112 [Journal] - Fanica Gavril
**Testing for Equality Between Maximum Matching and Minimum Node Covering.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1977, v:6, n:6, pp:199-202 [Journal] - Fanica Gavril
**An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:45, n:6, pp:285-290 [Journal] - Fanica Gavril, Oded Shmueli
**Intersection Graphs of**[Citation Graph (0, 0)][DBLP]*k*-Acyclic Families of Subtrees and Relational Database Query Processing. Inf. Process. Lett., 1998, v:66, n:1, pp:1-6 [Journal] - Jorge Urrutia, Fanica Gavril
**An Algorithm for Fraternal Orientation of Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:41, n:5, pp:271-274 [Journal] - Mihalis Yannakakis, Fanica Gavril
**The Maximum k-Colorable Subgraph Problem for Chordal Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1987, v:24, n:2, pp:133-137 [Journal] - Fanica Gavril
**Generating the Maximum Spanning Trees of a Weighted Graph.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1987, v:8, n:4, pp:592-597 [Journal] - Fanica Gavril, V. Toledano Laredo, Dominique de Werra
**Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1994, v:17, n:2, pp:207-221 [Journal] - Fanica Gavril, Johanan Schönheim
**Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1985, v:6, n:2, pp:239-252 [Journal] **Covering a Tree by a Forest.**[Citation Graph (, )][DBLP]**Algorithms on Subtree Filament Graphs.**[Citation Graph (, )][DBLP]**3D-interval-filament graphs.**[Citation Graph (, )][DBLP]
Search in 0.219secs, Finished in 0.220secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |