Borrow it
 Albert D. Cohen Management Library
 Architecture/Fine Arts Library
 Archives and Special Collections
 Bibliothèque AlfredMonnin (Université de SaintBoniface)
 Bill Larson Library (Grace Hospital)
 Carolyn Sifton  Helene Fuld Library (St. Boniface General Hospital)
 Concordia Hospital Library
 Donald W. Craik Engineering Library
 E.K. Williams Law Library
 EckhardtGramatté Music Library
 Elizabeth Dafoe Library
 Fr. H. Drake Library (St. Paul's College)
 J.W. Crane Memorial Library (Deer Lodge Centre)
 Libraries Annex (not open to the public; please see web page for details)
 Neil John Maclean Health Sciences Library
 Sciences and Technology Library
 Seven Oaks General Hospital Library
 Sister St. Odilon Library (Misericordia Health Centre)
 St. John's College Library
 Victoria General Hospital Library
 William R Newman Library (Agriculture)
The Resource Algorithms  ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
Algorithms  ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
Resource Information
The item Algorithms  ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Manitoba Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms  ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Manitoba Libraries.
This item is available to borrow from all library branches.
 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, 1721 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); – realworld 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
 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 kdTrees
 Range Searching in Categorical Data: Colored Range Searching on Grid
 NearLinear Time Approximation Algorithms for Curve Simplification
 Translating a Planar Object to Maximize Point Containment
 Approximation Algorithms for kLine Center
 New Heuristics and Lower Bounds for the MinMax kChinese Postman Problem
 SCIL — Symbolic Constraints in Integer Linear Programming
 Implementing I/Oefficient Data Structures Using TPIE
 On the kSplittable 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.375Approximation Algorithm for Sorting by Reversals
 Radio Labeling with Preassigned Frequencies
 BranchandBound Algorithms for the Test Cover Problem
 Constructing Plane Spanners of Bounded Degree and Low Weight
 Eager stOrdering
 ThreeDimensional Layers of Maxima
 Optimal Terrain Construction Problems and Applications in IntensityModulated Radiation Therapy
 Geometric Algorithms for DensityBased Data Clustering
 BalancedReplication Algorithms for Distribution Trees
 Butterflies and PeertoPeer 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
 Nonindependent 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 Online
 Vector Assignment Problems: A General Framework
 Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice
 Simple and Fast: Improving a BranchAndBound Algorithm for Maximum Clique
 Online Companion Caching
 Deterministic Communication in Radio Networks with Large Labels
 A Primal Approach to the Stable Set Problem
 WideSense Nonblocking WDM CrossConnects
 Efficient Implementation of a Minimal Triangulation Algorithm
 Scheduling Malleable Parallel Tasks: An Asymptotic Fully PolynomialTime Approximation Scheme
 The Probabilistic Analysis of a Greedy Satisfiability Algorithm
 Dynamic Additively Weighted Voronoi Diagrams in 2D
 TimeExpanded Graphs for FlowDependent Transit Times
 PartiallyOrdered Knapsack and Applications to Scheduling
 A Software Library for Elliptic Curve Cryptography
 RealTime 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
 OnLine DialaRide 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
 ExternalMemory BreadthFirst 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 UniformlyOriented Steiner Tree Problem
 A Fast, Accurate and Simple Method for Pricing EuropeanAsian and SavingAsian 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 Online on a Single Machine, Using Restarts
 HighLevel 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 2Connected Bipartite Plane Graphs
 Isbn
 9783540457497
 Label
 Algorithms  ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings
 Title
 Algorithms  ESA 2002
 Title remainder
 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings
 Statement of responsibility
 edited by Rolf Möhring, Rajeev Raman
 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, 1721 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); – realworld 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
 Dewey number
 005.11
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 huywgjKJ1bs
 qeu_fblVeVs
 Image bit depth
 0
 Language note
 English
 LC call number
 QA76.676.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 1721, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
 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 kdTrees  Range Searching in Categorical Data: Colored Range Searching on Grid  NearLinear Time Approximation Algorithms for Curve Simplification  Translating a Planar Object to Maximize Point Containment  Approximation Algorithms for kLine Center  New Heuristics and Lower Bounds for the MinMax kChinese Postman Problem  SCIL — Symbolic Constraints in Integer Linear Programming  Implementing I/Oefficient Data Structures Using TPIE  On the kSplittable 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.375Approximation Algorithm for Sorting by Reversals  Radio Labeling with Preassigned Frequencies  BranchandBound Algorithms for the Test Cover Problem  Constructing Plane Spanners of Bounded Degree and Low Weight  Eager stOrdering  ThreeDimensional Layers of Maxima  Optimal Terrain Construction Problems and Applications in IntensityModulated Radiation Therapy  Geometric Algorithms for DensityBased Data Clustering  BalancedReplication Algorithms for Distribution Trees  Butterflies and PeertoPeer 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  Nonindependent 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 Online  Vector Assignment Problems: A General Framework  Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice  Simple and Fast: Improving a BranchAndBound Algorithm for Maximum Clique  Online Companion Caching  Deterministic Communication in Radio Networks with Large Labels  A Primal Approach to the Stable Set Problem  WideSense Nonblocking WDM CrossConnects  Efficient Implementation of a Minimal Triangulation Algorithm  Scheduling Malleable Parallel Tasks: An Asymptotic Fully PolynomialTime Approximation Scheme  The Probabilistic Analysis of a Greedy Satisfiability Algorithm  Dynamic Additively Weighted Voronoi Diagrams in 2D  TimeExpanded Graphs for FlowDependent Transit Times  PartiallyOrdered Knapsack and Applications to Scheduling  A Software Library for Elliptic Curve Cryptography  RealTime 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  OnLine DialaRide 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  ExternalMemory BreadthFirst 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 UniformlyOriented Steiner Tree Problem  A Fast, Accurate and Simple Method for Pricing EuropeanAsian and SavingAsian 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 Online on a Single Machine, Using Restarts  HighLevel 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 2Connected 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/3540457496
 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
 (DEHe213)9783540457497
 (MiAaPQ)EBC3072966
 (EXLCZ)991000000000211849
 Label
 Algorithms  ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
 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 kdTrees  Range Searching in Categorical Data: Colored Range Searching on Grid  NearLinear Time Approximation Algorithms for Curve Simplification  Translating a Planar Object to Maximize Point Containment  Approximation Algorithms for kLine Center  New Heuristics and Lower Bounds for the MinMax kChinese Postman Problem  SCIL — Symbolic Constraints in Integer Linear Programming  Implementing I/Oefficient Data Structures Using TPIE  On the kSplittable 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.375Approximation Algorithm for Sorting by Reversals  Radio Labeling with Preassigned Frequencies  BranchandBound Algorithms for the Test Cover Problem  Constructing Plane Spanners of Bounded Degree and Low Weight  Eager stOrdering  ThreeDimensional Layers of Maxima  Optimal Terrain Construction Problems and Applications in IntensityModulated Radiation Therapy  Geometric Algorithms for DensityBased Data Clustering  BalancedReplication Algorithms for Distribution Trees  Butterflies and PeertoPeer 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  Nonindependent 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 Online  Vector Assignment Problems: A General Framework  Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice  Simple and Fast: Improving a BranchAndBound Algorithm for Maximum Clique  Online Companion Caching  Deterministic Communication in Radio Networks with Large Labels  A Primal Approach to the Stable Set Problem  WideSense Nonblocking WDM CrossConnects  Efficient Implementation of a Minimal Triangulation Algorithm  Scheduling Malleable Parallel Tasks: An Asymptotic Fully PolynomialTime Approximation Scheme  The Probabilistic Analysis of a Greedy Satisfiability Algorithm  Dynamic Additively Weighted Voronoi Diagrams in 2D  TimeExpanded Graphs for FlowDependent Transit Times  PartiallyOrdered Knapsack and Applications to Scheduling  A Software Library for Elliptic Curve Cryptography  RealTime 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  OnLine DialaRide 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  ExternalMemory BreadthFirst 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 UniformlyOriented Steiner Tree Problem  A Fast, Accurate and Simple Method for Pricing EuropeanAsian and SavingAsian 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 Online on a Single Machine, Using Restarts  HighLevel 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 2Connected 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/3540457496
 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
 (DEHe213)9783540457497
 (MiAaPQ)EBC3072966
 (EXLCZ)991000000000211849
