| Publication | Date of Publication | Type |
|---|
Constructing red-black spanners for mixed-charging vehicular networks
Theoretical Computer Science | 2024-12-12 | Paper |
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
Journal of Combinatorial Optimization | 2024-10-21 | Paper |
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
| 2024-09-16 | Paper |
The line-constrained maximum coverage facility location problem
| 2024-09-16 | Paper |
Red-black spanners for mixed-charging vehicular networks
| 2024-08-22 | Paper |
Locating evacuation centers optimally in path and cycle networks
| 2024-08-13 | Paper |
On computing a center persistence diagram
| 2024-05-29 | Paper |
Improving upper and lower bounds for the total number of edge crossings of Euclidean minimum weight Laman graphs
| 2023-03-30 | Paper |
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
Combinatorial Optimization and Applications | 2023-03-21 | Paper |
A study of the LMT-skeleton
| 2023-01-25 | Paper |
An \(O(n^2\log^2 n)\) time algorithm for minmax regret minsum sink on path networks
| 2022-07-21 | Paper |
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
| 2021-10-04 | Paper |
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
Theoretical Computer Science | 2021-06-22 | Paper |
Minsum \(k\)-sink problem on path networks
Theoretical Computer Science | 2020-01-16 | Paper |
Minmax-regret evacuation planning for cycle networks
| 2019-10-15 | Paper |
The mixed evacuation problem
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Minsum \(k\)-sink problem on dynamic flow path networks
| 2018-09-06 | Paper |
Minimax regret 1-median problem in dynamic path networks
Theory of Computing Systems | 2018-08-03 | Paper |
A population-based algorithm for solving linear assignment problems with two objectives
Computers \& Operations Research | 2018-07-11 | Paper |
A proof of the molecular conjecture
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Notes on computing peaks in \(k\)-levels and parametric spanning trees
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Improved algorithms for computing \(k\)-sink on dynamic flow path networks
| 2017-09-22 | Paper |
The mixed evacuation problem
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Geometric \(p\)-center problems with centers constrained to two lines
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Continuous folding of regular dodecahedra
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Minimax regret 1-median problem in dynamic path networks
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Extended formulations for sparsity matroids
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
An inductive construction of minimally rigid body-hinge simple graphs
Theoretical Computer Science | 2016-06-27 | Paper |
A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems
Information Processing Letters | 2016-06-09 | Paper |
On the edge crossing properties of Euclidean minimum weight Laman graphs
Computational Geometry | 2016-01-18 | Paper |
Optimally bracing grid frameworks with holes
Theoretical Computer Science | 2015-12-11 | Paper |
Multiple sink location problems in dynamic path networks
Theoretical Computer Science | 2015-12-08 | Paper |
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
Information Processing Letters | 2015-12-01 | Paper |
Straight-Line Drawability of a Planar Graph Plus an Edge
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Optimally bracing grid frameworks with holes
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
A linear-time algorithm for testing outer-1-planarity
Algorithmica | 2015-09-02 | Paper |
Minimax regret 1-sink location problem in dynamic path networks
Theoretical Computer Science | 2015-06-11 | Paper |
Multiple sink location problems in dynamic path networks
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Minimax regret sink location problem in dynamic tree networks with uniform capacity
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
Discrete Applied Mathematics | 2014-09-12 | Paper |
Online graph exploration algorithms for cycles and trees by multiple searchers
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity
Algorithms and Computation | 2014-02-18 | Paper |
On the edge crossing properties of Euclidean minimum weight Laman graphs
Algorithms and Computation | 2014-01-14 | Paper |
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
Theoretical Computer Science | 2014-01-13 | Paper |
A linear-time algorithm for testing outer-1-planarity
Graph Drawing | 2013-12-20 | Paper |
An inductive construction of minimally rigid body-hinge simple graphs
Combinatorial Optimization and Applications | 2013-12-10 | Paper |
Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Minimax regret 1-sink location problems in dynamic path networks
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Testing maximal 1-planarity of graphs with a rotation system in linear time (extended abstract)
Graph Drawing | 2013-04-03 | Paper |
Independent arborescences in directed graphs
Discrete Mathematics | 2013-03-01 | Paper |
A rooted-forest partition with uniform vertex demand
Journal of Combinatorial Optimization | 2012-12-21 | Paper |
Topology optimization of trusses with stress and local constraints on nodal stability and member intersection
Structural and Multidisciplinary Optimization | 2012-07-31 | Paper |
Online exploration of all vertices in a simple polygon
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
A proof of the molecular conjecture
Discrete \& Computational Geometry | 2011-06-03 | Paper |
scientific article; zbMATH DE number 5870351 (Why is no real title available?)
| 2011-03-25 | Paper |
The structure and number of global roundings of a graph
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Covering directed graphs by in-trees
Journal of Combinatorial Optimization | 2011-02-18 | Paper |
Sequential semidefinite programming for optimization of framed structures under multimodal buckling constraints
International Journal of Structural Stability and Dynamics | 2011-02-10 | Paper |
Arc-disjoint in-trees in directed graphs
Combinatorica | 2010-08-13 | Paper |
scientific article; zbMATH DE number 5764894 (Why is no real title available?)
| 2010-08-06 | Paper |
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths
Discrete Applied Mathematics | 2010-04-28 | Paper |
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
Discrete Applied Mathematics | 2010-04-28 | Paper |
A geometric spanner of segments
International Journal of Computational Geometry & Applications | 2010-03-19 | Paper |
Parametric search: three new applications
Frontiers of Mathematics in China | 2010-02-26 | Paper |
A Rooted-Forest Partition with Uniform Vertex Demand
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
A polynomial-time algorithm for the universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
Algorithms and Computation | 2009-12-17 | Paper |
On the Infinitesimal Rigidity of Bar-and-Slider Frameworks
Algorithms and Computation | 2009-12-17 | Paper |
Fast enumeration algorithms for non-crossing geometric graphs
Discrete \& Computational Geometry | 2009-08-27 | Paper |
The Minimum Weight In-Tree Cover Problem
Communications in Computer and Information Science | 2009-05-13 | Paper |
Enumerating Constrained Non-crossing Geometric Spanning Trees
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Fast enumeration algorithms for non-crossing geometric graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Voronoi diagrams with respect to criteria on vision information
Japan Journal of Industrial and Applied Mathematics | 2008-09-25 | Paper |
Enumerating constrained non-crossing minimally rigid frameworks
Discrete \& Computational Geometry | 2008-09-24 | Paper |
Covering Directed Graphs by In-Trees
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Geometric Spanner of Objects under L 1 Distance
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Geometric Spanner of Segments
Algorithms and Computation | 2008-05-27 | Paper |
Triangulating a convex polygon with fewer number of non-standard bars
Theoretical Computer Science | 2008-01-07 | Paper |
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Enumerating Non-crossing Minimally Rigid Frameworks
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Enumerating non-crossing minimally rigid frameworks
Graphs and Combinatorics | 2007-07-19 | Paper |
An approximation algorithm for the pickup and delivery vehicle routing problem on trees
Discrete Applied Mathematics | 2007-01-09 | Paper |
POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA
International Journal of Computational Geometry & Applications | 2006-05-29 | Paper |
scientific article; zbMATH DE number 5006167 (Why is no real title available?)
| 2006-02-13 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
Journal of Combinatorial Optimization | 2005-05-17 | Paper |
Optimal spanners for axis-aligned rectangles
Computational Geometry | 2005-02-09 | Paper |
scientific article; zbMATH DE number 2119753 (Why is no real title available?)
| 2004-11-29 | Paper |
The structure and number of global roundings of a graph
Theoretical Computer Science | 2004-10-27 | Paper |
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
scientific article; zbMATH DE number 2086361 (Why is no real title available?)
| 2004-08-11 | Paper |
Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning
SIAM Journal on Computing | 2003-09-28 | Paper |
scientific article; zbMATH DE number 1975070 (Why is no real title available?)
| 2003-09-04 | Paper |
scientific article; zbMATH DE number 1958099 (Why is no real title available?)
| 2003-07-31 | Paper |
\(k\)-levels of concave surfaces
Discrete \& Computational Geometry | 2003-04-27 | Paper |
Group symmetry in interior-point methods for semidefinite program
Optimization and Engineering | 2003-03-12 | Paper |
Approximating uniform triangular meshes in polygons.
Theoretical Computer Science | 2003-01-21 | Paper |
scientific article; zbMATH DE number 2015505 (Why is no real title available?)
| 2003-01-01 | Paper |
scientific article; zbMATH DE number 1789197 (Why is no real title available?)
| 2002-08-26 | Paper |
scientific article; zbMATH DE number 1786513 (Why is no real title available?)
| 2002-08-21 | Paper |
scientific article; zbMATH DE number 1696619 (Why is no real title available?)
| 2002-07-01 | Paper |
Resource constrained chain scheduling of UET jobs on two machines
Operations Research | 2002-07-01 | Paper |
scientific article; zbMATH DE number 1741101 (Why is no real title available?)
| 2002-05-15 | Paper |
scientific article; zbMATH DE number 1522939 (Why is no real title available?)
| 2001-12-05 | Paper |
A unified scheme for detecting fundamental curves in binary edge images
Computational Geometry | 2001-09-27 | Paper |
scientific article; zbMATH DE number 1559543 (Why is no real title available?)
| 2001-02-28 | Paper |
LMT-skeleton heuristics for several new classes of optimal triangulations
Computational Geometry | 2001-02-22 | Paper |
scientific article; zbMATH DE number 1568054 (Why is no real title available?)
| 2001-02-21 | Paper |
scientific article; zbMATH DE number 1568144 (Why is no real title available?)
| 2001-02-21 | Paper |
A new approximation algorithm for the capacitated vehicle routing problem on a tree
Journal of Combinatorial Optimization | 2001-01-01 | Paper |
scientific article; zbMATH DE number 1445369 (Why is no real title available?)
| 2000-10-23 | Paper |
scientific article; zbMATH DE number 1302182 (Why is no real title available?)
| 2000-10-10 | Paper |
Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints
Computer Methods in Applied Mechanics and Engineering | 2000-09-10 | Paper |
Efficient algorithms for finding the most vital edge of a minimum spanning tree
Information Processing Letters | 2000-08-14 | Paper |
scientific article; zbMATH DE number 1398082 (Why is no real title available?)
| 2000-02-03 | Paper |
scientific article; zbMATH DE number 1395342 (Why is no real title available?)
| 2000-01-30 | Paper |
Finding Subsets Maximizing Minimum Structures
SIAM Journal on Discrete Mathematics | 1999-11-23 | Paper |
scientific article; zbMATH DE number 1303035 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1305444 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1256677 (Why is no real title available?)
| 1999-04-22 | Paper |
scientific article; zbMATH DE number 1222815 (Why is no real title available?)
| 1998-11-11 | Paper |
Triangulations intersect nicely
Discrete \& Computational Geometry | 1997-02-18 | Paper |
Variants for the Hough transform for line detection
Computational Geometry | 1996-11-04 | Paper |
scientific article; zbMATH DE number 871905 (Why is no real title available?)
| 1996-10-21 | Paper |
scientific article; zbMATH DE number 910870 (Why is no real title available?)
| 1996-08-22 | Paper |
A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
Discrete Applied Mathematics | 1996-07-07 | Paper |
FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE
International Journal of Computational Geometry & Applications | 1995-08-22 | Paper |
On minimum and maximum spanning trees of linearly moving points
Discrete \& Computational Geometry | 1995-03-20 | Paper |
Efficient algorithms for minimum range cut problems
Networks | 1994-11-27 | Paper |
scientific article; zbMATH DE number 544186 (Why is no real title available?)
| 1994-04-04 | Paper |
scientific article; zbMATH DE number 177540 (Why is no real title available?)
| 1993-05-18 | Paper |
A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control
Discrete Applied Mathematics | 1993-05-16 | Paper |
Optimal strategies for some team games
Discrete Applied Mathematics | 1992-06-28 | Paper |
An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion
Discrete Applied Mathematics | 1992-06-28 | Paper |
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
Discrete Applied Mathematics | 1992-06-28 | Paper |
A two‐commodity sharing problem on networks
Networks | 1992-06-25 | Paper |
Finding k points with minimum diameter and related problems
Journal of Algorithms | 1991-01-01 | Paper |
AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS
Journal of the Operations Research Society of Japan | 1990-01-01 | Paper |
Mathematical Considerations on the Relationship between the Ordering of players and Winning Probability in Certain Types of Team Sports
Journal of the Operations Research Society of Japan | 1989-01-01 | Paper |
The Fair Resource Allocation Problem with Submodular Constraints
Mathematics of Operations Research | 1988-01-01 | Paper |
Approximation algorithms for combinatorial fractional programming problems
Mathematical Programming | 1987-01-01 | Paper |
A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
Discrete Applied Mathematics | 1987-01-01 | Paper |
VARIANCE CONSTRAINED MARKOV DECISION PROCESS
Journal of the Operations Research Society of Japan | 1987-01-01 | Paper |
A cautious scheduler for multistep transactions
Algorithmica | 1987-01-01 | Paper |
An efficient algorithm for the parametric resource allocation problem
Discrete Applied Mathematics | 1985-01-01 | Paper |
An Algorithm for the Equipollent Resource Allocation Problem
Mathematics of Operations Research | 1985-01-01 | Paper |
Cautious transaction schedulers with admission control
ACM Transactions on Database Systems | 1985-01-01 | Paper |
A polynomial time algorithm for a chance-constrained single machine scheduling problem
Operations Research Letters | 1983-01-01 | Paper |
On-line computation of transitive closures of graphs
Information Processing Letters | 1983-01-01 | Paper |
An efficient algorithm for K shortest simple paths
Networks | 1982-01-01 | Paper |
An Algorithm for the K Best Solutions of the Resource Allocation Problem
Journal of the ACM | 1981-01-01 | Paper |
An Algorithm for Finding K Minimum Spanning Trees
SIAM Journal on Computing | 1981-01-01 | Paper |
Notes on the Problem of the Allocation of Resources to Activities in Discrete Quantities
The Journal of the Operational Research Society | 1980-01-01 | Paper |
A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
The Journal of the Operational Research Society | 1979-01-01 | Paper |
ALGORITHMS FOR A VARIANT OF THE RESOURCE ALLOCATION PROBLEM
Journal of the Operations Research Society of Japan | 1979-01-01 | Paper |
