| Conditional Automatic Complexity and Its Metrics
|
2024 |
Kjos-Hanssen, Bjørn |
| Exponential Time Complexity of the Complex Weighted Boolean #CSP
|
2024 |
Liu, Ying |
| List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs
|
2024 |
Sen, Banu Baklan |
| Variants of Euclidean k-Center Clusterings
|
2024 |
Nakano, Shin-ichi |
| Sum-of-Local-Effects Data Structures for Separable Graphs
|
2024 |
Lyu, Xing |
| Red-Black Spanners for Mixed-Charging Vehicular Networks
|
2024 |
Bereg, Sergey |
| DR-Submodular Function Maximization with Adaptive Stepsize
|
2024 |
Li, Yanfei |
| Complexity and Enumeration in Models of Genome Rearrangement
|
2024 |
Bailey, Lora |
| Linear Time Algorithms for NP-Hard Problems Restricted to GATEX Graphs
|
2024 |
Hellmuth, Marc |
| Sink Location Problems in Dynamic Flow Grid Networks
|
2024 |
Higashikawa, Yuya |
| Improved Sourcewise Roundtrip Spanners with Constant Stretch
|
2024 |
Stafford, Eli |
| The k Edge-Vertex Domination Problem
|
2024 |
Li, Peng |
| Approximating Decision Trees with Priority Hypotheses
|
2024 |
Yuan, Jing |
| Approximating the A-low-density Value
|
2024 |
Gudmundsson, Joachim |
| Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width
|
2024 |
Luo, Weidong |
| Shortest Longest-Path Graph Orientations
|
2024 |
Asahiro, Yuichi |
| Hardness and Approximation for the Star S-Hub Routing Cost Problem in Aß-Metric Graphs
|
2024 |
Tsai, Meng-Shiou |
| Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs
|
2024 |
Tian, Kangyi |
| Self-stabilizing (A + 1)-Coloring in Sublinear (in A) Rounds via Locally-Iterative Algorithms
|
2024 |
Fu, Xinyu |
| Multi-Load Agent Path Finding for Online Pickup and Delivery Problem
|
2024 |
Li, Yifei |
Tag hinzufügen