- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c3 |      | Fanica Gavril: Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs. WG 2012: 297-307 |
| 2011 | ||
| j24 | | Fanica Gavril: Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs. Discrete Math., Alg. and Appl. 3(3): 323-336 (2011) |
| j23 | | Fanica Gavril: Algorithms for induced biclique optimization problems. Inf. Process. Lett. 111(10): 469-473 (2011) |
| 2009 | ||
| c2 | | Fanica Gavril: Algorithms on Subtree Filament Graphs. Graph Theory, Computational Intelligence and Thought 2009: 27-35 |
| c1 | | Fanica Gavril, Alon Itai: Covering a Tree by a Forest. Graph Theory, Computational Intelligence and Thought 2009: 66-76 |
| 2008 | ||
| j22 | | Fanica Gavril: Minimum weight feedback vertex sets in circle graphs. Inf. Process. Lett. 107(1): 1-6 (2008) |
| j21 | | 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 | ||
| j20 | | |
| 2002 | ||
| j19 | | Fanica Gavril: Algorithms for maximum weight induced paths. Inf. Process. Lett. 81(4): 203-208 (2002) |
| 2000 | ||
| j18 | | Fanica Gavril: Maximum weight independent sets and cliques in intersection graphs of filaments. Inf. Process. Lett. 73(5-6): 181-188 (2000) |
| 1998 | ||
| j17 | | 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 | ||
| j16 | | Fanica Gavril: Intersection Graphs of Helly Families of Subtrees. Discrete Applied Mathematics 66(1): 45-56 (1996) |
| 1994 | ||
| j15 | | Fanica Gavril, Jorge Urrutia: Intersection Graphs of Concatenable Subtrees of Graphs. Discrete Applied Mathematics 52(2): 195-209 (1994) |
| j14 | | 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 | ||
| j13 | | Fanica Gavril: An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible. Inf. Process. Lett. 45(6): 285-290 (1993) |
| 1992 | ||
| j12 | | Jorge Urrutia, Fanica Gavril: An Algorithm for Fraternal Orientation of Graphs. Inf. Process. Lett. 41(5): 271-274 (1992) |
| 1987 | ||
| j11 | | Mihalis Yannakakis, Fanica Gavril: The Maximum k-Colorable Subgraph Problem for Chordal Graphs. Inf. Process. Lett. 24(2): 133-137 (1987) |
| j10 | | Fanica Gavril: Generating the Maximum Spanning Trees of a Weighted Graph. J. Algorithms 8(4): 592-597 (1987) |
| j9 | | Fanica Gavril: Algorithms for maximum k-colorings and k-coverings of transitive graphs. Networks 17(4): 465-470 (1987) |
| 1985 | ||
| j8 | | 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) |
| 1983 | ||
| j7 | | Fanica Gavril, Robert Tamari: An algorithm for constructing edge-trees from hypergraphs. Networks 13(3): 377-388 (1983) |
| 1978 | ||
| j6 | | |
| 1977 | ||
| j5 | | Fanica Gavril: Testing for Equality Between Maximum Matching and Minimum Node Covering. Inf. Process. Lett. 6(6): 199-202 (1977) |
| 1975 | ||
| j4 | | |
| j3 | | Fanica Gavril: An Algorithm for Testing Chordality of Graphs. Inf. Process. Lett. 3(4): 110-112 (1975) |
| 1974 | ||
| j2 | | |
| 1972 | ||
| j1 | | 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) |
| 1 | Alon Itai | |
| 2 | V. Toledano Laredo | |
| 3 | Ron Y. Pinter | |
| 4 | Johanan Schönheim | |
| 5 | Oded Shmueli | |
| 6 | Robert Tamari | |
| 7 | Jorge Urrutia | |
| 8 | Dominique de Werra | |
| 9 | Mihalis Yannakakis | |
| 10 | Shmuel Zaks |
Colors in the list of coauthors
Last update Sat May 25 08:33:57 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page