Borrow it
Coverart for item
The Resource Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)

Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)

Creator
Editor
Contributor
Summary
This volume contains the 74 contributed papers and abstracts of 4 of the 5 invited talks presented at the 10th Annual European Symposium on Algorithms (ESA 2002), held at the University of Rome “La Sapienza”, Rome, Italy, 17-21 September, 2002. For the ?rst time, ESA had two tracks, with separate program committees, which dealt respectively with: – the design and mathematical analysis of algorithms (the “Design and An- ysis” track); – real-world applications, engineering and experimental analysis of algorithms (the “Engineering and Applications” track). Previous ESAs were held in Bad Honnef, Germany (1993); Utrecht, The Neth- lands (1994); Corfu, Greece (1995); Barcelona, Spain (1996); Graz, Austria (1997); Venice, Italy (1998); Prague, Czech Republic (1999); Saarbruc ̈ ken, Ger- ? many (2000), and Arhus, Denmark (2001). The predecessor to the Engineering and Applications track of ESA was the Annual Workshop on Algorithm En- neering (WAE). Previous WAEs were held in Venice, Italy (1997), Saarbruc ̈ ken, ? Germany (1998), London, UK (1999), Saarbru ̈cken, Germany (2000), and Arhus, Denmark (2001). The proceedings of the previous ESAs were published as Springer LNCS volumes 726, 855, 979, 1284, 1461, 1643, 1879, and 2161. The proceedings of WAEs from 1999 onwards were published as Springer LNCS volumes 1668, 1982, and 2161
Language
  • eng
  • eng
Work
Publication
Edition
1st ed. 2002.
Extent
1 online resource (XXVIII, 919 p.)
Note
Bibliographic Level Mode of Issuance: Monograph
Contents
  • Invited Lectures
  • Solving Traveling Salesman Problems
  • Computing Shapes from Point Cloud Data
  • Mechanism Design for Fun and Profit
  • On Distance Oracles and Routing in Graphs
  • Contributed Papers
  • Kinetic Medians and kd-Trees
  • Range Searching in Categorical Data: Colored Range Searching on Grid
  • Near-Linear Time Approximation Algorithms for Curve Simplification
  • Translating a Planar Object to Maximize Point Containment
  • Approximation Algorithms for k-Line Center
  • New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman Problem
  • SCIL — Symbolic Constraints in Integer Linear Programming
  • Implementing I/O-efficient Data Structures Using TPIE
  • On the k-Splittable Flow Problem
  • Partial Alphabetic Trees
  • Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router
  • Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
  • Two Simplified Algorithms for Maintaining Order in a List
  • Efficient Tree Layout in a Multilevel Memory Hierarchy
  • A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
  • TSP with Neighborhoods of Varying Size
  • 1.375-Approximation Algorithm for Sorting by Reversals
  • Radio Labeling with Pre-assigned Frequencies
  • Branch-and-Bound Algorithms for the Test Cover Problem
  • Constructing Plane Spanners of Bounded Degree and Low Weight
  • Eager st-Ordering
  • Three-Dimensional Layers of Maxima
  • Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy
  • Geometric Algorithms for Density-Based Data Clustering
  • Balanced-Replication Algorithms for Distribution Trees
  • Butterflies and Peer-to-Peer Networks
  • Estimating Rarity and Similarity over Data Stream Windows
  • Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels
  • Frequency Estimation of Internet Packet Streams with Limited Space
  • Truthful and Competitive Double Auctions
  • Optimal Graph Exploration without Good Maps
  • Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee
  • Non-independent Randomized Rounding and an Application to Digital Halftoning
  • Computing Homotopic Shortest Paths Efficiently
  • An Algorithm for Dualization in Products of Lattices and Its Applications
  • Determining Similarity of Conformational Polymorphs
  • Minimizing the Maximum Starting Time On-line
  • Vector Assignment Problems: A General Framework
  • Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice
  • Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique
  • Online Companion Caching
  • Deterministic Communication in Radio Networks with Large Labels
  • A Primal Approach to the Stable Set Problem
  • Wide-Sense Nonblocking WDM Cross-Connects
  • Efficient Implementation of a Minimal Triangulation Algorithm
  • Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
  • The Probabilistic Analysis of a Greedy Satisfiability Algorithm
  • Dynamic Additively Weighted Voronoi Diagrams in 2D
  • Time-Expanded Graphs for Flow-Dependent Transit Times
  • Partially-Ordered Knapsack and Applications to Scheduling
  • A Software Library for Elliptic Curve Cryptography
  • Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows
  • Randomized Approximation Algorithms for Query Optimization Problems on Two Processors
  • Covering Things with Things
  • On-Line Dial-a-Ride Problems under a Restricted Information Model
  • Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
  • Engineering a Lightweight Suffix Array Construction Algorithm
  • Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations
  • External-Memory Breadth-First Search with Sublinear I/O
  • Frequency Channel Assignment on Planar Networks
  • Design and Implementation of Efficient Data Types for Static Graphs
  • An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem
  • A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options
  • Sorting 13 Elements Requires 34 Comparisons
  • Extending Reduction Techniques for the Steiner Tree Problem
  • A Comparison of Multicast Pull Models
  • Online Scheduling for Sorting Buffers
  • Finding the Sink Takes Some Time
  • Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design
  • Minimizing Makespan and Preemption Costs on a System of Uniform Machines
  • Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts
  • High-Level Filtering for Arrangements of Conic Arcs
  • An Approximation Scheme for Cake Division with a Linear Number of Cuts
  • A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs
