default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFanica Gavril
Person information
- unicode name: Fănică Gavril
- affiliation: Technion - Israel Institute of Technology, Computer Science Department, Haifa, Israel
- affiliation (PhD 1974): Weizmann Institute of Science, Rehovot, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j35]Fanica Gavril
:
Maximum max-k-clique subgraphs in cactus subtree graphs. Discret. Math. Algorithms Appl. 15(6): 2250147:1-2250147:16 (2023)- 2022
- [j34]Fanica Gavril, Mordechai Shalom, Shmuel Zaks:
Approximation algorithms for maximum weight k-coverings of graphs by packings. Discret. Math. Algorithms Appl. 14(1): 2150099:1-2150099:14 (2022)
2010 – 2019
- 2019
- [i1]Yuval Emek, Fanica Gavril, Shay Kutten, Mordechai Shalom, Shmuel Zaks:
Maximizing Communication Throughput in Tree Networks. CoRR abs/1904.10215 (2019) - 2017
- [j33]Fanica Gavril:
New insights on GA-H reduced graphs. Inf. Process. Lett. 128: 58-61 (2017) - 2015
- [j32]Fanica Gavril:
Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs. Discret. Math. Algorithms Appl. 7(4): 1550061:1-1550061:21 (2015) - [j31]Fanica Gavril:
Algorithms for GA-H reduced graphs. J. Discrete Algorithms 35: 17-26 (2015) - 2014
- [j30]Fanica Gavril:
Algorithms on Subgraph Overlap graphs. Discret. Math. Algorithms Appl. 6(2) (2014) - 2012
- [c3]Fanica Gavril:
Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs. WG 2012: 297-307 - 2011
- [j29]Fanica Gavril:
Minimum Weight Feedback Vertex Sets in Circle n-Gon Graphs and Circle Trapezoid Graphs. Discret. Math. Algorithms Appl. 3(3): 323-336 (2011) - [j28]Fanica Gavril:
Algorithms for induced biclique optimization problems. Inf. Process. Lett. 111(10): 469-473 (2011)
2000 – 2009
- 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
- [j27]Fanica Gavril:
Minimum weight feedback vertex sets in circle graphs. Inf. Process. Lett. 107(1): 1-6 (2008) - [j26]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
- [j25]Fanica Gavril:
3D-interval-filament graphs. Discret. Appl. Math. 155(18): 2625-2636 (2007) - 2002
- [j24]Fanica Gavril:
Algorithms for maximum weight induced paths. Inf. Process. Lett. 81(4): 203-208 (2002) - 2000
- [j23]Fanica Gavril:
Maximum weight independent sets and cliques in intersection graphs of filaments. Inf. Process. Lett. 73(5-6): 181-188 (2000)
1990 – 1999
- 1998
- [j22]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
- [j21]Fanica Gavril:
Intersection Graphs of Helly Families of Subtrees. Discret. Appl. Math. 66(1): 45-56 (1996) - 1994
- [j20]Fanica Gavril, Jorge Urrutia:
Intersection Graphs of Concatenable Subtrees of Graphs. Discret. Appl. Math. 52(2): 195-209 (1994) - [j19]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
- [j18]Fanica Gavril:
An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible. Inf. Process. Lett. 45(6): 285-290 (1993) - 1992
- [j17]Jorge Urrutia, Fanica Gavril:
An Algorithm for Fraternal Orientation of Graphs. Inf. Process. Lett. 41(5): 271-274 (1992)
1980 – 1989
- 1987
- [j16]Mihalis Yannakakis, Fanica Gavril:
The Maximum k-Colorable Subgraph Problem for Chordal Graphs. Inf. Process. Lett. 24(2): 133-137 (1987) - [j15]Fanica Gavril:
Generating the Maximum Spanning Trees of a Weighted Graph. J. Algorithms 8(4): 592-597 (1987) - [j14]Fanica Gavril:
Algorithms for maximum k-colorings and k-coverings of transitive graphs. Networks 17(4): 465-470 (1987) - 1985
- [j13]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
- [j12]Fanica Gavril, Robert Tamari:
An algorithm for constructing edge-trees from hypergraphs. Networks 13(3): 377-388 (1983) - 1982
- [j11]Fanica Gavril, Johanan Schönheim:
Characterization and algorithms of curve map graphs. Discret. Appl. Math. 4(3): 181-191 (1982)
1970 – 1979
- 1978
- [j10]Fanica Gavril:
A recognition algorithm for the intersection graphs of paths in trees. Discret. Math. 23(3): 211-227 (1978) - [j9]Fanica Gavril:
A recognition algorithm for the total graphs. Networks 8(2): 121-133 (1978) - 1977
- [j8]Fanica Gavril:
Algorithms on clique separable graphs. Discret. Math. 19(2): 159-165 (1977) - [j7]Fanica Gavril:
Testing for Equality Between Maximum Matching and Minimum Node Covering. Inf. Process. Lett. 6(6): 199-202 (1977) - 1975
- [j6]Fanica Gavril:
Merging with Parallel Processors. Commun. ACM 18(10): 588-591 (1975) - [j5]Fanica Gavril:
A recognition algorithm for the intersection graphs of directed paths in directed trees. Discret. Math. 13(3): 237-249 (1975) - [j4]Fanica Gavril:
An Algorithm for Testing Chordality of Graphs. Inf. Process. Lett. 3(4): 110-112 (1975) - 1974
- [j3]Fanica Gavril:
Algorithms on circular-arc graphs. Networks 4(4): 357-369 (1974) - 1973
- [j2]Fanica Gavril:
Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3(3): 261-273 (1973) - 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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
