Recognition and Isomorphism of Two Dimensional Partial Orders. - Jeremy P. Spinrad; Jacobo Valdes (ICALP, 1983)

Transitive Orientation in O(n²) Time - Jeremy P. Spinrad (STOC, 1983)

Worst case analysis of a graph coloring algorithm. - Jeremy P. Spinrad; Gopalakrishnan Vijayan (Discret. Appl. Math., 1985)

On Comparability and Permutation Graphs. - Jeremy P. Spinrad (SIAM J. Comput., 1985)

The minimum dummy task problem. - Jeremy P. Spinrad (Networks, 1986)

Bipartite permutation graphs. - Jeremy P. Spinrad; Andreas Brandstädt; Lorna Stewart (Discret. Appl. Math., 1987)

An improved edge bound on the interval number of a graph. - Jeremy P. Spinrad; Gopalakrishnan Vijayan; Douglas B. West (J. Graph Theory, 1987)

Circular-arc graphs with clique cover number two. - Jeremy P. Spinrad (J. Comb. Theory B, 1988)

Incremental modular decomposition. - John H. Muller; Jeremy P. Spinrad (J. ACM, 1989)

Prime Testing for the Split Decomposition of a Graph. - Jeremy P. Spinrad (SIAM J. Discret. Math., 1989)

Split Decomposition of Undirected Graphs. - Tze-Heng Ma; Jeremy P. Spinrad (SODA, 1990)

Avoiding Matrix Multiplication. - Tze-Heng Ma; Jeremy P. Spinrad (WG, 1990)

An O(n2) Time Algorithm for the 2-Chain Cover Problem and Related Problems. - Tze-Heng Ma; Jeremy P. Spinrad (SODA, 1991)

Finding Large Holes. - Jeremy P. Spinrad (Inf. Process. Lett., 1991)

Note on recognition of matroid systems. - Jeremy P. Spinrad (Oper. Res. Lett., 1991)

P4-Trees and Substitution Decomposition. - Jeremy P. Spinrad (Discret. Appl. Math., 1992)

An O(n2) Algorithm for Circular-Arc Graph Recognition. - Elaine M. Eschen; Jeremy P. Spinrad (SODA, 1993)

Doubly Lexical Ordering of Dense 0 - 1 Matrices. - Jeremy P. Spinrad (Inf. Process. Lett., 1993)

Dimension and Algorithms. - Jeremy P. Spinrad (ORDAL, 1994)

Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. - Ross M. McConnell; Jeremy P. Spinrad (SODA, 1994)

An O(n²) Algorithm for Undirected Split Decompositon. - Tze-Heng Ma; Jeremy P. Spinrad (J. Algorithms, 1994)

On the 2-Chain Subgraph Cover and Related Problems. - Tze-Heng Ma; Jeremy P. Spinrad (J. Algorithms, 1994)

Recognition of Circle Graphs. - Jeremy P. Spinrad (J. Algorithms, 1994)

A Linear Algorithm To Decompose Inheritance Graphs Into Modules. - Michel Habib; Marianne Huchard; Jeremy P. Spinrad (Algorithmica, 1995)

Algorithms for Weakly Triangulated Graphs. - Jeremy P. Spinrad; R. Sritharan (Discret. Appl. Math., 1995)

A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. - Ortrud Oellermann; Jeremy P. Spinrad (Inf. Process. Lett., 1995)

Independent Sets in Circular-Arc Graphs. - Wen-Lian Hsu; Jeremy P. Spinrad (J. Algorithms, 1995)

Nonredundant 1's in Gamma-Free Matrices. - Jeremy P. Spinrad (SIAM J. Discret. Math., 1995)

Linear-Time Transitive Orientation. - Ross M. McConnell; Jeremy P. Spinrad (SODA, 1997)

Visibility Graphs of Towers. - Paul Colley; Anna Lubiw; Jeremy P. Spinrad (Comput. Geom., 1997)

On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. - Ton Kloks; Dieter Kratsch; Jeremy P. Spinrad (Theor. Comput. Sci., 1997)

Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time. - Richard B. Borie; Jeremy P. Spinrad (Discret. Appl. Math., 1999)

Modular decomposition and transitive orientation. - Ross M. McConnell; Jeremy P. Spinrad (Discret. Math., 1999)

Weakly Triangulated Comparability Graphs. - Elaine M. Eschen; Ryan Hayward; Jeremy P. Spinrad; R. Sritharan (SIAM J. Comput., 1999)

Weakly chordal graph algorithms via handles. - Ryan Hayward; Jeremy P. Spinrad; R. Sritharan (SODA, 2000)

Ordered Vertex Partitioning. - Ross M. McConnell; Jeremy P. Spinrad (Discret. Math. Theor. Comput. Sci., 2000)

Solving Problems on Special Classes of Graphs. - Vijay Raghavan 002; Jeremy P. Spinrad (Electron. Notes Discret. Math., 2000)

A polynomial time recognition algorithm for probe interval graphs. - Julie L. Johnson; Jeremy P. Spinrad (SODA, 2001)

Domination graphs: examples and counterexamples. - Irena Rusu; Jeremy P. Spinrad (Discret. Appl. Math., 2001)

Construction of probe interval models. - Ross M. McConnell; Jeremy P. Spinrad (SODA, 2002)

Forbidden subgraph decomposition. - Irena Rusu; Jeremy P. Spinrad (Discret. Math., 2002)

Efficient graph representations. - Jeremy P. Spinrad (American Mathematical Society, 2003)

Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. - Hans L. Bodlaender; Andreas Brandstädt; Dieter Kratsch; Michaël Rao; Jeremy P. Spinrad (FCT, 2003)

Between O(nm) and O(n alpha). - Dieter Kratsch; Jeremy P. Spinrad (SODA, 2003)

