Description

Book Synopsis

.- Graph Algorithms and Graph Theory.
.- On the Complexity of 2-Club Cluster Editing with Vertex Splitting.
.- A sufficient condition for the existence of two completely independent spanning trees.
.- Undecidability of polynomial inequalities in subset densities and additive energies.
.- Approximation algorithm for prize-collecting hypergraph vertex cover with fairness constraints.
.- Sum-of-Max Chain Partition of a Tree.
.- Reconfiguring Multiple Connected Components with Size Multiset Constraints.
.- Fault diagnosability evaluation of BCCC data center networks.
.- Testing Some First-Order Logic Properties on Sparse Graphs.
.- Massively Parallel Approximate Steiner Tree Algorithms.
.- A Multi-start Variable Neighborhood Tabu Search Algorithm for the Cyclic Bandwidth Problem.
.- Vertex-Critical (P5, W4)-Free Graphs.
.- Learning and Data-Related Theory.
.- A Dynamic Working Set Method for Compressed Sensing.
.- Data Debugging is NP-hard for Classifiers Trained with SGD.
.- Coresets for k-Median of Lines with Group Fairness Constraints.
.- Redefining Entity Integration: Theoretical Insights for GNN-based Recommender Systems.
.- Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits.
.- A Robust Distributed Minimax Learning Method against Model Poisoning Attacks.
.- Parameterized Algorithms.
.- Parameterized Complexity of Influence Maximization.
.- Improved Parameterized Algorithms for Scheduling with Precedence Constraints and Time Windows.
.- Pareto Optimal Matching with Multilayer Preferences: How Hard Can It Be?.
.- An FPT Factor-11 Approximation Algorithm for TSP.
.- From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems.
.- String Algorithms and Discrete Structures.
.- Revisit the Partial Coloring Method: Prefix Spencer and Sampling.
.- A Sparse Dynamic Programming Algorithm for Solving the Coding Sequence Design Problem.
.- Improved Approximation Algorithm and Hardness Result for Sorting Unsigned Strings by Symmetric Reversals.
.- Longest Double-Bounded (k]-tuple Common Substrings.
.- Finding cycle types in permutation groups with few generators.
.- Counting overlapping pairs of words.

Computing and Combinatorics

Product form

£58.49

Includes FREE delivery

RRP £64.99 – you save £6.50 (10%)

Order before 4pm today for delivery by Fri 16 Jan 2026.

A Paperback by Fedor V. Fomin

Out of stock


    View other formats and editions of Computing and Combinatorics by Fedor V. Fomin

    Publisher: Springer
    Publication Date: 8/24/2025
    ISBN13: 9789819502172, 978-9819502172
    ISBN10: 9819502179
    Also in:
    Mathematical theory of computation

    Description

    Book Synopsis

    .- Graph Algorithms and Graph Theory.
    .- On the Complexity of 2-Club Cluster Editing with Vertex Splitting.
    .- A sufficient condition for the existence of two completely independent spanning trees.
    .- Undecidability of polynomial inequalities in subset densities and additive energies.
    .- Approximation algorithm for prize-collecting hypergraph vertex cover with fairness constraints.
    .- Sum-of-Max Chain Partition of a Tree.
    .- Reconfiguring Multiple Connected Components with Size Multiset Constraints.
    .- Fault diagnosability evaluation of BCCC data center networks.
    .- Testing Some First-Order Logic Properties on Sparse Graphs.
    .- Massively Parallel Approximate Steiner Tree Algorithms.
    .- A Multi-start Variable Neighborhood Tabu Search Algorithm for the Cyclic Bandwidth Problem.
    .- Vertex-Critical (P5, W4)-Free Graphs.
    .- Learning and Data-Related Theory.
    .- A Dynamic Working Set Method for Compressed Sensing.
    .- Data Debugging is NP-hard for Classifiers Trained with SGD.
    .- Coresets for k-Median of Lines with Group Fairness Constraints.
    .- Redefining Entity Integration: Theoretical Insights for GNN-based Recommender Systems.
    .- Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits.
    .- A Robust Distributed Minimax Learning Method against Model Poisoning Attacks.
    .- Parameterized Algorithms.
    .- Parameterized Complexity of Influence Maximization.
    .- Improved Parameterized Algorithms for Scheduling with Precedence Constraints and Time Windows.
    .- Pareto Optimal Matching with Multilayer Preferences: How Hard Can It Be?.
    .- An FPT Factor-11 Approximation Algorithm for TSP.
    .- From Metric to General Graphs: FPT Constant-Factor Approximation Algorithms for Three Location Problems.
    .- String Algorithms and Discrete Structures.
    .- Revisit the Partial Coloring Method: Prefix Spencer and Sampling.
    .- A Sparse Dynamic Programming Algorithm for Solving the Coding Sequence Design Problem.
    .- Improved Approximation Algorithm and Hardness Result for Sorting Unsigned Strings by Symmetric Reversals.
    .- Longest Double-Bounded (k]-tuple Common Substrings.
    .- Finding cycle types in permutation groups with few generators.
    .- Counting overlapping pairs of words.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account