default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeremy P. Spinrad
Person information
- affiliation: Vanderbilt University, Department of Electrical Engineering and Computer Science, Nashville, TN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2003
[b1]Jeremy P. Spinrad:
Efficient graph representations. Fields Institute monographs 19, American Mathematical Society 2003, ISBN 978-0-8218-2815-1, pp. I-VIII, 1-342
Journal Articles
- 2017
- [j51]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: 171-180 (2017) - 2013
- [j50]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): 157-182 (2013) - 2012
- [j49]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
Finding a Sun in Building-Free Graphs. Graphs Comb. 28(3): 347-364 (2012) - 2011
- [j48]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): 215-239 (2011) - [j47]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
On graphs without a C4 or a diamond. Discret. Appl. Math. 159(7): 581-587 (2011) - 2008
- [j46]Dieter Kratsch, Jeremy P. Spinrad, R. Sritharan:
A new characterization of HH-free graphs. Discret. Math. 308(20): 4833-4835 (2008) - 2007
- [j45]Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan:
Improved algorithms for weakly chordal graphs. ACM Trans. Algorithms 3(2): 14 (2007) - 2006
- [j44]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): 149-180 (2006) - [j43]Dieter Kratsch, Jeremy P. Spinrad:
Minimal fill in O(n2.69) time. Discret. Math. 306(3): 366-371 (2006) - [j42]Elaine M. Eschen, Jeremy P. Spinrad:
Finding Triangles in Restricted Classes of Graphs. Electron. Notes Discret. Math. 27: 25-26 (2006) - [j41]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): 67-78 (2006) - [j40]Dieter Kratsch, Jeremy P. Spinrad:
Between O(nm) and O(nalpha). SIAM J. Comput. 36(2): 310-325 (2006) - [j39]Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad:
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36(2): 326-353 (2006) - 2005
- [j38]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
On algorithms for (P5, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005) - 2004
- [j37]Jeremy P. Spinrad:
Recognizing quasi-triangulated graphs. Discret. Appl. Math. 138(1-2): 203-213 (2004) - [j36]Jeremy P. Spinrad:
A note on computing graph closures. Discret. Math. 276(1-3): 327-329 (2004) - [j35]Van Bang Le, Jeremy P. Spinrad:
Consequences of an algorithm for bridged graphs. Discret. Math. 280(1-3): 271-274 (2004) - 2003
- [j34]Elaine M. Eschen, Julie L. Johnson, Jeremy P. Spinrad, R. Sritharan:
Recognition of Some Perfectly Orderable Graph Classes. Discret. Appl. Math. 128(2-3): 355-373 (2003) - [j33]Joe Sawada, Jeremy P. Spinrad:
From a simple elimination ordering to a strong elimination ordering in linear time. Inf. Process. Lett. 86(6): 299-302 (2003) - [j32]Vijay Raghavan, Jeremy P. Spinrad:
Robust algorithms for restricted domains. J. Algorithms 48(1): 160-172 (2003) - [j31]Stefan Felsner, Vijay Raghavan, Jeremy P. Spinrad:
Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. Order 20(4): 351-364 (2003) - [j30]Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, Jeremy P. Spinrad:
Scalar aggregation in inconsistent databases. Theor. Comput. Sci. 296(3): 405-434 (2003) - 2002
- [j29]Irena Rusu, Jeremy P. Spinrad:
Forbidden subgraph decomposition. Discret. Math. 247(1-3): 159-168 (2002) - 2001
- [j28]Irena Rusu, Jeremy P. Spinrad:
Domination graphs: examples and counterexamples. Discret. Appl. Math. 110(2-3): 289-300 (2001) - 2000
- [j27]Ross M. McConnell, Jeremy P. Spinrad:
Ordered Vertex Partitioning. Discret. Math. Theor. Comput. Sci. 4(1): 45-60 (2000) - [j26]Vijay Raghavan, Jeremy P. Spinrad:
Solving Problems on Special Classes of Graphs. Electron. Notes Discret. Math. 5: 266-269 (2000) - 1999
- [j25]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): 287-292 (1999) - [j24]Ross M. McConnell, Jeremy P. Spinrad:
Modular decomposition and transitive orientation. Discret. Math. 201(1-3): 189-241 (1999) - [j23]Elaine M. Eschen, Ryan Hayward, Jeremy P. Spinrad, R. Sritharan:
Weakly Triangulated Comparability Graphs. SIAM J. Comput. 29(2): 378-386 (1999) - 1997
- [j22]Paul Colley, Anna Lubiw, Jeremy P. Spinrad:
Visibility Graphs of Towers. Comput. Geom. 7: 161-172 (1997) - [j21]Ton Kloks, Dieter Kratsch, Jeremy P. Spinrad:
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. Theor. Comput. Sci. 175(2): 309-335 (1997) - 1995
- [j20]Michel Habib, Marianne Huchard, Jeremy P. Spinrad:
A Linear Algorithm To Decompose Inheritance Graphs Into Modules. Algorithmica 13(6): 573-591 (1995) - [j19]Jeremy P. Spinrad, R. Sritharan:
Algorithms for Weakly Triangulated Graphs. Discret. Appl. Math. 59(2): 181-191 (1995) - [j18]Ortrud Oellermann, Jeremy P. Spinrad:
A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. Inf. Process. Lett. 55(3): 149-154 (1995) - [j17]Wen-Lian Hsu, Jeremy P. Spinrad:
Independent Sets in Circular-Arc Graphs. J. Algorithms 19(2): 145-160 (1995) - [j16]Jeremy P. Spinrad:
Nonredundant 1's in Gamma-Free Matrices. SIAM J. Discret. Math. 8(2): 251-257 (1995) - 1994
- [j15]Tze-Heng Ma, Jeremy P. Spinrad:
An O(n²) Algorithm for Undirected Split Decompositon. J. Algorithms 16(1): 154-160 (1994) - [j14]Jeremy P. Spinrad:
Recognition of Circle Graphs. J. Algorithms 16(2): 264-282 (1994) - [j13]Tze-Heng Ma, Jeremy P. Spinrad:
On the 2-Chain Subgraph Cover and Related Problems. J. Algorithms 17(2): 251-268 (1994) - 1993
- [j12]Jeremy P. Spinrad:
Doubly Lexical Ordering of Dense 0 - 1 Matrices. Inf. Process. Lett. 45(5): 229-235 (1993) - 1992
- [j11]Jeremy P. Spinrad:
P4-Trees and Substitution Decomposition. Discret. Appl. Math. 39(3): 263-291 (1992) - 1991
- [j10]Jeremy P. Spinrad:
Finding Large Holes. Inf. Process. Lett. 39(4): 227-229 (1991) - [j9]Jeremy P. Spinrad:
Note on recognition of matroid systems. Oper. Res. Lett. 10(6): 313-314 (1991) - 1989
- [j8]John H. Muller, Jeremy P. Spinrad:
Incremental modular decomposition. J. ACM 36(1): 1-19 (1989) - [j7]Jeremy P. Spinrad:
Prime Testing for the Split Decomposition of a Graph. SIAM J. Discret. Math. 2(4): 590-599 (1989) - 1988
- [j6]Jeremy P. Spinrad:
Circular-arc graphs with clique cover number two. J. Comb. Theory B 44(3): 300-306 (1988) - 1987
- [j5]Jeremy P. Spinrad, Andreas Brandstädt, Lorna Stewart:
Bipartite permutation graphs. Discret. Appl. Math. 18(3): 279-292 (1987) - [j4]Jeremy P. Spinrad, Gopalakrishnan Vijayan, Douglas B. West:
An improved edge bound on the interval number of a graph. J. Graph Theory 11(3): 447-449 (1987) - 1986
- [j3]Jeremy P. Spinrad:
The minimum dummy task problem. Networks 16(3): 331-348 (1986) - 1985
- [j2]Jeremy P. Spinrad, Gopalakrishnan Vijayan:
Worst case analysis of a graph coloring algorithm. Discret. Appl. Math. 12(1): 89-92 (1985) - [j1]Jeremy P. Spinrad:
On Comparability and Permutation Graphs. SIAM J. Comput. 14(3): 658-670 (1985)
Conference and Workshop Papers
- 2018
- [c22]Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu:
Double Threshold Digraphs. MFCS 2018: 69:1-69:12 - 2014
- [c21]Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad:
Recognizing Threshold Tolerance Graphs in O(n2) Time. WG 2014: 214-224 - 2006
- [c20]Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad:
Very Fast Instances for Concept Generation. ICFCA 2006: 119-129 - 2005
- [c19]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: 208-222 - [c18]Anne Berry, Alain Sigayret, Jeremy P. Spinrad:
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. WG 2005: 445-455 - 2004
- [c17]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: 243-252 - 2003
- [c16]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. FCT 2003: 61-72 - [c15]Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad:
Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003: 158-167 - [c14]Dieter Kratsch, Jeremy P. Spinrad:
Between O(nm) and O(n alpha). SODA 2003: 709-716 - 2002
- [c13]Ross M. McConnell, Jeremy P. Spinrad:
Construction of probe interval models. SODA 2002: 866-875 - 2001
- [c12]Vijay Raghavan, Jeremy P. Spinrad:
Robust algorithms for restricted domains. SODA 2001: 460-467 - [c11]Julie L. Johnson, Jeremy P. Spinrad:
A polynomial time recognition algorithm for probe interval graphs. SODA 2001: 477-486 - 2000
- [c10]Ryan Hayward, Jeremy P. Spinrad, R. Sritharan:
Weakly chordal graph algorithms via handles. SODA 2000: 42-49 - 1997
- [c9]Ross M. McConnell, Jeremy P. Spinrad:
Linear-Time Transitive Orientation. SODA 1997: 19-25 - 1994
- [c8]Jeremy P. Spinrad:
Dimension and Algorithms. ORDAL 1994: 33-52 - [c7]Ross M. McConnell, Jeremy P. Spinrad:
Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. SODA 1994: 536-545 - 1993
- [c6]Elaine M. Eschen, Jeremy P. Spinrad:
An O(n2) Algorithm for Circular-Arc Graph Recognition. SODA 1993: 128-137 - 1991
- [c5]Tze-Heng Ma, Jeremy P. Spinrad:
An O(n2) Time Algorithm for the 2-Chain Cover Problem and Related Problems. SODA 1991: 363-372 - 1990
- [c4]Tze-Heng Ma, Jeremy P. Spinrad:
Split Decomposition of Undirected Graphs. SODA 1990: 252-260 - [c3]Tze-Heng Ma, Jeremy P. Spinrad:
Avoiding Matrix Multiplication. WG 1990: 61-71 - 1983
- [c2]Jeremy P. Spinrad, Jacobo Valdes:
Recognition and Isomorphism of Two Dimensional Partial Orders. ICALP 1983: 676-686 - [c1]Jeremy P. Spinrad:
Transitive Orientation in O(n²) Time. STOC 1983: 457-466
Editorship
- 2007
- [e2]Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad:
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007. Dagstuhl Seminar Proceedings 07211, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2004
- [e1]Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad:
Robust and Approximative Algorithms an Particular Graph Classes, 23.05. - 28.05.2004. Dagstuhl Seminar Proceedings 04221, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2004 [contents]
Informal and Other Publications
- 2019
- [i7]Zlatko Joveski, Jeremy P. Spinrad:
Interval-Permutation Segment Graphs. CoRR abs/1908.10491 (2019) - 2017
- [i6]Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad:
Double Threshold Digraphs. CoRR abs/1702.06614 (2017) - 2012
- [i5]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 abs/1203.4822 (2012) - 2009
- [i4]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
On graphs without a C4 or a diamond. CoRR abs/0909.4719 (2009) - [i3]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
Finding a sun in building-free graphs. CoRR abs/0910.1808 (2009) - 2007
- [i2]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 - 2004
- [i1]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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