Subject
 Algorithm Analysis and Problem Complexity
 Computational complexity
 Computer Graphics
 Computer graphics
 Computer science
 Computer software
 Data Structures
 Data structures (Computer scienc
 Discrete Mathematics in Computer Science
 Electronic data processing
 Numeric Computing
 Programming Techniques
Member of
Library Locations

Albert D. Cohen Management LibraryBorrow it181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA49.807878 97.129961


Archives and Special CollectionsBorrow it25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Bibliothèque AlfredMonnin (Université de SaintBoniface)Borrow it200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA49.888861 97.119735

Bill Larson Library (Grace Hospital)Borrow it300 Booth Drive, G227, Winnipeg, MB, R3J 3M7, CA49.882400 97.276436

Carolyn Sifton  Helene Fuld Library (St. Boniface General Hospital)Borrow it409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA49.883388 97.126050

Concordia Hospital LibraryBorrow it1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA49.913252 97.064683

Donald W. Craik Engineering LibraryBorrow it75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA49.809053 97.133292


EckhardtGramatté Music LibraryBorrow it136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA49.807964 97.132222

Elizabeth Dafoe LibraryBorrow it25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Fr. H. Drake Library (St. Paul's College)Borrow it70 Dysart Road, Winnipeg, MB, R3T 2M6, CA49.810605 97.138184

J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA49.878000 97.235520

Libraries Annex (not open to the public; please see web page for details)Borrow it25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA49.809961 97.131878

Neil John Maclean Health Sciences LibraryBorrow it727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA49.903563 97.160554

Sciences and Technology LibraryBorrow it186 Dysart Road, Winnipeg, MB, R3T 2M8, CA49.811526 97.133257

Seven Oaks General Hospital LibraryBorrow it2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA49.955177 97.148865

Sister St. Odilon Library (Misericordia Health Centre)Borrow it99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA49.879592 97.160425


Victoria General Hospital LibraryBorrow it2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA49.806755 97.152739

William R Newman Library (Agriculture)Borrow it66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA49.806936 97.135525
Library Links
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.lib.umanitoba.ca/portal/AlgorithmsESA200210thAnnualEuropean/G2Pr35byKPI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.umanitoba.ca/portal/AlgorithmsESA200210thAnnualEuropean/G2Pr35byKPI/">Algorithms  ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.lib.umanitoba.ca/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.umanitoba.ca/">University of Manitoba Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms  ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.lib.umanitoba.ca/portal/AlgorithmsESA200210thAnnualEuropean/G2Pr35byKPI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.lib.umanitoba.ca/portal/AlgorithmsESA200210thAnnualEuropean/G2Pr35byKPI/">Algorithms  ESA 2002 : 10th Annual European Symposium, Rome, Italy, September 1721, 2002, Proceedings, edited by Rolf Möhring, Rajeev Raman, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.lib.umanitoba.ca/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.lib.umanitoba.ca/">University of Manitoba Libraries</a></span></span></span></span></div>