Jeremy P. Spinrad

Publication Activity (10 Years)

Years Active: 1983-2019
Publications (10 Years): 4

Top Topics

Subgraph Isomorphism

Equivalence Classes

Thresholding Algorithm

Threshold Selection

Top Venues

Discret. Appl. Math.

Discret. Math. Theor. Comput. Sci.

Publications

Zlatko Joveski, Jeremy P. Spinrad
Interval-Permutation Segment Graphs. CoRR (2019)
Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu
Double Threshold Digraphs. MFCS (2018)
Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
On recognition of threshold tolerance graphs and their complements. Discret. Appl. Math. 216 (2017)
Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad
Double Threshold Digraphs. CoRR (2017)
Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
) Time. WG (2014)
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
Isomorphism of graph classes related to the circular-ones property. Discret. Math. Theor. Comput. Sci. 15 (1) (2013)
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
Isomorphism of graph classes related to the circular-ones property CoRR (2012)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
Finding a Sun in Building-Free Graphs. Graphs Comb. 28 (3) (2012)
Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica 59 (2) (2011)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
or a diamond. Discret. Appl. Math. 159 (7) (2011)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
On graphs without a C4 or a diamond CoRR (2009)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
Finding a sun in building-free graphs CoRR (2009)
Dieter Kratsch, Jeremy P. Spinrad, R. Sritharan
A new characterization of HH-free graphs. Discret. Math. 308 (20) (2008)
Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes (2007)
Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan
Improved algorithms for weakly chordal graphs. ACM Trans. Algorithms 3 (2) (2007)
Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36 (2) (2006)
Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy P. Spinrad, Alan Tucker
Polynomial time recognition of unit circular-arc graphs. J. Algorithms 58 (1) (2006)
Elaine M. Eschen, Jeremy P. Spinrad
Finding Triangles in Restricted Classes of Graphs. Electron. Notes Discret. Math. 27 (2006)
Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
Very Fast Instances for Concept Generation. ICFCA (2006)
Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad
Algorithms for the Homogeneous Set Sandwich Problem. Algorithmica 46 (2) (2006)
Dieter Kratsch, Jeremy P. Spinrad
). SIAM J. Comput. 36 (2) (2006)
Dieter Kratsch, Jeremy P. Spinrad
) time. Discret. Math. 306 (3) (2006)
Anne Berry, Alain Sigayret, Jeremy P. Spinrad
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. WG (2005)
Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. ICFCA (2005)
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
, gem)-free graphs. Theor. Comput. Sci. 349 (1) (2005)
Jeremy P. Spinrad
A note on computing graph closures. Discret. Math. 276 (1-3) (2004)
Celina M. H. de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy P. Spinrad
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. WEA (2004)
Van Bang Le, Jeremy P. Spinrad
Consequences of an algorithm for bridged graphs. Discret. Math. 280 (1-3) (2004)
Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad
04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes. Robust and Approximative Algorithms an Particular Graph Classes (2004)
Jeremy P. Spinrad
Recognizing quasi-triangulated graphs. Discret. Appl. Math. 138 (1-2) (2004)
Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
, Gem)-Free Graphs. FCT (2003)
Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
Certifying algorithms for recognizing interval graphs and permutation graphs. SODA (2003)
Dieter Kratsch, Jeremy P. Spinrad
Between O(nm) and O(n alpha). SODA (2003)
Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan
Recognition of Some Perfectly Orderable Graph Classes. Discret. Appl. Math. 128 (2-3) (2003)
Joe Sawada, Jeremy P. Spinrad
From a simple elimination ordering to a strong elimination ordering in linear time. Inf. Process. Lett. 86 (6) (2003)
Vijay Raghavan, Jeremy P. Spinrad
Robust algorithms for restricted domains. J. Algorithms 48 (1) (2003)
Stefan Felsner, Vijay Raghavan, Jeremy P. Spinrad
Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. Order 20 (4) (2003)
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, Jeremy P. Spinrad
Scalar aggregation in inconsistent databases. Theor. Comput. Sci. 296 (3) (2003)
Ross M. McConnell, Jeremy P. Spinrad
Construction of probe interval models. SODA (2002)
Irena Rusu, Jeremy P. Spinrad
Forbidden subgraph decomposition. Discret. Math. 247 (1-3) (2002)
Vijay Raghavan, Jeremy P. Spinrad
Robust algorithms for restricted domains. SODA (2001)
Julie L. Johnson, Jeremy P. Spinrad
A polynomial time recognition algorithm for probe interval graphs. SODA (2001)
Irena Rusu, Jeremy P. Spinrad
Domination graphs: examples and counterexamples. Discret. Appl. Math. 110 (2-3) (2001)
Ryan Hayward, Jeremy P. Spinrad, R. Sritharan
Weakly chordal graph algorithms via handles. SODA (2000)
Vijay Raghavan, Jeremy P. Spinrad
Solving Problems on Special Classes of Graphs. Electron. Notes Discret. Math. 5 (2000)
Ross M. McConnell, Jeremy P. Spinrad
Ordered Vertex Partitioning. Discret. Math. Theor. Comput. Sci. 4 (1) (2000)
Elaine M. Eschen, Ryan Hayward, Jeremy P. Spinrad, R. Sritharan
Weakly Triangulated Comparability Graphs. SIAM J. Comput. 29 (2) (1999)
Richard B. Borie, Jeremy P. Spinrad
Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time. Discret. Appl. Math. 91 (1-3) (1999)
Ross M. McConnell, Jeremy P. Spinrad
Modular decomposition and transitive orientation. Discret. Math. 201 (1-3) (1999)
Paul Colley, Anna Lubiw, Jeremy P. Spinrad
Visibility Graphs of Towers. Comput. Geom. 7 (1997)
Ton Kloks, Dieter Kratsch, Jeremy P. Spinrad
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. Theor. Comput. Sci. 175 (2) (1997)
Ross M. McConnell, Jeremy P. Spinrad
Linear-Time Transitive Orientation. SODA (1997)
Michel Habib, Marianne Huchard, Jeremy P. Spinrad
A Linear Algorithm To Decompose Inheritance Graphs Into Modules. Algorithmica 13 (6) (1995)
Jeremy P. Spinrad, R. Sritharan
Algorithms for Weakly Triangulated Graphs. Discret. Appl. Math. 59 (2) (1995)
Jeremy P. Spinrad
Nonredundant 1's in Gamma-Free Matrices. SIAM J. Discret. Math. 8 (2) (1995)
Ortrud Oellermann, Jeremy P. Spinrad
A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. Inf. Process. Lett. 55 (3) (1995)
Wen-Lian Hsu, Jeremy P. Spinrad
Independent Sets in Circular-Arc Graphs. J. Algorithms 19 (2) (1995)
Tze-Heng Ma, Jeremy P. Spinrad
On the 2-Chain Subgraph Cover and Related Problems. J. Algorithms 17 (2) (1994)
Jeremy P. Spinrad
Recognition of Circle Graphs. J. Algorithms 16 (2) (1994)
Tze-Heng Ma, Jeremy P. Spinrad
An O(n²) Algorithm for Undirected Split Decompositon. J. Algorithms 16 (1) (1994)
Jeremy P. Spinrad
Dimension and Algorithms. ORDAL (1994)
Ross M. McConnell, Jeremy P. Spinrad
Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. SODA (1994)
Jeremy P. Spinrad
Doubly Lexical Ordering of Dense 0 - 1 Matrices. Inf. Process. Lett. 45 (5) (1993)
Elaine M. Eschen, Jeremy P. Spinrad
) Algorithm for Circular-Arc Graph Recognition. SODA (1993)
Jeremy P. Spinrad
-Trees and Substitution Decomposition. Discret. Appl. Math. 39 (3) (1992)
Tze-Heng Ma, Jeremy P. Spinrad
) Time Algorithm for the 2-Chain Cover Problem and Related Problems. SODA (1991)
Jeremy P. Spinrad
Finding Large Holes. Inf. Process. Lett. 39 (4) (1991)
Tze-Heng Ma, Jeremy P. Spinrad
Split Decomposition of Undirected Graphs. SODA (1990)
Tze-Heng Ma, Jeremy P. Spinrad
Avoiding Matrix Multiplication. WG (1990)
Jeremy P. Spinrad
Prime Testing for the Split Decomposition of a Graph. SIAM J. Discret. Math. 2 (4) (1989)
John H. Muller, Jeremy P. Spinrad
Incremental modular decomposition. J. ACM 36 (1) (1989)
Jeremy P. Spinrad
Circular-arc graphs with clique cover number two. J. Comb. Theory, Ser. B 44 (3) (1988)
Jeremy P. Spinrad, Andreas Brandstädt, Lorna Stewart
Bipartite permutation graphs. Discret. Appl. Math. 18 (3) (1987)
Jeremy P. Spinrad, Gopalakrishnan Vijayan, Douglas B. West
An improved edge bound on the interval number of a graph. J. Graph Theory 11 (3) (1987)
Jeremy P. Spinrad
The minimum dummy task problem. Networks 16 (3) (1986)
Jeremy P. Spinrad, Gopalakrishnan Vijayan
Worst case analysis of a graph coloring algorithm. Discret. Appl. Math. 12 (1) (1985)
Jeremy P. Spinrad
On Comparability and Permutation Graphs. SIAM J. Comput. 14 (3) (1985)
Jeremy P. Spinrad
Transitive Orientation in O(n²) Time STOC (1983)
Jeremy P. Spinrad, Jacobo Valdes
Recognition and Isomorphism of Two Dimensional Partial Orders. ICALP (1983)