The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jeremy Spinrad: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:61-72 [Conf]
  2. Jeremy Spinrad, Jacobo Valdes
    Recognition and Isomorphism of Two Dimensional Partial Orders. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:676-686 [Conf]
  3. Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad
    Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2005, pp:208-222 [Conf]
  4. Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad
    Very Fast Instances for Concept Generation. [Citation Graph (0, 0)][DBLP]
    ICFCA, 2006, pp:119-129 [Conf]
  5. Jeremy Spinrad
    Dimension and Algorithms. [Citation Graph (0, 0)][DBLP]
    ORDAL, 1994, pp:33-52 [Conf]
  6. Elaine M. Eschen, Jeremy Spinrad
    An O(n2) Algorithm for Circular-Arc Graph Recognition. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:128-137 [Conf]
  7. Ryan Hayward, Jeremy Spinrad, R. Sritharan
    Weakly chordal graph algorithms via handles. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:42-49 [Conf]
  8. Julie L. Johnson, Jeremy Spinrad
    A polynomial time recognition algorithm for probe interval graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:477-486 [Conf]
  9. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad
    Certifying algorithms for recognizing interval graphs and permutation graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:158-167 [Conf]
  10. Dieter Kratsch, Jeremy Spinrad
    Between O(nm) and O(n alpha). [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:709-716 [Conf]
  11. Tze-Heng Ma, Jeremy Spinrad
    Split Decomposition of Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:252-260 [Conf]
  12. Tze-Heng Ma, Jeremy Spinrad
    An O(n2) Time Algorithm for the 2-Chain Cover Problem and Related Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:363-372 [Conf]
  13. Ross M. McConnell, Jeremy Spinrad
    Construction of probe interval models. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:866-875 [Conf]
  14. Ross M. McConnell, Jeremy Spinrad
    Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:536-545 [Conf]
  15. Ross M. McConnell, Jeremy Spinrad
    Linear-Time Transitive Orientation. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:19-25 [Conf]
  16. Vijay Raghavan, Jeremy Spinrad
    Robust algorithms for restricted domains. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:460-467 [Conf]
  17. Jeremy Spinrad
    Transitive Orientation in O(n²) Time [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:457-466 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:243-252 [Conf]
  19. Anne Berry, Alain Sigayret, Jeremy Spinrad
    Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:445-455 [Conf]
  20. Tze-Heng Ma, Jeremy Spinrad
    Avoiding Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:61-71 [Conf]
  21. Michel Habib, Marianne Huchard, Jeremy Spinrad
    A Linear Algorithm To Decompose Inheritance Graphs Into Modules. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:6, pp:573-591 [Journal]
  22. Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca, Vinícius G. P. de Sá, Jeremy Spinrad
    Algorithms for the Homogeneous Set Sandwich Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:2, pp:149-180 [Journal]
  23. Paul Colley, Anna Lubiw, Jeremy Spinrad
    Visibility Graphs of Towers. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:161-172 [Journal]
  24. Richard B. Borie, Jeremy Spinrad
    Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:287-292 [Journal]
  25. Elaine M. Eschen, Julie L. Johnson, Jeremy Spinrad, R. Sritharan
    Recognition of Some Perfectly Orderable Graph Classes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:2-3, pp:355-373 [Journal]
  26. Irena Rusu, Jeremy Spinrad
    Domination graphs: examples and counterexamples. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:289-300 [Journal]
  27. Jeremy Spinrad
    Recognizing quasi-triangulated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:203-213 [Journal]
  28. Jeremy Spinrad
    P4-Trees and Substitution Decomposition. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:39, n:3, pp:263-291 [Journal]
  29. Jeremy Spinrad, R. Sritharan
    Algorithms for Weakly Triangulated Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:2, pp:181-191 [Journal]
  30. Dieter Kratsch, Jeremy Spinrad
    Minimal fill in O(n2.69) time. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:366-371 [Journal]
  31. Van Bang Le, Jeremy Spinrad
    Consequences of an algorithm for bridged graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:271-274 [Journal]
  32. Irena Rusu, Jeremy Spinrad
    Forbidden subgraph decomposition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:159-168 [Journal]
  33. Jeremy Spinrad
    A note on computing graph closures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:327-329 [Journal]
  34. Ross M. McConnell, Jeremy Spinrad
    Ordered Vertex Partitioning. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2000, v:4, n:1, pp:45-60 [Journal]
  35. Ortrud Oellermann, Jeremy Spinrad
    A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:3, pp:149-154 [Journal]
  36. Joe Sawada, Jeremy Spinrad
    From a simple elimination ordering to a strong elimination ordering in linear time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:6, pp:299-302 [Journal]
  37. Jeremy Spinrad
    Finding Large Holes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:4, pp:227-229 [Journal]
  38. Jeremy Spinrad
    Doubly Lexical Ordering of Dense 0 - 1 Matrices. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:5, pp:229-235 [Journal]
  39. John H. Muller, Jeremy Spinrad
    Incremental modular decomposition. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:1, pp:1-19 [Journal]
  40. Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy Spinrad, Alan Tucker
    Polynomial time recognition of unit circular-arc graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:58, n:1, pp:67-78 [Journal]
  41. Wen-Lian Hsu, Jeremy Spinrad
    Independent Sets in Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:2, pp:145-160 [Journal]
  42. Tze-Heng Ma, Jeremy Spinrad
    An O(n²) Algorithm for Undirected Split Decompositon. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:1, pp:154-160 [Journal]
  43. Tze-Heng Ma, Jeremy Spinrad
    On the 2-Chain Subgraph Cover and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:2, pp:251-268 [Journal]
  44. Vijay Raghavan, Jeremy Spinrad
    Robust algorithms for restricted domains. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:160-172 [Journal]
  45. Jeremy Spinrad
    Recognition of Circle Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:2, pp:264-282 [Journal]
  46. Jeremy Spinrad
    Circular-arc graphs with clique cover number two. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:3, pp:300-306 [Journal]
  47. Stefan Felsner, Vijay Raghavan, Jeremy Spinrad
    Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:4, pp:351-364 [Journal]
  48. Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan
    Weakly Triangulated Comparability Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:378-386 [Journal]
  49. Jeremy Spinrad
    On Comparability and Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:3, pp:658-670 [Journal]
  50. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad
    Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:326-353 [Journal]
  51. Dieter Kratsch, Jeremy Spinrad
    Between O(nm) and O(nalpha). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:2, pp:310-325 [Journal]
  52. Jeremy Spinrad
    Nonredundant 1's in Gamma-Free Matrices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:2, pp:251-257 [Journal]
  53. Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, Jeremy Spinrad
    Scalar aggregation in inconsistent databases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:3, n:296, pp:405-434 [Journal]
  54. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
    On algorithms for (P5, gem)-free graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:2-21 [Journal]
  55. Ton Kloks, Dieter Kratsch, Jeremy Spinrad
    On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:2, pp:309-335 [Journal]
  56. Ross M. McConnell, Jeremy Spinrad
    Modular decomposition and transitive orientation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:201, n:1-3, pp:189-241 [Journal]
  57. Ryan B. Hayward, Jeremy Spinrad, R. Sritharan
    Improved algorithms for weakly chordal graphs. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  58. 07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. [Citation Graph (, )][DBLP]


  59. On graphs without a C4 or a diamond [Citation Graph (, )][DBLP]


  60. Finding a sun in building-free graphs [Citation Graph (, )][DBLP]


  61. A new characterization of HH-free graphs. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.020secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002