On the public citation graph
Geometric applications of a matrix-searching algorithm
0 signed · 419 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-68402-9_17openalex-snapshot
The Separation for General Single-Layer Wiring Barriers
inferredcites →https://doi.org/10.1007/bf00979872openalex-snapshot
Complexity, convexity, and unimodality
inferredcites →https://doi.org/10.1007/bf01898354openalex-snapshot
Minimum area circumscribing Polygons
inferredcites →https://doi.org/10.1016/0020-0190(78)90066-2openalex-snapshot
The all nearest-neighbor problem for convex polygons
inferredcites →https://doi.org/10.1016/0022-0000(81)90010-6openalex-snapshot
An optimal solution to a wire-routing problem
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0196-6774(86)90028-3openalex-snapshot
Fast computation of the modality of polygons
inferredcites →https://doi.org/10.1016/0898-1221(82)90054-2openalex-snapshot
On the multimodality of distances in convex polygons
inferredcites →https://doi.org/10.1016/0898-1221(83)90139-6openalex-snapshot
The symmetric all-furthest- neighbor problem
inferredcites →https://doi.org/10.1137/0215022openalex-snapshot
Computing the Largest Empty Rectangle
inferredcites →https://doi.org/10.1145/800076.802484openalex-snapshot
Optimal wiring between rectangles
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(199306)40:4<459::aid-nav3220400404>3.0.co;2-8openalex-snapshot
The dynamic lot-sizing model with backlogging: A simpleo(n logn) algorithm and minimal forecast horizon procedure
inferred← citeshttps://doi.org/10.1002/nav.21485openalex-snapshot
Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
inferred← citeshttps://doi.org/10.1002/nav.21564openalex-snapshot
Vehicle routing problems with regular objective functions on a path
inferred← citeshttps://doi.org/10.1002/net.20013openalex-snapshot
Algorithms for minimum‐cost paths in time‐dependent networks with waiting policies
inferred← citeshttps://doi.org/10.1006/jagm.1995.1039openalex-snapshot
An Improved Algorithm for the Traveler′s Problem
inferred← citeshttps://doi.org/10.1006/jagm.1996.0028openalex-snapshot
Selection in Monotone Matrices and Computingkth Nearest Neighbors
inferred← citeshttps://doi.org/10.1006/jagm.1996.0824openalex-snapshot
More Efficient Parallel Totally Monotone Matrix Searching
inferred← citeshttps://doi.org/10.1006/jagm.1998.0955openalex-snapshot
Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
inferred← citeshttps://doi.org/10.1006/jagm.2001.1191openalex-snapshot
On the Common Substring Alignment Problem
inferred← citeshttps://doi.org/10.1006/jagm.2002.1213openalex-snapshot
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
inferred← citeshttps://doi.org/10.1007/11561071_78openalex-snapshot
Optimizing a 2D Function Satisfying Unimodality Properties
inferred← citeshttps://doi.org/10.1007/11940128_70openalex-snapshot
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy
inferred← citeshttps://doi.org/10.1007/11970125_4openalex-snapshot
Online Dynamic Programming Speedups
inferred← citeshttps://doi.org/10.1007/3-540-39963-1_58openalex-snapshot
On the Complexity of Optimal Multisplitting
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_23openalex-snapshot
The k-Median Problem for Directed Trees
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_17openalex-snapshot
Sparse LCS Common Substring Alignment
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_8openalex-snapshot
Fast Algorithms with Algebraic Monge Properties
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_11openalex-snapshot
Computing the minimum visible vertex distance between two polygons
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_81openalex-snapshot
Finding least-weight subsequences with fewer processors
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_51openalex-snapshot
On some largest empty orthoconvex polygons in a point set
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_80openalex-snapshot
Improved selection in totally monotone arrays
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_6openalex-snapshot
Approximate regular expression pattern matching with concave gap penalties
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_235openalex-snapshot
An optimal algorithm for finding the separation of simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_60openalex-snapshot
On the recognition of permuted bottleneck monge matrices
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_278openalex-snapshot
Consecutive interval query and dynamic programming on intervals
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_279openalex-snapshot
An improved algorithm for the traveler's problem
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_2openalex-snapshot
Selection in monotone matrices and computing k th nearest neighbors
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_222openalex-snapshot
k Best Cuts for Circular-Arc graphs
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_150openalex-snapshot
Lower bounds for row minima searching
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_17openalex-snapshot
Two-Center Problems for a Convex Polygon (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_4openalex-snapshot
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_28openalex-snapshot
Advanced Techniques for Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_47openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_5openalex-snapshot
Efficient Algorithms with Applications to Molecular Biology
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_10openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_3openalex-snapshot
Random Sampling Techniques in Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_17openalex-snapshot
Efficient Algorithms for Sequence Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-01225-0_16openalex-snapshot
MPLP++: Fast, Parallel Dual Block-Coordinate Ascent for Dense Graphical Models
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_29openalex-snapshot
Efficient Second-Order Shape-Constrained Function Fitting
inferred← citeshttps://doi.org/10.1007/978-3-030-35231-8_49openalex-snapshot
Efficient Gaussian Distance Transforms for Image Processing
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_19openalex-snapshot
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-030-85665-6_23openalex-snapshot
A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
inferred← citeshttps://doi.org/10.1007/978-3-031-18840-4_32openalex-snapshot
Recurrent Segmentation Meets Block Models in Temporal Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-49611-0_29openalex-snapshot
The Line-Constrained Maximum Coverage Facility Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_1openalex-snapshot
Line-Constrained $$k$$ -Median, $$k$$ -Means, and $$k$$ -Center Problems in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-319-42634-1_29openalex-snapshot
Deterministic Algorithms for Unique Sink Orientations of Grids
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_23openalex-snapshot
Speeding up Dynamic Programming in the Line-Constrained k-median
inferred← citeshttps://doi.org/10.1007/978-3-319-62395-5_35openalex-snapshot
Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_13openalex-snapshot
Two Algorithms for LCS Consecutive Suffix Alignment
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_10openalex-snapshot
Online Maintenance of k-Medians and k-Covers on a Line
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_10openalex-snapshot
A Generalization of Magic Squares with Applications to Digital Halftoning
inferred← citeshttps://doi.org/10.1007/978-3-540-69733-6_32openalex-snapshot
Sequence Alignment Algorithms for Run-Length-Encoded Strings
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_31openalex-snapshot
Optimal Field Splitting with Feathering in Intensity-Modulated Radiation Therapy
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_17openalex-snapshot
Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O(n 4) Time
inferred← citeshttps://doi.org/10.1007/978-3-540-73814-5_1openalex-snapshot
Geometric Algorithms for the Constrained 1-D K-Means Clustering Problems and IMRT Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_60openalex-snapshot
New Algorithm for Field Splitting in Radiation Therapy
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_23openalex-snapshot
Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_20openalex-snapshot
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_24openalex-snapshot
Approximating Points by a Piecewise Linear Function: I
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_25openalex-snapshot
Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_3openalex-snapshot
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_9openalex-snapshot
Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_9openalex-snapshot
Multiplication Algorithms for Monge Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-20423-4_8openalex-snapshot
Geometric Robustness of Viability Kernels and Resilience Basins
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_18openalex-snapshot
New Algorithms for 1-D Facility Location and Path Equipartition Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_54openalex-snapshot
Improved Distance Queries in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_9openalex-snapshot
Approximate Point Set Pattern Matching with L p -Norm
inferred← citeshttps://doi.org/10.1007/978-3-642-25832-9_53openalex-snapshot
Object Detection by Admissible Region Search
inferred← citeshttps://doi.org/10.1007/978-3-642-48417-9_40openalex-snapshot
“Monge”-property and efficient algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_11openalex-snapshot
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-662-03039-4_29openalex-snapshot
Recognition of Affine Planar Curves Using Geometric Properties
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_44openalex-snapshot
Improved Submatrix Maximum Queries in Monge Matrices
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_47openalex-snapshot
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
inferred← citeshttps://doi.org/10.1007/bf01190159openalex-snapshot
Finding least-weight subsequences with fewer processors
inferred← citeshttps://doi.org/10.1007/bf01300375openalex-snapshot
Approximate regular expression pattern matching with concave gap penalties
inferred← citeshttps://doi.org/10.1007/bf01840396openalex-snapshot
Computing euclidean maximum spanning trees
inferred← citeshttps://doi.org/10.1007/bf02090398openalex-snapshot
Selection and sorting in totally monotone arrays
inferred← citeshttps://doi.org/10.1007/bf02253612openalex-snapshot
Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
inferred← citeshttps://doi.org/10.1007/bf02526033openalex-snapshot
k best cuts for circular-arc graphs
inferred← citeshttps://doi.org/10.1007/bf02574380openalex-snapshot
Finding a minimum-weightk-link path in graphs with the concave Monge property and applications
inferred← citeshttps://doi.org/10.1007/bf02684360openalex-snapshot
Spanning trees and shortest paths in monge graphs
inferred← citeshttps://doi.org/10.1007/bf02811344openalex-snapshot
Fast parallel algorithms for the Maximum Empty Rectangle problem
inferred← citeshttps://doi.org/10.1007/pl00009175openalex-snapshot
Parallel Searching in Generalized Monge Arrays
inferred← citeshttps://doi.org/10.1007/s00224-009-9166-xopenalex-snapshot
Online Dynamic Programming Speedups
inferred← citeshttps://doi.org/10.1007/s00224-017-9780-yopenalex-snapshot
Speeding up dynamic programming in the line-constrained k-median
inferred← citeshttps://doi.org/10.1007/s00453-004-1126-xopenalex-snapshot
Optimal Two-Description Scalar Quantizer Design
inferred← citeshttps://doi.org/10.1007/s00453-005-1195-5openalex-snapshot
Online Maintenance of k-Medians and k-Covers on a Line
inferred← citeshttps://doi.org/10.1007/s00453-006-1216-zopenalex-snapshot
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem
inferred← citeshttps://doi.org/10.1007/s00453-009-9354-8openalex-snapshot
Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy
inferred← citeshttps://doi.org/10.1007/s00453-009-9363-7openalex-snapshot
Coupled Path Planning, Region Optimization, and Applications in Intensity-modulated Radiation Therapy
inferred← citeshttps://doi.org/10.1007/s00453-010-9486-xopenalex-snapshot
Finding Maximum Edge Bicliques in Convex Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9590-6openalex-snapshot
Unified Compression-Based Acceleration of Edit-Distance Computation
inferred← citeshttps://doi.org/10.1007/s00453-011-9603-5openalex-snapshot
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00453-012-9658-yopenalex-snapshot
Approximating Points by a Piecewise Linear Function
inferred← citeshttps://doi.org/10.1007/s00453-012-9737-0openalex-snapshot
New Algorithms for Facility Location Problems on the Real Line
inferred← citeshttps://doi.org/10.1007/s00453-013-9830-zopenalex-snapshot
Fast Distance Multiplication of Unit-Monge Matrices
inferred← citeshttps://doi.org/10.1007/s00453-013-9859-zopenalex-snapshot
Resequencing a Set of Strings Based on a Target String
inferred← citeshttps://doi.org/10.1007/s00453-018-0432-7openalex-snapshot
On Almost Monge All Scores Matrices
inferred← citeshttps://doi.org/10.1007/s00453-019-00587-4openalex-snapshot
The Complexity of Optimization on Grids
inferred← citeshttps://doi.org/10.1007/s00453-021-00908-6openalex-snapshot
Fast and Longest Rollercoasters
inferred← citeshttps://doi.org/10.1007/s00453-022-01002-1openalex-snapshot
Empty Squares in Arbitrary Orientation Among Points
inferred← citeshttps://doi.org/10.1007/s00454-017-9871-1openalex-snapshot
On the Number of Maximum Empty Boxes Amidst n Points
inferred← citeshttps://doi.org/10.1007/s00454-025-00768-9openalex-snapshot
The Geodesic Edge Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00493-006-0014-1openalex-snapshot
An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*
inferred← citeshttps://doi.org/10.1007/s00530-025-01755-zopenalex-snapshot
SoftBinReduce: data reduction for color quantization through soft binning
inferred← citeshttps://doi.org/10.1007/s10107-020-01603-0openalex-snapshot
Subcontracting and lot-sizing with constant capacities
inferred← citeshttps://doi.org/10.1007/s10618-016-0485-7openalex-snapshot
Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks
inferred← citeshttps://doi.org/10.1007/s10618-017-0515-0openalex-snapshot
Discovering recurring activity in temporal networks
inferred← citeshttps://doi.org/10.1007/s10878-007-9132-yopenalex-snapshot
Alignments with non-overlapping moves, inversions and tandem duplications in O(n 4) time
inferred← citeshttps://doi.org/10.1007/s10878-012-9552-1openalex-snapshot
An improved algorithm for tree edit distance with applications for RNA secondary structure comparison
inferred← citeshttps://doi.org/10.1007/s10951-021-00691-wopenalex-snapshot
Scheduling with gaps: new models and algorithms
inferred← citeshttps://doi.org/10.1007/s10994-023-06507-6openalex-snapshot
Recurrent segmentation meets block models in temporal networks
inferred← citeshttps://doi.org/10.1007/s11263-016-0895-4openalex-snapshot
Capturing Hands in Action Using Discriminative Salient Points and Physics Simulation
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90022-7openalex-snapshot
A note on lower bounds for the maximum area and maximum perimeter k-gon problems
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90103-8openalex-snapshot
A linear time algorithm for finding all farthest neighbors in a convex polygon
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90084-bopenalex-snapshot
An optimal algorithm with unknown time complexity for convex matrix searching
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90139-oopenalex-snapshot
On the angle restricted nearest neighbor problem
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90167-vopenalex-snapshot
Computing the longest diagonal of a simple polygon
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90215-jopenalex-snapshot
A linear-time algorithm for concave one-dimensional dynamic programming
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90118-2openalex-snapshot
A special case of the n-vertex traveling-salesman problem that can be solved in O(n) time
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90143-6openalex-snapshot
An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90133-gopenalex-snapshot
Optimal time bounds for some proximity problems in the plane
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90227-mopenalex-snapshot
Computing the shortest diagonal of a monotone polygon in linear time
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00071-9openalex-snapshot
The convex-hull-and-line traveling salesman problem: a solvable case
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00049-xopenalex-snapshot
A unified linear-time algorithm for computing distance maps
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90115-oopenalex-snapshot
Efficient algorithms for the largest rectangle problem
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90041-xopenalex-snapshot
Optimal shortest path queries in a simple polygon
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90124-uopenalex-snapshot
Applications of generalized matrix searching to geometric algorithms
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90200-topenalex-snapshot
New clique and independent set algorithms for circle graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90038-popenalex-snapshot
New clique and independent set algorithms for circle graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90220-iopenalex-snapshot
Monge and feasibility sequences in general flow problems
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0121-eopenalex-snapshot
A Monge property for the d-dimensional transportation problem
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00019-aopenalex-snapshot
On the recognition of permuted bottleneck Monge matrices
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot
Perspectives of Monge properties in optimization
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90032-6openalex-snapshot
The concave least-weight subsequence problem revisited
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90031-9openalex-snapshot
Sequence comparison with mixed convex and concave costs
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90016-ropenalex-snapshot
On-line dynamic programming with applications to the prediction of RNA secondary structure
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90039-2openalex-snapshot
Optimal quantization by matrix searching
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90005-wopenalex-snapshot
Superlinear bounds for matrix searching problems
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90046-fopenalex-snapshot
An efficient parallel algorithm for the row minima of a totally monotone matrix
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90101-1openalex-snapshot
Speeding up dynamic programming with applications to molecular biology
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90135-3openalex-snapshot
Dynamic programming with convexity, concavity and sparsity
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90049-7openalex-snapshot
Finding minimal convex nested polygons
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00041-0openalex-snapshot
Finding the largest area axis-parallel rectangle in a polygon
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50012-6openalex-snapshot
Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.02.002openalex-snapshot
Hausdorff approximation of convex polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.11.001openalex-snapshot
An almost linear time algorithm for field splitting in radiation therapy
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.02.005openalex-snapshot
Computing the L1 geodesic diameter and center of a simple polygon in linear time
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101631openalex-snapshot
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101742openalex-snapshot
Largest and smallest area triangles on imprecise points
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101792openalex-snapshot
Largest triangles in a polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2021.101844openalex-snapshot
Extremal convex polygons inscribed in a given convex polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102135openalex-snapshot
Largest unit rectangles inscribed in a convex polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102171openalex-snapshot
Finding a largest-area triangle in a terrain in near-linear time
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102232openalex-snapshot
Inscribed and circumscribed histogons of a convex polygon
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.001openalex-snapshot
The algebraic Monge property and path problems
inferred← citeshttps://doi.org/10.1016/j.dam.2012.05.025openalex-snapshot
Minimizing a sum of submodular functions
inferred← citeshttps://doi.org/10.1016/j.dam.2019.02.042openalex-snapshot
Properties of the d -dimensional earth mover’s problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.04.050openalex-snapshot
Monge properties, discrete convexity and applications
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.11.017openalex-snapshot
Dynamic lot-sizing model for major and minor demands
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.09.006openalex-snapshot
Sparse LCS Common Substring Alignment
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.07.003openalex-snapshot
On the symmetric angle-restricted nearest neighbor problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.11.006openalex-snapshot
Dynamic programming algorithms for the mosaic longest common subsequence problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.028openalex-snapshot
Efficient algorithms for finding interleaving relationship between sequences
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.11.003openalex-snapshot
Finding the maximum bounded intersection of k out of n halfplanes
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.09.007openalex-snapshot
Strongly polynomial efficient approximation scheme for segmentation
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105943openalex-snapshot
Maximum-area triangle in a convex polygon, revisited
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.004openalex-snapshot
Two algorithms for LCS Consecutive Suffix Alignment
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103681openalex-snapshot
The edit distance to k-subsequence universality
inferred← citeshttps://doi.org/10.1016/j.jda.2017.07.002openalex-snapshot
Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks
inferred← citeshttps://doi.org/10.1016/j.orl.2011.08.001openalex-snapshot
Improved algorithms for path partition and related problems
inferred← citeshttps://doi.org/10.1016/j.sigpro.2025.110151openalex-snapshot
Bounded guaranteed algorithms for concave impurity minimization via maximum likelihood
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.016openalex-snapshot
A dynamic data structure for top-k queries on uncertain data
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.068openalex-snapshot
Monge properties of sequence alignment
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.029openalex-snapshot
Paging mobile users in cellular networks: Optimality versus complexity and simplicity
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.022openalex-snapshot
One-dimensional approximate point set pattern matching with Lp -norm
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.023openalex-snapshot
L1 shortest path queries in simple polygons
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.040openalex-snapshot
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113944openalex-snapshot
Linear-space S-table algorithms for the longest common subsequence problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114778openalex-snapshot
Finding the Largest Separating Rectangle Among Two Point Sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115593openalex-snapshot
On computing the maximum-volume bichromatic separating box
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00143-5openalex-snapshot
On optimal bridges between two convex regions
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00199-5openalex-snapshot
A faster off-line algorithm for the TCP acknowledgement problem
inferred← citeshttps://doi.org/10.1016/s0020-0190(96)00139-1openalex-snapshot
Using total monotonicity for two optimization problems on the plane
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00026-xopenalex-snapshot
Optimum extensions of prefix codes
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00137-9openalex-snapshot
An efficient algorithm for on-line searching of minima in Monge path-decomposable tridimensional arrays
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00039-xopenalex-snapshot
Scheduling with batching: two job types
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00021-3openalex-snapshot
Consecutive interval query and dynamic programming on intervals
inferred← citeshttps://doi.org/10.1016/s0167-6377(00)00041-9openalex-snapshot
Monge strikes again: optimal placement of web proxies in the internet
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00035-7openalex-snapshot
Structured p-facility location problems on the line solvable in polynomial time
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00099-3openalex-snapshot
Algorithms for optimal multi-resolution quantization
inferred← citeshttps://doi.org/10.1016/s0925-7721(03)00015-4openalex-snapshot
On finding an empty staircase polygon of largest area (width) in a planar point-set
showing the first 200 of 405 · page through all 405
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.