1 option
Combinatorial Algorithms : 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings / edited by Paola Flocchini, Lucia Moura.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12757
- Theoretical Computer Science and General Issues, 2512-2029 ; 12757
- Language:
- English
- Subjects (All):
- Computer science-Mathematics.
- Discrete mathematics.
- Algorithms.
- Data structures (Computer science).
- Information theory.
- Computer graphics.
- Discrete Mathematics in Computer Science.
- Design and Analysis of Algorithms.
- Data Structures and Information Theory.
- Computer Graphics.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Design and Analysis of Algorithms.
- Data Structures and Information Theory.
- Computer Graphics.
- Physical Description:
- 1 online resource (XX, 588 pages) : 134 illustrations, 59 illustrations in color.
- Edition:
- 1st ed. 2021.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2021.
- System Details:
- text file PDF
- Summary:
- This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format. The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business. Chapter "Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
- Contents:
- Invited Papers
- Relaxed and Approximate Graph Realizations
- Search for combinatorial objects using lattice algorithms - revisited
- Contributed Papers
- Linear Algorithms for Red Blue Domination in Convex Bipartite Graphs
- Combinatorics and algorithms for quasi-chain graphs
- Composed Degree-Distance Realizations of Graphs
- All Subgraphs of a Wheel are 5-Coupled-Choosable
- Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
- Edge exploration of temporal graphs
- Optimal monomial quadratization for ODE systems
- A Hamilton Cycle in the k-Sided Pancake Network
- Algorithms and Complexity of s-Club Cluster Vertex Deletion
- Covering Convex Polygons by Two Congruent Disks
- The Tandem Duplication Distance Problem is hard over bounded alphabets
- On the oriented coloring of the disjoint union of graphs
- The Pony Express Communication Problem
- Skyline Groups are Ideals. An efficient algorithm for enumerating skyline groups
- Vertex Cover at Distance on H-free Graphs
- On an Ordering Problem in Weighted Hypergraphs
- An Efficient Noisy Binary Search in Graphs via Median Approximation
- A study on the existence of null labelling for 3-hypergraphs
- Piercing All Translates of a Set of Axis-Parallel Rectangles
- A triangle process on regular graphs
- Complexity and Algorithms for MUL-Tree Pruning
- Makespan Trade-offs for Visiting Triangle Edges
- Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k
- Approximation algorithms for hitting subgraphs
- Isomorphic unordered labeled trees up to substitution ciphering
- Intersecting Disks using Two Congruent Disks
- Disjoint Paths and Connected Subgraphs for H-Free Graphs
- Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property
- Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
- Non-preemptive tree packing
- Card-based Cryptographic Protocols for Three-input Functions Using Private Operations
- Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
- Reconfiguring Simple s; t Hamiltonian Paths in Rectangular Grid Graphs
- New Approximations and Hardness Results for Submodular Partitioning Problems
- An FPT Algorithm for Matching Cut and d-Cut
- Backtrack search for parallelisms of projective spaces
- Approximating Multistage Matching Problems
- Heuristically enhanced IPO Algorithms for Covering Array Generation.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-79987-8
- 9783030799878
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.