Borrow it
Coverart for item
The Resource Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, edited by Tetsuo Asano, (electronic resource)

Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, edited by Tetsuo Asano, (electronic resource)

Work
Publication
Edition
1st ed. 2006.
Extent
1 online resource (XX, 766 p.)
Note
Bibliographic Level Mode of Issuance: Monograph
Contents
  • Invited Talks
  • Stable Matching Problems
  • Delaunay Meshing of Surfaces
  • Best Paper 2006
  • Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction
  • Best Student Paper 2006
  • Branching and Treewidth Based Exact Algorithms
  • Session 1A: Algorithms and Data Structures
  • Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees
  • Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
  • Flexible Word Design and Graph Labeling
  • Session 1B: Online Algorithms
  • Frequency Allocation Problems for Linear Cellular Networks
  • Finite-State Online Algorithms and Their Automated Competitive Analysis
  • Offline Sorting Buffers on Line
  • Session 2A: Approximation Algorithms
  • Approximating Tree Edit Distance Through String Edit Distance
  • A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees
  • Improved Approximation for Single-Sink Buy-at-Bulk
  • Approximability of Partitioning Graphs with Supply and Demand
  • Session 2B: Graphs
  • Convex Grid Drawings of Plane Graphs with Rectangular Contours
  • Algorithms on Graphs with Small Dominating Targets
  • Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
  • On Estimating Path Aggregates over Streaming Graphs
  • Session 3A: Computational Geometry
  • Diamond Triangulations Contain Spanners of Bounded Degree
  • Optimal Construction of the City Voronoi Diagram
  • Relations Between Two Common Types of Rectangular Tilings
  • Quality Tetrahedral Mesh Generation for Macromolecules
  • On Approximating the TSP with Intersecting Neighborhoods
  • Session 3B: Computational Complexity
  • Negation-Limited Complexity of Parity and Inverters
  • The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
  • Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete
  • Parameterized Problems on Coincidence Graphs
  • On 2-Query Codeword Testing with Near-Perfect Completeness
  • Session 4A: Algorithms and Data Structures
  • Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance
  • Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
  • On Locating Disjoint Segments with Maximum Sum of Densities
  • Two-Tier Relaxed Heaps
  • Session 4B: Games and Networks
  • The Interval Liar Game
  • How Much Independent Should Individual Contacts Be to Form a Small–World?
  • Faster Centralized Communication in Radio Networks
  • On the Runtime and Robustness of Randomized Broadcasting
  • Session 5A: Combinatorial Optimization and Computational Biology
  • Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
  • Non-cooperative Facility Location and Covering Games
  • Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
  • Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
  • Algorithms for Computing Variants of the Longest Common Subsequence Problem
  • Session 5B: Graphs
  • Constructing Labeling Schemes Through Universal Matrices
  • Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions
  • Analyzing Disturbed Diffusion on Networks
  • Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
  • On Isomorphism and Canonization of Tournaments and Hypertournaments
  • Session 6A: Algorithms and Data Structures
  • Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem
  • Deterministic Random Walks on the Two-Dimensional Grid
  • Improving Time and Space Complexity for Compressed Pattern Matching
  • Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems
  • Session 6B: Graphs
  • A Simple Message Passing Algorithm for Graph Partitioning Problems
  • Minimal Interval Completion Through Graph Exploration
  • Balanced Cut Approximation in Random Geometric Graphs
  • Improved Algorithms for the Minmax-Regret 1-Center Problem
  • Session 7A: Approximation Algorithms
  • On Approximating the Maximum Simple Sharing Problem
  • Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
  • Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems
  • Session 7B: Graphs
  • Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii
  • Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
  • Intuitive Algorithms and t-Vertex Cover
  • Session 8A: Combinatorial Optimization and Quantum Computing
  • Politician’s Firefighting
  • Runtime Analysis of a Simple Ant Colony Optimization Algorithm
  • Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
  • Resources Required for Preparing Graph States
  • Session 8B: Online Algorithms
  • Online Multi-path Routing in a Maze
  • On the On-Line k-Truck Problem with Benefit Maximization
  • Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels
  • Online Packet Admission and Oblivious Routing in Sensor Networks
  • Session 9A: Computational Geometry
  • Field Splitting Problems in Intensity-Modulated Radiation Therapy
  • Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy
  • A New Approximation Algorithm for Multidimensional Rectangle Tiling
  • Tessellation of Quadratic Elements
  • Session 9B: Distributed Computing and Cryptography
  • Effective Elections for Anonymous Mobile Agents
  • Gathering Asynchronous Oblivious Mobile Robots in a Ring
  • Provably Secure Steganography and the Complexity of Sampling
Isbn
9783540496960
Instance
Label
Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
Title
Algorithms and Computation
Title remainder
17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
Statement of responsibility
edited by Tetsuo Asano
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Member of
Is Subseries of
http://bibfra.me/vocab/relation/corporateauthor
7VJvaMPGfoQ
Dewey number
005.1
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
wfmE5LyGtAs
Image bit depth
0
Language note
English
LC call number
QA76.6-76.66
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2006
http://bibfra.me/vocab/lite/meetingName
ISAAC (Conference)
Nature of contents
dictionaries
http://bibfra.me/vocab/lite/organizationName
ISAAC (Conference)
http://library.link/vocab/relatedWorkOrContributorName
  • ISAAC (Conference)
  • Asano, Tetsuo.
Series statement
Theoretical Computer Science and General Issues
Series volume
4288
http://library.link/vocab/subjectName
  • Computer science
  • Computer software
  • Computational complexity
  • Electronic data processing
  • Computer Communication Networks
  • Computer graphics
  • Programming Techniques
  • Algorithm Analysis and Problem Complexity
  • Discrete Mathematics in Computer Science
  • Numeric Computing
  • Computer Communication Networks
  • Computer Graphics
Label
Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, edited by Tetsuo Asano, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Invited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small–World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid -- Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician’s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session 9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling
Dimensions
unknown
Edition
1st ed. 2006.
Extent
1 online resource (XX, 766 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540496960
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/11940128
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000283730
  • (SSID)ssj0000316180
  • (PQKBManifestationID)11273113
  • (PQKBTitleCode)TC0000316180
  • (PQKBWorkID)10263185
  • (PQKB)10696669
  • (DE-He213)978-3-540-49696-0
  • (MiAaPQ)EBC3068628
  • (EXLCZ)991000000000283730
Label
Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, edited by Tetsuo Asano, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and author index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
Contents
Invited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small–World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid -- Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician’s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session 9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling
Dimensions
unknown
Edition
1st ed. 2006.
Extent
1 online resource (XX, 766 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540496960
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/11940128
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000283730
  • (SSID)ssj0000316180
  • (PQKBManifestationID)11273113
  • (PQKBTitleCode)TC0000316180
  • (PQKBWorkID)10263185
  • (PQKB)10696669
  • (DE-He213)978-3-540-49696-0
  • (MiAaPQ)EBC3068628
  • (EXLCZ)991000000000283730

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 ...