On the public citation graph
Fractional cascading: I. A data structuring technique
0 signed · 404 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/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bf01840441openalex-snapshot
Fractional cascading: II. Applications
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot
Decomposable searching problems I. Static-to-dynamic transformation
inferredcites →https://doi.org/10.1016/0196-6774(82)90016-5openalex-snapshot
Rectilinear line segment intersection, layered segment trees, and dynamization
inferredcites →https://doi.org/10.1016/0196-6774(86)90004-0openalex-snapshot
Searching and storing similar lists
inferredcites →https://doi.org/10.1109/sfcs.1984.715940openalex-snapshot
Dynamic Segment Intersection Search With Applications
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferredcites →https://doi.org/10.1145/323233.323256openalex-snapshot
Dynamization of geometric data structures
inferredcites →https://doi.org/10.1145/800061.808753openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1995.1017openalex-snapshot
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
inferred← citeshttps://doi.org/10.1006/jagm.1996.0054openalex-snapshot
Off-Line Maintenance of Planar Configurations
inferred← citeshttps://doi.org/10.1006/jagm.1996.0063openalex-snapshot
Range Searching and Point Location among Fat Objects
inferred← citeshttps://doi.org/10.1006/jcss.1996.0012openalex-snapshot
Applications of Range Query Theory to Relational Data Base Join and Selection Operations
inferred← citeshttps://doi.org/10.1006/jcss.2002.1848openalex-snapshot
An Algorithm for Handling Many Relational Calculus Queries Efficiently
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1383openalex-snapshot
Parallel Algorithm for Finding the Most Vital Edge in Weighted Graphs
inferred← citeshttps://doi.org/10.1007/11534273_14openalex-snapshot
Line-Segment Intersection Made In-Place
inferred← citeshttps://doi.org/10.1007/11590156_3openalex-snapshot
Developments in Data Structure Research During the First 25 Years of FSTTCS
inferred← citeshttps://doi.org/10.1007/11841036_37openalex-snapshot
Region-Restricted Clustering for Geographic Data Mining
inferred← citeshttps://doi.org/10.1007/11841036_8openalex-snapshot
Fréchet Distance for Curves, Revisited
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_20openalex-snapshot
Authenticated Data Structures for Graph and Geometric Searching
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_21openalex-snapshot
Fractal Merkle Tree Representation and Traversal
inferred← citeshttps://doi.org/10.1007/3-540-44438-6_41openalex-snapshot
An Efficient Shape-Based Approach to Image Retrieval
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_12openalex-snapshot
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-44691-5_16openalex-snapshot
Planar Point Location for Large Data Sets: To Seek or Not to Seek
inferred← citeshttps://doi.org/10.1007/3-540-44732-6_22openalex-snapshot
A New Geometric Tool for Pattern Recognition - An Algorithm for Real Time Insertion of Layered Segment Trees
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_30openalex-snapshot
Efficient Algorithms for Two-Center Problems for a Convex Polygon
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_89openalex-snapshot
Dynamic Algorithms for Approximating Interdistances
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_26openalex-snapshot
Three-Dimensional Layers of Maxima
inferred← citeshttps://doi.org/10.1007/3-540-45753-4_14openalex-snapshot
Facility Location and the Geometric Minimum-Diameter Spanning Tree
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_67openalex-snapshot
Planar point location revisited (A guided tour of a decade of research)
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_2openalex-snapshot
Efficient spatial point location
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_107openalex-snapshot
Intersection queries in sets of disks
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_79openalex-snapshot
Output-sensitive generation of the perspective view of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_91openalex-snapshot
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_172openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_174openalex-snapshot
Computational geometry for the gourmet old fare and new dishes
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_20openalex-snapshot
Selected topics from computational geometry, data structures and motion planning
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_18openalex-snapshot
Fractional cascading simplified
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_277openalex-snapshot
Counting and reporting red/blue segment intersections
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-60313-1_151openalex-snapshot
External-memory algorithms for processing line segments in geographic information systems
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_78openalex-snapshot
Geometric Applications of Posets
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_8openalex-snapshot
External-memory algorithms with applications in GIS
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-68535-9_4openalex-snapshot
De-amortization of Algorithms
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-4613-0303-9_10openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_3openalex-snapshot
Concentration of Measure for Randomized Algorithms: Techniques and Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4615-5515-5_8openalex-snapshot
Implementation and Evaluation of Decision Trees with Range and Region Splitting
inferred← citeshttps://doi.org/10.1007/978-3-031-21343-4_10openalex-snapshot
Data and Data Management in the Context of Digital Twins
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_2openalex-snapshot
Point Enclosure Problem for Homothetic Polygons
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_38openalex-snapshot
Geometric Hitting Set for Line-Constrained Disks
inferred← citeshttps://doi.org/10.1007/978-3-031-83438-7_18openalex-snapshot
A Sub-quadratic Algorithm for the Minsum One Sink Location Problem on Balanced Binary Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_18openalex-snapshot
On Strictly Output-Sensitive Color Frequency Reporting
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_11openalex-snapshot
Efficient List-Based Computation of the String Subsequence Kernel
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_10openalex-snapshot
One-Dimensional k-Center on Uncertain Data
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-13075-0_26openalex-snapshot
Range Queries on Uncertain Data
inferred← citeshttps://doi.org/10.1007/978-3-319-21840-3_21openalex-snapshot
Cache-Oblivious Iterated Predecessor Queries via Range Coalescing
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_25openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_32openalex-snapshot
Cache Oblivious Sparse Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_6openalex-snapshot
Polygonal Path Approximation: A Query Based Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_6openalex-snapshot
Optimal External Memory Planar Point Enclosure
inferred← citeshttps://doi.org/10.1007/978-3-540-30213-1_41openalex-snapshot
Motif Extraction from Weighted Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_49openalex-snapshot
Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_20openalex-snapshot
Shortest Path Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_4openalex-snapshot
Uniquely Represented Data Structures for Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_11openalex-snapshot
Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_18openalex-snapshot
Indexing a Dictionary for Subset Matching Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_59openalex-snapshot
I/O-Efficient Point Location in a Set of Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-642-02882-3_22openalex-snapshot
Space Efficient Multi-dimensional Range Reporting
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_40openalex-snapshot
Towards Optimal Range Medians
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_20openalex-snapshot
Data Structures for Approximate Orthogonal Range Counting
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_22openalex-snapshot
Untangled Monotonic Chains and Adaptive Range Search
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_83openalex-snapshot
Data Structures for Range Median Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-12476-1_11openalex-snapshot
Indexing a Dictionary for Subset Matching Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_8openalex-snapshot
Range Queries over Untangled Chains
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_31openalex-snapshot
Fully Retroactive Approximate Range and Nearest Neighbor Searching
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_60openalex-snapshot
Efficient Algorithms for the Weighted k-Center Problem on a Real Line
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_61openalex-snapshot
Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_4openalex-snapshot
Ruler, Compass and Computer
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
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-43948-7_7openalex-snapshot
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_44openalex-snapshot
Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_10openalex-snapshot
Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
inferred← citeshttps://doi.org/10.1007/bf01182771openalex-snapshot
Algorithms for bichromatic line-segment problems and polyhedral terrains
inferred← citeshttps://doi.org/10.1007/bf01377183openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferred← citeshttps://doi.org/10.1007/bf01758750openalex-snapshot
Parallel computational geometry of rectangles
inferred← citeshttps://doi.org/10.1007/bf01758839openalex-snapshot
Line-segment intersection reporting in parallel
inferred← citeshttps://doi.org/10.1007/bf01758847openalex-snapshot
Output-sensitive generation of the perspective view of isothetic parallelepipeds
inferred← citeshttps://doi.org/10.1007/bf01758856openalex-snapshot
Parallel methods for visibility and shortest-path problems in simple polygons
inferred← citeshttps://doi.org/10.1007/bf01840366openalex-snapshot
Computing on a free tree via complexity-preserving mappings
inferred← citeshttps://doi.org/10.1007/bf01941685openalex-snapshot
Sweep Methods for Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1007/bf01941686openalex-snapshot
Optimal Cooperative Search in Fractional Cascaded Data Structures
inferred← citeshttps://doi.org/10.1007/bf01994881openalex-snapshot
Intersection queries in sets of disks
inferred← citeshttps://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferred← citeshttps://doi.org/10.1007/bf02187852openalex-snapshot
Maintaining the minimal distance of a point set in polylogarithmic time
inferred← citeshttps://doi.org/10.1007/bf02187875openalex-snapshot
Linear space data structures for two types of range search
inferred← citeshttps://doi.org/10.1007/bf02716578openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bfb0032049openalex-snapshot
Merging free trees in parallel for efficient voronoi diagram construction
inferred← citeshttps://doi.org/10.1007/bfb0049412openalex-snapshot
Range searching and point location among fat objects
inferred← citeshttps://doi.org/10.1007/bfb0100976openalex-snapshot
Towards optimal indexing for segment databases
inferred← citeshttps://doi.org/10.1007/s00453-006-1208-zopenalex-snapshot
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
inferred← citeshttps://doi.org/10.1007/s00453-007-9126-2openalex-snapshot
Optimal External Memory Planar Point Enclosure
inferred← citeshttps://doi.org/10.1007/s00453-009-9355-7openalex-snapshot
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
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-018-00537-6openalex-snapshot
Covering Uncertain Points in a Tree
inferred← citeshttps://doi.org/10.1007/s00453-019-00567-8openalex-snapshot
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-019-00588-3openalex-snapshot
Two Approaches to Building Time-Windowed Geometric Data Structures
inferred← citeshttps://doi.org/10.1007/s00453-022-00947-7openalex-snapshot
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient
inferred← citeshttps://doi.org/10.1007/s00454-004-1098-2openalex-snapshot
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons
inferred← citeshttps://doi.org/10.1007/s00454-006-1272-9openalex-snapshot
A Single Cell in an Arrangement of Convex Polyhedra in ${\Bbb R}^3$
inferred← citeshttps://doi.org/10.1007/s00454-017-9903-xopenalex-snapshot
Nearest-Neighbor Searching Under Uncertainty I
inferred← citeshttps://doi.org/10.1007/s00454-019-00112-yopenalex-snapshot
Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/s00778-019-00555-yopenalex-snapshot
LSM-based storage techniques: a survey
inferred← citeshttps://doi.org/10.1007/s00778-019-00559-8openalex-snapshot
Indexing in flash storage devices: a survey on challenges, current approaches, and future trends
inferred← citeshttps://doi.org/10.1007/s10618-017-0545-7openalex-snapshot
Efficient geometric-based computation of the string subsequence kernel
inferred← citeshttps://doi.org/10.1007/s10878-010-9301-2openalex-snapshot
The Maximum Box Problem for moving points in the plane
inferred← citeshttps://doi.org/10.1007/s10878-023-00996-wopenalex-snapshot
The two-center problem of uncertain points on a real line
inferred← citeshttps://doi.org/10.1007/s11227-018-2277-xopenalex-snapshot
Emergent models, frameworks, and hardware technologies for Big data analytics
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90120-2openalex-snapshot
The shortest watchtower and related problems for polyhedral terrains
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90046-zopenalex-snapshot
Parallel algorithms for the segment dragging problem
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90211-dopenalex-snapshot
Point location in fat subdivisions
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90087-6openalex-snapshot
The range co-minima problem
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90034-2openalex-snapshot
Making data structures persistent
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90018-gopenalex-snapshot
Hidden surface removal for rectangles
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90019-9openalex-snapshot
A general approach to dominance in the plane
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90062-hopenalex-snapshot
Algorithms for ray-shooting and intersection searching
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90005-dopenalex-snapshot
Parallel fractional cascading on hypercube multiprocessors
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90007-fopenalex-snapshot
Hidden surface removal for c-oriented polyhedra
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/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot
Deterministic Parallel Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50011-5openalex-snapshot
Geometric Data Structures
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50021-8openalex-snapshot
Closest-Point Problems in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.04.001openalex-snapshot
I/O-efficient dynamic planar point location
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.07.007openalex-snapshot
Facility location and the geometric minimum-diameter spanning tree
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.07.001openalex-snapshot
Polygonal chain approximation: a query based approach
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.09.003openalex-snapshot
Polygonal path simplification with angle constraints
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.09.001openalex-snapshot
Line-segment intersection made in-place
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.08.003openalex-snapshot
Region-restricted clustering for geographic data mining
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.06.005openalex-snapshot
Homogeneous 2-hop broadcast in 2D
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.07.003openalex-snapshot
Improved algorithms to network p -center location problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.09.001openalex-snapshot
Approximating minimum bending energy path in a simple corridor
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101945openalex-snapshot
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model
inferred← citeshttps://doi.org/10.1016/j.comgeo.2024.102122openalex-snapshot
On the line-separable unit-disk coverage and related problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2025.102196openalex-snapshot
Algorithms for computing closest points for segments
inferred← citeshttps://doi.org/10.1016/j.cpc.2023.109072openalex-snapshot
Efficient algorithms for Monte Carlo particle transport on AI accelerator hardware
inferred← citeshttps://doi.org/10.1016/j.dam.2025.11.010openalex-snapshot
Consecutive occurrences with distance constraints
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.07.003openalex-snapshot
Lower bounds for intersection searching and fractional cascading in higher dimension
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.09.006openalex-snapshot
Range-max queries on uncertain data
inferred← citeshttps://doi.org/10.1016/j.jda.2006.03.018openalex-snapshot
Algorithms for extracting motifs from biological weighted sequences
inferred← citeshttps://doi.org/10.1016/j.jda.2018.09.001openalex-snapshot
Space-efficient indexes for forbidden extension queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.033openalex-snapshot
Efficient algorithms for center problems in cactus networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.003openalex-snapshot
Towards optimal range medians
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.037openalex-snapshot
Untangled monotonic chains and adaptive range search
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.013openalex-snapshot
A note on the ϵ -indicator subset selection
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.028openalex-snapshot
Efficient algorithms for the one-dimensional k-center problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.017openalex-snapshot
One-dimensional k-center on uncertain data
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.005openalex-snapshot
Range queries on uncertain data
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.034openalex-snapshot
Faster shortest paths in dense distance graphs, with applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.053openalex-snapshot
Covering a set of line segments with a few squares
inferred← citeshttps://doi.org/10.1016/j.trc.2021.103265openalex-snapshot
Offline map matching using time-expanded graph for low-frequency data
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00075-1openalex-snapshot
Algorithms for three-dimensional dominance searching in linear space
inferred← citeshttps://doi.org/10.1016/s0031-3203(01)00202-3openalex-snapshot
Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
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-8655(01)00148-9openalex-snapshot
An efficient shape-based approach to image retrieval
inferred← citeshttps://doi.org/10.1016/s0305-0548(01)00063-6openalex-snapshot
Improved algorithms for placing undesirable facilities
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00049-4openalex-snapshot
Reporting intersecting pairs of convex polytopes in two and three dimensions
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00009-0openalex-snapshot
Computing the shortest watchtower of a polyhedral terrain in O(nlogn) time
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00008-4openalex-snapshot
New results on binary space partitions in the plane
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00031-5openalex-snapshot
Geometric applications of posets
inferred← citeshttps://doi.org/10.1016/s0925-7721(99)00055-3openalex-snapshot
Queries with segments in Voronoi diagrams
inferred← citeshttps://doi.org/10.1023/a:1009755828992openalex-snapshot
Implementation and Evaluation of Decision Trees with Range and Region Splitting
inferred← citeshttps://doi.org/10.1038/s41598-019-41451-3openalex-snapshot
Efficient Genomic Interval Queries Using Augmented Range Trees
inferred← citeshttps://doi.org/10.1051/ita/1994280100251openalex-snapshot
Using persistent data structures for adding range restrictions to searching problems
inferred← citeshttps://doi.org/10.1089/cmb.2006.13.1214openalex-snapshot
Computation of Repetitions and Regularities of Biologically Weighted Sequences
inferred← citeshttps://doi.org/10.1093/comjnl/40.1.22openalex-snapshot
New Results on Intersection Query Problems
inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot
Dynamic algorithms in computational geometry
inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot
Parallel techniques for computational geometry
inferred← citeshttps://doi.org/10.1109/apweb.2010.67openalex-snapshot
HashTree: A New Hybrid Index for Flash Disks
inferred← citeshttps://doi.org/10.1109/discex.2003.1194973openalex-snapshot
Efficient and scalable infrastructure support for dynamic coalitions
inferred← citeshttps://doi.org/10.1109/dsc49826.2021.9346272openalex-snapshot
Perpetual Secret Sharing from Dynamic Data Structures
inferred← citeshttps://doi.org/10.1109/focs.2006.40openalex-snapshot
Improved Dynamic Planar Point Location
inferred← citeshttps://doi.org/10.1109/focs.2009.58openalex-snapshot
Orthogonal Range Reporting in Three and Higher Dimensions
inferred← citeshttps://doi.org/10.1109/focs.2015.31openalex-snapshot
Towards an Optimal Method for Dynamic Planar Point Location
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00060openalex-snapshot
Adjacency Labelling for Planar Graphs (and Beyond)
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00072openalex-snapshot
2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.1109/fscs.1990.89544openalex-snapshot
Hidden surface removal for axis-parallel polyhedra
inferred← citeshttps://doi.org/10.1109/icaicta59291.2023.10389969openalex-snapshot
Obtaining Maximum Probability Partitioning by Optimizing Calculation Strategy
inferred← citeshttps://doi.org/10.1109/icdcs60910.2024.00040openalex-snapshot
CubeChain: Generalized Query Framework for Intra- and Cross-Chain Scenarios
inferred← citeshttps://doi.org/10.1109/icde.2017.121openalex-snapshot
On Log-Structured Merge for Solid-State Drives
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00158openalex-snapshot
Random Sampling Over Spatial Range Joins
showing the first 200 of 392 · page through all 392
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.