Fanica Gavril

Publication Activity (10 Years)

Years Active: 1972-2023
Publications (10 Years): 4

Top Topics

Connected Subgraphs

Graph Properties

Maximal Cliques

Top Venues

Discret. Math. Algorithms Appl.

Inf. Process. Lett.

J. Discrete Algorithms

Publications

Fanica Gavril
Maximum max-k-clique subgraphs in cactus subtree graphs. Discret. Math. Algorithms Appl. 15 (6) (2023)
Fanica Gavril, Mordechai Shalom, Shmuel Zaks
Approximation algorithms for maximum weight k-coverings of graphs by packings. Discret. Math. Algorithms Appl. 14 (1) (2022)
Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks
Maximizing Communication Throughput in Tree Networks. CoRR (2019)
Fanica Gavril
New insights on GA-H reduced graphs. Inf. Process. Lett. 128 (2017)
Fanica Gavril
Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs. Discret. Math. Algorithms Appl. 7 (4) (2015)
Fanica Gavril
Algorithms for GA-H reduced graphs. J. Discrete Algorithms 35 (2015)
Fanica Gavril
Algorithms on Subgraph Overlap graphs. Discret. Math. Algorithms Appl. 6 (2) (2014)
Fanica Gavril
Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs. WG (2012)
Fanica Gavril
Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs. Discret. Math. Algorithms Appl. 3 (3) (2011)
Fanica Gavril
Algorithms for induced biclique optimization problems. Inf. Process. Lett. 111 (10) (2011)
Fanica Gavril
Algorithms on Subtree Filament Graphs. Graph Theory, Computational Intelligence and Thought (2009)
Fanica Gavril, Alon Itai
Covering a Tree by a Forest. Graph Theory, Computational Intelligence and Thought (2009)
Fanica Gavril
Minimum weight feedback vertex sets in circle graphs. Inf. Process. Lett. 107 (1) (2008)
Fanica Gavril, Ron Y. Pinter, Shmuel Zaks
Intersection representations of matrices by subtrees and unicycles on graphs. J. Discrete Algorithms 6 (2) (2008)
Fanica Gavril
3D-interval-filament graphs. Discret. Appl. Math. 155 (18) (2007)
Fanica Gavril
Algorithms for maximum weight induced paths. Inf. Process. Lett. 81 (4) (2002)
Fanica Gavril
Maximum weight independent sets and cliques in intersection graphs of filaments. Inf. Process. Lett. 73 (5-6) (2000)
Fanica Gavril, Oded Shmueli
-Acyclic Families of Subtrees and Relational Database Query Processing. Inf. Process. Lett. 66 (1) (1998)
Fanica Gavril
Intersection Graphs of Helly Families of Subtrees. Discret. Appl. Math. 66 (1) (1996)
Fanica Gavril, V. Toledano Laredo, Dominique de Werra
Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions. J. Algorithms 17 (2) (1994)
Fanica Gavril, Jorge Urrutia
Intersection Graphs of Concatenable Subtrees of Graphs. Discret. Appl. Math. 52 (2) (1994)
Fanica Gavril
An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible. Inf. Process. Lett. 45 (6) (1993)
Jorge Urrutia, Fanica Gavril
An Algorithm for Fraternal Orientation of Graphs. Inf. Process. Lett. 41 (5) (1992)
Fanica Gavril
Generating the Maximum Spanning Trees of a Weighted Graph. J. Algorithms 8 (4) (1987)
Fanica Gavril
-coverings of transitive graphs. Networks 17 (4) (1987)
Mihalis Yannakakis, Fanica Gavril
The Maximum k-Colorable Subgraph Problem for Chordal Graphs. Inf. Process. Lett. 24 (2) (1987)
Fanica Gavril, Johanan Schönheim
Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs. J. Algorithms 6 (2) (1985)
Fanica Gavril, Robert Tamari
An algorithm for constructing edge-trees from hypergraphs. Networks 13 (3) (1983)
Fanica Gavril, Johanan Schönheim
Characterization and algorithms of curve map graphs. Discret. Appl. Math. 4 (3) (1982)
Fanica Gavril
A recognition algorithm for the total graphs. Networks 8 (2) (1978)
Fanica Gavril
A recognition algorithm for the intersection graphs of paths in trees. Discret. Math. 23 (3) (1978)
Fanica Gavril
Testing for Equality Between Maximum Matching and Minimum Node Covering. Inf. Process. Lett. 6 (6) (1977)
Fanica Gavril
Algorithms on clique separable graphs. Discret. Math. 19 (2) (1977)
Fanica Gavril
A recognition algorithm for the intersection graphs of directed paths in directed trees. Discret. Math. 13 (3) (1975)
Fanica Gavril
Merging with Parallel Processors. Commun. ACM 18 (10) (1975)
Fanica Gavril
An Algorithm for Testing Chordality of Graphs. Inf. Process. Lett. 3 (4) (1975)
Fanica Gavril
Algorithms on circular-arc graphs. Networks 4 (4) (1974)
Fanica Gavril
Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3 (3) (1973)
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) (1972)