default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID45th WG 2019: Vall de Núria, Spain
- Ignasi Sau
, Dimitrios M. Thilikos:
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers. Lecture Notes in Computer Science 11789, Springer 2019, ISBN 978-3-030-30785-1 - Karolina Okrasa, Pawel Rzazewski:
Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs. 1-13 - Guillaume Ducoffe:
The 4-Steiner Root Problem. 14-26 - Bart M. P. Jansen, László Kozma, Jesper Nederlof:
Hamiltonicity Below Dirac's Condition. 27-39 - Ararat Harutyunyan, Michael Lampis, Vadim V. Lozin, Jérôme Monnot:
Maximum Independent Sets in Subcubic Graphs: New Results. 40-52 - Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht:
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. 53-65 - Étienne Bamas, Louis Esperet:
Local Approximation of the Maximum Cut in Regular Graphs. 66-78 - Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik:
Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. 79-92 - Torben Hagerup:
Fast Breadth-First Search in Still Less Space. 93-105 - Huib Donkers, Bart M. P. Jansen:
A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free Deletion. 106-119 - Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip Distances Between Graph Orientations. 120-134 - Bogdan Alecu, Aistis Atminas, Vadim V. Lozin:
Graph Functionality. 135-147 - Ivan Bliznets, Danil Sagunov:
On Happy Colorings, Cuts, and Structural Parameterizations. 148-161 - Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler:
Shortest Reconfiguration of Matchings. 162-174 - Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann:
Travelling on Graphs with Small Highway Dimension. 175-189 - Robert Ganian, Sebastian Ordyniak:
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. 190-204 - Patrizio Angelini, Michael A. Bekos, Martin Gronemann, Antonios Symvonis:
Geometric Representations of Dichotomous Ordinal Data. 205-217 - Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset:
Linear MIM-Width of Trees. 218-231 - Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee:
Approximating Minimum Dominating Set on String Graphs. 232-243 - Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath:
Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. 244-257 - Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw:
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. 258-270 - Edin Husic, Martin Milanic:
A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs. 271-284 - Rémy Belmonte, Tesshu Hanaka, Michael Lampis, Hirotaka Ono, Yota Otachi:
Independent Set Reconfiguration Parameterized by Modular-Width. 285-297 - Martin E. Dyer, Catherine S. Greenhill, Haiko Müller:
Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. 298-310 - Steven Chaplick:
Intersection Graphs of Non-crossing Paths. 311-324 - Rahnuma Islam Nishat, Sue Whitesides:
Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs. 325-337 - Jan Böker:
Color Refinement, Homomorphisms, and Hypergraphs. 338-350 - Daniel Gonçalves:
3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes. 351-363 - Hubie Chen, Radu Curticapean, Holger Dell:
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. 364-378 - Martin Milanic, Nevena Pivac:
Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. 379-391
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-01-29 21:24 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:
