| 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 |
| 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 |
| Path Cover Problems with Length Cost
|
2022 |
Kobayashi, Kenya |
| From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability
|
2022 |
Bodlaender, Hans L. |
| Reconfiguration of Regular Induced Subgraphs
|
2022 |
Eto, Hiroshi |
| Traversability, Reconfiguration, and Reachability in the Gadget Framework
|
2022 |
Ani, Joshua |
| Aspect Ratio Universal Rectangular Layouts
|
2022 |
Felsner, Stefan |
| Morphing Tree Drawings in a Small 3D Grid
|
2022 |
Istomina, Aleksandra |
| Stream Table: An Area Proportional Visualization for Tables with Flowing Steams
|
2022 |
Espenant, Jared |
Tag hinzufügen