Fanica Gavril - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 37 from 37

2023

Maximum max-k-clique subgraphs in cactus subtree graphsFanica Gavril. dmaa, 15(6), August 2023. [doi]

2022

Approximation algorithms for maximum weight k-coverings of graphs by packingsFanica Gavril, Mordechai Shalom, Shmuel Zaks. dmaa, 14(1), 2022. [doi]

2017

New insights on GA-H reduced graphsFanica Gavril. ipl, 128:58-61, 2017. [doi]

2015

Algorithms for GA-H reduced graphsFanica Gavril. jda, 35:17-26, 2015. [doi]

Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphsFanica Gavril. dmaa, 7(4), 2015. [doi]

2014

Algorithms on Subgraph Overlap graphsFanica Gavril. dmaa, 6(2), 2014. [doi]

2012

Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle GraphsFanica Gavril. wg 2012: 297-307 [doi]

2011

Algorithms for induced biclique optimization problemsFanica Gavril. ipl, 111(10):469-473, 2011. [doi]

Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid GraphsFanica Gavril. dmaa, 3(3):323-336, 2011. [doi]

2009

Covering a Tree by a ForestFanica Gavril, Alon Itai. BIRTHDAY 2009: 66-76 [doi]

Algorithms on Subtree Filament GraphsFanica Gavril. BIRTHDAY 2009: 27-35 [doi]

2008

Minimum weight feedback vertex sets in circle graphsFanica Gavril. ipl, 107(1):1-6, 2008. [doi]

Intersection representations of matrices by subtrees and unicycles on graphsFanica Gavril, Ron Y. Pinter, Shmuel Zaks. jda, 6(2):216-228, 2008. [doi]

2007

3D-interval-filament graphsFanica Gavril. DAM, 155(18):2625-2636, 2007. [doi]

2002

Algorithms for maximum weight induced pathsFanica Gavril. ipl, 81(4):203-208, 2002. [doi]

2000

Maximum weight independent sets and cliques in intersection graphs of filamentsFanica Gavril. ipl, 73(5-6):181-188, 2000. [doi]

1998

Intersection Graphs of ::::k::::-Acyclic Families of Subtrees and Relational Database Query ProcessingFanica Gavril, Oded Shmueli. ipl, 66(1):1-6, 1998. [doi]

1996

Intersection Graphs of Helly Families of SubtreesFanica Gavril. DAM, 66(1):45-56, 1996. [doi]

1994

Chordless Paths, Odd Holes, and Kernels in Graphs without m-ObstructionsFanica Gavril, V. Toledano Laredo, Dominique de Werra. jal, 17(2):207-221, 1994.

Intersection Graphs of Concatenable Subtrees of GraphsFanica Gavril, Jorge Urrutia. DAM, 52(2):195-209, 1994. [doi]

1993

An Efficiently Solvable Graph Partition Problem to Which Many Problems are ReducibleFanica Gavril. ipl, 45(6):285-290, 1993.

1992

An Algorithm for Fraternal Orientation of GraphsJorge Urrutia, Fanica Gavril. ipl, 41(5):271-274, 1992.

1987

Generating the Maximum Spanning Trees of a Weighted GraphFanica Gavril. jal, 8(4):592-597, 1987.

k-coverings of transitive graphsFanica Gavril. networks, 17(4):465-470, 1987. [doi]

The Maximum k-Colorable Subgraph Problem for Chordal GraphsMihalis Yannakakis, Fanica Gavril. ipl, 24(2):133-137, 1987.

1985

Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted SubgraphsFanica Gavril, Johanan Schönheim. jal, 6(2):239-252, 1985.

1983

An algorithm for constructing edge-trees from hypergraphsFanica Gavril, Robert Tamari. networks, 13(3):377-388, 1983. [doi]

1982

Characterization and algorithms of curve map graphsFanica Gavril, Johanan Schönheim. DAM, 4(3):181-191, 1982. [doi]

1978

A recognition algorithm for the total graphsFanica Gavril. networks, 8(2):121-133, 1978. [doi]

A recognition algorithm for the intersection graphs of paths in treesFanica Gavril. DM, 23(3):211-227, 1978. [doi]

1977

Testing for Equality Between Maximum Matching and Minimum Node CoveringFanica Gavril. ipl, 6(6):199-202, 1977.

Algorithms on clique separable graphsFanica Gavril. DM, 19(2):159-165, 1977. [doi]

1975

An Algorithm for Testing Chordality of GraphsFanica Gavril. ipl, 3(4):110-112, 1975.

Merging with Parallel ProcessorsFanica Gavril. CACM, 18(10):588-591, 1975.

A recognition algorithm for the intersection graphs of directed paths in directed treesFanica Gavril. DM, 13(3):237-249, 1975. [doi]

1974

Algorithms on circular-arc graphsFanica Gavril. networks, 4(4):357-369, 1974. [doi]

1972

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphFanica Gavril. SICOMP, 1(2):180-187, 1972.

Sign in or sign up to see more results.

runs on WebDSL