| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6187792 | 2024-01-15 | Paper |
| Decomposing the boundary of a nonconvex polyhedron | 2022-12-09 | Paper |
| Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments | 2022-12-09 | Paper |
| Optimizing generalized kernels of polygons | 2021-08-17 | Paper |
| Shortest watchman tours in simple polygons under rotated monotone visibility | 2021-04-21 | Paper |
| Capturing points with a rotating polygon (and a 3D extension) | 2019-06-27 | Paper |
| Encoding watermark numbers as reducible permutation graphs using self-inverting permutations | 2018-10-26 | Paper |
| Minimum r-Star Cover of Class-3 Orthogonal Polygons | 2015-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501347 | 2015-08-03 | Paper |
| Join-reachability problems in directed graphs | 2015-02-05 | Paper |
| Corrigendum to ``Note on covering monotone orthogonal polygons | 2014-07-18 | Paper |
| Counting spanning trees using modular decomposition | 2014-03-13 | Paper |
| An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs | 2013-01-24 | Paper |
| An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs | 2012-10-11 | Paper |
| A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs | 2012-08-08 | Paper |
| Join-reachability problems in directed graphs | 2011-06-17 | Paper |
| Counting Spanning Trees in Graphs Using Modular Decomposition | 2011-02-20 | Paper |
| Computing the Newton polygon of the implicit equation | 2011-02-19 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| On the hamiltonicity of the Cartesian product | 2009-12-18 | Paper |
| An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs | 2009-12-11 | Paper |
| Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs | 2009-06-23 | Paper |
| An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs | 2009-03-10 | Paper |
| A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs | 2008-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387659 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387667 | 2008-05-27 | Paper |
| Optimal Algorithms for Detecting Network Stability | 2008-03-25 | Paper |
| On the parallel computation of the biconnected and strongly connected co-components of graphs | 2007-09-19 | Paper |
| On the Strongly Connected and Biconnected Components of the Complement of Graphs | 2007-05-29 | Paper |
| Detecting holes and antiholes in graphs | 2007-03-12 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Minimal separators in \(P_4\)-sparse graphs | 2006-03-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Efficient parallel recognition of cographs | 2005-09-28 | Paper |
| An optimal parallel co-connectivity algorithm | 2004-10-01 | Paper |
| Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation | 2004-10-01 | Paper |
| Parallel algorithms for P4-comparability graphs | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474099 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471828 | 2004-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414511 | 2003-07-25 | Paper |
| An efficient shape-based approach to image retrieval | 2002-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721995 | 2001-07-11 | Paper |
| Decomposing the boundary of a nonconvex polyhedron | 1997-06-30 | Paper |
| Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments | 1997-03-18 | Paper |
| Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon | 1996-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4295431 | 1994-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281925 | 1994-03-10 | Paper |
| Triangulating a nonconvex polytope | 1990-01-01 | Paper |
