| On Proper Labellings of Graphs with Minimum Label Sum
|
2020 |
Bensmail, Julien |
| Further Results on Online Node- and Edge-Deletion Problems with Advice
|
2020 |
Chen, Li-Hsuan |
| Polynomial Time Algorithms for Tracking Path Problems
|
2020 |
Choudhary, Pratibha |
| Iterated Type Partitions
|
2020 |
Cordasco, Gennaro |
| New Bounds for Maximizing Revenue in Online Dial-a-Ride
|
2020 |
Christman, Ananya |
| Skyline Computation with Noisy Comparisons
|
2020 |
Groz, Benoît |
| Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
|
2020 |
Hasunuma, Toru |
| Between Proper and Strong Edge-Colorings of Subcubic Graphs
|
2020 |
Hocquard, Hervé |
| Algorithms for Constructing Anonymizing Arrays
|
2020 |
Lanus, Erin |
| Coordinating Swarms of Objects at Extreme Dimensions
|
2020 |
Fekete, Sándor P. |
| Parameterized Complexity of (A,ℓ) -Path Packing
|
2020 |
Belmonte, Rémy |
| Edge-Disjoint Branchings in Temporal Graphs
|
2020 |
Campos, Victor |
| Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges
|
2020 |
Damaschke, Peter |
| The Steiner Problem for Count Matroids
|
2020 |
Jordán, Tibor |
| A Family of Tree-Based Generators for Bubbles in Directed Graphs
|
2020 |
Acuña, Vicente |
| Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
|
2020 |
Blanché, Alexandre |
| Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
|
2020 |
Bright, Curtis |
| Optimal In-place Algorithms for Basic Graph Problems
|
2020 |
Chakraborty, Sankardeep |
| Two Robots Patrolling on a Line: Integer Version and Approximability
|
2020 |
Damaschke, Peter |
| A Parameterized Perspective on Attacking and Defending Elections
|
2020 |
Gowda, Kishen N. |
Tag hinzufügen