| Publication | Date of Publication | Type |
|---|
| New formulation for coloring circle graphs | 2026-01-28 | Paper |
| Enumeration algorithm for the edge coloring problem on bipartite graphs | 2024-07-05 | Paper |
Monte Carlo methods for the Shapley-Shubik power index
Games | 2022-11-02 | Paper |
Trading transforms of non-weighted simple games and integer weights of weighted simple games
Theory and Decision | 2022-07-22 | Paper |
Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
Mathematical Social Sciences | 2022-01-24 | Paper |
Additive approximation algorithms for modularity maximization
Journal of Computer and System Sciences | 2021-02-02 | Paper |
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
Information Processing Letters | 2020-10-07 | Paper |
A doubly nonnegative relaxation for modularity density maximization
Discrete Applied Mathematics | 2020-02-20 | Paper |
Algorithmic aspects of equilibria of stable marriage model with complete preference lists
Operations Research Proceedings | 2019-09-13 | Paper |
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor
Journal of Global Optimization | 2019-05-09 | Paper |
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Compare the ratio of symmetric polynomials of odds to one and stop
Journal of Applied Probability | 2018-09-26 | Paper |
A linear time algorithm for the unbalanced Hitchcock transportation problem
Networks | 2018-05-23 | Paper |
Characterizing Delaunay graphs via fixed point theorem: a simple proof
Journal of the Operations Research Society of Japan | 2018-05-18 | Paper |
Additive approximation algorithms for modularity maximization
(available as arXiv preprint) | 2018-04-19 | Paper |
BEST SUBSET SELECTION FOR ELIMINATING MULTICOLLINEARITY
Journal of the Operations Research Society of Japan | 2017-12-11 | Paper |
Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Lower bounds for Bruss' odds problem with multiple stoppings
Mathematics of Operations Research | 2016-05-19 | Paper |
Positive semidefinite relaxation and approximation algorithm for triple patterning lithography
Algorithms and Computation | 2015-09-11 | Paper |
A 2.75-approximation algorithm for the unconstrained traveling tournament problem
Annals of Operations Research | 2014-11-26 | Paper |
A note on a lower bound for the multiplicative odds theorem of optimal stopping
Journal of Applied Probability | 2014-10-15 | Paper |
| Multicoloring unit disk graphs on triangular lattice points | 2014-10-13 | Paper |
Fractional programming formulation for the vertex coloring problem
Information Processing Letters | 2014-08-28 | Paper |
| On the number of solutions generated by Dantzig's simplex method for LP with bounded variables | 2013-02-07 | Paper |
An approximation algorithm for the traveling tournament problem
Annals of Operations Research | 2012-11-15 | Paper |
Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane
Algorithms and Computation | 2011-12-16 | Paper |
An improved approximation algorithm for the traveling tournament problem
Algorithmica | 2011-12-14 | Paper |
Polynomial time approximate or perfect samplers for discretized Dirichlet distribution
Japan Journal of Industrial and Applied Mathematics | 2011-02-08 | Paper |
Cheating strategies for the Gale-Shapley algorithm with complete preference lists
Algorithmica | 2010-10-07 | Paper |
A note on generalized rank aggregation
Information Processing Letters | 2010-08-20 | Paper |
An Improved Approximation Algorithm for the Traveling Tournament Problem
Algorithms and Computation | 2009-12-17 | Paper |
Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers
SIAM Journal on Computing | 2009-08-20 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
Discrete Applied Mathematics | 2009-06-24 | Paper |
An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
Discrete Applied Mathematics | 2009-06-24 | Paper |
A study of the quadratic semi-assignment polytope
Discrete Optimization | 2009-04-17 | Paper |
A general construction method for mixed-level supersaturated design
Computational Statistics and Data Analysis | 2008-12-11 | Paper |
Exact algorithms for the master ring problem
Networks | 2008-10-08 | Paper |
Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers
Annals of Operations Research | 2008-09-03 | Paper |
| The home-away assignment problems and break minimization/maximization problems in sports scheduling | 2008-02-22 | Paper |
Approximation Algorithms for Minimum Span Channel Assignment Problems
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Polynomial time perfect sampling algorithm for two-rowed contingency tables
Random Structures & Algorithms | 2007-02-07 | Paper |
| Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex | 2006-08-29 | Paper |
Semidefinite programming based approaches to the break minimization problem
Computers & Operations Research | 2006-01-18 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithmic Applications in Management
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 2212569 (Why is no real title available?) | 2005-10-07 | Paper |
A polynomial-time algorithm to find an equitable home--away assignment
Operations Research Letters | 2005-06-01 | Paper |
LINEAR TIME APPROXIMATION ALGORITHM FOR MULTICOLORING LATTICE GRAPHS WITH DIAGONALS
Journal of the Operations Research Society of Japan | 2005-01-31 | Paper |
| scientific article; zbMATH DE number 2127729 (Why is no real title available?) | 2005-01-14 | Paper |
Random generation of 2 2 2 J contingency tables
Theoretical Computer Science | 2005-01-11 | Paper |
NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT
Journal of the Operations Research Society of Japan | 2004-03-22 | Paper |
| scientific article; zbMATH DE number 1999224 (Why is no real title available?) | 2003-11-02 | Paper |
| scientific article; zbMATH DE number 1969728 (Why is no real title available?) | 2003-08-24 | Paper |
| scientific article; zbMATH DE number 1833408 (Why is no real title available?) | 2002-11-21 | Paper |
Optimality of mixed-level supersaturated designs
Journal of Statistical Planning and Inference | 2002-08-28 | Paper |
| scientific article; zbMATH DE number 1788709 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1759686 (Why is no real title available?) | 2002-08-06 | Paper |
scientific article; zbMATH DE number 1766750 (Why is no real title available?)
Journal of the Operations Research Society of Japan | 2002-07-11 | Paper |
| scientific article; zbMATH DE number 1741093 (Why is no real title available?) | 2002-05-15 | Paper |
| scientific article; zbMATH DE number 1741101 (Why is no real title available?) | 2002-05-15 | Paper |
NP-completeness for calculating power indices of weighted majority games
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 1568058 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1507300 (Why is no real title available?) | 2001-02-13 | Paper |
A fast bipartite network flow algorithm for selective assembly
Operations Research Letters | 1998-12-06 | Paper |
An algorithm for fractional assignment problems
Discrete Applied Mathematics | 1995-09-14 | Paper |
The minimum spanning tree problem on a planar graph
Discrete Applied Mathematics | 1995-06-14 | Paper |
Adjacency on combinatorial polyhedra
Discrete Applied Mathematics | 1995-05-04 | Paper |
A Note on <i>K</i>-Best Solutions to the Chinese Postman Problem
SIAM Journal on Optimization | 1995-02-19 | Paper |
AN INEFFICIENCY MEASUREMENT METHOD FOR MANAGEMENT SYSTEMS
Journal of the Operations Research Society of Japan | 1995-02-19 | Paper |
Adjacency of the best and second best valued solutions in combinatorial optimization problems
Discrete Applied Mathematics | 1995-01-31 | Paper |
Algorithms for finding a \(K\)th best valued assignment
Discrete Applied Mathematics | 1994-07-18 | Paper |
Finding all minimum-cost perfect matchings in Bipartite graphs
Networks | 1992-10-13 | Paper |
Parametric simplex algorithms for solving a special class of nonconvex minimization problems
Journal of Global Optimization | 1992-06-26 | Paper |
On the finiteness of the criss-cross method
European Journal of Operational Research | 1992-06-25 | Paper |
