| Multi-priority Graph Sparsification
|
2023 |
Ahmed, Reyan |
| Parameterized Algorithms for Eccentricity Shortest Path Problem
|
2023 |
Bhyravarapu, Sriram |
| Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks
|
2023 |
Bläsius, Thomas |
| A Polyhedral Perspective on Tropical Convolutions
|
2023 |
Brand, Cornelius |
| Advice Complexity Bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems
|
2023 |
Berndt, Niklas |
| Online Knapsack with Removal and Recourse
|
2023 |
Böckenhauer, Hans-Joachim |
| Minimum Surgical Probing with Convexity Constraints
|
2023 |
Böhnlein, Toni |
| Maximal Distortion of Geodesic Diameters in Polygonal Domains
|
2023 |
Dumitrescu, Adrian |
| Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism
|
2023 |
Kammer, Frank |
| Burn and Win
|
2023 |
Ashok, Pradeesha |
| A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
|
2023 |
Bloch-Hansen, Andrew |
| Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms
|
2023 |
Dondi, Riccardo |
| Make a Graph Singly Connected by Edge Orientations
|
2023 |
Hartmann, Tim A. |
| Finding Perfect Matching Cuts Faster
|
2023 |
Misra, Neeldhara |
| Connected Feedback VertexSet on AT-Free Graphs
|
2023 |
Mukherjee, Joydeep |
| On Computing Large Temporal (Unilateral) Connected Components
|
2023 |
Costa, Isnard Lopes |
| On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings
|
2023 |
Mallach, Sven |
| Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform
|
2023 |
Wang, Chi-Hao |
| On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
|
2023 |
Georgiadis, Loukas |
| Generating Cyclic Rotation Gray Codes for Stamp Foldings and Semi-meanders
|
2023 |
Liu, Bowie |
Tag hinzufügen