default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42. WG 2016: Istanbul, Turkey
- Pinar Heggernes:
Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9941, 2016, ISBN 978-3-662-53535-6 - Michal Debski
, Zbigniew Lonc, Pawel Rzazewski:
Sequences of Radius k for Complete Bipartite Graphs. 1-12 - Jie You, Jianxin Wang, Yixin Cao:
Approximate Association via Dissociation. 13-24 - Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
Geodetic Convexity Parameters for Graphs with Few Short Induced Paths. 25-37 - Andreas Brandstädt, Raffaele Mosca:
Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. 38-49 - Bruno Escoffier:
Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results. 50-61 - Leizhen Cai, Junjie Ye:
Finding Two Edge-Disjoint Paths with Length Constraints. 62-73 - Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
Packing and Covering Immersion Models of Planar Subcubic Graphs. 74-84 - Frédéric Maffray, Lucas Pastor:
The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs. 85-96 - Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
Parameterized Power Vertex Cover. 97-108 - Jan Goedgebeur, Oliver Schaudt:
Exhaustive Generation of k-Critical ℋ-Free Graphs. 109-120 - Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
Induced Separation Dimension. 121-132 - Rajesh Chitnis, Lior Kamma, Robert Krauthgamer:
Tight Bounds for Gomory-Hu-like Cut Counting. 133-144 - Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed:
Eccentricity Approximating Trees - Extended Abstract. 145-157 - Linda Kleist:
Drawing Planar Graphs with Prescribed Face Areas. 158-170 - Fedor V. Fomin, Torstein J. F. Strømme:
Vertex Cover Structural Parameterization Revisited. 171-182 - Pedro Montealegre, Ioan Todinca:
On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. 183-194 - Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. 195-206 - Martin Pergel, Pawel Rzazewski:
On Edge Intersection Graphs of Paths with 2 Bends. 207-219 - Mingyu Xiao, Shaowei Kou:
Almost Induced Matching: Linear Kernels and Parameterized Algorithms. 220-232 - Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. 233-244 - Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale:
Harmonious Coloring: Parameterized Algorithms and Upper Bounds. 245-256 - Ondrej Suchý:
On Directed Steiner Trees with Multiple Roots. 257-268 - M. S. Ramanujan:
A Faster Parameterized Algorithm for Group Feedback Edge Set. 269-281 - Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer:
Sequence Hypergraphs. 282-294 - Kunal Dutta, Arijit Ghosh:
On Subgraphs of Bounded Degeneracy in Hypergraphs. 295-306
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 2025-02-05 20:18 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:
