| 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 |
| 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 |
| Reverse Shortest Path Problem in Weighted Unit-Disk Graphs
|
2022 |
Wang, Haitao |
| Happy Set Problem on Subclasses of Co-comparability Graphs
|
2022 |
Eto, Hiroshi |
| The Complexity of L(p, q)-Edge-Labelling
|
2022 |
Berthe, Gaétan |
| Structural Parameterizations of Budgeted Graph Coloring
|
2022 |
Bandopadhyay, Susobhan |
| Minimum t-Spanners on Subcubic Graphs
|
2022 |
Gómez, Renzo |
| On Approximating Shortest Paths in Weighted Triangular Tessellations
|
2022 |
Bose, Prosenjit |
| 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 |
Tag hinzufügen