| Publication | Date of Publication | Type |
|---|
| Maximum max-k-clique subgraphs in cactus subtree graphs | 2023-07-15 | Paper |
| Approximation algorithms for maximum weight k-coverings of graphs by packings | 2022-03-17 | Paper |
| New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs | 2017-09-19 | Paper |
| Maximum weight independent sets and cliques in intersection graphs of filaments | 2016-06-16 | Paper |
| Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs | 2016-02-22 | Paper |
| Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs | 2015-11-17 | Paper |
| ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS | 2014-08-11 | Paper |
| Algorithms for induced biclique optimization problems | 2013-03-28 | Paper |
| Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs | 2012-11-06 | Paper |
| MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS | 2012-06-12 | Paper |
| Minimum weight feedback vertex sets in circle graphs | 2010-04-19 | Paper |
| Algorithms on Subtree Filament Graphs | 2010-01-07 | Paper |
| Covering a Tree by a Forest | 2010-01-07 | Paper |
| Intersection representations of matrices by subtrees and unicycles on graphs | 2008-08-08 | Paper |
| 3D-interval-filament graphs | 2007-11-30 | Paper |
| Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing. | 2006-01-17 | Paper |
| Algorithms for maximum weight induced paths | 2002-07-14 | Paper |
| Intersection graphs of Helly families of subtrees | 1996-07-07 | Paper |
| Intersection graphs of concatenable subtrees of graphs | 1995-01-26 | Paper |
| Chordless Paths, Odd Holes, and Kernels in Graphs Without m-Obstructions | 1994-11-30 | Paper |
| Intersection graphs of proper subtrees of unicyclic graphs | 1994-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139748 | 1993-11-11 | Paper |
| An efficiently solvable graph partition problem to which many problems are reducible | 1993-06-29 | Paper |
| An algorithm for fraternal orientation of graphs | 1993-01-16 | Paper |
| The maximum k-colorable subgraph problem for chordal graphs | 1987-01-01 | Paper |
| Generating the maximum spanning trees of a weighted graph | 1987-01-01 | Paper |
| Algorithms for maximumk-colorings andk-coverings of transitive graphs | 1987-01-01 | Paper |
| Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs | 1985-01-01 | Paper |
| An algorithm for constructing edge-trees from hypergraphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3944642 | 1982-01-01 | Paper |
| Edge Dominating Sets in Graphs | 1980-01-01 | Paper |
| A recognition algorithm for the intersection graphs of paths in trees | 1978-01-01 | Paper |
| A recognition algorithm for the total graphs | 1978-01-01 | Paper |
| Testing for Equality between Maximum Matching and Minimum Node Covering | 1977-01-01 | Paper |
| Algorithms on clique separable graphs | 1977-01-01 | Paper |
| An algorithm for testing chordality of graphs | 1975-01-01 | Paper |
| A recognition algorithm for the intersection graphs of directed paths in directed trees | 1975-01-01 | Paper |
| Merging with parallel processors | 1975-01-01 | Paper |
| The intersection graphs of subtrees in trees are exactly the chordal graphs | 1974-01-01 | Paper |
| Algorithms on circular-arc graphs | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5670639 | 1973-01-01 | Paper |
| Algorithms for a maximum clique and a maximum independent set of a circle graph | 1973-01-01 | Paper |
| Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph | 1972-01-01 | Paper |
