Tomio Hirata

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
An approximation algorithm for MAX 3-SAT	2023-03-21	Paper
A necessary and sufficient condition for a bipartite distance-hereditary graph to be Hamiltonian Computational Geometry and Graphs	2013-12-06	Paper
A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs Information Processing Letters	2010-08-16	Paper
Approximation algorithms for the weighted independent set problem in sparse graphs Discrete Applied Mathematics	2009-06-30	Paper
Finding shortest safari routes in simple polygons Information Processing Letters	2009-04-28	Paper
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem Journal of Graph Algorithms and Applications	2009-01-19	Paper
New Bounds for the Nearly Equitable Edge Coloring Problem Algorithms and Computation	2008-05-27	Paper
Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science	2006-11-01	Paper
3-D Voronoi tessellation algorithms Japan Journal of Industrial and Applied Mathematics	2005-09-12	Paper
scientific article; zbMATH DE number 1958101 (Why is no real title available?)	2003-07-31	Paper
CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES" International Journal of Computational Geometry & Applications	2001-02-08	Paper
scientific article; zbMATH DE number 1555972 (Why is no real title available?)	2001-01-24	Paper
scientific article; zbMATH DE number 1372698 (Why is no real title available?)	1999-12-01	Paper
Approximation algorithms for the maximum satisfiability problem Algorithm Theory — SWAT'96	1998-03-02	Paper
scientific article; zbMATH DE number 1002206 (Why is no real title available?)	1997-09-07	Paper
A unified linear-time algorithm for computing distance maps Information Processing Letters	1997-02-27	Paper
Complexity of projected images of convex subdivisions Computational Geometry	1995-04-09	Paper
AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES International Journal of Computational Geometry & Applications	1994-05-03	Paper
The intersection searching problem for c-oriented polygons Information Processing Letters	1991-01-01	Paper
A sufficient condition for a graph to be weakly k-linked Journal of Combinatorial Theory. Series B	1984-01-01	Paper
Edge-contraction problems Journal of Computer and System Sciences	1983-01-01	Paper

Research outcomes over time

This page was built for person: Tomio Hirata