| Publication | Date of Publication | Type |
|---|
A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences
Discrete Mathematics, Algorithms and Applications | 2024-11-13 | Paper |
Generating weakly chordal graphs from arbitrary graphs
Transactions on Computational Science XXXIX | 2023-08-03 | Paper |
| Computing in linear time a chord from which a simple polygon is weakly internally visible | 2023-03-21 | Paper |
A linear-time construction of the relative neighborhood graph within a histogram
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Semi-dynamic algorithms for strongly chordal graphs
Discrete Mathematics, Algorithms and Applications | 2021-11-30 | Paper |
| Algorithms for generating strongly chordal graphs | 2021-10-18 | Paper |
A separator-based method for generating weakly chordal graphs
Discrete Mathematics, Algorithms and Applications | 2021-04-09 | Paper |
Semi-dynamic Algorithms for Strongly Chordal Graphs
(available as arXiv preprint) | 2020-01-30 | Paper |
| Strongly Chordal Graph Generation using Intersection Graph Characterisation | 2019-07-25 | Paper |
QCA Gray code converter circuits using LTEx methodology
International Journal of Theoretical Physics | 2018-08-01 | Paper |
Linear layouts of weakly triangulated graphs
Discrete Mathematics, Algorithms and Applications | 2016-09-16 | Paper |
Algorithms for problems on maximum density segment
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
Three paths to point placement
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
All-maximum and all-minimum problems under some measures
Journal of Discrete Algorithms | 2014-08-13 | Paper |
More on generalized jewels and the point placement problem
Journal of Graph Algorithms and Applications | 2014-03-24 | Paper |
From approximate balls to approximate ellipses
Journal of Global Optimization | 2013-06-14 | Paper |
The ordinary line problem revisited
Computational Geometry | 2012-06-13 | Paper |
Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions
Computational Science and Its Applications — ICCSA 2003 | 2011-03-18 | Paper |
Approximate ellipsoid in the streaming model
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
Information Processing Letters | 2010-03-24 | Paper |
On intersecting a set of parallel line segments with a convex polygon of minimum area
Information Processing Letters | 2010-03-24 | Paper |
On the minimum perimeter triangle enclosing a convex polygon
Lecture Notes in Computer Science | 2010-02-05 | Paper |
On the all-farthest-segments problem for a planar set of points
Information Processing Letters | 2010-01-29 | Paper |
ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
| scientific article; zbMATH DE number 1834577 (Why is no real title available?) | 2002-11-24 | Paper |
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry | 2002-09-03 | Paper |
Fast algorithms for computing -skeletons and their relatives.
Pattern Recognition | 2001-01-01 | Paper |
COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
| scientific article; zbMATH DE number 1436137 (Why is no real title available?) | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1318519 (Why is no real title available?) | 1999-08-08 | Paper |
| scientific article; zbMATH DE number 1140071 (Why is no real title available?) | 1998-04-13 | Paper |
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
Journal of Algorithms | 1996-12-11 | Paper |
A new necessary condition for the vertex visibility graphs of simple polygons
Discrete & Computational Geometry | 1994-08-10 | Paper |
| scientific article; zbMATH DE number 177566 (Why is no real title available?) | 1993-05-18 | Paper |
A Solution to the Polynomial Hensel Code Conversion Problem
IEEE Transactions on Computers | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3958571 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3812832 (Why is no real title available?) | 1983-01-01 | Paper |
