The following pages link to Fanica Gavril (Q294732):
Displaying 28 items.
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- (Q1197980) (redirect page) (← links)
- An algorithm for fraternal orientation of graphs (Q1197981) (← links)
- An algorithm for testing chordality of graphs (Q1216324) (← links)
- A recognition algorithm for the intersection graphs of directed paths in directed trees (Q1219893) (← links)
- Testing for Equality between Maximum Matching and Minimum Node Covering (Q1242177) (← links)
- Algorithms on clique separable graphs (Q1246434) (← links)
- A recognition algorithm for the intersection graphs of paths in trees (Q1254334) (← links)
- Intersection graphs of concatenable subtrees of graphs (Q1331898) (← links)
- Algorithms for maximum weight induced paths (Q1603504) (← links)
- (Q1917299) (redirect page) (← links)
- Intersection graphs of Helly families of subtrees (Q1917300) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
- An efficiently solvable graph partition problem to which many problems are reducible (Q2365814) (← links)
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090) (← links)
- Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing. (Q2583532) (← links)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
- ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS (Q2875683) (← links)
- MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS (Q2890989) (← links)
- (Q3139748) (← links)
- Algorithms for a maximum clique and a maximum independent set of a circle graph (Q5675749) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
