Jeremy P. Spinrad

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