| r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes
|
2021 |
Kumabe, Soh |
| An Improvement of Reed's Treewidth Approximation
|
2021 |
Belbasi, Mahdi |
| Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms
|
2021 |
Conte, Alessio |
| APX-Hardness and Approximation for the k-Buming Number Problem
|
2021 |
Mondal, Debajyoti |
| Majority Spanning Trees, Cotrees and Their Applications
|
2021 |
Kaykobad, Mohammad |
| A New Transportation Problem on a Graph with Sending and Bringing-Back Operations
|
2021 |
Asano, Tetsuo |
| On Short Fastest Paths in Temporal Graphs
|
2021 |
Danda, Umesh Sandeep |
| On Compatible Matchings
|
2021 |
Aichholzer, Oswin |
| 2-Colored Point-Set Embeddings of Partial 2-Trees
|
2021 |
Giacomo, Emilio Di |
| Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs
|
2021 |
Biniaz, Ahmad |
| Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs
|
2021 |
Yamazaki, Kazuaki |
| Cyclic Shift Problems on Graphs
|
2021 |
Sai, Kwon Kham |
| Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles
|
2021 |
Minamisawa, Ko |
| Computing L(p, 1)-Labeling with Combined Parameters
|
2021 |
Hanaka, Tesshu |
| Upward Point Set Embeddings of Paths and Trees
|
2021 |
Arseneva, Elena |
| Physical Zero-Knowledge Proof for Ripple Effect
|
2021 |
Ruangwises, Suthee |
| Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees
|
2021 |
Wang, Haitao |
| The Bike Sharing Problem
|
2021 |
Czyzowicz, Jurek |
| Compact Data Structures for Dedekind Groups and Finite Rings
|
2021 |
Das, Bireswar |
| Faster Multi-sided One-Bend Boundary Labelling
|
2021 |
Bose, Prosenjit |
Tag hinzufügen