The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ross M. McConnell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht
    Complete inverted files for efficient text retrieval and analysis. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1987, v:34, n:3, pp:578-595 [Journal]
  2. Ross M. McConnell
    Complement-Equivalence Classes on Graphs. [Citation Graph (0, 0)][DBLP]
    Structures in Logic and Computer Science, 1997, pp:174-191 [Conf]
  3. Indrakshi Ray, Ross M. McConnell, Monte Lunacek, Vijay Kumar
    Reducing Damage Assessment Latency in Survivable Databases. [Citation Graph (0, 0)][DBLP]
    BNCOD, 2004, pp:106-111 [Conf]
  4. Indrajit Ray, Eunjong Kim, Ross M. McConnell, Daniel Massey
    Reliably, Securely and Efficiently Distributing Electronic Content Using Multicasting. [Citation Graph (0, 0)][DBLP]
    EC-Web, 2005, pp:327-336 [Conf]
  5. Ross M. McConnell
    Linear-time Recognition of Circular-arc Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:386-394 [Conf]
  6. Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
    Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:109-118 [Conf]
  7. 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]
  8. 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]
  9. Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
    Efficient and Practical Modular Decomposition. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:26-35 [Conf]
  10. 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]
  11. Ross M. McConnell
    A certifying algorithm for the consecutive-ones property. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:768-777 [Conf]
  12. Ross M. McConnell, Jeremy Spinrad
    Construction of probe interval models. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:866-875 [Conf]
  13. 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]
  14. Ross M. McConnell, Jeremy Spinrad
    Linear-Time Transitive Orientation. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:19-25 [Conf]
  15. Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
    Building a Complete Inverted File for a Set of Text Files in Linear Time [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:349-358 [Conf]
  16. Andrew R. Curtis, Clemente Izurieta, Benson Joeris, Scott Lundberg, Ross M. McConnell
    An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:168-178 [Conf]
  17. Ross M. McConnell, Fabien de Montgolfier
    Algebraic Operations on PQ Trees and Modular Decomposition Trees. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:421-432 [Conf]
  18. Ross M. McConnell
    Linear-Time Recognition of Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:2, pp:93-147 [Journal]
  19. Ross M. McConnell
    An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:3, pp:229-248 [Journal]
  20. Ross M. McConnell, Fabien de Montgolfier
    Linear-time modular decomposition of directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:198-209 [Journal]
  21. Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
    Partially Complemented Representations of Digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2002, v:5, n:1, pp:147-168 [Journal]
  22. 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]
  23. Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
    Linear size finite automata for the set of all subwords of a word - an outline of results. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1983, v:21, n:, pp:12-20 [Journal]
  24. Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
    Efficient and Practical Algorithms for Sequential Modular Decomposition. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:360-387 [Journal]
  25. 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]
  26. Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan
    An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:2, pp:283-294 [Journal]
  27. B. Clift, David Haussler, Ross M. McConnell, Thomas D. Schneider, Gary D. Stormo
    Sequence landscapes. [Citation Graph (0, 0)][DBLP]
    Nucleic Acids Research, 1986, v:14, n:1, pp:141-158 [Journal]
  28. 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]
  29. Paola Bonizzoni, Ross M. McConnell
    Nesting of prime substructures in k-ary relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:341-357 [Journal]
  30. Andrzej Ehrenfeucht, Ross M. McConnell
    A k-Structure Generalization of the Theory of 2-Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:209-227 [Journal]
  31. Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot
    Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:59-84 [Journal]
  32. Wen-Lian Hsu, Ross M. McConnell
    PC trees and circular-ones arrangements. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:99-116 [Journal]
  33. 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]

  34. O(m logn) Split Decomposition of Strongly Connected Graphs. [Citation Graph (, )][DBLP]


  35. Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure. [Citation Graph (, )][DBLP]


  36. Linear-Time Recognition of Probe Interval Graphs. [Citation Graph (, )][DBLP]


  37. An implicit representation of chordal comparability graphs in linear time. [Citation Graph (, )][DBLP]


  38. O(mlogn) split decomposition of strongly-connected graphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002