Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jeremy Spinrad
2010 – today
- 2013
[j47]Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy Spinrad, Jayme Luiz Szwarcfiter: Isomorphism of graph classes related to the circular-ones property. Discrete Mathematics & Theoretical Computer Science 15(1): 157-182 (2013)- 2012
- [j46]Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: Finding a Sun in Building-Free Graphs. Graphs and Combinatorics 28(3): 347-364 (2012)
- [i3]Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy Spinrad, Jayme Luiz Szwarcfiter: Isomorphism of graph classes related to the circular-ones property. CoRR abs/1203.4822 (2012)
- 2011
- [j45]Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy Spinrad, Jayme Luiz Szwarcfiter: Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica 59(2): 215-239 (2011)
- [j44]Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: On graphs without a C4 or a diamond. Discrete Applied Mathematics 159(7): 581-587 (2011)
2000 – 2009
- 2009
- [i2]Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: On graphs without a C4 or a diamond. CoRR abs/0909.4719 (2009)
- [i1]Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: Finding a sun in building-free graphs. CoRR abs/0910.1808 (2009)
- 2008
- [j43]Dieter Kratsch, Jeremy Spinrad, R. Sritharan: A new characterization of HH-free graphs. Discrete Mathematics 308(20): 4833-4835 (2008)
- 2007
- [j42]Ryan B. Hayward, Jeremy Spinrad, R. Sritharan: Improved algorithms for weakly chordal graphs. ACM Transactions on Algorithms 3(2) (2007)
- [c21]Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy 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
- [e1]Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad (Eds.): 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
- 2006
- [j41]Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad: Algorithms for the Homogeneous Set Sandwich Problem. Algorithmica 46(2): 149-180 (2006)
- [j40]Dieter Kratsch, Jeremy Spinrad: Minimal fill in O(n2.69) time. Discrete Mathematics 306(3): 366-371 (2006)
- [j39]Elaine M. Eschen, Jeremy Spinrad: Finding Triangles in Restricted Classes of Graphs. Electronic Notes in Discrete Mathematics 27: 25-26 (2006)
- [j38]Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy Spinrad, Alan Tucker: Polynomial time recognition of unit circular-arc graphs. J. Algorithms 58(1): 67-78 (2006)
- [j37]
- [j36]Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36(2): 326-353 (2006)
- [c20]Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad: Very Fast Instances for Concept Generation. ICFCA 2006: 119-129
- 2005
- [j35]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad: On algorithms for (P5, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005)
- [c19]Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad: Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. ICFCA 2005: 208-222
- [c18]Anne Berry, Alain Sigayret, Jeremy Spinrad: Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. WG 2005: 445-455
- 2004
- [j34]Jeremy Spinrad: Recognizing quasi-triangulated graphs. Discrete Applied Mathematics 138(1-2): 203-213 (2004)
- [j33]
- [j32]Van Bang Le, Jeremy Spinrad: Consequences of an algorithm for bridged graphs. Discrete Mathematics 280(1-3): 271-274 (2004)
- [c17]Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad: Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem. WEA 2004: 243-252
- 2003
- [j31]Elaine M. Eschen, Julie L. Johnson, Jeremy Spinrad, R. Sritharan: Recognition of Some Perfectly Orderable Graph Classes. Discrete Applied Mathematics 128(2-3): 355-373 (2003)
- [j30]Joe Sawada, Jeremy Spinrad: From a simple elimination ordering to a strong elimination ordering in linear time. Inf. Process. Lett. 86(6): 299-302 (2003)
- [j29]Vijay Raghavan, Jeremy Spinrad: Robust algorithms for restricted domains. J. Algorithms 48(1): 160-172 (2003)
- [j28]Stefan Felsner, Vijay Raghavan, Jeremy Spinrad: Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. Order 20(4): 351-364 (2003)
- [j27]Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, Jeremy Spinrad: Scalar aggregation in inconsistent databases. Theor. Comput. Sci. 296(3): 405-434 (2003)
- [c16]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy 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 Spinrad: Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003: 158-167
- [c14]
- 2002
- [j26]Irena Rusu, Jeremy Spinrad: Forbidden subgraph decomposition. Discrete Mathematics 247(1-3): 159-168 (2002)
- [c13]
- 2001
- [j25]Irena Rusu, Jeremy Spinrad: Domination graphs: examples and counterexamples. Discrete Applied Mathematics 110(2-3): 289-300 (2001)
- [c12]
- [c11]Julie L. Johnson, Jeremy Spinrad: A polynomial time recognition algorithm for probe interval graphs. SODA 2001: 477-486
- 2000
- [j24]Ross M. McConnell, Jeremy Spinrad: Ordered Vertex Partitioning. Discrete Mathematics & Theoretical Computer Science 4(1): 45-60 (2000)
- [j23]Vijay Raghavan, Jeremy Spinrad: Solving Problems on Special Classes of Graphs. Electronic Notes in Discrete Mathematics 5: 266-269 (2000)
- [c10]Ryan Hayward, Jeremy Spinrad, R. Sritharan: Weakly chordal graph algorithms via handles. SODA 2000: 42-49
1990 – 1999
- 1999
- [j22]Richard B. Borie, Jeremy Spinrad: Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time. Discrete Applied Mathematics 91(1-3): 287-292 (1999)
- [j21]Ross M. McConnell, Jeremy Spinrad: Modular decomposition and transitive orientation. Discrete Mathematics 201(1-3): 189-241 (1999)
- [j20]Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan: Weakly Triangulated Comparability Graphs. SIAM J. Comput. 29(2): 378-386 (1999)
- 1997
- [j19]Paul Colley, Anna Lubiw, Jeremy Spinrad: Visibility Graphs of Towers. Comput. Geom. 7: 161-172 (1997)
- [j18]Ton Kloks, Dieter Kratsch, Jeremy Spinrad: On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. Theor. Comput. Sci. 175(2): 309-335 (1997)
- [c9]
- 1995
- [j17]Michel Habib, Marianne Huchard, Jeremy Spinrad: A Linear Algorithm To Decompose Inheritance Graphs Into Modules. Algorithmica 13(6): 573-591 (1995)
- [j16]Jeremy Spinrad, R. Sritharan: Algorithms for Weakly Triangulated Graphs. Discrete Applied Mathematics 59(2): 181-191 (1995)
- [j15]Ortrud Oellermann, Jeremy Spinrad: A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. Inf. Process. Lett. 55(3): 149-154 (1995)
- [j14]Wen-Lian Hsu, Jeremy Spinrad: Independent Sets in Circular-Arc Graphs. J. Algorithms 19(2): 145-160 (1995)
- [j13]Jeremy Spinrad: Nonredundant 1's in Gamma-Free Matrices. SIAM J. Discrete Math. 8(2): 251-257 (1995)
- 1994
- [j12]Tze-Heng Ma, Jeremy Spinrad: An O(n²) Algorithm for Undirected Split Decompositon. J. Algorithms 16(1): 154-160 (1994)
- [j11]
- [j10]Tze-Heng Ma, Jeremy Spinrad: On the 2-Chain Subgraph Cover and Related Problems. J. Algorithms 17(2): 251-268 (1994)
- [c8]
- [c7]Ross M. McConnell, Jeremy Spinrad: Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. SODA 1994: 536-545
- 1993
- [j9]Jeremy Spinrad: Doubly Lexical Ordering of Dense 0 - 1 Matrices. Inf. Process. Lett. 45(5): 229-235 (1993)
- [c6]Elaine M. Eschen, Jeremy Spinrad: An O(n2) Algorithm for Circular-Arc Graph Recognition. SODA 1993: 128-137
- 1992
- [j8]Jeremy Spinrad: P4-Trees and Substitution Decomposition. Discrete Applied Mathematics 39(3): 263-291 (1992)
- 1991
- [j7]
- [c5]Tze-Heng Ma, Jeremy Spinrad: An O(n2) Time Algorithm for the 2-Chain Cover Problem and Related Problems. SODA 1991: 363-372
- 1990
- [c4]
- [c3]
1980 – 1989
- 1989
- [j6]
- [j5]Jeremy Spinrad: Prime Testing for the Split Decomposition of a Graph. SIAM J. Discrete Math. 2(4): 590-599 (1989)
- 1988
- [j4]Jeremy Spinrad: Circular-arc graphs with clique cover number two. J. Comb. Theory, Ser. B 44(3): 300-306 (1988)
- 1987
- [j3]Jeremy Spinrad, Gopalakrishnan Vijayan, Douglas B. West: An improved edge bound on the interval number of a graph. Journal of Graph Theory 11(3): 447-449 (1987)
- 1986
- [j2]
- 1985
- [j1]
- 1983
- [c2]Jeremy Spinrad, Jacobo Valdes: Recognition and Isomorphism of Two Dimensional Partial Orders. ICALP 1983: 676-686
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:18 CEST by the dblp team