Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 248
Volume 248, October 2018
- Derek G. Corneil, Sang-il Oum, Christophe Paul:
Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015. 1-2 - Lorna Stewart, Richard Anthony Valenzano:
On polygon numbers of circle graphs and distance hereditary graphs. 3-17 - Marcin Jakub Kaminski, Jean-Florent Raymond
, Théophile Trunck:
Well-quasi-ordering H-contraction-free graphs. 18-27 - Stefan Mengel:
Lower bounds on the mim-width of some graph classes. 28-32 - Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic:
1-perfectly orientable K4-minor-free and outerplanar graphs. 33-45 - Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Parameterized complexity of distance labeling and uniform channel assignment problems. 46-55 - Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary:
Parameterized extension complexity of independent set and related problems. 56-67 - Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. 68-78 - Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff, Anthony Perez:
Exact algorithms for weak Roman domination. 79-92 - Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart:
Computing square roots of graphs with low maximum degree. 93-101 - Jisu Jeong, Seongmin Ok, Geewon Suh:
Characterizing graphs of maximum matching width at most 2. 102-113 - Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle:
Maximum matching width: New characterizations and a fast algorithm for dominating set. 114-124 - Bruno Courcelle:
From tree-decompositions to clique-width terms. 125-144 - Andrew Collins, Jan Foniok, Nicholas Korpelainen, Vadim V. Lozin, Victor Zamaraev:
Infinitely many minimal classes of graphs of unbounded clique-width. 145-152 - Eduard Eiben, Robert Ganian, Stefan Szeider:
Meta-kernelization using well-structured modulators. 153-167
a service of 
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-07-31 20:35 CEST 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:
