| Publication | Date of Publication | Type |
|---|
| On the discrete and semi-continuous versions of the two-watchtower problem in the plane | 2025-11-11 | Paper |
| scientific article; zbMATH DE number 7788584 (Why is no real title available?) | 2024-01-15 | Paper |
Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Decomposing the boundary of a nonconvex polyhedron
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Optimizing generalized kernels of polygons
Journal of Global Optimization | 2021-08-17 | Paper |
Shortest watchman tours in simple polygons under rotated monotone visibility
(available as arXiv preprint) | 2021-04-21 | Paper |
Capturing points with a rotating polygon (and a 3D extension)
Theory of Computing Systems | 2019-06-27 | Paper |
Encoding watermark numbers as reducible permutation graphs using self-inverting permutations
Discrete Applied Mathematics | 2018-10-26 | Paper |
Minimum \(r\)-star cover of class-3 orthogonal polygons
Lecture Notes in Computer Science | 2015-09-15 | Paper |
| Hole and antihole detection in graphs | 2015-08-03 | Paper |
Join-reachability problems in directed graphs
Theory of Computing Systems | 2015-02-05 | Paper |
Corrigendum to ``Note on covering monotone orthogonal polygons''
Information Processing Letters | 2014-07-18 | Paper |
Counting spanning trees using modular decomposition
Theoretical Computer Science | 2014-03-13 | Paper |
An \(O(n)\)-time algorithm for the paired domination problem on permutation graphs
European Journal of Combinatorics | 2013-01-24 | Paper |
An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs
Theoretical Computer Science | 2012-10-11 | Paper |
A fully dynamic algorithm for the recognition of P₄-sparse graphs
Theoretical Computer Science | 2012-08-08 | Paper |
Join-reachability problems in directed graphs
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Counting spanning trees in graphs using modular decomposition
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Computing the Newton polygon of the implicit equation
Mathematics in Computer Science | 2011-02-19 | Paper |
Recognizing bipolarizable and \(P _{4}\)-simplicial graphs.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
On the hamiltonicity of the Cartesian product
Information Processing Letters | 2009-12-18 | Paper |
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
Discrete Mathematics | 2009-06-23 | Paper |
An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs
Frontiers in Algorithmics | 2009-03-10 | Paper |
A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
| On the recognition of bipolarizable and \(P_4\)-simplicial graphs | 2008-05-27 | Paper |
| On the recognition of bipolarizable and \(P_4\)-simplicial graphs | 2008-05-27 | Paper |
| Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs | 2008-05-27 | Paper |
| Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs | 2008-05-27 | Paper |
Optimal Algorithms for Detecting Network Stability
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics | 2007-09-19 | Paper |
On the Strongly Connected and Biconnected Components of the Complement of Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Detecting holes and antiholes in graphs
Algorithmica | 2007-03-12 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Minimal separators in \(P_4\)-sparse graphs
Discrete Mathematics | 2006-03-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Efficient parallel recognition of cographs
Discrete Applied Mathematics | 2005-09-28 | Paper |
An optimal parallel co-connectivity algorithm
Theory of Computing Systems | 2004-10-01 | Paper |
Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation
Algorithmica | 2004-10-01 | Paper |
Parallel algorithms for P4-comparability graphs
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2081001 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2079751 (Why is no real title available?) | 2004-07-30 | Paper |
| scientific article; zbMATH DE number 1953107 (Why is no real title available?) | 2003-07-25 | Paper |
An efficient shape-based approach to image retrieval
Pattern Recognition Letters | 2002-07-03 | Paper |
| scientific article; zbMATH DE number 1617273 (Why is no real title available?) | 2001-07-11 | Paper |
Decomposing the boundary of a nonconvex polyhedron
Algorithmica | 1997-06-30 | Paper |
Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments
Journal of Algorithms | 1997-03-18 | Paper |
Optimal tetrahedralization of the 3D-region ``between'' a convex polyhedron and a convex polygon
Computational Geometry | 1996-10-20 | Paper |
| scientific article; zbMATH DE number 589122 (Why is no real title available?) | 1994-06-14 | Paper |
| scientific article; zbMATH DE number 513297 (Why is no real title available?) | 1994-03-10 | Paper |
Triangulating a nonconvex polytope
Discrete & Computational Geometry | 1990-01-01 | Paper |
