Jeremy Spinrad

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

Coauthor Index

1	Marcelo Arenas	[37]
2	Anne Berry	[50] [51] [58]
3	Leopoldo E. Bertossi	[37]
4	Hans L. Bodlaender	[44] [49]
5	Richard B. Borie	[28]
6	Andreas Brandstädt	[44] [49] [60] [61]
7	Jan Chomicki	[37]
8	Paul Colley	[24]
9	Guillermo Durán	[54]
10	Elaine M. Eschen	[12] [26] [41] [55]
11	Stefan Felsner	[38]
12	Celina M. Herrera de Figueiredo	[48] [57]
13	Guilherme Dias da Fonseca	[48] [57]
14	Agustín Gravano	[54]
15	Michel Habib	[22]
16	Ryan B. Hayward (Ryan Hayward)	[26] [31] [59]
17	Xin He	[37]
18	Wen-Lian Hsu	[19]
19	Marianne Huchard	[22] [51]
20	Klaus Jansen	[60] [61]
21	Julie L. Johnson	[33] [41]
22	Ton Kloks (Antonius J. J. Kloks)	[23]
23	Dieter Kratsch	[23] [42] [43] [44] [49] [52] [53] [56] [60] [61] [62]
24	Van Bang Le	[45]
25	Anna Lubiw	[24]
26	Tze-Heng Ma	[6] [7] [9] [13] [15]
27	Ross M. McConnell	[16] [25] [27] [30] [36] [43] [51] [52] [54] [58]
28	Kurt Mehlhorn	[43] [52]
29	John H. Muller	[5]
30	Ortrud R. Oellermann (Ortrud Oellermann)	[20]
31	Vijay V. Raghavan (Vijay Raghavan)	[29] [34] [37] [38] [39]
32	Michaël Rao	[44] [49]
33	Irena Rusu	[32] [35]
34	Vinícius G. P. de Sá	[48] [57]
35	Joe Sawada	[40]
36	Alain Sigayret	[50] [51] [58]
37	R. Sritharan	[21] [26] [31] [41] [59] [62]
38	Alan Tucker	[54]
39	Jacobo Valdes	[2]

Colors in the list of coauthors