Naoki Katoh

Yuki Kobayashi

Int. J. Comput. Math. Comput. Syst. Theory, January, 2023

The Two-Squirrel Problem and Its Relatives.

[BibT_eX]

[DOI]

CoRR, 2023

Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges.

[BibT_eX]

[DOI]

CoRR, 2023

On Computing a Center Persistence Diagram.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Red-Black Spanners for Mixed-Charging Vehicular Networks.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

The Line-Constrained Maximum Coverage Facility Location Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2021

Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs.

[BibT_eX]

[DOI]

Yuki Kobayashi

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

Locating Evacuation Centers Optimally in Path and Cycle Networks.

[BibT_eX]

[DOI]

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020

Minsum k-sink problem on path networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data".

[BibT_eX]

[DOI]

Rev. Socionetwork Strateg., 2019

A Survey on Facility Location Problems in Dynamic Flow Networks.

[BibT_eX]

[DOI]

Rev. Socionetwork Strateg., 2019

Minmax-Regret Evacuation Planning for Cycle Networks.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

2018

Minimax Regret 1-Median Problem in Dynamic Path Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

The mixed evacuation problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Minsum k-Sink Problem on Path Networks.

[BibT_eX]

[DOI]

CoRR, 2018

Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks.

[BibT_eX]

[DOI]

CoRR, 2018

Minsum k-Sink Problem on Dynamic Flow Path Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Geometric Graphs: Theory and Applications (NII Shonan Meeting 2017-16).

[BibT_eX]

[DOI]

Hee-Kap Ahn

Subhas C. Nandy

NII Shonan Meet. Rep., 2017

A population-based algorithm for solving linear assignment problems with two objectives.

[BibT_eX]

[DOI]

Xavier Gandibleux

Hiroyuki Morita

Comput. Oper. Res., 2017

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

2016

Extended formulations for sparsity matroids.

[BibT_eX]

[DOI]

Math. Program., 2016

Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Improved Algorithms for Computing k-Sink on Dynamic Path Networks.

[BibT_eX]

[DOI]

Binay K. Bhattacharya

CoRR, 2016

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities.

[BibT_eX]

[DOI]

Guru Prakash Arumugam

CoRR, 2016

On the edge crossing properties of Euclidean minimum weight Laman graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2016

2015

Optimally bracing grid frameworks with holes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Multiple sink location problems in dynamic path networks.

[BibT_eX]

[DOI]

Mordecai J. Golin

Theor. Comput. Sci., 2015

Minimax regret 1-sink location problem in dynamic path networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Geometric k-Center Problems with Centers Constrained to Two Lines.

[BibT_eX]

[DOI]

Binay K. Bhattacharya

CoRR, 2015

Polynomial-time approximability of the k-Sink Location problem.

[BibT_eX]

[DOI]

CoRR, 2015

A Linear-Time Algorithm for Testing Outer-1-Planarity.

[BibT_eX]

[DOI]

Algorithmica, 2015

Straight-Line Drawability of a Planar Graph Plus an Edge.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Continuous Folding of Regular Dodecahedra.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Geometric p-Center Problems with Centers Constrained to Two Lines.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014

An inductive construction of minimally rigid body-hinge simple graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity.

[BibT_eX]

[DOI]

Mordecai J. Golin

J. Graph Algorithms Appl., 2014

Online graph exploration algorithms for cycles and trees by multiple searchers.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks.

[BibT_eX]

[DOI]

Mordecai J. Golin

CoRR, 2014

2013

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Online Vertex Exploration Problems in a Simple Polygon.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2013

Independent arborescences in directed graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

Minimax Regret 1-Sink Location Problems in Dynamic Path Networks.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

Emerging Pattern Based Crime Spots Analysis and Rental Price Prediction.

[BibT_eX]

Proceedings of the Contrast Data Mining: Concepts, Algorithms, and Applications, 2013

2012

An Emergency Evacuation Planning Model Using the Universally Quickest Flow.

[BibT_eX]

[DOI]

Masaki Inoue

Rev. Socionetwork Strateg., 2012

A rooted-forest partition with uniform vertex demand.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

Online Exploration of All Vertices in a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Collision Probability in an In-Line Machines Model.

[BibT_eX]

[DOI]

Trans. Comput. Sci., 2011

Covering directed graphs by in-trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

A Proof of the Molecular Conjecture.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2011

2010

A Geometric Spanner of Segments.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2010

2009

Combinatorial Optimization Algorithms in Resource Allocation Problems.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Fast Enumeration Algorithms for Non-crossing Geometric Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2009

Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Arc-disjoint in-trees in directed graphs.