Isbn
9783540457497
Instance
Label
Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings
Title
Algorithms - ESA 2002
Title remainder
10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings
Statement of responsibility
edited by Rolf Möhring, Rajeev Raman
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Summary
This volume contains the 74 contributed papers and abstracts of 4 of the 5 invited talks presented at the 10th Annual European Symposium on Algorithms (ESA 2002), held at the University of Rome “La Sapienza”, Rome, Italy, 17-21 September, 2002. For the ?rst time, ESA had two tracks, with separate program committees, which dealt respectively with: – the design and mathematical analysis of algorithms (the “Design and An- ysis” track); – real-world applications, engineering and experimental analysis of algorithms (the “Engineering and Applications” track). Previous ESAs were held in Bad Honnef, Germany (1993); Utrecht, The Neth- lands (1994); Corfu, Greece (1995); Barcelona, Spain (1996); Graz, Austria (1997); Venice, Italy (1998); Prague, Czech Republic (1999); Saarbruc ̈ ken, Ger- ? many (2000), and Arhus, Denmark (2001). The predecessor to the Engineering and Applications track of ESA was the Annual Workshop on Algorithm En- neering (WAE). Previous WAEs were held in Venice, Italy (1997), Saarbruc ̈ ken, ? Germany (1998), London, UK (1999), Saarbru ̈cken, Germany (2000), and Arhus, Denmark (2001). The proceedings of the previous ESAs were published as Springer LNCS volumes 726, 855, 979, 1284, 1461, 1643, 1879, and 2161. The proceedings of WAEs from 1999 onwards were published as Springer LNCS volumes 1668, 1982, and 2161
Member of
Dewey number
005.11
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • huywgjKJ1bs
  • qeu_fblVeVs
Image bit depth
0
Language note
English
LC call number
QA76.6-76.66
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingName
ESA 2002
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • Möhring, Rolf.
  • Raman, Rajeev.
