共 50 条
- [32] A Linear-Time Parameterized Algorithm for Computing the Width of a GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2021, 2021, 12911 : 257 - 269
- [33] Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 287 - 299
- [36] The fog computing/edge computing to leverage Digital Twin DIGITAL TWIN PARADIGM FOR SMARTER SYSTEMS AND ENVIRONMENTS: THE INDUSTRY USE CASES, 2020, 117 : 51 - 77
- [37] A Faster Parameterized Algorithm for Group Feedback Edge Set GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 269 - 281
- [39] Two-Layer Planarization Parameterized by Feedback Edge Set THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2010, 6108 : 431 - 442
- [40] Tournament Fixing Parameterized by Feedback Vertex Set Number Is FPT THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 5, 2023, : 5876 - 5883