Tomio Hirata

From MaRDI portal
Revision as of 11:08, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:751324

Available identifiers

zbMath Open hirata.tomioMaRDI QIDQ751324

List of research outcomes





PublicationDate of PublicationType
An approximation algorithm for MAX 3-SAT2023-03-21Paper
A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian2013-12-06Paper
A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs2010-08-16Paper
Approximation algorithms for the weighted independent set problem in sparse graphs2009-06-30Paper
Finding shortest safari routes in simple polygons2009-04-28Paper
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem2009-01-19Paper
New Bounds for the Nearly Equitable Edge Coloring Problem2008-05-27Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
3-D Voronoi tessellation algorithms2005-09-12Paper
https://portal.mardi4nfdi.de/entity/Q44189852003-07-31Paper
CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"2001-02-08Paper
https://portal.mardi4nfdi.de/entity/Q45257432001-01-24Paper
https://portal.mardi4nfdi.de/entity/Q47039081999-12-01Paper
Approximation algorithms for the maximum satisfiability problem1998-03-02Paper
https://portal.mardi4nfdi.de/entity/Q31299241997-09-07Paper
A unified linear-time algorithm for computing distance maps1997-02-27Paper
Complexity of projected images of convex subdivisions1995-04-09Paper
AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES1994-05-03Paper
The intersection searching problem for c-oriented polygons1991-01-01Paper
A sufficient condition for a graph to be weakly k-linked1984-01-01Paper
Edge-contraction problems1983-01-01Paper

Research outcomes over time

This page was built for person: Tomio Hirata