| Publication | Date of Publication | Type |
|---|
Maximum max-k-clique subgraphs in cactus subtree graphs
Discrete Mathematics, Algorithms and Applications | 2023-07-15 | Paper |
Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings
Discrete Mathematics, Algorithms and Applications | 2022-03-17 | Paper |
New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
Information Processing Letters | 2017-09-19 | Paper |
Maximum weight independent sets and cliques in intersection graphs of filaments
Information Processing Letters | 2016-06-16 | Paper |
Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
Discrete Mathematics, Algorithms and Applications | 2016-02-22 | Paper |
Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
Journal of Discrete Algorithms | 2015-11-17 | Paper |
Algorithms on subgraph overlap graphs
Discrete Mathematics, Algorithms and Applications | 2014-08-11 | Paper |
Algorithms for induced biclique optimization problems
Information Processing Letters | 2013-03-28 | Paper |
Maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs and circle graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Minimum weight feedback vertex sets in circle n-gon graphs and circle trapezoid graphs
Discrete Mathematics, Algorithms and Applications | 2012-06-12 | Paper |
Minimum weight feedback vertex sets in circle graphs
Information Processing Letters | 2010-04-19 | Paper |
Algorithms on Subtree Filament Graphs
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Covering a tree by a forest
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Intersection representations of matrices by subtrees and unicycles on graphs
Journal of Discrete Algorithms | 2008-08-08 | Paper |
3D-interval-filament graphs
Discrete Applied Mathematics | 2007-11-30 | Paper |
Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
Information Processing Letters | 2006-01-17 | Paper |
Algorithms for maximum weight induced paths
Information Processing Letters | 2002-07-14 | Paper |
Intersection graphs of Helly families of subtrees
Discrete Applied Mathematics | 1996-07-07 | Paper |
Intersection graphs of concatenable subtrees of graphs
Discrete Applied Mathematics | 1995-01-26 | Paper |
Chordless Paths, Odd Holes, and Kernels in Graphs Without m-Obstructions
Journal of Algorithms | 1994-11-30 | Paper |
Intersection graphs of proper subtrees of unicyclic graphs
Journal of Graph Theory | 1994-11-27 | Paper |
| scientific article; zbMATH DE number 434894 (Why is no real title available?) | 1993-11-11 | Paper |
An efficiently solvable graph partition problem to which many problems are reducible
Information Processing Letters | 1993-06-29 | Paper |
An algorithm for fraternal orientation of graphs
Information Processing Letters | 1993-01-16 | Paper |
The maximum k-colorable subgraph problem for chordal graphs
Information Processing Letters | 1987-01-01 | Paper |
Generating the maximum spanning trees of a weighted graph
Journal of Algorithms | 1987-01-01 | Paper |
Algorithms for maximumk-colorings andk-coverings of transitive graphs
Networks | 1987-01-01 | Paper |
Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs
Journal of Algorithms | 1985-01-01 | Paper |
An algorithm for constructing edge-trees from hypergraphs
Networks | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3762110 (Why is no real title available?) | 1982-01-01 | Paper |
Edge Dominating Sets in Graphs
SIAM Journal on Applied Mathematics | 1980-01-01 | Paper |
A recognition algorithm for the intersection graphs of paths in trees
Discrete Mathematics | 1978-01-01 | Paper |
A recognition algorithm for the total graphs
Networks | 1978-01-01 | Paper |
Testing for Equality between Maximum Matching and Minimum Node Covering
Information Processing Letters | 1977-01-01 | Paper |
Algorithms on clique separable graphs
Discrete Mathematics | 1977-01-01 | Paper |
An algorithm for testing chordality of graphs
Information Processing Letters | 1975-01-01 | Paper |
A recognition algorithm for the intersection graphs of directed paths in directed trees
Discrete Mathematics | 1975-01-01 | Paper |
Merging with parallel processors
Communications of the ACM | 1975-01-01 | Paper |
The intersection graphs of subtrees in trees are exactly the chordal graphs
Journal of Combinatorial Theory. Series B | 1974-01-01 | Paper |
Algorithms on circular-arc graphs
Networks | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3404257 (Why is no real title available?) | 1973-01-01 | Paper |
Algorithms for a maximum clique and a maximum independent set of a circle graph
Networks | 1973-01-01 | Paper |
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
SIAM Journal on Computing | 1972-01-01 | Paper |
