Fanica Gavril

39 papers B 1Journal 36Unranked 2
YearRankTypeTitle / Venue / Authors
2023 J jnl
Maximum max-k-clique subgraphs in cactus subtree graphs.
Discret. Math. Algorithms Appl.
Fanica Gavril
2022 J jnl
Approximation algorithms for maximum weight k-coverings of graphs by packings.
Discret. Math. Algorithms Appl.
Fanica Gavril, Mordechai Shalom, Shmuel Zaks
2019 J jnl
Maximizing Communication Throughput in Tree Networks.
CoRR
Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks
2017 J jnl
New insights on GA-H reduced graphs.
Inf. Process. Lett.
Fanica Gavril
2015 J jnl
Algorithms for GA-H reduced graphs.
J. Discrete Algorithms
Fanica Gavril
2015 J jnl
Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs.
Discret. Math. Algorithms Appl.
Fanica Gavril
2014 J jnl
Algorithms on Subgraph Overlap graphs.
Discret. Math. Algorithms Appl.
Fanica Gavril
2012 B conf
Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs.
WG
Fanica Gavril
2011 J jnl
Algorithms for induced biclique optimization problems.
Inf. Process. Lett.
Fanica Gavril
2011 J jnl
Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs.
Discret. Math. Algorithms Appl.
Fanica Gavril
2009 — conf
Algorithms on Subtree Filament Graphs.
Graph Theory, Computational Intelligence and Thought
Fanica Gavril
2009 — conf
Covering a Tree by a Forest.
Graph Theory, Computational Intelligence and Thought
Fanica Gavril, Alon Itai
2008 J jnl
Intersection representations of matrices by subtrees and unicycles on graphs.
J. Discrete Algorithms
Fanica Gavril, Ron Y. Pinter, Shmuel Zaks
2008 J jnl
Minimum weight feedback vertex sets in circle graphs.
Inf. Process. Lett.
Fanica Gavril
2007 J jnl
3D-interval-filament graphs.
Discret. Appl. Math.
Fanica Gavril
2002 J jnl
Algorithms for maximum weight induced paths.
Inf. Process. Lett.
Fanica Gavril
2000 J jnl
Maximum weight independent sets and cliques in intersection graphs of filaments.
Inf. Process. Lett.
Fanica Gavril
1998 J jnl
Intersection Graphs of
Inf. Process. Lett.
Fanica Gavril, Oded Shmueli
1996 J jnl
Intersection Graphs of Helly Families of Subtrees.
Discret. Appl. Math.
Fanica Gavril
1994 J jnl
Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions.
J. Algorithms
Fanica Gavril, V. Toledano Laredo, Dominique de Werra
1994 J jnl
Intersection Graphs of Concatenable Subtrees of Graphs.
Discret. Appl. Math.
Fanica Gavril, Jorge Urrutia
1993 J jnl
An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible.
Inf. Process. Lett.
Fanica Gavril
1992 J jnl
An Algorithm for Fraternal Orientation of Graphs.
Inf. Process. Lett.
Jorge Urrutia, Fanica Gavril
1987 J jnl
Algorithms for maximum
Networks
Fanica Gavril
1987 J jnl
Generating the Maximum Spanning Trees of a Weighted Graph.
J. Algorithms
Fanica Gavril
1987 J jnl
The Maximum k-Colorable Subgraph Problem for Chordal Graphs.
Inf. Process. Lett.
Mihalis Yannakakis, Fanica Gavril
1985 J jnl
Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs.
J. Algorithms
Fanica Gavril, Johanan Schönheim
1983 J jnl
An algorithm for constructing edge-trees from hypergraphs.
Networks
Fanica Gavril, Robert Tamari
1982 J jnl
Characterization and algorithms of curve map graphs.
Discret. Appl. Math.
Fanica Gavril, Johanan Schönheim
1978 J jnl
A recognition algorithm for the intersection graphs of paths in trees.
Discret. Math.
Fanica Gavril
1978 J jnl
A recognition algorithm for the total graphs.
Networks
Fanica Gavril
1977 J jnl
Algorithms on clique separable graphs.
Discret. Math.
Fanica Gavril
1977 J jnl
Testing for Equality Between Maximum Matching and Minimum Node Covering.
Inf. Process. Lett.
Fanica Gavril
1975 J jnl
A recognition algorithm for the intersection graphs of directed paths in directed trees.
Discret. Math.
Fanica Gavril
1975 J jnl
An Algorithm for Testing Chordality of Graphs.
Inf. Process. Lett.
Fanica Gavril
1975 J jnl
Merging with Parallel Processors.
Commun. ACM
Fanica Gavril
1974 J jnl
Algorithms on circular-arc graphs.
Networks
Fanica Gavril
1973 J jnl
Algorithms for a maximum clique and a maximum independent set of a circle graph.
Networks
Fanica Gavril
1972 J jnl
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph.
SIAM J. Comput.
Fanica Gavril