| 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 |
| Hardness of Balanced Mobiles
|
2023 |
Martínez, Virginia Ardévol |
| Point Enclosure Problem for Homothetic Polygons
|
2023 |
Akram, Waseem |
| Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness
|
2023 |
Assayakh, Imad |
| Capacity-Preserving Subgraphs of Directed Flow Networks
|
2023 |
Chimani, Markus |
| A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter
|
2023 |
Chakraborty, Dipayan |
| Computing the Center of Uncertain Points on Cactus Graphs
|
2023 |
Hu, Ran |
| Cosecure Domination: Hardness Results and Algorithms
|
2023 |
Kusum |
| Finding Small Complete Subgraphs Efficiently
|
2023 |
Dumitrescu, Adrian |
| Optimal Cost-Based Allocations Under Two-Sided Preferences
|
2023 |
Limaye, Girija |
| Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
|
2023 |
Nozaki, Yuta |
| Burn and Win
|
2023 |
Ashok, Pradeesha |
Tag hinzufügen