| 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 |
| Packing Arc-Disjoint Cycles in Bipartite Tournaments
|
2020 |
Jacob, Ajay Saju |
| Faster Privacy-Preserving Computation of Edit Distance with Moves
|
2020 |
Yoshimoto, Yohei |
| Parameterized Algorithms for the Happy Set Problem
|
2020 |
Asahiro, Yuichi |
| Train Scheduling: Hardness and Algorithms
|
2020 |
Scheffer, Christian |
| Trichotomy for the Reconfiguration Problem of Integer Linear Systems
|
2020 |
Kimura, Kei |
| Drawing Planar Graphs
|
2020 |
Rahman, Md. Saidur |
| Angle Covers: Algorithms and Complexity
|
2020 |
Evans, William |
| Packing and Covering with Segments
|
2020 |
Mitchell, Joseph S. B. |
| Efficient Enumeration of Non-isomorphic Ptolemaic Graphs
|
2020 |
Tran, Dat Hoang |
| An Experimental Study of a 1-Planarity Testing and Embedding Algorithm
|
2020 |
Binucci, Carla |
Tag hinzufügen