Combinatorial algorithms = 33rd Inte...
International Workshop on Combinatorial Algorithms (2022 :)

FindBook      Google Book      Amazon      博客來     
  • Combinatorial algorithms = 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022 : proceedings /
  • 紀錄類型: 書目-電子資源 : Monograph/item
    正題名/作者: Combinatorial algorithms/ edited by Cristina Bazgan, Henning Fernau.
    其他題名: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022 : proceedings /
    其他題名: IWOCA 2022
    其他作者: Bazgan, Cristina.
    團體作者: International Workshop on Combinatorial Algorithms
    出版者: Cham :Springer International Publishing : : 2022.,
    面頁冊數: xviii, 524 p. :ill. (some col.), digital ;24 cm.
    內容註: Distance from Triviality 2.0: Hybrid Parameterizations -- Graphs as Algorithms: Characterizing Motion-Planning Gadgets through Simulation and Complexity -- On the Existence of EFX Allocations -- Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model -- Perfect Matchings with Crossings -- Graph parameters, implicit representations and factorial properties -- Approximating Subset Sum Ratio via Subset Sum Computations -- Faster Algorithm for Finding Maximum 1-Restricted Simple 2-Matchings -- Lower bounds on the performance of online algorithms for relaxed packing problems -- An Adjacency Labeling Scheme Based On A Decomposition Of Trees Into Caterpillars -- Computing Longest (Common) Lyndon Subsequence -- Structure-aware combinatorial group testing: a new method for pandemic screening -- Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution -- 1-Extendability of independent sets -- Tukey Depth Histograms -- An Efficient Algorithm for the Proximity Connected Two Center Problem -- A New Temporal Interpretation of Cluster Editing -- List covering of regular multigraphs -- The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs -- Perfect matching cuts partitioning a graph into complementary subgraphs -- On the Intractability Landscape of Digraph Intersection Representations -- The Red-Blue Separation problem on graphs -- Harmless Sets in Sparse Classes -- The Parameterized Complexity of s-Club with Triangle and Seed Constraints -- Space-Efficient B Trees via Load-Balancing -- An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations -- Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota -- Practical Space-Efficient Index for Structural Pattern Matching -- A Shift Gray Code for Fixed-Content Lukasiewicz Words -- Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms -- Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number -- Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings -- On relative clique number of triangle-free planar colored mixed graphs. -- Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks -- Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage -- Linear Time Construction of Indexable Elastic Founder Graphs -- On Critical Node Problems with Vulnerable Vertices -- Winner Determination Algorithms for Graph Games with Matching Structures.
    Contained By: Springer Nature eBook
    標題: Combinatorial analysis - Congresses. -
    電子資源: https://doi.org/10.1007/978-3-031-06678-8
    ISBN: 9783031066788
館藏地:  出版年:  卷號: 
館藏
  • 1 筆 • 頁數 1 •
 
W9441882 電子資源 11.線上閱覽_V 電子書 EB QA164 .I58 2022 一般使用(Normal) 在架 0
  • 1 筆 • 頁數 1 •
多媒體
評論
Export
取書館
 
 
變更密碼
登入