Jeremy P. Spinrad

Affiliations:
  • Vanderbilt University, Department of Electrical Engineering and Computer Science, Nashville, TN, USA


According to our database1, Jeremy P. Spinrad authored at least 77 papers between 1983 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Interval-Permutation Segment Graphs.
CoRR, 2019

2018
Double Threshold Digraphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
On recognition of threshold tolerance graphs and their complements.
Discret. Appl. Math., 2017

Double Threshold Digraphs.
CoRR, 2017

2014
Recognizing Threshold Tolerance Graphs in O(n<sup>2</sup>) Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013
Isomorphism of graph classes related to the circular-ones property.
Discret. Math. Theor. Comput. Sci., 2013

2012
Finding a Sun in Building-Free Graphs.
Graphs Comb., 2012

2011
On graphs without a C<sub>4</sub> or a diamond.
Discret. Appl. Math., 2011

Linear-Time Recognition of Helly Circular-Arc Models and Graphs.
Algorithmica, 2011

2009
On graphs without a C4 or a diamond
CoRR, 2009

2008
A new characterization of HH-free graphs.
Discret. Math., 2008

2007
Improved algorithms for weakly chordal graphs.
ACM Trans. Algorithms, 2007

07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes.
Proceedings of the Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05., 2007

2006
Between O(nm) and O(n<sup>alpha</sup>).
SIAM J. Comput., 2006

Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs.
SIAM J. Comput., 2006

Polynomial time recognition of unit circular-arc graphs.
J. Algorithms, 2006

Finding Triangles in Restricted Classes of Graphs.
Electron. Notes Discret. Math., 2006

Minimal fill in O(<i>n</i><sup>2.69</sup>) time.
Discret. Math., 2006

Algorithms for the Homogeneous Set Sandwich Problem.
Algorithmica, 2006

Very Fast Instances for Concept Generation.
Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

2005
On algorithms for (<i>P</i><sub>5</sub>, gem)-free graphs.
Theor. Comput. Sci., 2005

Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice.
Proceedings of the Formal Concept Analysis, Third International Conference, 2005

2004
A note on computing graph closures.
Discret. Math., 2004

Consequences of an algorithm for bridged graphs.
Discret. Math., 2004

Recognizing quasi-triangulated graphs.
Discret. Appl. Math., 2004

Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes.
Proceedings of the Robust and Approximative Algorithms an Particular Graph Classes, 23.05., 2004

2003
Scalar aggregation in inconsistent databases.
Theor. Comput. Sci., 2003

Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number.
Order, 2003

Robust algorithms for restricted domains.
J. Algorithms, 2003

From a simple elimination ordering to a strong elimination ordering in linear time.
Inf. Process. Lett., 2003

Recognition of Some Perfectly Orderable Graph Classes.
Discret. Appl. Math., 2003

Between O(nm) and O(n alpha).
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Linear Time Algorithms for Some NP-Complete Problems on (P<sub>5</sub>, Gem)-Free Graphs.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Efficient graph representations.
Fields Institute monographs 19, American Mathematical Society, ISBN: 978-0-8218-2815-1, 2003

2002
Forbidden subgraph decomposition.
Discret. Math., 2002

Construction of probe interval models.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Domination graphs: examples and counterexamples.
Discret. Appl. Math., 2001

A polynomial time recognition algorithm for probe interval graphs.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Solving Problems on Special Classes of Graphs.
Electron. Notes Discret. Math., 2000

Ordered Vertex Partitioning.
Discret. Math. Theor. Comput. Sci., 2000

Weakly chordal graph algorithms via handles.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Weakly Triangulated Comparability Graphs.
SIAM J. Comput., 1999

Modular decomposition and transitive orientation.
Discret. Math., 1999

Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time.
Discret. Appl. Math., 1999

1997
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs.
Theor. Comput. Sci., 1997

Visibility Graphs of Towers.
Comput. Geom., 1997

Linear-Time Transitive Orientation.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1995
Nonredundant 1's in Gamma-Free Matrices.
SIAM J. Discret. Math., 1995

Independent Sets in Circular-Arc Graphs.
J. Algorithms, 1995

A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary.
Inf. Process. Lett., 1995

Algorithms for Weakly Triangulated Graphs.
Discret. Appl. Math., 1995

A Linear Algorithm To Decompose Inheritance Graphs Into Modules.
Algorithmica, 1995

1994
Recognition of Circle Graphs.
J. Algorithms, 1994

On the 2-Chain Subgraph Cover and Related Problems.
J. Algorithms, 1994

An O(n²) Algorithm for Undirected Split Decompositon.
J. Algorithms, 1994

Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Dimension and Algorithms.
Proceedings of the Orders, 1994

1993
Doubly Lexical Ordering of Dense 0 - 1 Matrices.
Inf. Process. Lett., 1993

An O(n<sup>2</sup>) Algorithm for Circular-Arc Graph Recognition.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
<i>P</i><sub>4</sub>-Trees and Substitution Decomposition.
Discret. Appl. Math., 1992

1991
Note on recognition of matroid systems.
Oper. Res. Lett., 1991

Finding Large Holes.
Inf. Process. Lett., 1991

An O(n<sup>2</sup>) Time Algorithm for the 2-Chain Cover Problem and Related Problems.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
Avoiding Matrix Multiplication.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

Split Decomposition of Undirected Graphs.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
Prime Testing for the Split Decomposition of a Graph.
SIAM J. Discret. Math., 1989

Incremental modular decomposition.
J. ACM, 1989

1988
Circular-arc graphs with clique cover number two.
J. Comb. Theory B, 1988

1987
An improved edge bound on the interval number of a graph.
J. Graph Theory, 1987

Bipartite permutation graphs.
Discret. Appl. Math., 1987

1986
The minimum dummy task problem.
Networks, 1986

1985
On Comparability and Permutation Graphs.
SIAM J. Comput., 1985

Worst case analysis of a graph coloring algorithm.
Discret. Appl. Math., 1985

1983
Transitive Orientation in O(n²) Time
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Recognition and Isomorphism of Two Dimensional Partial Orders.
Proceedings of the Automata, 1983


  Loading...