| Optimum Algorithm for the Mutual Visibility Problem
|
2020 |
Bhagat, Subhash |
| Fast Multiple Pattern Cartesian Tree Matching
|
2020 |
Gu, Geonmo |
| Dispersion of Mobile Robots on Grids
|
2020 |
Kshemkalyani, Ajay D. |
| Matching Random Colored Points with Rectangles
|
2020 |
Corujo, Josué |
| Approximability of the Independent Feedback Vertex Set Problem for Bipartite Graphs
|
2020 |
Tamura, Yuma |
| Space Efficient Separator Algorithms for Planar Graphs
|
2020 |
Watanabe, Osamu |
| Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks
|
2020 |
Zhang, Louxin |
| Routing in Histograms
|
2020 |
Chiu, Man-Kwun |
| On the Maximum Edge-Pair Embedding Bipartite Matching
|
2020 |
Nguyen, Cam Ly |
| Designing Survivable Networks with Zero-Suppressed Binary Decision Diagrams
|
2020 |
Suzuki, Hirofumi |
| A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips
|
2020 |
Gonzalez, Miguel Coviello |
| Packing Trees into 1-Planar Graphs
|
2020 |
Luca, Felice De |
| Shortest Covers of All Cyclic Shifts of a String
|
2020 |
Crochemore, Maxime |
| Generalized Dictionary Matching Under Substring Consistent Equivalence Relations
|
2020 |
Hendrian, Diptarama |
| Reconfiguring k-path Vertex Covers
|
2020 |
Hoang, Duc A. |
| Maximum Bipartite Subgraph of Geometric Intersection Graphs
|
2020 |
Jana, Satyabrata |
| Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons
|
2020 |
Iwamoto, Chuzo |
| The Stub Resolution of 1-Planar Graphs
|
2020 |
Kaufmann, Michael |
| Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
|
2020 |
Nakahata, Yu |
| Partitioning a Graph into Complementary Subgraphs
|
2020 |
Nascimento, Julliano Rosa |
Tag hinzufügen