Ross M. McConnell

67 papers A* 9A 1B 8C 2Journal 41Unranked 3

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Bipartite Analogues of Comparability and Cocomparability Graphs. SIAM J. Discret. Math. Pavol Hell, Jing Huang, Jephian C.-H. Lin, Ross M. McConnell
2020	J	`jnl`	Min-Orderable Digraphs. SIAM J. Discret. Math. Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
2018	B	`conf`	Double Threshold Digraphs. MFCS Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu
2018	B	`conf`	Interval-Like Graphs and Digraphs. MFCS Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
2018	J	`jnl`	Interval-Like Graphs and Digraphs. CoRR Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
2017	J	`jnl`	A note on finding minimum mean cycle. Inf. Process. Lett. Mmanu Chaturvedi, Ross M. McConnell
2017	J	`jnl`	Double Threshold Digraphs. CoRR Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad
2017	J	`jnl`	On recognition of threshold tolerance graphs and their complements. Discret. Appl. Math. Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2017	J	`jnl`	Simple DFS on the complement of a graph and on partially complemented digraphs. Inf. Process. Lett. Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim
2016	J	`jnl`	Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. SIAM J. Discret. Math. Nathan Lindzey, Ross M. McConnell
2015	J	`jnl`	Linear-Time Recognition of Probe Interval Graphs. SIAM J. Discret. Math. Ross M. McConnell, Yahav Nussbaum
2014	J	`jnl`	Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. CoRR Nathan Lindzey, Ross M. McConnell
2014	B	`conf`	Recognizing Threshold Tolerance Graphs in O(n WG Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
2013	J	`jnl`	Isomorphism of graph classes related to the circular-ones property. Discret. Math. Theor. Comput. Sci. Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2013	J	`jnl`	Linear-Time Recognition of Probe Interval Graphs. CoRR Ross M. McConnell, Yahav Nussbaum
2013	J	`jnl`	On Finding Lekkerkerker-Boland Subgraphs CoRR Nathan Lindzey, Ross M. McConnell
2013	B	`conf`	On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. WG Nathan Lindzey, Ross M. McConnell
2013	J	`jnl`	Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs. CoRR Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim
2012	J	`jnl`	Isomorphism of graph classes related to the circular-ones property CoRR Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2011	J	`jnl`	Certifying algorithms. Comput. Sci. Rev. Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer
2011	J	`jnl`	Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Dagstuhl Reports Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell
2011	J	`jnl`	Foreword. Discret. Appl. Math. Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit
2011	J	`jnl`	Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2011	J	`jnl`	Position heaps: A simple and dynamic text indexing data structure. J. Discrete Algorithms Andrzej Ehrenfeucht, Ross M. McConnell, Nissa Osheim, Sung-Whan Woo
2010	J	`jnl`	An implicit representation of chordal comparability graphs in linear time. Discret. Appl. Math. Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell
2010	J	`jnl`	O(mlogn) split decomposition of strongly-connected graphs. Discret. Appl. Math. Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell
2010	J	`jnl`	Using Graph Theory to Represent a Spatio-Temporal Role-Based Access Control Model. Int. J. Next Gener. Comput. Manachai Toahchoodee, Indrakshi Ray, Ross M. McConnell
2009	B	`conf`	Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure. CPM Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo
2009	—	`ed.`	Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday Graph Theory, Computational Intelligence and Thought Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell
2009	A	`conf`	Linear-Time Recognition of Probe Interval Graphs. ESA Ross M. McConnell, Yahav Nussbaum
2008	J	`jnl`	On cliques of Helly Circular-arc Graphs. Electron. Notes Discret. Math. Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2007	B	`conf`	Efficient Algorithms For Optimizing Policy-Constrained Routing. IWQoS Andrew R. Curtis, Ross M. McConnell, Daniel Massey
2006	B	`conf`	An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. WG Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell
2006	J	`jnl`	Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
2006	J	`jnl`	Polynomial time recognition of unit circular-arc graphs. J. Algorithms Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy P. Spinrad, Alan Tucker
2006	C	`conf`	Very Fast Instances for Concept Generation. ICFCA Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
2005	B	`conf`	Algebraic Operations on PQ Trees and Modular Decomposition Trees. WG Ross M. McConnell, Fabien de Montgolfier
2005	C	`conf`	Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. ICFCA Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
2005	J	`jnl`	Linear-time modular decomposition of directed graphs. Discret. Appl. Math. Ross M. McConnell, Fabien de Montgolfier
2005	—	`conf`	Reliably, Securely and Efficiently Distributing Electronic Content Using Multicasting. EC-Web Indrajit Ray, Eunjong Kim, Ross M. McConnell, Daniel Massey
2004	A*	`conf`	A certifying algorithm for the consecutive-ones property. SODA Ross M. McConnell
2004	—	`ch.`	PQ Trees, PC Trees, and Planar Graphs. Handbook of Data Structures and Applications Wen-Lian Hsu, Ross M. McConnell
2004	—	`conf`	Reducing Damage Assessment Latency in Survivable Databases. BNCOD Indrakshi Ray, Ross M. McConnell, Monte Lunacek, Vijay Kumar
2004	—	`ch.`	String Searching. Handbook of Data Structures and Applications Andrzej Ehrenfeucht, Ross M. McConnell
2003	A*	`conf`	Certifying algorithms for recognizing interval graphs and permutation graphs. SODA Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
2003	J	`jnl`	Linear-Time Recognition of Circular-Arc Graphs. Algorithmica Ross M. McConnell
2003	J	`jnl`	PC trees and circular-ones arrangements. Theor. Comput. Sci. Wen-Lian Hsu, Ross M. McConnell
2002	A*	`conf`	Construction of probe interval models. SODA Ross M. McConnell, Jeremy P. Spinrad
2002	J	`jnl`	Partially Complemented Representations of Digraphs. Discret. Math. Theor. Comput. Sci. Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
2001	J	`jnl`	Efficient and Practical Algorithms for Sequential Modular Decomposition. J. Algorithms Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
2001	A*	`conf`	Linear-time Recognition of Circular-arc Graphs. FOCS Ross M. McConnell
2001	J	`jnl`	Nesting of prime substructures in k-ary relations. Theor. Comput. Sci. Paola Bonizzoni, Ross M. McConnell
2000	J	`jnl`	Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot
2000	J	`jnl`	Ordered Vertex Partitioning. Discret. Math. Theor. Comput. Sci. Ross M. McConnell, Jeremy P. Spinrad
1999	J	`jnl`	Modular decomposition and transitive orientation. Discret. Math. Ross M. McConnell, Jeremy P. Spinrad
1997	—	`conf`	Complement-Equivalence Classes on Graphs. Structures in Logic and Computer Science Ross M. McConnell
1997	A*	`conf`	Efficient and Practical Modular Decomposition. SODA Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
1997	A*	`conf`	Linear-Time Transitive Orientation. SODA Ross M. McConnell, Jeremy P. Spinrad
1995	J	`jnl`	An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures. Algorithmica Ross M. McConnell
1994	J	`jnl`	A k-Structure Generalization of the Theory of 2-Structures. Theor. Comput. Sci. Andrzej Ehrenfeucht, Ross M. McConnell
1994	J	`jnl`	An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. J. Algorithms Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan
1994	A*	`conf`	Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. SODA Ross M. McConnell, Jeremy P. Spinrad
1987	J	`jnl`	Complete inverted files for efficient text retrieval and analysis. J. ACM Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht
1986	J	`jnl`	Sequence landscapes. Nucleic Acids Res. B. Clift, David Haussler, Ross M. McConnell, Thomas D. Schneider, Gary D. Stormo
1984	A*	`conf`	Building a Complete Inverted File for a Set of Text Files in Linear Time STOC Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
1984	A*	`conf`	Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. ICALP Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
1983	J	`jnl`	Linear size finite automata for the set of all subwords of a word - an outline of results. Bull. EATCS Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell