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="Blair, Jean R.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An efficient self-stabilizing distance-2 coloring algorithm
Jean R.S. Blair
,
Fredrik Manne
Theoretical Computer Science
444
, 2012, pp. 28-39
Maximum cardinality search for computing minimal triangulations of graphs
Anne Berry
,
Jean R.S. Blair
,
Pinar Heggernes
,
Barry W. Peyton
Algorithmica
39
(4), 2004, pp. 287-298
Maximum cardinality search for computing minimal triangulations
Anne Berry
,
Jean R.S. Blair
,
Pinar Heggernes
Lecture Notes in Computer Science
2573
, 2002, pp. 1-12
A practical algorithm for making filled graphs minimal
Jean R.S. Blair
,
Pinar Heggernes
,
Jan Arne Telle
Theoretical Computer Science
250
(1-2), 2001, pp. 125-141
Making an arbitrary filled graph minimal by removing fill edges
Jean R.S. Blair
,
Pinar Heggernes
,
Jan Arne Telle
Lecture Notes in Computer Science
1097
, 1996, pp. 173-184
River routing with a generalized model
Jean R.S. Blair
,
Errol L. Lloyd
Journal of Computer and System Sciences
53
(3), 1996, pp. 525-544
The efficiency of AC graphs
Jean R.S. Blair
Discrete Applied Mathematics
44
(1-3), 1993, pp. 119-138
The benefits of external wires in single row routing
Jean R.S. Blair
,
Errol L. Lloyd
Information Processing Letters
40
, 1991, pp. 43-49
Minimizing channel density in standard cell layout
Jean R.S. Blair
,
S. Kapoor
,
Errol L. Lloyd
,
Kenneth J. Supowit
Algorithmica
2
, 1987, pp. 267-282