Finding Popular Branchings in Vertex-Weighted Digraphs

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:WALCOM (16. : 2022 : Jember) WALCOM: Algorithms and Computation
1. Verfasser: Natsui, Kei (VerfasserIn)
Weitere Verfasser: Takazawa, Kenjiro (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2022
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
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
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
Some Problems Related to the Space of Optimal Tree Reconeciliations: (Invited Talk) 2022 Calamonerti, Tiziana
Alle Artikel auflisten