| 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 |
| On the Geometric Red-Blue Set Cover Problem
|
2021 |
Madireddy, Raghunath Reddy |
| Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game
|
2021 |
Byrne, Thomas |
| Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes
|
2021 |
Saitoh, Toshiki |
| Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs
|
2021 |
Gurski, Frank |
| Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights
|
2021 |
Fujie, Tetsuya |
| Efficient Generation of a Card-Based Uniformly Distributed Random Derangement
|
2021 |
Murata, Soma |
| 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 |
Tag hinzufügen