default search action
48th WG 2022: Tübingen, Germany
- Michael A. Bekos
, Michael Kaufmann
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13453, Springer 2022, ISBN 978-3-031-15913-8 - Faisal N. Abu-Khzam
Minimal Roman Dominating Functions: Extensions and Enumeration. 1-15 - Oswin Aichholzer
Disjoint Compatibility via Graph Classes. 16-28 - Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman:
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). 29-42 - Jakub Balabán
Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. 43-55 - Valentin Bartier, Nicolas Bousquet
Token Sliding on Graphs of Girth Five. 56-69 - Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle:
Recognition of Linear and Star Variants of Leaf Powers is in P. 70-83 - Hans L. Bodlaender
Problems Hard for Treewidth but Easy for Stable Gonality. 84-97 - Cornelius Brand
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. 98-113 - Laurent Bulteau
An Algorithmic Framework for Locally Constrained Homomorphisms. 114-128 - Dibyayan Chakraborty
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. 129-143 - Vera Chekan
Polychromatic Colorings of Unions of Geometric Hypergraphs. 144-157 - David Dekker, Bart M. P. Jansen:
Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. 158-172 - Huib Donkers
Finding k-Secluded Trees Faster. 173-186 - Gabriel L. Duarte, Uéverton S. Souza:
On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy. 187-200 - Eduard Eiben
On the Lossy Kernelization for Connected Treedepth Deletion Set. 201-214 - Andreas Emil Feldmann
Generalized k-Center: Distinguishing Doubling and Highway Dimension. 215-229 - Jirí Fiala, Ignaz Rutter
Extending Partial Representations of Circular-Arc Graphs. 230-243 - Mathew C. Francis
Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates. 244-256 - Esther Galby
Parameterized Complexity of Weighted Multicut in Trees. 257-270 - Ina Goeßmann, Jonathan Klawitter
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. 271-286 - Hugo Jacob
Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. 287-299 - Sergei Kiselev
On Anti-stochastic Properties of Unlabeled Graphs. 300-312 - Sándor Kisfaludi-Bak
Computing List Homomorphisms in Geometric Intersection Graphs. 313-327 - Fabian Klute
On Fully Diverse Sets of Geometric Objects and Graphs. 328-341 - Yasuaki Kobayashi
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. 342-355 - R. Krithika
The Complexity of Contracting Bipartite Graphs into Small Cycles. 356-369 - Hélène Langlois
Algorithmic Aspects of Small Quasi-Kernels. 370-382 - Giuseppe Liotta
Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. 383-397 - Barnaby Martin
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. 398-411 - Giacomo Paesani
Classifying Subset Feedback Vertex Set for H-Free Graphs. 412-424 - Robert Scheffler
Linearizing Partial Search Orders. 425-438 - Csaba D. Tóth
Minimum Weight Euclidean (1+ε )-Spanners. 439-452
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-15 01:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: