| Optimal Monomial Quadratization for ODE Systems
|
2021 |
Bychkov, Andrey |
| The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets
|
2021 |
Cicalese, Ferdinando |
| Vertex Cover at Distance on H-Free Graphs
|
2021 |
Dallard, Clément |
| Prophet Secretary for k-Knapsack and l-Matroid Intersection via Continuous Exchange Property
|
2021 |
Kumabe, Soh |
| Heuristically Enhanced IPO Algorithms for Covering Array Generation
|
2021 |
Wagner, Michael |
| Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphs
|
2021 |
Abbas, Nesrine |
| Composed Degree-Distance Realizations of Graphs
|
2021 |
Bar-Noy, Amotz |
| A Hamilton Cycle in the k-Sided Pancake Network
|
2021 |
Cameron, B. |
| Covering Convex Polygons by Two Congruent Disks
|
2021 |
Choi, Jongmin |
| Algorithms and Complexity of s-Club Cluster Vertex Deletion
|
2021 |
Chakraborty, Dibyayan |
| On an Ordering Problem in Weighted Hypergraphs
|
2021 |
Damaschke, Peter |
| An Efficient Noisy Binary Search in Graphs via Median Approximation
|
2021 |
Dereniowski, Dariusz |
| A Study on the Existence of Null Labelling for 3-Hypergraphs
|
2021 |
Marco, Niccolò Di |
| Makespan Trade-Offs for Visiting Triangle Edges: (Extended Abstract)
|
2021 |
Georgiou, Konstantinos |
| Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k
|
2021 |
Hasunuma, Toru |
| Complexity and Algorithms for MUL-Tree Pruning
|
2021 |
Gascon, Mathieu |
| Approximation Algorithms for Hitting Subgraphs
|
2021 |
Brüstle, Noah |
| Disjoint Paths and Connected Subgraphs for H-Free Graphs
|
2021 |
Kern, Walter |
| Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
|
2021 |
Marino, Andrea |
| New Approximations and Hardness Results for Submodular Partitioning Problems
|
2021 |
Santiago, Richard |
Tag hinzufügen