On the public citation graph
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
0 signed · 254 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-1-4684-2001-2_14openalex-snapshot
Efficiency of Equivalence Algorithms
inferredcites →https://doi.org/10.1007/bf01459088openalex-snapshot
Zum Hilbertschen Aufbau der reellen Zahlen
inferredcites →https://doi.org/10.1007/bf02579209openalex-snapshot
Almost linear upper bounds on the length of general davenport—schinzel sequences
inferredcites →https://doi.org/10.1016/s0049-237x(08)71130-3openalex-snapshot
A Mathematical Incompleteness in Peano Arithmetic
inferredcites →https://doi.org/10.1109/sfcs.1985.40openalex-snapshot
On minima of function, intersection patterns of curves, and davenport-schinzel sequences
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.2307/2267457openalex-snapshot
On the interpretation of non-finitist proofs–Part II
inferredcites →https://doi.org/10.2307/2373068openalex-snapshot
A Combinatorial Problem Connected with Differential Equations
inferredcites →https://doi.org/10.4064/aa-17-4-355-362openalex-snapshot
Some properties of Davenport-Schinzel sequences
inferredcites →https://doi.org/10.4064/aa-17-4-363-372openalex-snapshot
A combinatorial problem connected with differential equations II
inferredcites →https://doi.org/10.4064/aa-25-2-213-224openalex-snapshot
On a problem of Davenport and Schinzel
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/eujc.1996.0005openalex-snapshot
On abab-free and abba-free Set Partitions
inferred← citeshttps://doi.org/10.1006/inco.1995.1026openalex-snapshot
On the Power of the Shift Instruction
inferred← citeshttps://doi.org/10.1006/jagm.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferred← citeshttps://doi.org/10.1006/jagm.1996.0815openalex-snapshot
Linearity and Unprovability of Set Union Problem Strategies
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1478openalex-snapshot
Scaleable Parallel Algorithms for Lower Envelopes with Applications
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1565openalex-snapshot
Scalable Parallel Algorithms for Geometric Pattern Recognition
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_30openalex-snapshot
On the bivariate function minimization problem and its applications to motion planning
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_117openalex-snapshot
Geometric structures in computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_25openalex-snapshot
Partitioning Colored Point Sets into Monochromatic Parts
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_53openalex-snapshot
The Conditional Location of a Median Path
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_1openalex-snapshot
Recent Developments in the Theory of Arrangements of Surfaces
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_28openalex-snapshot
On the complexity of the union of geometric objects
inferred← citeshttps://doi.org/10.1007/3-540-51683-2_34openalex-snapshot
An optimal algorithm for the boundary of a cell in a union of rays
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_105openalex-snapshot
Upper envelope onion peeling
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-53487-3_49openalex-snapshot
Voronoi diagrams of moving points in the plane
inferred← citeshttps://doi.org/10.1007/3-540-55121-2_11openalex-snapshot
Voronoi diagrams of moving points in the plane
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_179openalex-snapshot
A simplified technique for hidden-line elimination in terrains
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_34openalex-snapshot
Convex polygons made from few lines and convex decompositions of polyhedra
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_1openalex-snapshot
Computing depth orders and related problems
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_55openalex-snapshot
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_64openalex-snapshot
Reporting red-blue intersections between two sets of connected line segments
inferred← citeshttps://doi.org/10.1007/3-540-63248-4_3openalex-snapshot
Approximation algorithms for covering polygons with squares and similar problems
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_47openalex-snapshot
Finding cores of limited length
inferred← citeshttps://doi.org/10.1007/978-1-4613-8997-2_26openalex-snapshot
An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space
inferred← citeshttps://doi.org/10.1007/978-3-030-68211-8_5openalex-snapshot
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights
inferred← citeshttps://doi.org/10.1007/978-3-031-49190-0_11openalex-snapshot
Sink Location Problems in Dynamic Flow Grid Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_31openalex-snapshot
Kinetic Maintenance of Mobile k-Centres on Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_63openalex-snapshot
Weak Visibility Queries of Line Segments in Simple Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_8openalex-snapshot
Geometric Transversal Theory
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/bf00127827openalex-snapshot
Dynamic computational geometry on meshes and hypercubes
inferred← citeshttps://doi.org/10.1007/bf01187019openalex-snapshot
Visibility with a moving point of view
inferred← citeshttps://doi.org/10.1007/bf01190509openalex-snapshot
Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
inferred← citeshttps://doi.org/10.1007/bf01191208openalex-snapshot
On the deque conjecture for the splay algorithm
inferred← citeshttps://doi.org/10.1007/bf01200429openalex-snapshot
Randomized range-maxima in nearly-constant parallel time
inferred← citeshttps://doi.org/10.1007/bf01258293openalex-snapshot
Robot motion planning and the single cell problem in arrangements
inferred← citeshttps://doi.org/10.1007/bf01302967openalex-snapshot
Generalized Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1007/bf01530889openalex-snapshot
Coordinated motion planning for two independent robots
inferred← citeshttps://doi.org/10.1007/bf01758833openalex-snapshot
Finding effective “force targets” for two-dimensional, multifinger frictional grips
inferred← citeshttps://doi.org/10.1007/bf01758855openalex-snapshot
Minimum-link paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf01840405openalex-snapshot
An optimal algorithm for the boundary of a cell in a union of rays
inferred← citeshttps://doi.org/10.1007/bf02122559openalex-snapshot
Improved lower bounds on the length of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1007/bf02123007openalex-snapshot
Triangles in space or building (and analyzing) castles in the air
inferred← citeshttps://doi.org/10.1007/bf02187732openalex-snapshot
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
inferred← citeshttps://doi.org/10.1007/bf02187733openalex-snapshot
The upper envelope of piecewise linear functions: Algorithms and applications
inferred← citeshttps://doi.org/10.1007/bf02187734openalex-snapshot
The upper envelope of piecewise linear functions: Tight bounds on the number of faces
inferred← citeshttps://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferred← citeshttps://doi.org/10.1007/bf02187745openalex-snapshot
On arrangements of Jordan arcs with three intersections per pair
inferred← citeshttps://doi.org/10.1007/bf02187778openalex-snapshot
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
inferred← citeshttps://doi.org/10.1007/bf02187779openalex-snapshot
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
inferred← citeshttps://doi.org/10.1007/bf02187783openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and spheres
inferred← citeshttps://doi.org/10.1007/bf02187784openalex-snapshot
The complexity and construction of many faces in arrangements of lines and of segments
inferred← citeshttps://doi.org/10.1007/bf02187806openalex-snapshot
Efficient binary space partitions for hidden-surface removal and solid modeling
inferred← citeshttps://doi.org/10.1007/bf02187883openalex-snapshot
On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
inferred← citeshttps://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferred← citeshttps://doi.org/10.1007/bf02187902openalex-snapshot
Separating two simple polygons by a sequence of translations
inferred← citeshttps://doi.org/10.1007/bf02189323openalex-snapshot
The upper envelope of voronoi surfaces and its applications
inferred← citeshttps://doi.org/10.1007/bf02570714openalex-snapshot
Almost tight upper bounds for the single cell and zone problems in three dimensions
inferred← citeshttps://doi.org/10.1007/bf02574035openalex-snapshot
On minimum and maximum spanning trees of linearly moving points
inferred← citeshttps://doi.org/10.1007/bf02574043openalex-snapshot
Arrangements of segments that share endpoints: Single face results
inferred← citeshttps://doi.org/10.1007/bf02574383openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferred← citeshttps://doi.org/10.1007/bf02574384openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1007/bf02574706openalex-snapshot
Onk-sets in arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1007/bf02579209openalex-snapshot
Almost linear upper bounds on the length of general davenport—schinzel sequences
inferred← citeshttps://doi.org/10.1007/bf02712873openalex-snapshot
Optimal output-sensitive convex hull algorithms in two and three dimensions
inferred← citeshttps://doi.org/10.1007/bf02712877openalex-snapshot
A new technique for analyzing substructures in arrangements of piecewise linear surfaces
inferred← citeshttps://doi.org/10.1007/bf02716576openalex-snapshot
The overlay of lower envelopes and its applications
inferred← citeshttps://doi.org/10.1007/bf02716578openalex-snapshot
Vertical decompositions for triangles in 3-space
inferred← citeshttps://doi.org/10.1007/bf02770875openalex-snapshot
On critical orientations in the kedem-sharir motion planning algorithm
inferred← citeshttps://doi.org/10.1007/bfb0015935openalex-snapshot
Postorder hierarchy for path compressions and set union
inferred← citeshttps://doi.org/10.1007/bfb0028974openalex-snapshot
On the boundary of a union of Rays
inferred← citeshttps://doi.org/10.1007/bfb0035760openalex-snapshot
A singly-exponential stratification scheme for real semi-algebraic varieties and its applications
inferred← citeshttps://doi.org/10.1007/bfb0036193openalex-snapshot
A linear-time heuristic for minimum rectangular coverings (Extended abstract)
inferred← citeshttps://doi.org/10.1007/pl00009193openalex-snapshot
Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space
inferred← citeshttps://doi.org/10.1007/pl00009319openalex-snapshot
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces
inferred← citeshttps://doi.org/10.1007/pl00009396openalex-snapshot
Geometric Lower Bounds for Parametric Matroid Optimization
inferred← citeshttps://doi.org/10.1007/s00453-025-01368-yopenalex-snapshot
The Voronoi Diagram of Rotating Rays with Applications to Floodlight Illumination
inferred← citeshttps://doi.org/10.1007/s00454-009-9177-zopenalex-snapshot
On Approximate Range Counting and Depth
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/s00493-025-00187-7openalex-snapshot
A Refutation of the Pach-Tardos Conjecture for 0–1 Matrices
inferred← citeshttps://doi.org/10.1007/s00778-010-0186-6openalex-snapshot
Top-k queries on temporal data
inferred← citeshttps://doi.org/10.1007/s10878-024-01199-7openalex-snapshot
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90053-7openalex-snapshot
A survey of motion planning and related geometric algorithms
inferred← citeshttps://doi.org/10.1016/0010-4485(89)90125-5openalex-snapshot
Geometric computing and uniform grid technique
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90316-8openalex-snapshot
Davenport-Schinzel theory of matrices
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90677-8openalex-snapshot
Generalized Davenport-Schinzel sequences with linear upper bound
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00188-3openalex-snapshot
Extremal functions for sequences
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90042-2openalex-snapshot
A note on the papadimitriou-silverberg algorithm for planning optimal piecewise-linear motion of a ladder
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90136-1openalex-snapshot
Finding the upper envelope of n line segments in O(n log n) time
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90193-2openalex-snapshot
Common intersections of polygons
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90204-9openalex-snapshot
Voronoi diagrams of rigidly moving sets of points
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90060-4openalex-snapshot
Testing string superprimitivity in parallel
inferred← citeshttps://doi.org/10.1016/0097-3165(88)90055-6openalex-snapshot
A simplified construction of nonlinear Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1016/0097-3165(89)90032-0openalex-snapshot
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90115-5openalex-snapshot
A linear upper bound in extremal theory of sequences
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0137-nopenalex-snapshot
Almost fully-parallel parentheses matching
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90005-wopenalex-snapshot
Superlinear bounds for matrix searching problems
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90261-yopenalex-snapshot
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00021-hopenalex-snapshot
Compaction and separation algorithms for non-convex polygons and their applications
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90027-popenalex-snapshot
Upper envelope onion peeling
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90001-mopenalex-snapshot
A convex polygon among polygonal obstacles: placement and high-clearance motion
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90018-2openalex-snapshot
On the union of fat wedges and separating a collection of segments by a line
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90011-6openalex-snapshot
External polygon containment problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00005-8openalex-snapshot
Computing depth orders for fat objects and related problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00008-9openalex-snapshot
Generalized hidden surface removal
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50012-6openalex-snapshot
Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50013-8openalex-snapshot
Algorithmic Motion Planning in Robotics
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/j.cad.2004.09.018openalex-snapshot
Precise global collision detection in multi-axis NC-machining
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.02.001openalex-snapshot
Weak visibility queries of line segments in simple polygons
inferred← citeshttps://doi.org/10.1016/j.disc.2011.06.020openalex-snapshot
Degrees of nonlinearity in forbidden 0–1 matrix problems
inferred← citeshttps://doi.org/10.1016/j.disc.2017.02.022openalex-snapshot
On the zone of a circle in an arrangement of lines
inferred← citeshttps://doi.org/10.1016/j.disc.2018.03.023openalex-snapshot
Lower bounds on Davenport–Schinzel sequences via rectangular Zarankiewicz matrices
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.05.004openalex-snapshot
An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100848openalex-snapshot
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.05.001openalex-snapshot
Extremal problems for ordered (hyper)graphs: applications of Davenport–Schinzel sequences
inferred← citeshttps://doi.org/10.1016/j.endm.2015.06.032openalex-snapshot
On the zone of a circle in an arrangement of lines
inferred← citeshttps://doi.org/10.1016/j.ic.2008.04.004openalex-snapshot
Finding the conditional location of a median path on a tree
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.02.011openalex-snapshot
Generalized Davenport–Schinzel sequences and their 0–1 matrix counterparts
inferred← citeshttps://doi.org/10.1016/j.jcta.2012.04.004openalex-snapshot
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.12.006openalex-snapshot
Turán problems for edge-ordered graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114812openalex-snapshot
Sink location problems in dynamic flow grid networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116230openalex-snapshot
Sink location problems in dynamic flow networks
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00189-6openalex-snapshot
Combinatorial aspects of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00164-7openalex-snapshot
On numbers of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00255-6openalex-snapshot
Extremal problems for colored trees and Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80067-4openalex-snapshot
An efficient algorithm for hidden surface removal, II
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00608-2openalex-snapshot
Remarks on the computation of the horizon of a digital terrain
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00229-6openalex-snapshot
On determining optimal strategies in pursuit games in the plane
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00313-1openalex-snapshot
The maximum absolute deviation measure in location problems on networks
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(96)00027-2openalex-snapshot
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00024-2openalex-snapshot
Erased arrangements of lines and convex decompositions of polyhedra
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00030-8openalex-snapshot
Combinatorial complexity of translating a box in polyhedral 3-space
inferred← citeshttps://doi.org/10.1051/ita/1992260503871openalex-snapshot
Enumerating Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1080/00029890.1989.11972221openalex-snapshot
Algorithms in Combinatorial Geometry. By Herbert Edelsbrunner
inferred← citeshttps://doi.org/10.1080/00029890.1990.11995657openalex-snapshot
A Whirlwind Tour of Computational Geometry
inferred← citeshttps://doi.org/10.1080/02331934.2021.1939699openalex-snapshot
An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
inferred← citeshttps://doi.org/10.1080/02693799608902096openalex-snapshot
Representing the visibility structure of a polyhedral terrain through a horizon map
inferred← citeshttps://doi.org/10.1090/dimacs/006/03openalex-snapshot
Horizon theorems for lines and polygons
inferred← citeshttps://doi.org/10.1090/dimacs/049/11openalex-snapshot
On the maximum lengths of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/71.980023openalex-snapshot
On computing the upper envelope of segments in parallel
inferred← citeshttps://doi.org/10.1109/iccitechn.2010.5723878openalex-snapshot
Kinetisation of view of 3D point set
inferred← citeshttps://doi.org/10.1109/icpp.1998.708493openalex-snapshot
On computing the upper envelope of segments in parallel
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218529openalex-snapshot
Fast optimal nonconcave resource allocation
inferred← citeshttps://doi.org/10.1109/robot.1987.1087897openalex-snapshot
Efficient algorithms for planning purely translational collision-free motion in two and three dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1986.43openalex-snapshot
Planar realizations of nonlinear Davenport-Schinzel sequences by segments
inferred← citeshttps://doi.org/10.1109/sfcs.1987.44openalex-snapshot
On the lower envelope of bivariate functions and its applications
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21973openalex-snapshot
Combinatorial complexity bounds for arrangements of curves and surfaces
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63478openalex-snapshot
Recursive *-tree parallel data-structure
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185347openalex-snapshot
Fat triangles determine linearly many holes (computational geometry)
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185439openalex-snapshot
Using approximation algorithms to design parallel algorithms that may ignore processor allocation
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267750openalex-snapshot
On minimum and maximum spanning trees of linearly moving points
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267820openalex-snapshot
Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366837openalex-snapshot
Almost tight upper bounds for lower envelopes in higher dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366849openalex-snapshot
Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181892openalex-snapshot
An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem
inferred← citeshttps://doi.org/10.1137/0219020openalex-snapshot
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
inferred← citeshttps://doi.org/10.1137/0219060openalex-snapshot
Postorder Disjoint Set Union is Linear
inferred← citeshttps://doi.org/10.1137/0220010openalex-snapshot
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
inferred← citeshttps://doi.org/10.1137/0222017openalex-snapshot
Recursive Star-Tree Parallel Data Structure
inferred← citeshttps://doi.org/10.1137/0401038openalex-snapshot
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
inferred← citeshttps://doi.org/10.1137/080735862openalex-snapshot
Origins of Nonlinearity in Davenport–Schinzel Sequences
inferred← citeshttps://doi.org/10.1137/1.9781611976465.88openalex-snapshot
(Near-)Linear-Time Randomized Algorithms for Row Minima in Monge Partial Matrices and Related Problems
inferred← citeshttps://doi.org/10.1137/1.9781611977912.45openalex-snapshot
On the Extremal Functions of Acyclic Forbidden 0-1 Matrices
inferred← citeshttps://doi.org/10.1137/140968574openalex-snapshot
Three Generalizations of Davenport--Schinzel Sequences
inferred← citeshttps://doi.org/10.1137/s009753979018330xopenalex-snapshot
Fat Triangles Determine Linearly Many Holes
inferred← citeshttps://doi.org/10.1137/s0097539792242144openalex-snapshot
Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
inferred← citeshttps://doi.org/10.1137/s0097539795295936openalex-snapshot
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
inferred← citeshttps://doi.org/10.1142/s0218195902000943openalex-snapshot
PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS
inferred← citeshttps://doi.org/10.1142/s0218195905001749openalex-snapshot
CONTINUOUS PATH VERIFICATION IN MULTI-AXIS NC-MACHINING
inferred← citeshttps://doi.org/10.1142/s0218195998000187openalex-snapshot
Voronoi Diagrams of Moving Points
inferred← citeshttps://doi.org/10.1145/103418.103471openalex-snapshot
Hidden surface removal with respect to a moving view point
inferred← citeshttps://doi.org/10.1145/10515.10537openalex-snapshot
On shortest paths amidst convex polyhedra
inferred← citeshttps://doi.org/10.1145/109648.109668openalex-snapshot
Extremal polygon containment problems
inferred← citeshttps://doi.org/10.1145/109648.109670openalex-snapshot
The upper envelope of Voronoi surfaces and its applications
inferred← citeshttps://doi.org/10.1145/109648.109684openalex-snapshot
Arrangements of segments that share endpoints
inferred← citeshttps://doi.org/10.1145/116873.116878openalex-snapshot
Data structures and algorithms for disjoint set union problems
inferred← citeshttps://doi.org/10.1145/1247069.1247129openalex-snapshot
On approximate range counting and depth
inferred← citeshttps://doi.org/10.1145/142675.142700openalex-snapshot
On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane
inferred← citeshttps://doi.org/10.1145/160985.160987openalex-snapshot
Generalized hidden surface removal
inferred← citeshttps://doi.org/10.1145/160985.160989openalex-snapshot
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
inferred← citeshttps://doi.org/10.1145/160985.160992openalex-snapshot
Combinatorial complexity of translating a box in polyhedral 3-space
inferred← citeshttps://doi.org/10.1145/160985.161154openalex-snapshot
Scalable parallel geometric algorithms for coarse grained multicomputers
inferred← citeshttps://doi.org/10.1145/1706591.1706597openalex-snapshot
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
showing the first 200 of 241 · page through all 241
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.