Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Spinrad, Jeremy"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recognizing threshold tolerance graphs in
O(n^2)
time
Petr A. Golovach
,
Pinar Heggernes
,
Nathan Lindzey
,
Ross M. McConnell
,
Vinícius Fernandes dos Santos
,
Jeremy P. Spinrad
Lecture Notes in Computer Science
8747
, 2014, pp. 214-224
Finding a sun in building-free graphs
Elaine M. Eschen
,
Chính T. Hoàng
,
Jeremy P. Spinrad
,
R. Sritharan
Graphs and Combinatorics
28
(3), 2012, pp. 347-364
Linear-time recognition of Helly circular-arc models and graphs
Benson L. Joeris
,
Min Chih Lin
,
Ross M. McConnell
,
Jeremy P. Spinrad
,
Jayme L. Szwarcfiter
Algorithmica
59
(2), 2011, pp. 215-239
Polynomial time recognition of unit circular-arc graphs
Guillermo Durán
,
Agustín Gravano
,
Ross M. McConnell
,
Jeremy Spinrad
,
Alan Tucker
Journal of Algorithms
58
(1), 2006, pp. 67-78
Certifying algorithms for recognizing interval graphs and permutation graphs
Dieter Kratsch
,
Ross M. McConnell
,
Kurt Mehlhorn
,
Jeremy P. Spinrad
SIAM Journal on Computing
36
(2), 2006, pp. 326-353
Between
O(nm)
and
O(n^\alpha)
Dieter Kratsch
,
Jeremy Spinrad
SIAM Journal on Computing
36
(2), 2006, pp. 310-325
Algorithms for the homogeneous set sandwich problem
Celina M.H. de Figueiredo
,
Guilherme D. da Fonseca
,
Vinícius G.P. de Sá
,
Jeremy Spinrad
Algorithmica
46
(2), 2006, pp. 149-180
Faster dynamic algorithms for chordal graphs, and an application to phylogeny
Anne Berry
,
Alain Sigayret
,
Jeremy Spinrad
Lecture Notes in Computer Science
3787
, 2005, pp. 445-455
On algorithms for
(P_5,gem)
-free graphs
Hans L. Bodlaender
,
Andreas Brandstädt
,
Dieter Kratsch
,
Michaël Rao
,
Jeremy Spinrad
Theoretical Computer Science
349
(1), 2005, pp. 2-21
Scalar aggregation in inconsistent databases
Marcelo Arenas
,
Leopoldo Bertossi
,
Jan Chomicki
,
Xin He
,
Vijay Raghavan
,
Jeremy Spinrad
Theoretical Computer Science
296
(3), 2003, pp. 405-434
Robust algorithms for restricted domains
Vijay Raghavan
,
Jeremy Spinrad
Journal of Algorithms
48
(1), 2003, pp. 160-172
Domination graphs: Examples and counterexemples
Irena Rusu
,
Jeremy Spinrad
Discrete Applied Mathematics
110
(2-3), 2001, pp. 289-300
Construction of a simple elimination scheme for a chordal comparability graph in linear time
Richard B. Borie
,
Jeremy P. Spinrad
Discrete Applied Mathematics
91
(1-3), 1999, pp. 287-292
Graph classes: A survey
Andreas Brandstädt
,
Van Bang Le
,
Jeremy P. Spinrad
SIAM Monographs on Discrete Mathematics and Applications
, 1999, pp. xi, 304
Weakly triangulated comparability graphs
Elaine Eschen
,
Ryan B. Hayward
,
Jeremy Spinrad
,
R. Sritharan
SIAM Journal on Computing
29
(2), 1999, pp. 378-386
On treewidth and minimum fill-in of asteroidal triple-free graphs
Ton Kloks
,
Dieter Kratsch
,
Jeremy Spinrad
Theoretical Computer Science
175
(2), 1997, pp. 309-335
Linear-time transitive orientation
Ross M. McConnell
,
Jeremy P. Spinrad
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 19-25
Independent sets in circular-arc graphs
Wen-Lian Hsu
,
Jeremy P. Spinrad
Journal of Algorithms
19
(2), 1995, pp. 145-160
A polynomial algorithm for testing whether a graph is 3-Steiner distance hereditary
Ortrud Oellermann
,
Jeremy P. Spinrad
Information Processing Letters
55
, 1995, pp. 149-154
Algorithms for weakly triangulated graphs
Jeremy Spinrad
,
R. Sritharan
Discrete Applied Mathematics
59
, 1995, pp. 181-191
Nonredundant 1's in
\Gamma
-free matrices
Jeremy P. Spinrad
SIAM Journal on Discrete Mathematics
8
(2), 1995, pp. 251-257
An
O(n^2)
algorithm for undirected split decomposition
Tze-Heng Ma
,
Jeremy Spinrad
Journal of Algorithms
16
(1), 1994, pp. 145-160
On the 2-chain subgraph cover and related problems
Tze-Heng Ma
,
Jeremy P. Spinrad
Journal of Algorithms
17
(2), 1994, pp. 251-268
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
Ross M. McConnell
,
Jeremy P. Spinrad
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 536-545
Recognition of circle graphs
Jeremy Spinrad
Journal of Algorithms
16
(2), 1994, pp. 264-282
Seiten 1
2
>