| Publication | Date of Publication | Type |
|---|
A sub-quadratic time algorithm for computing the beacon kernel of simple polygons
| 2024-08-22 | Paper |
Locating evacuation centers optimally in path and cycle networks
| 2024-08-13 | Paper |
Computing in linear time a chord from which a simple polygon is weakly internally visible
| 2023-03-21 | Paper |
The weighted \(k\)-center problem in trees for fixed \(k\)
| 2023-02-03 | Paper |
Efficient approximate shortest-path queries among isothetic rectangular obstacles
Lecture Notes in Computer Science | 2023-01-18 | Paper |
An efficient algorithm for the proximity connected two center problem
| 2022-08-30 | Paper |
An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks
| 2022-07-21 | Paper |
The weighted \(k\)-center problem in trees for fixed \(k\)
Theoretical Computer Science | 2022-02-21 | Paper |
Computation of spatial skyline points
Computational Geometry | 2021-01-07 | Paper |
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
INFORMS Journal on Computing | 2021-01-07 | Paper |
Constant work-space algorithms for facility location problems
Discrete Applied Mathematics | 2020-06-29 | Paper |
Linear-time fitting of a \(k\)-step function
Discrete Applied Mathematics | 2020-05-18 | Paper |
Minsum \(k\)-sink problem on path networks
Theoretical Computer Science | 2020-01-16 | Paper |
Minmax-regret evacuation planning for cycle networks
| 2019-10-15 | Paper |
Minsum \(k\)-sink problem on dynamic flow path networks
| 2018-09-06 | Paper |
Optimizing squares covering a set of points
Theoretical Computer Science | 2018-05-17 | Paper |
The bilinear assignment problem: complexity and polynomially solvable special cases
Mathematical Programming. Series A. Series B | 2017-12-01 | Paper |
The \(p\)-center problem in tree networks revisited
| 2017-10-17 | Paper |
Improved algorithms for computing \(k\)-sink on dynamic flow path networks
| 2017-09-22 | Paper |
Rectilinear path problems in restricted memory setup
Discrete Applied Mathematics | 2017-06-19 | Paper |
Geometric \(p\)-center problems with centers constrained to two lines
Lecture Notes in Computer Science | 2017-02-01 | Paper |
On representing a simple polygon perceivable to a blind person
Information Processing Letters | 2017-01-31 | Paper |
\(k\)-delivery traveling salesman problem on tree networks
| 2017-01-26 | Paper |
Linear-time fitting of a \(k\)-step function
Algorithms and Discrete Applied Mathematics | 2016-03-23 | Paper |
Approximation algorithms for generalized MST and TSP in grid clusters
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
Theoretical Computer Science | 2016-01-21 | Paper |
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
Theoretical Computer Science | 2015-12-11 | Paper |
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
Discrete Applied Mathematics | 2015-09-21 | Paper |
Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Optimizing squares covering a set of points
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Rectilinear path problems in restricted memory setup
Algorithms and Discrete Applied Mathematics | 2015-02-19 | Paper |
A linear time algorithm for computing minmax regret 1-median on a tree network
Algorithmica | 2015-01-19 | Paper |
The cyclical scheduling problem
Theoretical Computer Science | 2014-10-06 | Paper |
Back-up 2-center on a path/tree/cycle/unicycle
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Improved minmax regret 1-center algorithms for cactus networks with \(c\) cycles
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Improved algorithms to network \(p\)-center location problems
Computational Geometry | 2014-01-22 | Paper |
The cyclical scheduling problem
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
Computing minmax regret 1-median on a tree network with positive/negative vertex weights
Algorithms and Computation | 2013-03-21 | Paper |
Efficient algorithms for the conditional covering problem
Information and Computation | 2012-11-27 | Paper |
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand
Theoretical Aspects of Computing – ICTAC 2011 | 2012-01-06 | Paper |
Some variations on constrained minimum enclosing circle problem
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Approximation algorithms for the multi-vehicle scheduling problem
Algorithms and Computation | 2010-12-09 | Paper |
On intersecting a set of parallel line segments with a convex polygon of minimum area
Information Processing Letters | 2010-03-24 | Paper |
Computation of non-dominated points using compact Voronoi diagrams
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
On the minimum perimeter triangle enclosing a convex polygon
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Optimal movement of mobile sensors for barrier coverage of a planar region
Theoretical Computer Science | 2009-11-25 | Paper |
Optimal algorithms for the path/tree-shaped facility location problems in trees
Algorithmica | 2009-10-23 | Paper |
Collection depots facility location problems in trees
Networks | 2009-07-28 | Paper |
Approximation Algorithms for a Network Design Problem
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Single facility collection depots location problem in the plane
Computational Geometry | 2009-06-18 | Paper |
Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Single Vehicle Scheduling Problems on Path/Tree/Cycle Networks with Release and Handling Times
Algorithms and Computation | 2009-01-29 | Paper |
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
New Upper Bounds on Continuous Tree Edge-Partition Problem
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
Algorithms and Computation | 2008-04-24 | Paper |
Computing the maximum clique in the visibility graph of a simple polygon
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Efficient algorithms for center problems in cactus networks
Theoretical Computer Science | 2007-07-09 | Paper |
Efficient computation of 2-medians in a tree network with positive/negative weights
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Efficient computation of 2-medians in a tree network with positive/negative weights
Discrete Mathematics | 2006-08-04 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
A linear time algorithm to remove winding of a simple polygon
Computational Geometry | 2006-04-28 | 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 |
On computing the optimal bridge between two convex polygons.
Information Processing Letters | 2002-07-14 | Paper |
Efficient algorithms for centers and medians in interval and circular-arc graphs
Networks | 2002-07-01 | Paper |
Improved algorithms for uniform partitions of points
Algorithmica | 2002-05-21 | Paper |
scientific article; zbMATH DE number 1670650 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1522948 (Why is no real title available?)
| 2001-08-12 | Paper |
Space-time torsion, broken Lorentz symmetry and inflation in the early universe
Modern Physics Letters A | 2001-07-31 | Paper |
Characterizing LR-visibility polygons and related problems
Computational Geometry | 2001-04-24 | Paper |
scientific article; zbMATH DE number 1522945 (Why is no real title available?)
| 2001-03-06 | Paper |
COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
Optimal algorithms for some intersection radius problems
Computing | 1999-08-31 | Paper |
scientific article; zbMATH DE number 1318519 (Why is no real title available?)
| 1999-08-08 | Paper |
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
Journal of Algorithms | 1998-09-27 | Paper |
AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
Journal of Algorithms | 1998-05-25 | Paper |
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
SIAM Journal on Discrete Mathematics | 1997-01-22 | Paper |
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
Journal of Algorithms | 1996-12-11 | Paper |
An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window
CVGIP: Graphical Models and Image Processing | 1994-08-29 | Paper |
COMPUTING SHORTEST TRANSVERSALS OF SETS
International Journal of Computational Geometry & Applications | 1993-11-26 | Paper |
scientific article; zbMATH DE number 176771 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 177566 (Why is no real title available?)
| 1993-05-18 | Paper |
Computing shortest transversals
Computing | 1991-01-01 | Paper |
Efficient reconstruction of binary trees from their transversals
Applied Mathematics Letters | 1989-01-01 | Paper |
Computing the volume of the union of spheres
The Visual Computer | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4062596 (Why is no real title available?)
| 1988-01-01 | Paper |
Fast algorithms for computing the diameter of a finite planar set
The Visual Computer | 1988-01-01 | Paper |
Solving the two-dimensional findpath problem using a line-triangle representation of the robot
Journal of Algorithms | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4041267 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3945378 (Why is no real title available?)
| 1985-01-01 | Paper |
A new linear convex hull algorithm for simple polygons (Corresp.)
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
Efficient algorithms for computing the maximum distance between two finite planar sets
Journal of Algorithms | 1983-01-01 | Paper |
Optimal algorithms for computing the minimum distance between two finite planar sets
Pattern Recognition Letters | 1983-01-01 | Paper |
On the multimodality of distances in convex polygons
Computers & Mathematics with Applications | 1982-01-01 | Paper |
An upper bound on the probability of misclassification in terms of Matusita's measure of affinity
Annals of the Institute of Statistical Mathematics | 1982-01-01 | Paper |
A Counterexample to a Diameter Algorithm for Convex Polygons
IEEE Transactions on Pattern Analysis and Machine Intelligence | 1982-01-01 | Paper |
