Takeshi Tokuyama

From MaRDI portal
Person:202562

Available identifiers

zbMath Open tokuyama.takeshiWikidataQ102311701 ScholiaQ102311701MaRDI QIDQ202562

List of research outcomes





PublicationDate of PublicationType
High quality consistent digital curved rays via vector field rounding2024-04-23Paper
Universal convex covering problems under translations and discrete rotations2023-11-06Paper
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays2023-02-07Paper
Interval finding and its application to data mining2023-01-25Paper
Greedily finding a dense subgraph2022-12-09Paper
Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays2022-09-16Paper
Weight balancing on boundaries2022-05-18Paper
Consistent digital curved rays and pseudoline arrangements2022-05-11Paper
https://portal.mardi4nfdi.de/entity/Q49671802019-07-03Paper
Dense subgraph problems with output-density conditions2018-11-05Paper
Buyback problem with discrete concave valuation functions2018-05-24Paper
Weight Balancing on Boundaries and Skeletons2018-04-23Paper
Colored spanning graphs for set visualization2018-02-19Paper
Efficiently correcting matrix products2017-10-10Paper
Notes on computing peaks in \(k\)-levels and parametric spanning trees2017-09-29Paper
A unified view to greedy geometric routing algorithms in ad hoc networks2016-12-19Paper
Buyback problem with discrete concave valuation functions2016-02-26Paper
Minimax parametric optimization problems and multi-dimensional parametric searching2015-02-27Paper
A generalization of the convex Kakeya problem2015-01-19Paper
Zone diagrams: existence, uniqueness and algorithmic challenge2014-12-18Paper
The distance trisector curve2014-11-25Paper
Base-object location problems for base-monotone regions2014-10-06Paper
Efficient algorithms for network localization using cores of underlying graphs2014-09-18Paper
Zone diagrams in Euclidean spaces and in other normed spaces2014-04-03Paper
Distance \(k\)-sectors exist2014-04-03Paper
Order-preserving matching2014-03-13Paper
Space-efficient and data-sensitive polygon reconstruction algorithms from visibility angle information2014-01-14Paper
Base Location Problems for Base-Monotone Regions2013-04-12Paper
Zone diagrams in Euclidean spaces and in other normed spaces2012-12-20Paper
A generalization of the convex Kakeya problem2012-06-29Paper
Efficient \(\varepsilon\)-net construction for an application to ad-hoc network2011-03-25Paper
Effect of corner information in simultaneous placement of \(k\) rectangles and tableaux2011-03-25Paper
The structure and number of global roundings of a graph2011-03-18Paper
Distance \(k\)-sectors exist2010-09-02Paper
Effect of corner information in simultaneous placement of \(K\) rectangles and tableaux2010-07-20Paper
Distance trisector of a segment and a point2010-05-28Paper
Efficient algorithms for constructing a pyramid from a terrain2010-02-05Paper
Efficiently pricing European-Asian options-ultimate implementation and analysis of the AMO algorithm2010-01-29Paper
Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes2009-12-17Paper
Consistent digital rays2009-08-27Paper
Algorithms and Computation2009-08-07Paper
Algorithms and Computation2009-08-07Paper
Directional Geometric Routing on Mobile Ad Hoc Networks2009-07-23Paper
All Farthest Neighbors in the Presence of Highways and Obstacles2009-02-24Paper
Fixed-Parameter Tractability for Non-Crossing Spanning Trees2009-02-17Paper
Consistent digital rays2009-02-12Paper
Voronoi diagrams with respect to criteria on vision information2008-09-25Paper
Minimizing interference of a wireless ad-hoc network in a plane2008-08-14Paper
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge2008-08-14Paper
Optimal Insertion of a Segment Highway in a City Metric2008-07-10Paper
Data Mining with optimized two-dimensional association rules2008-06-18Paper
Recent progress on combinatorics and algorithms for low discrepancy roundings2007-07-19Paper
The distance trisector curve2007-05-23Paper
Algorithms and Computation2006-11-14Paper
Linear time algorithm for approximating a curve by a single-peaked curve2006-06-14Paper
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA2006-05-29Paper
Algorithms and Computation2005-12-22Paper
Algorithmic Applications in Management2005-11-30Paper
Algorithm Theory - SWAT 20042005-09-07Paper
A fast, accurate, and simple method for pricing European-Asian and saving-Asian options2005-08-02Paper
Computing and Combinatorics2005-06-15Paper
EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION2005-06-10Paper
On Properties of a Set of Global Roundings Associated with Clique Connection of Graphs2005-05-23Paper
Minimax Parametric Optimization Problems and Multidimensional Parametric Searching2005-05-23Paper
Combinatorics and algorithms for low-discrepancy roundings of a real sequence2005-04-06Paper
Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition2004-12-13Paper
https://portal.mardi4nfdi.de/entity/Q48290282004-11-29Paper
The structure and number of global roundings of a graph2004-10-27Paper
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS2004-09-29Paper
LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES2004-09-29Paper
https://portal.mardi4nfdi.de/entity/Q44722952004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44740852004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44741282004-08-04Paper
Quasi-Norms for a Double Sequence2003-11-16Paper
Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning2003-09-28Paper
A characterization of planar graphs by pseudo-line arrangements2003-08-17Paper
https://portal.mardi4nfdi.de/entity/Q44189822003-07-31Paper
https://portal.mardi4nfdi.de/entity/Q44190042003-07-31Paper
https://portal.mardi4nfdi.de/entity/Q44114092003-07-08Paper
Efficient algorithms for the minimum diameter bridge problem2003-04-28Paper
\(k\)-levels of concave surfaces2003-04-27Paper
Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization2003-04-02Paper
https://portal.mardi4nfdi.de/entity/Q45478242002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45381312002-07-11Paper
Optimal online algorithms for an electronic commerce money distribution system2002-06-17Paper
https://portal.mardi4nfdi.de/entity/Q45350172002-06-12Paper
Quantum Computation in Computational Geometry2002-01-01Paper
A unified scheme for detecting fundamental curves in binary edge images2001-09-27Paper
Optimal roundings of sequences and matrices2001-08-14Paper
Algorithms for the maximum subarray problem based on matrix multiplication2001-07-12Paper
https://portal.mardi4nfdi.de/entity/Q27220042001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q45269922001-02-28Paper
https://portal.mardi4nfdi.de/entity/Q47618622001-02-21Paper
https://portal.mardi4nfdi.de/entity/Q45257412001-01-24Paper
Greedily Finding a Dense Subgraph2000-08-28Paper
https://portal.mardi4nfdi.de/entity/Q42502122000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q42523292000-07-10Paper
https://portal.mardi4nfdi.de/entity/Q49533412000-05-09Paper
Mining optimized association rules for numeric attributes2000-02-17Paper
Finding Subsets Maximizing Minimum Structures1999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42684421999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42523281999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42303641999-04-22Paper
https://portal.mardi4nfdi.de/entity/Q43702051998-09-07Paper
Consecutive interval query and dynamic programming on intervals1998-07-28Paper
Implementation and evaluation of decision trees with range and region splitting1998-06-11Paper
How to cut pseudoparabolas into segments1998-03-11Paper
Orthogonal queries in segments1997-08-17Paper
https://portal.mardi4nfdi.de/entity/Q48751741996-10-21Paper
https://portal.mardi4nfdi.de/entity/Q48860441996-08-22Paper
Geometric algorithms for the minimum cost assignment problem1996-05-28Paper
A note on polynomial arithmetic analogue of Halton sequences1996-04-28Paper
Efficient Algorithms for the Hitchcock Transportation Problem1996-02-13Paper
An Improved Algorithm for the Traveler′s Problem1995-09-17Paper
https://portal.mardi4nfdi.de/entity/Q47634041995-04-11Paper
Complexity of projected images of convex subdivisions1995-04-09Paper
On minimum and maximum spanning trees of linearly moving points1995-03-20Paper
Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications1994-11-27Paper
WALKING IN AN ARRANGEMENT TOPOLOGICALLY1994-11-06Paper
https://portal.mardi4nfdi.de/entity/Q42835541994-02-23Paper
A theorem on the average number of subfaces in arrangements and oriented matroids1993-09-30Paper
Splitting a configuration in a simplex1993-06-29Paper
Algorithms for projecting points to give the most uniform distribution with applications to hashing1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q39817221992-06-26Paper
Bounding the number of \(k\)-faces in arrangements of hyperplanes1992-06-25Paper
The generating function of strict Gelfand patterns and some formulas on characters of general linear groups1988-01-01Paper
Determinantal method and the Littlewood-Richardson rule1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38002701987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37492581986-01-01Paper
On the decomposition rules of tensor products of the representations of the classical Weyl groups1984-01-01Paper
A theorem on the representations of the Weyl groups of type \(D_ n\) and \(B_ n\)1984-01-01Paper

Research outcomes over time

This page was built for person: Takeshi Tokuyama