| 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 |
| 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 |
| Multi-priority Graph Sparsification
|
2023 |
Ahmed, Reyan |
Tag hinzufügen