| 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. |
| 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 |
Tag hinzufügen