Series statement
Lecture Notes in Computer Science,
Series volume
2461
http://library.link/vocab/subjectName
  • Computer science
  • Computer software
  • Computational complexity
  • Electronic data processing
  • Data structures (Computer scienc
  • Computer graphics
  • Programming Techniques
  • Algorithm Analysis and Problem Complexity
  • Discrete Mathematics in Computer Science
  • Numeric Computing
  • Data Structures
  • Computer Graphics
Label
Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references at the end of each chapters and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Invited Lectures -- Solving Traveling Salesman Problems -- Computing Shapes from Point Cloud Data -- Mechanism Design for Fun and Profit -- On Distance Oracles and Routing in Graphs -- Contributed Papers -- Kinetic Medians and kd-Trees -- Range Searching in Categorical Data: Colored Range Searching on Grid -- Near-Linear Time Approximation Algorithms for Curve Simplification -- Translating a Planar Object to Maximize Point Containment -- Approximation Algorithms for k-Line Center -- New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman Problem -- SCIL — Symbolic Constraints in Integer Linear Programming -- Implementing I/O-efficient Data Structures Using TPIE -- On the k-Splittable Flow Problem -- Partial Alphabetic Trees -- Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router -- Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy -- Two Simplified Algorithms for Maintaining Order in a List -- Efficient Tree Layout in a Multilevel Memory Hierarchy -- A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons -- TSP with Neighborhoods of Varying Size -- 1.375-Approximation Algorithm for Sorting by Reversals -- Radio Labeling with Pre-assigned Frequencies -- Branch-and-Bound Algorithms for the Test Cover Problem -- Constructing Plane Spanners of Bounded Degree and Low Weight -- Eager st-Ordering -- Three-Dimensional Layers of Maxima -- Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy -- Geometric Algorithms for Density-Based Data Clustering -- Balanced-Replication Algorithms for Distribution Trees -- Butterflies and Peer-to-Peer Networks -- Estimating Rarity and Similarity over Data Stream Windows -- Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels -- Frequency Estimation of Internet Packet Streams with Limited Space -- Truthful and Competitive Double Auctions -- Optimal Graph Exploration without Good Maps -- Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee -- Non-independent Randomized Rounding and an Application to Digital Halftoning -- Computing Homotopic Shortest Paths Efficiently -- An Algorithm for Dualization in Products of Lattices and Its Applications -- Determining Similarity of Conformational Polymorphs -- Minimizing the Maximum Starting Time On-line -- Vector Assignment Problems: A General Framework -- Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice -- Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique -- Online Companion Caching -- Deterministic Communication in Radio Networks with Large Labels -- A Primal Approach to the Stable Set Problem -- Wide-Sense Nonblocking WDM Cross-Connects -- Efficient Implementation of a Minimal Triangulation Algorithm -- Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme -- The Probabilistic Analysis of a Greedy Satisfiability Algorithm -- Dynamic Additively Weighted Voronoi Diagrams in 2D -- Time-Expanded Graphs for Flow-Dependent Transit Times -- Partially-Ordered Knapsack and Applications to Scheduling -- A Software Library for Elliptic Curve Cryptography -- Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows -- Randomized Approximation Algorithms for Query Optimization Problems on Two Processors -- Covering Things with Things -- On-Line Dial-a-Ride Problems under a Restricted Information Model -- Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs -- Engineering a Lightweight Suffix Array Construction Algorithm -- Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations -- External-Memory Breadth-First Search with Sublinear I/O -- Frequency Channel Assignment on Planar Networks -- Design and Implementation of Efficient Data Types for Static Graphs -- An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem -- A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options -- Sorting 13 Elements Requires 34 Comparisons -- Extending Reduction Techniques for the Steiner Tree Problem -- A Comparison of Multicast Pull Models -- Online Scheduling for Sorting Buffers -- Finding the Sink Takes Some Time -- Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design -- Minimizing Makespan and Preemption Costs on a System of Uniform Machines -- Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts -- High-Level Filtering for Arrangements of Conic Arcs -- An Approximation Scheme for Cake Division with a Linear Number of Cuts -- A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs
Dimensions
unknown
Edition
1st ed. 2002.
Extent
1 online resource (XXVIII, 919 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540457497
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/3-540-45749-6
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000211849
  • (SSID)ssj0000321191
  • (PQKBManifestationID)11255492
  • (PQKBTitleCode)TC0000321191
  • (PQKBWorkID)10263099
  • (PQKB)11778442
  • (DE-He213)978-3-540-45749-7
  • (MiAaPQ)EBC3072966
  • (EXLCZ)991000000000211849
Label
Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references at the end of each chapters and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Invited Lectures -- Solving Traveling Salesman Problems -- Computing Shapes from Point Cloud Data -- Mechanism Design for Fun and Profit -- On Distance Oracles and Routing in Graphs -- Contributed Papers -- Kinetic Medians and kd-Trees -- Range Searching in Categorical Data: Colored Range Searching on Grid -- Near-Linear Time Approximation Algorithms for Curve Simplification -- Translating a Planar Object to Maximize Point Containment -- Approximation Algorithms for k-Line Center -- New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman Problem -- SCIL — Symbolic Constraints in Integer Linear Programming -- Implementing I/O-efficient Data Structures Using TPIE -- On the k-Splittable Flow Problem -- Partial Alphabetic Trees -- Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router -- Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy -- Two Simplified Algorithms for Maintaining Order in a List -- Efficient Tree Layout in a Multilevel Memory Hierarchy -- A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons -- TSP with Neighborhoods of Varying Size -- 1.375-Approximation Algorithm for Sorting by Reversals -- Radio Labeling with Pre-assigned Frequencies -- Branch-and-Bound Algorithms for the Test Cover Problem -- Constructing Plane Spanners of Bounded Degree and Low Weight -- Eager st-Ordering -- Three-Dimensional Layers of Maxima -- Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy -- Geometric Algorithms for Density-Based Data Clustering -- Balanced-Replication Algorithms for Distribution Trees -- Butterflies and Peer-to-Peer Networks -- Estimating Rarity and Similarity over Data Stream Windows -- Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels -- Frequency Estimation of Internet Packet Streams with Limited Space -- Truthful and Competitive Double Auctions -- Optimal Graph Exploration without Good Maps -- Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee -- Non-independent Randomized Rounding and an Application to Digital Halftoning -- Computing Homotopic Shortest Paths Efficiently -- An Algorithm for Dualization in Products of Lattices and Its Applications -- Determining Similarity of Conformational Polymorphs -- Minimizing the Maximum Starting Time On-line -- Vector Assignment Problems: A General Framework -- Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice -- Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique -- Online Companion Caching -- Deterministic Communication in Radio Networks with Large Labels -- A Primal Approach to the Stable Set Problem -- Wide-Sense Nonblocking WDM Cross-Connects -- Efficient Implementation of a Minimal Triangulation Algorithm -- Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme -- The Probabilistic Analysis of a Greedy Satisfiability Algorithm -- Dynamic Additively Weighted Voronoi Diagrams in 2D -- Time-Expanded Graphs for Flow-Dependent Transit Times -- Partially-Ordered Knapsack and Applications to Scheduling -- A Software Library for Elliptic Curve Cryptography -- Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows -- Randomized Approximation Algorithms for Query Optimization Problems on Two Processors -- Covering Things with Things -- On-Line Dial-a-Ride Problems under a Restricted Information Model -- Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs -- Engineering a Lightweight Suffix Array Construction Algorithm -- Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations -- External-Memory Breadth-First Search with Sublinear I/O -- Frequency Channel Assignment on Planar Networks -- Design and Implementation of Efficient Data Types for Static Graphs -- An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem -- A Fast, Accurate and Simple Method for Pricing European-Asian and Saving-Asian Options -- Sorting 13 Elements Requires 34 Comparisons -- Extending Reduction Techniques for the Steiner Tree Problem -- A Comparison of Multicast Pull Models -- Online Scheduling for Sorting Buffers -- Finding the Sink Takes Some Time -- Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design -- Minimizing Makespan and Preemption Costs on a System of Uniform Machines -- Minimizing the Total Completion Time On-line on a Single Machine, Using Restarts -- High-Level Filtering for Arrangements of Conic Arcs -- An Approximation Scheme for Cake Division with a Linear Number of Cuts -- A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs
Dimensions
unknown
Edition
1st ed. 2002.
Extent
1 online resource (XXVIII, 919 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540457497
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/3-540-45749-6
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000211849
  • (SSID)ssj0000321191
  • (PQKBManifestationID)11255492
  • (PQKBTitleCode)TC0000321191
  • (PQKBWorkID)10263099
  • (PQKB)11778442
  • (DE-He213)978-3-540-45749-7
  • (MiAaPQ)EBC3072966
  • (EXLCZ)991000000000211849

Subject

Member of

Library Locations

  • Albert D. Cohen Management LibraryBorrow it
    181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA
    49.807878 -97.129961
  • Architecture/Fine Arts LibraryBorrow it
    84 Curry Place, Winnipeg, MB, CA
    49.807716 -97.136226
  • Archives and Special CollectionsBorrow it
    25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Bibliothèque Alfred-Monnin (Université de Saint-Boniface)Borrow it
    200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA
    49.888861 -97.119735
  • Bill Larson Library (Grace Hospital)Borrow it
    300 Booth Drive, G-227, Winnipeg, MB, R3J 3M7, CA
    49.882400 -97.276436
  • Carolyn Sifton - Helene Fuld Library (St. Boniface General Hospital)Borrow it
    409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA
    49.883388 -97.126050
  • Concordia Hospital LibraryBorrow it
    1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA
    49.913252 -97.064683
  • Donald W. Craik Engineering LibraryBorrow it
    75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA
    49.809053 -97.133292
  • E.K. Williams Law LibraryBorrow it
    224 Dysart Road, Winnipeg, MB, R3T 5V4, CA
    49.811829 -97.131017
  • Eckhardt-Gramatté Music LibraryBorrow it
    136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA
    49.807964 -97.132222
  • Elizabeth Dafoe LibraryBorrow it
    25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Fr. H. Drake Library (St. Paul's College)Borrow it
    70 Dysart Road, Winnipeg, MB, R3T 2M6, CA
    49.810605 -97.138184
  • J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it
    2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA
    49.878000 -97.235520
  • Libraries Annex (not open to the public; please see web page for details)Borrow it
    25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Neil John Maclean Health Sciences LibraryBorrow it
    727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA
    49.903563 -97.160554
  • Sciences and Technology LibraryBorrow it
    186 Dysart Road, Winnipeg, MB, R3T 2M8, CA
    49.811526 -97.133257
  • Seven Oaks General Hospital LibraryBorrow it
    2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA
    49.955177 -97.148865
  • Sister St. Odilon Library (Misericordia Health Centre)Borrow it
    99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA
    49.879592 -97.160425
  • St. John's College LibraryBorrow it
    92 Dysart Road, Winnipeg, MB, R3T 2M5, CA
    49.811242 -97.137156
  • Victoria General Hospital LibraryBorrow it
    2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA
    49.806755 -97.152739
  • William R Newman Library (Agriculture)Borrow it
    66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA
    49.806936 -97.135525

Library Links

Zepheira Logo
Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Manitoba Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...