| 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 |
| An Efficient Data Analysis Method for Big Data Using Multiple-Model Linear Regression
|
2024 |
Lyu, Bohan |
| On Detecting Some Defective Items in Group Testing
|
2024 |
Bshouty, Nader H. |
| Resource-Adaptive Newton’s Method for Distributed Learning
|
2024 |
Chen, Shuzhen |
| On the Routing Problems in Graphs with Ordered Forbidden Transitions
|
2024 |
Kumakura, Kota |
| A Physical Zero-Knowledge Proof for Sumplete, a Puzzle Generated by ChatGPT
|
2024 |
Hatsugai, Kyosuke |
| Streaming and Query Once Space Complexity of Longest Increasing Subsequence
|
2024 |
Li, Xin |
| Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation
|
2024 |
Külekci, M. Oğuzhan |
Tag hinzufügen