| The Micro-world of Cographs
|
2020 |
Alecu, Bogdan |
| On the Complexity of Stackelberg Matroid Pricing Problems
|
2020 |
Böhnlein, Toni |
| Fair Packing of Independent Sets
|
2020 |
Chiarelli, Nina |
| On the Complexity of Singly Connected Vertex Deletion
|
2020 |
Das, Avinandan |
| Equitable d-degenerate Choosability of Graphs
|
2020 |
Drgas-Burchardt, Ewa |
| On the Complexity of BROADCAST DOMINATION and MULTIPACKING in Digraphs
|
2020 |
Foucaud, Florent |
| Bounded Degree Group Steiner Tree Problems
|
2020 |
Kortsarz, Guy |
| Acyclic Matching in Some Subclasses of Graphs
|
2020 |
Panda, B. S. |
| 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. |
| Strongly Stable and Maximum Weakly Stable Noncrossing Matchings
|
2020 |
Hamada, Koki |
Tag hinzufügen