On the public citation graph

Origins of Nonlinearity in Davenport–Schinzel Sequences

https://doi.org/10.1137/080735862
0 signed · 44 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jagm.1996.0815openalex-snapshot
Linearity and Unprovability of Set Union Problem Strategies
inferredcites →https://doi.org/10.1007/3-540-63938-1_63openalex-snapshot
Graph drawing with no k pairwise crossing edges
inferredcites →https://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferredcites →https://doi.org/10.1007/978-3-662-04166-6_22openalex-snapshot
The Füredi-Hajnal Conjecture Implies the Stanley-Wilf Conjecture
inferredcites →https://doi.org/10.1007/bf01302967openalex-snapshot
Generalized Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1007/bf01840359openalex-snapshot
Geometric applications of a matrix-searching algorithm
inferredcites →https://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1007/bf02711511openalex-snapshot
A near-linear algorithm for the planar segment-center problem
inferredcites →https://doi.org/10.1007/bf02773960openalex-snapshot
Forbidden paths and cycles in ordered graphs and matrices
inferredcites →https://doi.org/10.1007/s00493-003-0017-0openalex-snapshot
Davenport–Schinzel Trees*
inferredcites →https://doi.org/10.1016/0012-365x(92)90316-8openalex-snapshot
Davenport-Schinzel theory of matrices
inferredcites →https://doi.org/10.1016/0012-365x(92)90677-8openalex-snapshot
Generalized Davenport-Schinzel sequences with linear upper bound
inferredcites →https://doi.org/10.1016/0012-365x(92)90686-aopenalex-snapshot
Unprovable combinatorial statements
inferredcites →https://doi.org/10.1016/0097-3165(89)90032-0openalex-snapshot
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
inferredcites →https://doi.org/10.1016/0097-3165(90)90074-7openalex-snapshot
The maximum number of unit distances in a convex n-gon
inferredcites →https://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot
Perspectives of Monge properties in optimization
inferredcites →https://doi.org/10.1016/0196-6774(92)90005-wopenalex-snapshot
Superlinear bounds for matrix searching problems
inferredcites →https://doi.org/10.1016/j.jcta.2004.04.002openalex-snapshot
Excluded permutation matrices and the Stanley–Wilf conjecture
inferredcites →https://doi.org/10.1016/j.jcta.2004.11.015openalex-snapshot
On 0–1 matrices and small excluded submatrices
inferredcites →https://doi.org/10.1016/j.jcta.2008.05.006openalex-snapshot
On linear forbidden submatrices
inferredcites →https://doi.org/10.1016/j.jcta.2009.03.004openalex-snapshot
Extremal functions of forbidden double permutation matrices
inferredcites →https://doi.org/10.1137/0220029openalex-snapshot
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
inferredcites →https://doi.org/10.1137/0403009openalex-snapshot
An Almost Linear Time Algorithm for Generalized Matrix Searching
inferredcites →https://doi.org/10.1137/0404002openalex-snapshot
An Extremal Problem on Sparse 0-1 Matrices
inferredcites →https://doi.org/10.1145/1064092.1064096openalex-snapshot
Forbidden patterns and unit distances
inferredcites →https://doi.org/10.1145/1455248.1455252openalex-snapshot
Weak ε-nets and interval chains
inferredcites →https://doi.org/10.1145/1706591.1706597openalex-snapshot
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
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/2373068openalex-snapshot
A Combinatorial Problem Connected with Differential Equations
inferredcites →https://doi.org/10.48550/arxiv.0707.2160openalex-snapshot
Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture
inferredcites →https://doi.org/10.5555/314464.314482openalex-snapshot
A near-linear algorithm for the planar segment center problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

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.endm.2015.06.032openalex-snapshot
On the zone of a circle in an arrangement of lines
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.1137/140968574openalex-snapshot
Three Generalizations of Davenport--Schinzel Sequences
inferred← citeshttps://doi.org/10.1145/1998196.1998258openalex-snapshot
On the structure and composition of forbidden sequences, with geometric applications
inferred← citeshttps://doi.org/10.1145/2462356.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/2493132.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/2794075openalex-snapshot
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5709openalex-snapshot
Three Generalizations of Davenport-Schinzel Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1503.03462openalex-snapshot
On the zone of a circle in an arrangement of lines
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.