| 2008 |
|---|
| 34 | EE | Min Chih Lin,
Ross M. McConnell,
Francisco J. Soulignac,
Jayme Luiz Szwarcfiter:
On cliques of Helly Circular-arc Graphs.
Electronic Notes in Discrete Mathematics 30: 117-122 (2008) |
| 2006 |
|---|
| 33 | EE | Anne Berry,
Ross M. McConnell,
Alain Sigayret,
Jeremy Spinrad:
Very Fast Instances for Concept Generation.
ICFCA 2006: 119-129 |
| 32 | EE | Andrew R. Curtis,
Clemente Izurieta,
Benson Joeris,
Scott Lundberg,
Ross M. McConnell:
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time.
WG 2006: 168-178 |
| 31 | EE | 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) |
| 30 | EE | 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) |
| 2005 |
|---|
| 29 | EE | Indrajit Ray,
Eunjong Kim,
Ross M. McConnell,
Daniel Massey:
Reliably, Securely and Efficiently Distributing Electronic Content Using Multicasting.
EC-Web 2005: 327-336 |
| 28 | EE | 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 |
| 27 | EE | Ross M. McConnell,
Fabien de Montgolfier:
Algebraic Operations on PQ Trees and Modular Decomposition Trees.
WG 2005: 421-432 |
| 26 | EE | Ross M. McConnell,
Fabien de Montgolfier:
Linear-time modular decomposition of directed graphs.
Discrete Applied Mathematics 145(2): 198-209 (2005) |
| 2004 |
|---|
| 25 | EE | Indrakshi Ray,
Ross M. McConnell,
Monte Lunacek,
Vijay Kumar:
Reducing Damage Assessment Latency in Survivable Databases.
BNCOD 2004: 106-111 |
| 24 | EE | Ross M. McConnell:
A certifying algorithm for the consecutive-ones property.
SODA 2004: 768-777 |
| 2003 |
|---|
| 23 | EE | Dieter Kratsch,
Ross M. McConnell,
Kurt Mehlhorn,
Jeremy Spinrad:
Certifying algorithms for recognizing interval graphs and permutation graphs.
SODA 2003: 158-167 |
| 22 | EE | Ross M. McConnell:
Linear-Time Recognition of Circular-Arc Graphs.
Algorithmica 37(2): 93-147 (2003) |
| 21 | EE | Wen-Lian Hsu,
Ross M. McConnell:
PC trees and circular-ones arrangements.
Theor. Comput. Sci. 296(1): 99-116 (2003) |
| 2002 |
|---|
| 20 | EE | Ross M. McConnell,
Jeremy Spinrad:
Construction of probe interval models.
SODA 2002: 866-875 |
| 19 | EE | Elias Dahlhaus,
Jens Gustedt,
Ross M. McConnell:
Partially Complemented Representations of Digraphs.
Discrete Mathematics & Theoretical Computer Science 5(1): 147-168 (2002) |
| 2001 |
|---|
| 18 | | Ross M. McConnell:
Linear-time Recognition of Circular-arc Graphs.
FOCS 2001: 386-394 |
| 17 | EE | Elias Dahlhaus,
Jens Gustedt,
Ross M. McConnell:
Efficient and Practical Algorithms for Sequential Modular Decomposition.
J. Algorithms 41(2): 360-387 (2001) |
| 16 | EE | Paola Bonizzoni,
Ross M. McConnell:
Nesting of prime substructures in k-ary relations.
Theor. Comput. Sci. 259(1-2): 341-357 (2001) |
| 2000 |
|---|
| 15 | EE | Ross M. McConnell,
Jeremy Spinrad:
Ordered Vertex Partitioning.
Discrete Mathematics & Theoretical Computer Science 4(1): 45-60 (2000) |
| 14 | EE | 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.
Theor. Comput. Sci. 234(1-2): 59-84 (2000) |
| 1999 |
|---|
| 13 | EE | Ross M. McConnell,
Jeremy Spinrad:
Modular decomposition and transitive orientation.
Discrete Mathematics 201(1-3): 189-241 (1999) |
| 1997 |
|---|
| 12 | | Ross M. McConnell,
Jeremy Spinrad:
Linear-Time Transitive Orientation.
SODA 1997: 19-25 |
| 11 | | Elias Dahlhaus,
Jens Gustedt,
Ross M. McConnell:
Efficient and Practical Modular Decomposition.
SODA 1997: 26-35 |
| 10 | | Ross M. McConnell:
Complement-Equivalence Classes on Graphs.
Structures in Logic and Computer Science 1997: 174-191 |
| 1995 |
|---|
| 9 | | Ross M. McConnell:
An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures.
Algorithmica 14(3): 229-248 (1995) |
| 1994 |
|---|
| 8 | | Ross M. McConnell,
Jeremy Spinrad:
Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs.
SODA 1994: 536-545 |
| 7 | | 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.
J. Algorithms 16(2): 283-294 (1994) |
| 6 | | Andrzej Ehrenfeucht,
Ross M. McConnell:
A k-Structure Generalization of the Theory of 2-Structures.
Theor. Comput. Sci. 132(2): 209-227 (1994) |
| 1987 |
|---|
| 5 | EE | Anselm Blumer,
J. Blumer,
David Haussler,
Ross M. McConnell,
Andrzej Ehrenfeucht:
Complete inverted files for efficient text retrieval and analysis.
J. ACM 34(3): 578-595 (1987) |
| 1986 |
|---|
| 4 | | B. Clift,
David Haussler,
Ross M. McConnell,
Thomas D. Schneider,
Gary D. Stormo:
Sequence landscapes.
Nucleic Acids Research 14(1): 141-158 (1986) |
| 1984 |
|---|
| 3 | | 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.
ICALP 1984: 109-118 |
| 2 | | 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
STOC 1984: 349-358 |
| 1983 |
|---|
| 1 | | 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.
Bulletin of the EATCS 21: 12-20 (1983) |
