| Relaxed and Approximate Graph Realizations
|
2021 |
Bar-Noy, Amotz |
| All Subgraphs of a Wheel Are 5-Coupled-Choosable
|
2021 |
Barr, Sam |
| The Pony Express Communication Problem
|
2021 |
Coleman, Jared |
| Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups
|
2021 |
Coumes, Simon |
| Piercing All Translates of a Set of Axis-Parallel Rectangles
|
2021 |
Dumitrescu, Adrian |
| A Triangle Process on Regular Graphs
|
2021 |
Cooper, Colin |
| Intersecting Disks Using Two Congruent Disks
|
2021 |
Kang, Byeonguk |
| Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters
|
2021 |
Kučera, Martin |
| Non-preemptive Tree Packing
|
2021 |
Lendl, Stefan |
| An FPT Algorithm for Matching Cut and d-Cut
|
2021 |
Aravind, N. R. |
| Backtrack Search for Parallelisms of Projective Spaces
|
2021 |
Topalova, Svetlana |
| 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 |
Tag hinzufügen