| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
Finding a Sun in Building-Free Graphs.  |
Graphs and Combinatorics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
On graphs without a C4 or a diamond. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
On graphs without a C4 or a diamond |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
Finding a sun in building-free graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Dieter Kratsch, Jeremy Spinrad, R. Sritharan |
A new characterization of HH-free graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan B. Hayward, Jeremy Spinrad, R. Sritharan |
Improved algorithms for weakly chordal graphs. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
weakly chordal, graph algorithms, recognition, coloring, Perfect graphs |
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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 |
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes |
2007 |
DBLP BibTeX RDF |
|
| 1 | Elaine M. Eschen, Jeremy Spinrad |
Finding Triangles in Restricted Classes of Graphs. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Jeremy Spinrad |
Minimal fill in O(n2.69) time. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy Spinrad, Alan Tucker |
Polynomial time recognition of unit circular-arc graphs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad |
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Jeremy Spinrad |
Between O(nm) and O(nalpha). |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad |
Very Fast Instances for Concept Generation. |
ICFCA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad |
On algorithms for (P5, gem)-free graphs. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Berry, Alain Sigayret, Jeremy Spinrad |
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. |
WG |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
A note on computing graph closures. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Jeremy Spinrad |
Consequences of an algorithm for bridged graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
Recognizing quasi-triangulated graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Joe Sawada, Jeremy Spinrad |
From a simple elimination ordering to a strong elimination ordering in linear time. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, Jeremy Spinrad |
Scalar aggregation in inconsistent databases. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijay Raghavan, Jeremy Spinrad |
Robust algorithms for restricted domains. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Felsner, Vijay Raghavan, Jeremy Spinrad |
Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number. |
Order |
2003 |
DBLP DOI BibTeX RDF |
Dilworth number, partial order, recognition algorithms, width |
| 1 | Elaine M. Eschen, Julie L. Johnson, Jeremy Spinrad, R. Sritharan |
Recognition of Some Perfectly Orderable Graph Classes. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy Spinrad |
Certifying algorithms for recognizing interval graphs and permutation graphs. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Jeremy Spinrad |
Between O(nm) and O(n alpha). |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 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. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu, Jeremy Spinrad |
Forbidden subgraph decomposition. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ross M. McConnell, Jeremy Spinrad |
Construction of probe interval models. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Irena Rusu, Jeremy Spinrad |
Domination graphs: examples and counterexamples. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijay Raghavan, Jeremy Spinrad |
Robust algorithms for restricted domains. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Julie L. Johnson, Jeremy Spinrad |
A polynomial time recognition algorithm for probe interval graphs. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vijay Raghavan, Jeremy Spinrad |
Solving Problems on Special Classes of Graphs. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ross M. McConnell, Jeremy Spinrad |
Ordered Vertex Partitioning. |
Discrete Mathematics & Theoretical Computer Science |
2000 |
DBLP BibTeX RDF |
|
| 1 | Ryan Hayward, Jeremy Spinrad, R. Sritharan |
Weakly chordal graph algorithms via handles. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ross M. McConnell, Jeremy Spinrad |
Modular decomposition and transitive orientation. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard B. Borie, Jeremy Spinrad |
Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan |
Weakly Triangulated Comparability Graphs. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Dieter Kratsch, Jeremy Spinrad |
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Colley, Anna Lubiw, Jeremy Spinrad |
Visibility Graphs of Towers. |
Comput. Geom. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ross M. McConnell, Jeremy Spinrad |
Linear-Time Transitive Orientation. |
SODA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ortrud Oellermann, Jeremy Spinrad |
A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Marianne Huchard, Jeremy Spinrad |
A Linear Algorithm To Decompose Inheritance Graphs Into Modules. |
Algorithmica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Wen-Lian Hsu, Jeremy Spinrad |
Independent Sets in Circular-Arc Graphs. |
J. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
Nonredundant 1's in Gamma-Free Matrices. |
SIAM J. Discrete Math. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad, R. Sritharan |
Algorithms for Weakly Triangulated Graphs. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Tze-Heng Ma, Jeremy Spinrad |
On the 2-Chain Subgraph Cover and Related Problems. |
J. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
Recognition of Circle Graphs. |
J. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Tze-Heng Ma, Jeremy Spinrad |
An O(n²) Algorithm for Undirected Split Decompositon. |
J. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ross M. McConnell, Jeremy Spinrad |
Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
Dimension and Algorithms. |
ORDAL |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
Doubly Lexical Ordering of Dense 0 - 1 Matrices. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Jeremy Spinrad |
An O(n2) Algorithm for Circular-Arc Graph Recognition. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
P4-Trees and Substitution Decomposition. |
Discrete Applied Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
Finding Large Holes. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Tze-Heng Ma, Jeremy Spinrad |
An O(n2) Time Algorithm for the 2-Chain Cover Problem and Related Problems. |
SODA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Tze-Heng Ma, Jeremy Spinrad |
Avoiding Matrix Multiplication. |
WG |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Tze-Heng Ma, Jeremy Spinrad |
Split Decomposition of Undirected Graphs. |
SODA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Muller, Jeremy Spinrad |
Incremental modular decomposition. |
J. ACM |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
Prime Testing for the Split Decomposition of a Graph. |
SIAM J. Discrete Math. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
Circular-arc graphs with clique cover number two. |
J. Comb. Theory, Ser. B |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
On Comparability and Permutation Graphs. |
SIAM J. Comput. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad, Jacobo Valdes |
Recognition and Isomorphism of Two Dimensional Partial Orders. |
ICALP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremy Spinrad |
Transitive Orientation in O(n²) Time |
STOC |
1983 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")