| Publication | Date of Publication | Type |
|---|
Approximation algorithms for minimum ply covering of points with unit squares and unit disks
Theoretical Computer Science | 2024-12-12 | Paper |
| Finding a maximum clique in a disk graph | 2024-10-16 | Paper |
Minimum ply covering of points with unit squares
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Improved and generalized algorithms for burning a planar point set
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Improved and generalized algorithms for burning a planar point set
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
International Journal of Computational Geometry & Applications | 2023-07-21 | Paper |
Bottleneck convex subsets: finding \(k\) large convex sets in a point set
(available as arXiv preprint) | 2023-03-30 | Paper |
Finding a Maximum Clique in a Grounded 1-Bend String Graph
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
Computing maximum independent set on outerstring graphs and their relatives
Computational Geometry | 2022-04-08 | Paper |
Boundary labeling for rectangular diagrams
(available as arXiv preprint) | 2020-08-25 | Paper |
Polygon simplification by minimizing convex corners
Theoretical Computer Science | 2019-09-10 | Paper |
Swapping colored tokens on graphs
Theoretical Computer Science | 2018-05-17 | Paper |
An algorithm for the maximum weight independent set problem on outerstring graphs
Computational Geometry | 2018-01-22 | Paper |
Polygon simplification by minimizing convex corners
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Computing a minimum outer-connected dominating set for the class of chordal graphs
Information Processing Letters | 2014-04-11 | Paper |
Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs
Information Processing Letters | 2012-03-19 | Paper |
| Approximating the MaxMin and MinMax area triangulations using angular constraints | 2011-05-18 | Paper |
The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation
Information Processing Letters | 2010-06-09 | Paper |
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Algorithmic properties of ciliate sequence alignment
Theoretical Computer Science | 2010-02-19 | Paper |
Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks
Computational Science and Its Applications - ICCSA 2006 | 2009-01-27 | Paper |
POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
International Journal of Computational Geometry & Applications | 2007-05-23 | Paper |
Algorithms for optimal area triangulations of a convex polygon
Computational Geometry | 2006-10-25 | Paper |
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Discrete Applied Mathematics | 2006-09-28 | Paper |
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
Algorithmica | 2004-09-22 | Paper |
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
Discrete Applied Mathematics | 2004-08-06 | Paper |
A new bound for map labeling with uniform circle pairs
Information Processing Letters | 2003-06-24 | Paper |
| scientific article; zbMATH DE number 1326927 (Why is no real title available?) | 2003-06-05 | Paper |
| scientific article; zbMATH DE number 1670650 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1424299 (Why is no real title available?) | 2000-08-29 | Paper |
A large subgraph of the minimum weight triangulation
Discrete & Computational Geometry | 1998-07-27 | Paper |
Computing Visibility Information in an Inaccurate Simple Polygon
International Journal of Computational Geometry & Applications | 1998-02-08 | Paper |
Covering Orthogonal Polygons with Non-Piercing Rectangles
International Journal of Computational Geometry & Applications | 1997-10-30 | Paper |
Computing a subgraph of the minimum weight triangulation
Computational Geometry | 1995-03-01 | Paper |
The complexity of domination problems in circle graphs
Discrete Applied Mathematics | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 140458 (Why is no real title available?) | 1993-03-28 | Paper |
Efficient Algorithms for the Capacitated 1-Median Problem
ORSA Journal on Computing | 1993-02-25 | Paper |
On the complexity of scheduling tasks with discrete starting times
Operations Research Letters | 1993-01-04 | Paper |
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry | 1992-06-28 | Paper |
An optimal algorithm for finding dominating cycles in circular-arc graphs
Discrete Applied Mathematics | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 26490 (Why is no real title available?) | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4070353 (Why is no real title available?) | 1988-01-01 | Paper |
A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
Total domination in interval graphs
Information Processing Letters | 1986-01-01 | Paper |
Finding Hamiltonian circuits in interval graphs
Information Processing Letters | 1985-01-01 | Paper |
Finding minimum dominating cycles in permutation graphs
Operations Research Letters | 1985-01-01 | Paper |
Domination in permutation graphs
Journal of Algorithms | 1985-01-01 | Paper |
Decomposing a Polygon into Simpler Components
SIAM Journal on Computing | 1985-01-01 | Paper |
A note on a conjecture by Gavril on clique separable graphs
Discrete Mathematics | 1983-01-01 | Paper |