[BibT_eX]

[DOI]

Comb., 2009

On the Infinitesimal Rigidity of Bar-and-Slider Frameworks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

A Proof of the Molecular Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Enumerating Constrained Non-crossing Minimally Rigid Frameworks.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

The Minimum Weight In-Tree Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Modelling, 2008

Geometric Spanner of Objects under L1 Distance.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Triangulating a convex polygon with fewer number of non-standard bars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Risk discovery of car-related crimes from urban spatial attributes using emerging patterns.

[BibT_eX]

[DOI]

Int. J. Knowl. Based Intell. Eng. Syst., 2007

Enumerating Non-crossing Minimally Rigid Frameworks.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Is this brand ephemeral? A multivariate tree-based decision analysis of new product sustainability.

[BibT_eX]

[DOI]

Edward Hak-Sing Ip

Decis. Support Syst., 2007

Applying graph mining to discover substructures of room layouts which affect the rent of apartments.

[BibT_eX]

[DOI]

Kazuma Yoshida

Proceedings of the IEEE International Conference on Systems, 2007

Voronoi Diagram with Respect to Criteria on Vision Information.

[BibT_eX]

[DOI]

Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

Enumerating Constrained Non-crossing Geometric Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Polyline Fitting of Planar Points under Min-sum Criteria.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2006

Inserting Points Uniformly at Every Instance.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

Finding a Triangular Mesh with a Constant Number of Different Edge Lengths.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2006

An approximation algorithm for the pickup and delivery vehicle routing problem on trees.

[BibT_eX]

[DOI]

Taihei Yano

Discret. Appl. Math., 2006

Preface.

[BibT_eX]

[DOI]

Hiro Ito

Discret. Appl. Math., 2006

Foreword.

[BibT_eX]

[DOI]

Algorithmica, 2006

Angular Voronoi Diagram with Applications.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2006

An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

Optimal spanners for axis-aligned rectangles.

[BibT_eX]

[DOI]

Comput. Geom., 2005

The Future Direction of New Computing Environment for Exabyte Data in the Business World.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE/IPSJ International Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops), 31 January, 2005

Triangulating a Convex Polygon with Small Number of Non-standard Bars.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

The structure and number of global roundings of a graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On Geometric Structure of Global Roundings for Graphs and Range Spaces.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2004

Efficient Algorithms for Approximating a Multi-dimensional Voxel Terrain by a Unimodal Terrain.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Matrix Rounding and Related Problems with Application to Digital Halftoning.

[BibT_eX]

[DOI]

Proceedings of the System Modeling and Optimization, 2003

Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives.

[BibT_eX]

[DOI]

Xavier Gandibleux

Hiroyuki Morita

Proceedings of the Evolutionary Multi-Criterion Optimization, 2003

Business Application for Sales Transaction Data by Using Genome Analysis Technology.

[BibT_eX]

[DOI]

Yukinobu Hamuro

Proceedings of the Discovery Science, 6th International Conference, 2003

Data Mining Oriented CRM Systems Based on MUSASHI: C-MUSASHI.

[BibT_eX]

[DOI]

Proceedings of the Active Mining, Second International Workshop, 2003

2002

Approximating uniform triangular meshes in polygons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Parametric Polymatroid Optimization and Its Geometric Applications.

[BibT_eX]

[DOI]

Hisao Tamaki

Int. J. Comput. Geom. Appl., 2002

K-Levels of Concave Surfaces.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

Combinatorial and Geometric Problems Related to Digital Halftoning.

[BibT_eX]

[DOI]

Proceedings of the Geometry, 2002

Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

A Machine Learning Algorithm for Analyzing String Patterns Helps to Discover Simple and Interpretable Business Rules from Purchase History.

[BibT_eX]

[DOI]

Proceedings of the Progress in Discovery Science, 2002

2001

A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree.

[BibT_eX]

[DOI]

Kazuhiro Kawashima

J. Comb. Optim., 2001

Efficient Algorithms for Optimization-Based Image Segmentation.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2001

A unified scheme for detecting fundamental curves in binary edge images.

[BibT_eX]

[DOI]

Comput. Geom., 2001

The Supported Solutions Used as a Genetic Information in a Population Heuristics.

[BibT_eX]

[DOI]

Xavier Gandibleux

Hiroyuki Morita

Proceedings of the Evolutionary Multi-Criterion Optimization, 2001

Notes on computing peaks in k-levels and parametric spanning trees.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

LMT-skeleton heuristics for several new classes of optimal triangulations.

[BibT_eX]

