Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Algorithms and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings, edited by Rudolf Fleischer, Gerhard Trippen, (electronic resource)
Algorithms and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings, edited by Rudolf Fleischer, Gerhard Trippen, (electronic resource)
Resource Information
The item Algorithms and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings, edited by Rudolf Fleischer, Gerhard Trippen, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings, edited by Rudolf Fleischer, Gerhard Trippen, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 This volume contains the proceedings of the 15th Annual International Sym sium on Algorithms and Computation (ISAAC 2004), held in Hong Kong, 20–22 December, 2004. In the past, it has been held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), and Kyoto (2003). ISAAC is an annual international symposium that covers a wide range of topics,namelyalgorithmsandcomputation.Themainpurposeofthesymposium is to provide a forum for researchers working in the active research community of algorithms and the theory of computation to present and exchange new ideas. In response to our call for papers we received 226 submissions. The task of selectingthepapersinthisvolumewasdonebyourprogramcommitteeandother referees. After a thorough review process the committee selected 76 papers, the decisions being based on originality and relevance to the ?eld of algorithms and computation. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications, with selected papers from ISAAC 2004 are in preparation. Thebeststudentpaperawardwillbegivenfor“Geometricoptimizationpr lems over sliding windows” by Bashir S. Sadjad and Timothy M. Chan from the University of Waterloo. Two eminent invited speakers, Prof. Erik D. Demaine, MIT, and Prof. David M. Mount, University of Maryland, also contributed to this volume
 Language

 eng
 eng
 Edition
 1st ed. 2005.
 Extent
 1 online resource (XVII, 935 p.)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Contents

 Puzzles, Art, and Magic with Algorithms
 The ABCs of AVDs: Geometric Retrieval Made Simple
 Pareto Optimality in House Allocation Problems
 PropertyPreserving Data Reconstruction
 On the Monotone Circuit Complexity of Quadratic Boolean Functions
 Generalized Function Matching
 Approximate Distance Oracles for Graphs with Dense Clusters
 Multicriteria Global Minimum Cuts
 Polyline Fitting of Planar Points Under Minsum Criteria
 A Generalization of Magic Squares with Applications to Digital Halftoning
 Voronoi Diagrams with a Transportation Network on the Euclidean Plane
 Structural Alignment of Two RNA Sequences with Lagrangian Relaxation
 PolyAPX and PTASCompleteness in Standard and Differential Approximation
 Efficient Algorithms for k Maximum Sums
 Equipartitions of Measures by 2Fans
 Augmenting the EdgeConnectivity of a Spider Tree
 On Nash Equilibria for Multicast Transmissions in AdHoc Wireless Networks
 Structural Similarity in Graphs
 Flexibility of Steiner Trees in Uniform Orientation Metrics
 Random Access to Advice Strings and Collapsing Results
 Bounding the Payment of Approximate Truthful Mechanisms
 The Polymatroid Steiner Problems
 Geometric Optimization Problems Over Sliding Windows
 OnLine Windows Scheduling of Temporary Items
 Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy
 An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem
 On the Range MaximumSum Segment Query Problem
 An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
 Efficient Job Scheduling Algorithms with Multitype Contentions
 Superimposing Voronoi Complexes for Shape Deformation
 On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
 Guarding Art Galleries by Guarding Witnesses
 On pNorm Based Locality Measures of SpaceFilling Curves
 Composability of InfiniteState Activity Automata
 Error Compensation in Leaf Root Problems
 On Compact and Efficient Routing in Certain Graph Classes
 Randomized Insertion and Deletion in Point Quad Trees
 Diagnosis in the Presence of Intermittent Faults
 ThreeRound Adaptive Diagnosis in Binary nCubes
 Fast Algorithms for Comparison of Similar Unordered Trees
 GCD of Random Linear Forms
 On the Hardness and Easiness of Random 4SAT Formulas
 Minimum Common String Partition Problem: Hardness and Approximations
 On the Complexity of Network Synchronization
 Counting Spanning Trees and Other Structures in Nonconstantjump Circulant Graphs
 Adaptive Spatial Partitioning for Multidimensional Data Streams
 Paired Pointset Traversal
 Approximated Two Choices in Randomized Load Balancing
 SpaceEfficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
 Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs
 The Maximum Agreement of Two Nested Phylogenetic Networks
 Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations
 New Bounds on Map Labeling with Circular Labels
 Optimal Buffer Management via Resource Augmentation
 Oriented Paths in Mixed Graphs
 Polynomial Deterministic Rendezvous in Arbitrary Graphs
 Distributions of Points and Large Quadrangles
 Cutting Out Polygons with Lines and Rays
 Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays
 Inner Rectangular Drawings of Plane Graphs
 Approximating the Minmax Subtree Cover Problem in a Cactus
 BoundaryOptimal Triangulation Flooding
 Exact Computation of Polynomial Zeros Expressible by Square Roots
 ManytoMany Disjoint Path Covers in a Graph with Faulty Elements
 An O(nlog n)Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees
 Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks
 Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search
 Dynamic Tree Cross Products
 Spanners, Weak Spanners, and Power Spanners for Wireless Networks
 Techniques for Indexing and Querying Temporal Observations for a Collection of Objects
 Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices
 The TwoGuard Problem Revisited and Its Generalization
 Canonical Data Structure for Interval Probe Graphs
 Efficient Algorithms for the Longest Path Problem
 Randomized Algorithms for Motif Detection
 Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
 Sweeping Graphs with Large Clique Number
 A Slightly Improved Subcubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths
 Isbn
 9783540305514
 Label
 Algorithms and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings
 Title
 Algorithms and Computation
 Title remainder
 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings
 Statement of responsibility
 edited by Rudolf Fleischer, Gerhard Trippen
 Subject

 Numeric Computing
 Computer Graphics
 Computer software
 Computer graphics
 Information theory
 Algorithm Analysis and Problem Complexity
 Theory of Computation
 Computer Communication Networks
 Computer Communication Networks
 Computational complexity
 Electronic data processing
 Discrete Mathematics in Computer Science
 Language

 eng
 eng
 Summary
 This volume contains the proceedings of the 15th Annual International Sym sium on Algorithms and Computation (ISAAC 2004), held in Hong Kong, 20–22 December, 2004. In the past, it has been held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), and Kyoto (2003). ISAAC is an annual international symposium that covers a wide range of topics,namelyalgorithmsandcomputation.Themainpurposeofthesymposium is to provide a forum for researchers working in the active research community of algorithms and the theory of computation to present and exchange new ideas. In response to our call for papers we received 226 submissions. The task of selectingthepapersinthisvolumewasdonebyourprogramcommitteeandother referees. After a thorough review process the committee selected 76 papers, the decisions being based on originality and relevance to the ?eld of algorithms and computation. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications, with selected papers from ISAAC 2004 are in preparation. Thebeststudentpaperawardwillbegivenfor“Geometricoptimizationpr lems over sliding windows” by Bashir S. Sadjad and Timothy M. Chan from the University of Waterloo. Two eminent invited speakers, Prof. Erik D. Demaine, MIT, and Prof. David M. Mount, University of Maryland, also contributed to this volume
 Dewey number
 004.0151
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt

 9Oi2dpOHGo
 n3ZJcqTEPXo
 Image bit depth
 0
 Language note
 English
 LC call number
 QA75.576.95
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2004
 http://bibfra.me/vocab/lite/meetingName
 ISAAC (Conference)
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 Fleischer, Rudolf.
 Trippen, Gerhard.
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 3341
 http://library.link/vocab/subjectName

 Information theory
 Computer software
 Computational complexity
 Electronic data processing
 Computer Communication Networks
 Computer graphics
 Theory of Computation
 Algorithm Analysis and Problem Complexity
 Discrete Mathematics in Computer Science
 Numeric Computing
 Computer Communication Networks
 Computer Graphics
 Label
 Algorithms and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings, edited by Rudolf Fleischer, Gerhard Trippen, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 Puzzles, Art, and Magic with Algorithms  The ABCs of AVDs: Geometric Retrieval Made Simple  Pareto Optimality in House Allocation Problems  PropertyPreserving Data Reconstruction  On the Monotone Circuit Complexity of Quadratic Boolean Functions  Generalized Function Matching  Approximate Distance Oracles for Graphs with Dense Clusters  Multicriteria Global Minimum Cuts  Polyline Fitting of Planar Points Under Minsum Criteria  A Generalization of Magic Squares with Applications to Digital Halftoning  Voronoi Diagrams with a Transportation Network on the Euclidean Plane  Structural Alignment of Two RNA Sequences with Lagrangian Relaxation  PolyAPX and PTASCompleteness in Standard and Differential Approximation  Efficient Algorithms for k Maximum Sums  Equipartitions of Measures by 2Fans  Augmenting the EdgeConnectivity of a Spider Tree  On Nash Equilibria for Multicast Transmissions in AdHoc Wireless Networks  Structural Similarity in Graphs  Flexibility of Steiner Trees in Uniform Orientation Metrics  Random Access to Advice Strings and Collapsing Results  Bounding the Payment of Approximate Truthful Mechanisms  The Polymatroid Steiner Problems  Geometric Optimization Problems Over Sliding Windows  OnLine Windows Scheduling of Temporary Items  Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy  An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem  On the Range MaximumSum Segment Query Problem  An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs  Efficient Job Scheduling Algorithms with Multitype Contentions  Superimposing Voronoi Complexes for Shape Deformation  On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem  Guarding Art Galleries by Guarding Witnesses  On pNorm Based Locality Measures of SpaceFilling Curves  Composability of InfiniteState Activity Automata  Error Compensation in Leaf Root Problems  On Compact and Efficient Routing in Certain Graph Classes  Randomized Insertion and Deletion in Point Quad Trees  Diagnosis in the Presence of Intermittent Faults  ThreeRound Adaptive Diagnosis in Binary nCubes  Fast Algorithms for Comparison of Similar Unordered Trees  GCD of Random Linear Forms  On the Hardness and Easiness of Random 4SAT Formulas  Minimum Common String Partition Problem: Hardness and Approximations  On the Complexity of Network Synchronization  Counting Spanning Trees and Other Structures in Nonconstantjump Circulant Graphs  Adaptive Spatial Partitioning for Multidimensional Data Streams  Paired Pointset Traversal  Approximated Two Choices in Randomized Load Balancing  SpaceEfficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting  Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs  The Maximum Agreement of Two Nested Phylogenetic Networks  Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations  New Bounds on Map Labeling with Circular Labels  Optimal Buffer Management via Resource Augmentation  Oriented Paths in Mixed Graphs  Polynomial Deterministic Rendezvous in Arbitrary Graphs  Distributions of Points and Large Quadrangles  Cutting Out Polygons with Lines and Rays  Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays  Inner Rectangular Drawings of Plane Graphs  Approximating the Minmax Subtree Cover Problem in a Cactus  BoundaryOptimal Triangulation Flooding  Exact Computation of Polynomial Zeros Expressible by Square Roots  ManytoMany Disjoint Path Covers in a Graph with Faulty Elements  An O(nlog n)Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees  Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks  Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search  Dynamic Tree Cross Products  Spanners, Weak Spanners, and Power Spanners for Wireless Networks  Techniques for Indexing and Querying Temporal Observations for a Collection of Objects  Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices  The TwoGuard Problem Revisited and Its Generalization  Canonical Data Structure for Interval Probe Graphs  Efficient Algorithms for the Longest Path Problem  Randomized Algorithms for Motif Detection  Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation  Sweeping Graphs with Large Clique Number  A Slightly Improved Subcubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths
 Dimensions
 unknown
 Edition
 1st ed. 2005.
 Extent
 1 online resource (XVII, 935 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540305514
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/b104582
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000212673
 (SSID)ssj0000101089
 (PQKBManifestationID)11111477
 (PQKBTitleCode)TC0000101089
 (PQKBWorkID)10037416
 (PQKB)11596643
 (DEHe213)9783540305514
 (MiAaPQ)EBC3068335
 (EXLCZ)991000000000212673
 Label
 Algorithms and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings, edited by Rudolf Fleischer, Gerhard Trippen, (electronic resource)
 Note
 Bibliographic Level Mode of Issuance: Monograph
 Antecedent source
 mixed
 Bibliography note
 Includes bibliographical references
 Carrier category
 online resource
 Carrier category code
 cr
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Contents
 Puzzles, Art, and Magic with Algorithms  The ABCs of AVDs: Geometric Retrieval Made Simple  Pareto Optimality in House Allocation Problems  PropertyPreserving Data Reconstruction  On the Monotone Circuit Complexity of Quadratic Boolean Functions  Generalized Function Matching  Approximate Distance Oracles for Graphs with Dense Clusters  Multicriteria Global Minimum Cuts  Polyline Fitting of Planar Points Under Minsum Criteria  A Generalization of Magic Squares with Applications to Digital Halftoning  Voronoi Diagrams with a Transportation Network on the Euclidean Plane  Structural Alignment of Two RNA Sequences with Lagrangian Relaxation  PolyAPX and PTASCompleteness in Standard and Differential Approximation  Efficient Algorithms for k Maximum Sums  Equipartitions of Measures by 2Fans  Augmenting the EdgeConnectivity of a Spider Tree  On Nash Equilibria for Multicast Transmissions in AdHoc Wireless Networks  Structural Similarity in Graphs  Flexibility of Steiner Trees in Uniform Orientation Metrics  Random Access to Advice Strings and Collapsing Results  Bounding the Payment of Approximate Truthful Mechanisms  The Polymatroid Steiner Problems  Geometric Optimization Problems Over Sliding Windows  OnLine Windows Scheduling of Temporary Items  Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy  An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem  On the Range MaximumSum Segment Query Problem  An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs  Efficient Job Scheduling Algorithms with Multitype Contentions  Superimposing Voronoi Complexes for Shape Deformation  On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem  Guarding Art Galleries by Guarding Witnesses  On pNorm Based Locality Measures of SpaceFilling Curves  Composability of InfiniteState Activity Automata  Error Compensation in Leaf Root Problems  On Compact and Efficient Routing in Certain Graph Classes  Randomized Insertion and Deletion in Point Quad Trees  Diagnosis in the Presence of Intermittent Faults  ThreeRound Adaptive Diagnosis in Binary nCubes  Fast Algorithms for Comparison of Similar Unordered Trees  GCD of Random Linear Forms  On the Hardness and Easiness of Random 4SAT Formulas  Minimum Common String Partition Problem: Hardness and Approximations  On the Complexity of Network Synchronization  Counting Spanning Trees and Other Structures in Nonconstantjump Circulant Graphs  Adaptive Spatial Partitioning for Multidimensional Data Streams  Paired Pointset Traversal  Approximated Two Choices in Randomized Load Balancing  SpaceEfficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting  Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs  The Maximum Agreement of Two Nested Phylogenetic Networks  Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations  New Bounds on Map Labeling with Circular Labels  Optimal Buffer Management via Resource Augmentation  Oriented Paths in Mixed Graphs  Polynomial Deterministic Rendezvous in Arbitrary Graphs  Distributions of Points and Large Quadrangles  Cutting Out Polygons with Lines and Rays  Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays  Inner Rectangular Drawings of Plane Graphs  Approximating the Minmax Subtree Cover Problem in a Cactus  BoundaryOptimal Triangulation Flooding  Exact Computation of Polynomial Zeros Expressible by Square Roots  ManytoMany Disjoint Path Covers in a Graph with Faulty Elements  An O(nlog n)Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees  Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks  Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search  Dynamic Tree Cross Products  Spanners, Weak Spanners, and Power Spanners for Wireless Networks  Techniques for Indexing and Querying Temporal Observations for a Collection of Objects  Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices  The TwoGuard Problem Revisited and Its Generalization  Canonical Data Structure for Interval Probe Graphs  Efficient Algorithms for the Longest Path Problem  Randomized Algorithms for Motif Detection  Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation  Sweeping Graphs with Large Clique Number  A Slightly Improved Subcubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths
 Dimensions
 unknown
 Edition
 1st ed. 2005.
 Extent
 1 online resource (XVII, 935 p.)
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540305514
 Level of compression
 uncompressed
 Media category
 computer
 Media type code
 c
 Other control number
 10.1007/b104582
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number

 (CKB)1000000000212673
 (SSID)ssj0000101089
 (PQKBManifestationID)11111477
 (PQKBTitleCode)TC0000101089
 (PQKBWorkID)10037416
 (PQKB)11596643
 (DEHe213)9783540305514
 (MiAaPQ)EBC3068335
 (EXLCZ)991000000000212673
Subject
 Algorithm Analysis and Problem Complexity
 Computational complexity
 Computer Communication Networks
 Computer Communication Networks
 Computer Graphics
 Computer graphics
 Computer software
 Discrete Mathematics in Computer Science
 Electronic data processing
 Information theory
 Numeric Computing
 Theory of Computation
Member of
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
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.libraries.ou.edu/portal/AlgorithmsandComputation15thInternational/YXjd6yJS654/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/AlgorithmsandComputation15thInternational/YXjd6yJS654/">Algorithms and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings, edited by Rudolf Fleischer, Gerhard Trippen, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma 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 and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings, edited by Rudolf Fleischer, Gerhard Trippen, (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.libraries.ou.edu/portal/AlgorithmsandComputation15thInternational/YXjd6yJS654/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/AlgorithmsandComputation15thInternational/YXjd6yJS654/">Algorithms and Computation : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 2022, 2004, Proceedings, edited by Rudolf Fleischer, Gerhard Trippen, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>