Takao Ono

From MaRDI portal
Person:987801

Available identifiers

zbMath Open ono.takaoMaRDI QIDQ987801

List of research outcomes





PublicationDate of PublicationType
An approximation algorithm for MAX 3-SAT2023-03-21Paper
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
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
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
https://portal.mardi4nfdi.de/entity/Q41057571975-01-01Paper

Research outcomes over time

This page was built for person: Takao Ono

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:987801&oldid=6628565"
Powered by MediaWiki