Fanica Gavril

According to our database, Fanica Gavril authored at least 39 papers between 1972 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Maximum max-k-clique subgraphs in cactus subtree graphs.

Fanica Gavril

Discret. Math. Algorithms Appl., August, 2023

2022

Approximation algorithms for maximum weight k-coverings of graphs by packings.

Fanica Gavril, Mordechai Shalom, Shmuel Zaks

Discret. Math. Algorithms Appl., 2022

2019

Maximizing Communication Throughput in Tree Networks.

Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks

CoRR, 2019

2017

New insights on GA-H reduced graphs.

Fanica Gavril

Inf. Process. Lett., 2017

2015

Algorithms for GA-H reduced graphs.

Fanica Gavril

J. Discrete Algorithms, 2015

Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs.

Fanica Gavril

Discret. Math. Algorithms Appl., 2015

2014

Algorithms on Subgraph Overlap graphs.

Fanica Gavril

Discret. Math. Algorithms Appl., 2014

2012

Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs.

Fanica Gavril

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Algorithms for induced biclique optimization problems.

Fanica Gavril

Inf. Process. Lett., 2011

Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs.

Fanica Gavril

Discret. Math. Algorithms Appl., 2011

2009

Covering a Tree by a Forest.

Fanica Gavril, Alon Itai

Proceedings of the Graph Theory, 2009

Algorithms on Subtree Filament Graphs.

Fanica Gavril

Proceedings of the Graph Theory, 2009

2008

Intersection representations of matrices by subtrees and unicycles on graphs.

Fanica Gavril, Ron Y. Pinter, Shmuel Zaks

J. Discrete Algorithms, 2008

Minimum weight feedback vertex sets in circle graphs.

Fanica Gavril

Inf. Process. Lett., 2008

2007

3D-interval-filament graphs.

Fanica Gavril

Discret. Appl. Math., 2007

2002

Algorithms for maximum weight induced paths.

Fanica Gavril

Inf. Process. Lett., 2002

2000

Maximum weight independent sets and cliques in intersection graphs of filaments.

Fanica Gavril

Inf. Process. Lett., 2000

1998

Intersection Graphs of <i>k</i>-Acyclic Families of Subtrees and Relational Database Query Processing.

Fanica Gavril, Oded Shmueli

Inf. Process. Lett., 1998

1996

Intersection Graphs of Helly Families of Subtrees.

Fanica Gavril

Discret. Appl. Math., 1996

1994

Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions.

Fanica Gavril, V. Toledano Laredo, Dominique de Werra

J. Algorithms, 1994

Intersection Graphs of Concatenable Subtrees of Graphs.

Fanica Gavril, Jorge Urrutia

Discret. Appl. Math., 1994

1993

An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible.

Fanica Gavril

Inf. Process. Lett., 1993

1992

An Algorithm for Fraternal Orientation of Graphs.

Jorge Urrutia, Fanica Gavril

Inf. Process. Lett., 1992

1987

Algorithms for maximum <i>k</i>-colorings and <i>k</i>-coverings of transitive graphs.

Fanica Gavril

Networks, 1987

Generating the Maximum Spanning Trees of a Weighted Graph.

Fanica Gavril

J. Algorithms, 1987

The Maximum k-Colorable Subgraph Problem for Chordal Graphs.

Mihalis Yannakakis, Fanica Gavril

Inf. Process. Lett., 1987

1985

Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs.

Fanica Gavril, Johanan Schönheim

J. Algorithms, 1985

1983

An algorithm for constructing edge-trees from hypergraphs.

Fanica Gavril, Robert Tamari

Networks, 1983

1982

Characterization and algorithms of curve map graphs.

Fanica Gavril, Johanan Schönheim

Discret. Appl. Math., 1982

1978

A recognition algorithm for the total graphs.

Fanica Gavril

Networks, 1978

A recognition algorithm for the intersection graphs of paths in trees.

Fanica Gavril

Discret. Math., 1978

1977

Testing for Equality Between Maximum Matching and Minimum Node Covering.

Fanica Gavril

Inf. Process. Lett., 1977

Algorithms on clique separable graphs.

Fanica Gavril

Discret. Math., 1977

1975

An Algorithm for Testing Chordality of Graphs.

Fanica Gavril

Inf. Process. Lett., 1975

A recognition algorithm for the intersection graphs of directed paths in directed trees.

Fanica Gavril

Discret. Math., 1975

Merging with Parallel Processors.

Fanica Gavril

Commun. ACM, 1975

1974

Algorithms on circular-arc graphs.

Fanica Gavril

Networks, 1974

1973

Algorithms for a maximum clique and a maximum independent set of a circle graph.

Fanica Gavril

Networks, 1973

1972

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph.

Fanica Gavril

SIAM J. Comput., 1972