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="Smith, J. Cole"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Integer programming models and algorithms for the graph decontamination problem with mobile agents
John Penuel
,
J. Cole Smith
,
Siqian Shen
Networks
61
(1), 2013, pp. 1-19
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
Siqian Shen
,
J. Cole Smith
Networks
60
(2), 2012, pp. 103-119
Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
April K. Andreas
,
J. Cole Smith
Networks
53
(2), 2009, pp. 91-103
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
Jennifer A. Horne
,
J. Cole Smith
Networks
46
(4), 2005, pp. 177-185
A dynamic programming algorithm for the conditional covering problem on tree graphs
Jennifer A. Horne
,
J. Cole Smith
Networks
46
(4), 2005, pp. 186-197
A stochastic integer programming approach to solving a synchronous optical network ring design problem
J. Cole Smith
,
Andrew J. Schaefer
,
Joyce W. Yen
Networks
44
(1), 2004, pp. 12-26