[DOI]

Yang Dai

Siu-Wing Cheng

Comput. Geom., 2000

Optimizing the sum of linear fractional functions and applications.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Approximating Uniform Triangular Meshes for Spheres.

[BibT_eX]

[DOI]

Hiromichi Kojima

Ryo Taniguchi

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Discovering Interpretable Rules that Explain Customers' Brand Choice Behavior.

[BibT_eX]

[DOI]

Yukinobu Hamuro

Proceedings of the Discovery Science, 2000

1999

Finding Subsets Maximizing Minimum Structures.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

SIAM J. Discret. Math., 1999

Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 1999

1998

Mining Pharmacy Data Helps to Make Profits.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., 1998

A Capacitated Vehicle Routing Problem on a Tree.

[BibT_eX]

[DOI]

Shin-ya Hamaguchi

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Convertibility among Grid Filling Curves.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Data Mining Oriented System for Business Applications.

[BibT_eX]

[DOI]

Yukinobu Hamuro

Proceedings of the Discovery Science, 1998

On Computing New Classes of Optimal Trangulations with Angular Constraints.

[BibT_eX]

[DOI]

Yang Dai

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

Hole filling: a novel delay reduction technique using selector logic.

[BibT_eX]

[DOI]

Proceedings of the IEEE 1998 Custom Integrated Circuits Conference, 1998

1997

A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems.

[BibT_eX]

[DOI]

Yang Dai

Inf. Process. Lett., 1997

Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Triangulations Intersect Nicely.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1996

A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Variants for the Hough Transform for Line Detection.

[BibT_eX]

[DOI]

Comput. Geom., 1996

Polynomial-Time Solutions to Image Segmentation.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

A Study of the LMT-Skeleton.

[BibT_eX]

[DOI]

Siu-Wing Cheng

Manabu Sugai

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Experimental Results of Randomized Clustering Algorithm.

[BibT_eX]

[DOI]

Mary Inaba

Hiroshi Imai

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1995

On Minimum and Maximum Spanning Trees of Linearly Moving Points.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1995

Optimal approximation of monotone curves on a grid.

[BibT_eX]

[DOI]

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Efficient algorithms for minimum range cut problems.

[BibT_eX]

[DOI]

Networks, 1994

Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract).

[BibT_eX]

[DOI]

Mary Inaba

Hiroshi Imai

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

Graph endpoint coloring and distributed processing.

[BibT_eX]

[DOI]

Networks, 1993

Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

How to Treat Delete Requests in Semi-Online Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Number Theory Helps Line Detection in Digital Images.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992

Optimal strategies for some team games.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

A fully polynomial time approximation scheme for minimum cost-reliability ratio problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

An e-approximation scheme for combinatorial optimization problems with minimum variance criterion.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

A two-commodity sharing problem on networks.

[BibT_eX]

[DOI]

Tetsuo Ichimori

Networks, 1991

Finding k Points with Minimum Diameter and Related Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1991

Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1991

1990

Multiversion Cautious Schedulers for Database Concurrency Control.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1990

Searching Minimax Game Trees under Memory Space Constraint.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1990

1989

A 1-Version Cautious Transaction Scheduler with Dynamic Version Selection.

[BibT_eX]

[DOI]

Jun Kiniwa

Syst. Comput. Jpn., 1989

Fining k Points with Minimum Spanning Trees and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Cautious Transaction Schedulers for Database Concurrency Control.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1988

The Fair Resource Allocation Problem with Submodular Constraints.

[BibT_eX]

[DOI]

Satoru Fujishige

Tetsuo Ichimori

Math. Oper. Res., 1988

Resource allocation problems - algorithmic approaches.

[BibT_eX]

MIT Press series in the foundations of computing, MIT Press, ISBN: 978-0-262-09027-8, 1988

1987

Approximation algorithms for combinatorial fractional programming problems.

[BibT_eX]

[DOI]

Math. Program., 1987

A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1987

A Cautious Scheduler for Multistep Transactions.

[BibT_eX]

[DOI]

Algorithmica, 1987

1985

Cautious Transaction Schedulers with Admission Control.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1985

An Algorithm for the Equipollent Resource Allocation Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 1985

An efficient algorithm for the parametric resource allocation problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1985

1983

On-Line Computation of Transitive Closures of Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

1982

An efficient algorithm for K shortest simple paths.

[BibT_eX]

[DOI]

Networks, 1982

1981

An Algorithm for Finding K Minimum Spanning Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1981

An Algorithm for the K Best Solutions of the Resource Allocation Problem.

[BibT_eX]

[DOI]