Combinatorial Algorithms
portes grátis
Combinatorial Algorithms
35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings
Rescigno, Adele Anna; Vaccaro, Ugo
Springer International Publishing AG
06/2024
538
Mole
9783031630200
15 a 20 dias
Descrição não disponível.
- On computing sets of integers with maximum number of pairs summing to powers of 2.
- Matchings in hypercubes extend to long cycles.
- Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation.
- Simple random sampling of binary forests with fixed number of nodes and trees.
- Maximizing Minimum Cycle Bases Intersection.
- Improving Online Bin Covering with Little Advice.
- An Improved Bound for Equitable Proper Labellings.
- Approximate realizations for outerplanaric degree sequences.
- Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension.
- Star-Forest Decompositions of Complete Graphs.
- Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar.
- Detecting $K {2,3}$ as an induced minor.
- Computing maximal palindromes in non-standard matching models.
- On the Structure of Hamiltonian Graphs with Small Independence Number.
- Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems.
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
- Minimizing distances between vertices and edges through tree $t$-spanners.
- Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.
- Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
- Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers.
- Approximation Algorithms for Node-Weighted Directed Steiner Problems.
- Resolving Sets in Temporal Graphs.
- On the finiteness of $k$-vertex-critical $2P 2$-free graphs with forbidden induced squids or bulls.
- Directed Path Partition Problems on Directed Acyclic Graphs.
- Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.
- Lower Bounds for Leaf Rank of Leaf Powers.
- Perfect Roman Domination: Aspects of Enumeration and Parameterization.
- Computing Longest Common Subsequence under Cartesian-Tree Matching Model.
- Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
- Linear Search for an Escaping Target with Unknown Speed.
- Dominance for Enclosure Problems.
- Approximate cycle double cover.
- The Bottom-Left Algorithm for the Strip Packing Problem.
- Parameterized Upper Bounds for Path-Consistent Hub Labeling.
- The Hamiltonian cycle problem and monotone classes.
- The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots.
- Broadcasting in Star of Cliques.
- Approximating Spanning Tree Congestion on Bounded Degree Graphs.
- Efficient Computation of Crossing Components and Shortcut Hulls.
- Parameterized Complexity of Paired Domination.
- Matchings in hypercubes extend to long cycles.
- Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation.
- Simple random sampling of binary forests with fixed number of nodes and trees.
- Maximizing Minimum Cycle Bases Intersection.
- Improving Online Bin Covering with Little Advice.
- An Improved Bound for Equitable Proper Labellings.
- Approximate realizations for outerplanaric degree sequences.
- Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension.
- Star-Forest Decompositions of Complete Graphs.
- Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar.
- Detecting $K {2,3}$ as an induced minor.
- Computing maximal palindromes in non-standard matching models.
- On the Structure of Hamiltonian Graphs with Small Independence Number.
- Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems.
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
- Minimizing distances between vertices and edges through tree $t$-spanners.
- Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.
- Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
- Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers.
- Approximation Algorithms for Node-Weighted Directed Steiner Problems.
- Resolving Sets in Temporal Graphs.
- On the finiteness of $k$-vertex-critical $2P 2$-free graphs with forbidden induced squids or bulls.
- Directed Path Partition Problems on Directed Acyclic Graphs.
- Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.
- Lower Bounds for Leaf Rank of Leaf Powers.
- Perfect Roman Domination: Aspects of Enumeration and Parameterization.
- Computing Longest Common Subsequence under Cartesian-Tree Matching Model.
- Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
- Linear Search for an Escaping Target with Unknown Speed.
- Dominance for Enclosure Problems.
- Approximate cycle double cover.
- The Bottom-Left Algorithm for the Strip Packing Problem.
- Parameterized Upper Bounds for Path-Consistent Hub Labeling.
- The Hamiltonian cycle problem and monotone classes.
- The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots.
- Broadcasting in Star of Cliques.
- Approximating Spanning Tree Congestion on Bounded Degree Graphs.
- Efficient Computation of Crossing Components and Shortcut Hulls.
- Parameterized Complexity of Paired Domination.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Computer Science;Informatics;Conference Proceedings;Research;Applications;Algorithms and Data Structures;Algorithms on Strings & Graphs;Approximation Algorithms;Combinatorial Generation, Enumeration and Counting;Combinatorial Optimization;Complexity Theory;Computational Algebra and Geometry;Computational Biology;Distributed and Parallel Algorithms;Graph Algorithms for Social Network Analysis;Graph Drawing and Labelling;Graph Theory & Combinatorics;Parameterized and Exact Algorithms;Probabilistic and Randomized Algorithms;Streaming Algorithms
- On computing sets of integers with maximum number of pairs summing to powers of 2.
- Matchings in hypercubes extend to long cycles.
- Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation.
- Simple random sampling of binary forests with fixed number of nodes and trees.
- Maximizing Minimum Cycle Bases Intersection.
- Improving Online Bin Covering with Little Advice.
- An Improved Bound for Equitable Proper Labellings.
- Approximate realizations for outerplanaric degree sequences.
- Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension.
- Star-Forest Decompositions of Complete Graphs.
- Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar.
- Detecting $K {2,3}$ as an induced minor.
- Computing maximal palindromes in non-standard matching models.
- On the Structure of Hamiltonian Graphs with Small Independence Number.
- Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems.
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
- Minimizing distances between vertices and edges through tree $t$-spanners.
- Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.
- Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
- Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers.
- Approximation Algorithms for Node-Weighted Directed Steiner Problems.
- Resolving Sets in Temporal Graphs.
- On the finiteness of $k$-vertex-critical $2P 2$-free graphs with forbidden induced squids or bulls.
- Directed Path Partition Problems on Directed Acyclic Graphs.
- Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.
- Lower Bounds for Leaf Rank of Leaf Powers.
- Perfect Roman Domination: Aspects of Enumeration and Parameterization.
- Computing Longest Common Subsequence under Cartesian-Tree Matching Model.
- Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
- Linear Search for an Escaping Target with Unknown Speed.
- Dominance for Enclosure Problems.
- Approximate cycle double cover.
- The Bottom-Left Algorithm for the Strip Packing Problem.
- Parameterized Upper Bounds for Path-Consistent Hub Labeling.
- The Hamiltonian cycle problem and monotone classes.
- The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots.
- Broadcasting in Star of Cliques.
- Approximating Spanning Tree Congestion on Bounded Degree Graphs.
- Efficient Computation of Crossing Components and Shortcut Hulls.
- Parameterized Complexity of Paired Domination.
- Matchings in hypercubes extend to long cycles.
- Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation.
- Simple random sampling of binary forests with fixed number of nodes and trees.
- Maximizing Minimum Cycle Bases Intersection.
- Improving Online Bin Covering with Little Advice.
- An Improved Bound for Equitable Proper Labellings.
- Approximate realizations for outerplanaric degree sequences.
- Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension.
- Star-Forest Decompositions of Complete Graphs.
- Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar.
- Detecting $K {2,3}$ as an induced minor.
- Computing maximal palindromes in non-standard matching models.
- On the Structure of Hamiltonian Graphs with Small Independence Number.
- Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems.
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
- Minimizing distances between vertices and edges through tree $t$-spanners.
- Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints.
- Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional.
- Efficient Algorithms for Decomposing Integers as Sums of Few Tetrahedral Numbers.
- Approximation Algorithms for Node-Weighted Directed Steiner Problems.
- Resolving Sets in Temporal Graphs.
- On the finiteness of $k$-vertex-critical $2P 2$-free graphs with forbidden induced squids or bulls.
- Directed Path Partition Problems on Directed Acyclic Graphs.
- Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space.
- Lower Bounds for Leaf Rank of Leaf Powers.
- Perfect Roman Domination: Aspects of Enumeration and Parameterization.
- Computing Longest Common Subsequence under Cartesian-Tree Matching Model.
- Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space.
- Linear Search for an Escaping Target with Unknown Speed.
- Dominance for Enclosure Problems.
- Approximate cycle double cover.
- The Bottom-Left Algorithm for the Strip Packing Problem.
- Parameterized Upper Bounds for Path-Consistent Hub Labeling.
- The Hamiltonian cycle problem and monotone classes.
- The Minimum Algorithm Size of $k$-Grouping by Silent Oblivious Robots.
- Broadcasting in Star of Cliques.
- Approximating Spanning Tree Congestion on Bounded Degree Graphs.
- Efficient Computation of Crossing Components and Shortcut Hulls.
- Parameterized Complexity of Paired Domination.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Computer Science;Informatics;Conference Proceedings;Research;Applications;Algorithms and Data Structures;Algorithms on Strings & Graphs;Approximation Algorithms;Combinatorial Generation, Enumeration and Counting;Combinatorial Optimization;Complexity Theory;Computational Algebra and Geometry;Computational Biology;Distributed and Parallel Algorithms;Graph Algorithms for Social Network Analysis;Graph Drawing and Labelling;Graph Theory & Combinatorics;Parameterized and Exact Algorithms;Probabilistic and Randomized Algorithms;Streaming Algorithms