Recognition of Some Perfectly Orderable Graph Classes. - Elaine M. Eschen; Julie L. Johnson; Jeremy P. Spinrad; R. Sritharan (Discret. Appl. Math., 2003)

From a simple elimination ordering to a strong elimination ordering in linear time. - Joe Sawada; Jeremy P. Spinrad (Inf. Process. Lett., 2003)

Robust algorithms for restricted domains. - Vijay Raghavan 002; Jeremy P. Spinrad (J. Algorithms, 2003)

Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. - Stefan Felsner; Vijay Raghavan 002; Jeremy P. Spinrad (Order, 2003)

Scalar aggregation in inconsistent databases. - Marcelo Arenas; Leopoldo E. Bertossi; Jan Chomicki; Xin He; Vijay Raghavan 002; Jeremy P. Spinrad (Theor. Comput. Sci., 2003)

04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes. - Andreas Brandstädt; Derek G. Corneil; Klaus Jansen; Jeremy P. Spinrad (Robust and Approximative Algorithms an Particular Graph Classes, 2004)

Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. - Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Vinícius G. P. de Sá; Jeremy P. Spinrad (WEA, 2004)

Recognizing quasi-triangulated graphs. - Jeremy P. Spinrad (Discret. Appl. Math., 2004)

Consequences of an algorithm for bridged graphs. - Van Bang Le; Jeremy P. Spinrad (Discret. Math., 2004)

A note on computing graph closures. - Jeremy P. Spinrad (Discret. Math., 2004)

Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. - Anne Berry; Marianne Huchard; Ross M. McConnell; Alain Sigayret; Jeremy P. Spinrad (ICFCA, 2005)

Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. - Anne Berry; Alain Sigayret; Jeremy P. Spinrad (WG, 2005)

On algorithms for (P5, gem)-free graphs. - Hans L. Bodlaender; Andreas Brandstädt; Dieter Kratsch; Michaël Rao; Jeremy P. Spinrad (Theor. Comput. Sci., 2005)

Very Fast Instances for Concept Generation. - Anne Berry; Ross M. McConnell; Alain Sigayret; Jeremy P. Spinrad (ICFCA, 2006)

Algorithms for the Homogeneous Set Sandwich Problem. - Celina M. H. de Figueiredo; Guilherme Dias da Fonseca; Vinícius G. P. de Sá; Jeremy P. Spinrad (Algorithmica, 2006)

Minimal fill in O(n2.69) time. - Dieter Kratsch; Jeremy P. Spinrad (Discret. Math., 2006)

Finding Triangles in Restricted Classes of Graphs. - Elaine M. Eschen; Jeremy P. Spinrad (Electron. Notes Discret. Math., 2006)

Polynomial time recognition of unit circular-arc graphs. - Guillermo Durán; Agustín Gravano; Ross M. McConnell; Jeremy P. Spinrad; Alan Tucker (J. Algorithms, 2006)

Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. - Dieter Kratsch; Ross M. McConnell; Kurt Mehlhorn; Jeremy P. Spinrad (SIAM J. Comput., 2006)

Between O(nm) and O(nalpha). - Dieter Kratsch; Jeremy P. Spinrad (SIAM J. Comput., 2006)

07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. - Andreas Brandstädt; Klaus Jansen; Dieter Kratsch; Jeremy P. Spinrad (Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 2007)

Improved algorithms for weakly chordal graphs. - Ryan B. Hayward; Jeremy P. Spinrad; R. Sritharan (ACM Trans. Algorithms, 2007)

A new characterization of HH-free graphs. - Dieter Kratsch; Jeremy P. Spinrad; R. Sritharan (Discret. Math., 2008)

On graphs without a C4 or a diamond - Elaine M. Eschen; Chính T. Hoàng; Jeremy P. Spinrad; R. Sritharan (CoRR, 2009)

Linear-Time Recognition of Helly Circular-Arc Models and Graphs. - Benson L. Joeris; Min Chih Lin; Ross M. McConnell; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Algorithmica, 2011)

On graphs without a C4 or a diamond. - Elaine M. Eschen; Chính T. Hoàng; Jeremy P. Spinrad; R. Sritharan (Discret. Appl. Math., 2011)

Finding a Sun in Building-Free Graphs. - Elaine M. Eschen; Chính T. Hoàng; Jeremy P. Spinrad; R. Sritharan (Graphs Comb., 2012)

Isomorphism of graph classes related to the circular-ones property. - Andrew R. Curtis; Min Chih Lin; Ross M. McConnell; Yahav Nussbaum; Francisco J. Soulignac; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Discret. Math. Theor. Comput. Sci., 2013)

Recognizing Threshold Tolerance Graphs in O(n2) Time. - Petr A. Golovach; Pinar Heggernes; Nathan Lindzey; Ross M. McConnell; Vinícius Fernandes dos Santos; Jeremy P. Spinrad (WG, 2014)

Double Threshold Digraphs. - Peter Hamburger; Ross M. McConnell; Attila Pór; Jeremy P. Spinrad (CoRR, 2017)

On recognition of threshold tolerance graphs and their complements. - Petr A. Golovach; Pinar Heggernes; Nathan Lindzey; Ross M. McConnell; Vinícius Fernandes dos Santos; Jeremy P. Spinrad; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2017)

Double Threshold Digraphs. - Peter Hamburger; Ross M. McConnell; Attila Pór; Jeremy P. Spinrad; Zhisheng Xu (MFCS, 2018)

Interval-Permutation Segment Graphs. - Zlatko Joveski; Jeremy P. Spinrad (CoRR, 2019)

Verification of a certificate for weakly chordal graphs. - Jeremy P. Spinrad; R. Sritharan (Discret. Appl. Math., 2025)