Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Proskurowski, Andrzej - Department of Computer and Information Science, University of Oregon
Embeddings of k-connected graphs of pathwidth k
The Complexity of Minimizing Certain Cost Metrics for kSource Spanning Trees
Faster Algorithms for Subgraph Isomorphism of k-connected Partial k-trees
Multi-source Spanning Trees: Algorithms for Minimizing Source Eccentricities
Multicoloring Trees Magn us M. Halld orsson y Guy Kortsarz z Andrzej Proskurowski x
Journal of Interconnection Networks c World Scienti c Publishing Company
Internationalization of Computer Science Education Sarah Douglas, Art Farley, Ginnie Lo, Andrzej Proskurowski, Michal Young
On routing of wavebands for gossiping in all-optical paths and Michele Flammini z Alfredo Navarra x Andrzej Proskurowski {
Minimum SelfRepairing Graphs Arthur M. Farley and Andrzej Proskurowski \Lambda
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
Extremal graphs having no matching cuts Paul Bonsma Arthur M. Farley Andrzej Proskurowski
!"$#%&&'()0 1 3245768(!9&@AB CEDE@FE!"HGIPRQ!ES
Canonical representations of partial 2 and 3trees Stefan Arnborg \Lambda
Memory requirements for table computations in partial ktree algorithms
BIT32 (1992), 197-214. CANONICAL REPRESENTATIONS OF PARTIAL 2-AND
