| Some Problems Related to the Space of Optimal Tree Reconeciliations: (Invited Talk)
|
2022 |
Calamonerti, Tiziana |
| The Polygon Burning Problem
|
2022 |
Evans, William |
| Isomorphism Testing for T-graphs in FPT
|
2022 |
Çağırıcı, Deniz Ağaoğlu |
| Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage
|
2022 |
Figueiredo, Celin M. H. de |
| Finding Popular Branchings in Vertex-Weighted Digraphs
|
2022 |
Natsui, Kei |
| Invitation to Combinatorial Reconfigurauon
|
2022 |
Ito, Takehiro |
| Machine Learning Advised Ski Rental Problem with a Discount
|
2022 |
Bhattacharya, Arghyva |
| On the Harmless Set Problem Parameterized by Treewidth
|
2022 |
Gaikwad, Ajinkya |
| Parameterized Complexity of Reconfiguration of Atoms
|
2022 |
Cooper, Alexandre |
| Parameterized Complexity of Minimum Membership Dominating Set
|
2022 |
Agrawal, Akanksha |
| Counting and Sampling Orientations on Chordal Graphs
|
2022 |
Bezáková, Ivona |
| Approximating the Bundled Crossing Number
|
2022 |
Arroyo, Alan |
| 1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
|
2022 |
Srinivasan, Rahnuma Islam Nishat. Venkatesh |
| Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard
|
2022 |
Iwamoto, Chuzo |
| Finding Geometric Representations of Apex Graphs is NP-Hard
|
2022 |
Chakraborty, Dibyayan |
| Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets
|
2022 |
Ani, Joshua |
| An Optimal Tester for k-Linear
|
2022 |
Bshouty, Nader H. |
| Parameterized Complexity of Immunization in the Threshold Model
|
2022 |
Cordasco, Gennaro |
| Vertex-Weighted Graphs: Realizable and Unrealizable Domains
|
2022 |
Bar-Noy, Amotz |
| Hypergraph Representation via Axis-Aligned Point-Subspace Cover
|
2022 |
Firman, Oksana |
Tag hinzufügen