| Publication | Date of Publication | Type |
|---|
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands
International Journal of Foundations of Computer Science | 2023-11-16 | Paper |
Transportation Problem Allowing Sending and Bringing Back
International Journal of Foundations of Computer Science | 2023-08-18 | Paper |
Transportation problem on a graph
Japan Journal of Industrial and Applied Mathematics | 2023-01-17 | Paper |
Space filling curves and their use in the design of geometric data structures
LATIN '95: Theoretical Informatics | 2022-08-16 | Paper |
| A new transportation problem on a graph with sending and bringing-back operations | 2021-10-04 | Paper |
Pseudo approximation algorithms, with applications to optimal motion planning
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
A new algorithmic framework for basic problems on binary images
Discrete Applied Mathematics | 2017-05-12 | Paper |
| Constant-work-space algorithms for geometric problems | 2017-03-09 | Paper |
Depth-First Search Using $$O(n)$$ Bits
Algorithms and Computation | 2015-09-11 | Paper |
| Zone diagrams: existence, uniqueness and algorithmic challenge | 2014-12-18 | Paper |
The distance trisector curve
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
\(\widetilde{O}(\sqrt{n})\)-space and polynomial-time algorithm for planar directed graph reachability
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry | 2014-01-22 | Paper |
Constant-work-space algorithms for shortest paths in trees and simple polygons
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Time-space tradeoffs for all-nearest-larger-neighbors problems
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Memory-constrained algorithms for simple polygons
Computational Geometry | 2013-07-31 | Paper |
Memory-constrained algorithms for simple polygons
Computational Geometry | 2013-07-31 | Paper |
Priority queues and sorting for read-only data
Lecture Notes in Computer Science | 2013-05-28 | Paper |
A new framework for connected components labeling of binary images
Combinatorial Image Analaysis | 2013-04-04 | Paper |
Small work space algorithms for some basic problems on binary images
Combinatorial Image Analaysis | 2013-04-04 | Paper |
In-place algorithm for erasing a connected component in a binary image
Theory of Computing Systems | 2012-12-06 | Paper |
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Information Sciences | 2012-10-02 | Paper |
Constant-work-space image scan with a given angle
Interdisciplinary Information Sciences | 2011-05-18 | Paper |
| On-line uniformity of points | 2011-03-25 | Paper |
The structure and number of global roundings of a graph
Lecture Notes in Computer Science | 2011-03-18 | Paper |
In-place linear-time algorithms for Euclidean distance transform
Transactions on Computational Science VIII | 2010-11-02 | Paper |
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Online uniformity of integer points on a line
Information Processing Letters | 2010-06-09 | Paper |
Disc covering problem with application to digital halftoning
Theory of Computing Systems | 2010-05-10 | Paper |
Some theoretical challenges in digital geometry: a perspective
Discrete Applied Mathematics | 2010-04-28 | Paper |
Aspect-ratio Voronoi diagram and its complexity bounds
Information Processing Letters | 2010-03-24 | Paper |
OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS
International Journal of Computational Geometry & Applications | 2010-03-19 | Paper |
Constant-work-space algorithm for a shortest path in a simple polygon
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Finding Nearest Larger Neighbors
Lecture Notes in Computer Science | 2009-11-12 | Paper |
| Efficient computation of template matrices | 2009-05-22 | Paper |
CONSTRUCTING OPTIMAL HIGHWAYS
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
A linear-space algorithm for distance preserving graph embedding
Computational Geometry | 2009-03-09 | Paper |
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?
Algorithms and Computation | 2009-01-29 | Paper |
Voronoi diagrams with respect to criteria on vision information
Japan Journal of Industrial and Applied Mathematics | 2008-09-25 | Paper |
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge
SIAM Journal on Computing | 2008-08-14 | Paper |
In-Place Algorithm for Image Rotation
Algorithms and Computation | 2008-05-27 | Paper |
Optimal Triangulation with Steiner Points
Algorithms and Computation | 2008-05-27 | Paper |
A generalization of magic squares with applications to digital halftoning
Theory of Computing Systems | 2008-04-03 | Paper |
Computational Science and Its Applications – ICCSA 2004
Lecture Notes in Computer Science | 2007-07-19 | Paper |
The distance trisector curve
Advances in Mathematics | 2007-05-23 | Paper |
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Combinatorial Image Analysis
Lecture Notes in Computer Science | 2005-08-12 | Paper |
EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Optimal spanners for axis-aligned rectangles
Computational Geometry | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 2119753 (Why is no real title available?) | 2004-11-29 | Paper |
The structure and number of global roundings of a graph
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2081027 (Why is no real title available?) | 2004-08-04 | Paper |
Pseudo approximation algorithms with applications to optimal motion planning
Discrete & Computational Geometry | 2004-03-11 | Paper |
Spanning trees crossing few barriers
Discrete & Computational Geometry | 2004-02-05 | Paper |
Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning
SIAM Journal on Computing | 2003-09-28 | Paper |
| scientific article; zbMATH DE number 1958099 (Why is no real title available?) | 2003-07-31 | Paper |
Algorithmic Evaluation of Line Detection Problem
Interdisciplinary Information Sciences | 2003-07-09 | Paper |
Translating a convex polyhedron over monotone polyhedra
Computational Geometry | 2003-03-10 | Paper |
Shattering a set of objects in 2D
Discrete Applied Mathematics | 2002-08-29 | Paper |
| scientific article; zbMATH DE number 1746653 (Why is no real title available?) | 2002-06-09 | Paper |
| scientific article; zbMATH DE number 1741101 (Why is no real title available?) | 2002-05-15 | Paper |
| scientific article; zbMATH DE number 1522939 (Why is no real title available?) | 2001-12-05 | Paper |
| scientific article; zbMATH DE number 1629856 (Why is no real title available?) | 2001-11-06 | Paper |
A unified scheme for detecting fundamental curves in binary edge images
Computational Geometry | 2001-09-27 | Paper |
Dynamically maintaining the widest \(k\)-dense corridor
Theoretical Computer Science | 2001-08-20 | Paper |
Optimal roundings of sequences and matrices
Nordic Journal of Computing | 2001-08-14 | Paper |
| scientific article; zbMATH DE number 1617281 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1559543 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1568057 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1568058 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1555987 (Why is no real title available?) | 2001-01-24 | Paper |
A new approximation algorithm for the capacitated vehicle routing problem on a tree
Journal of Combinatorial Optimization | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1424307 (Why is no real title available?) | 2000-11-13 | Paper |
| scientific article; zbMATH DE number 1507292 (Why is no real title available?) | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1395342 (Why is no real title available?) | 2000-01-30 | Paper |
Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science | 1998-07-22 | Paper |
Variants for the Hough transform for line detection
Computational Geometry | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 871905 (Why is no real title available?) | 1996-10-21 | Paper |
| scientific article; zbMATH DE number 867674 (Why is no real title available?) | 1996-04-21 | Paper |
EFFICIENT ENUMERATION OF GRID POINTS IN A CONVEX POLYGON AND ITS APPLICATION TO INTEGER PROGRAMMING
International Journal of Computational Geometry & Applications | 1995-03-01 | Paper |
WALKING IN AN ARRANGEMENT TOPOLOGICALLY
International Journal of Computational Geometry & Applications | 1994-11-06 | Paper |
Algorithms for projecting points to give the most uniform distribution with applications to hashing
Algorithmica | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 4051002 (Why is no real title available?) | 1987-01-01 | Paper |
Shortest path between two simple polygons
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4051001 (Why is no real title available?) | 1987-01-01 | Paper |
Visibility of disjoint polygons
Algorithmica | 1986-01-01 | Paper |
Polygon triangulation: Efficiency and minimality
Journal of Algorithms | 1986-01-01 | Paper |
Generating and counting valid patterns in routes between two points
Graphs and Combinatorics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3912415 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3752767 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3588555 (Why is no real title available?) | 1978-01-01 | Paper |
A Wire-Routing Scheme Based on Trunk-Division Methods
IEEE Transactions on Computers | 1977-01-01 | Paper |
