| A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees
|
2022 |
Bodini, Olivier |
| How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?
|
2022 |
Place, Thomas |
| String Attractors and Infinite Words
|
2022 |
Restivo, Antonio |
| The Net Automaton of a Rational Expression
|
2022 |
Lombardy, Sylvain |
| Approximation Schemes for Packing Problems with [ell _p]-norm Diversity Constraints
|
2022 |
Gálvez, Waldo |
| Near-Optimal Search Time in [Delta]-Optimal Space
|
2022 |
Kociumaka, Tomasz |
| On the Complexity of Half-Guarding Monotone Polygons
|
2022 |
Hillberg, Hannah Miller |
| Complexity Results on Untangling Red-Blue Matchings
|
2022 |
Das, Arun Kumar |
| On r-Guarding SCOTs - A New Family of Orthogonal Polygons
|
2022 |
Cruz, Vasco |
| Local Routing Algorithms on Euclidean Spanners with Small Diameter
|
2022 |
Bonichon, Nicolas |
| Improved Parallel Algorithms for Generalized Baumslag Groups
|
2022 |
Mattes, Caroline |
| Tree 3-Spanners on Generalized Prisms of Graphs
|
2022 |
Gómez, Renzo |
| Exact Learning of Multitrees and Almost-Trees Using Path Queries
|
2022 |
Afshar, Ramtin |
| Approximations for the Steiner Multicycle Problem
|
2022 |
Fernandes, Cristina G. |
| Pathlength of Outerplanar Graphs
|
2022 |
Dissaux, Thomas |
| A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub Center
|
2022 |
Benedito, Marcelo P. L. |
| Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries
|
2022 |
Jo, Seungbum |
| Weighted Connected Matchings
|
2022 |
Gomes, Guilherme C. M. |
| Piercing Pairwise Intersecting Convex Shapes in the Plane
|
2022 |
Bazargani, Saman |
| Bounds on Oblivious Multiparty Quantum Communication Complexity
|
2022 |
Le Gall, François |
Tag hinzufügen