Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 278
Volume 278, May 2020
- Derek G. Corneil, Robert Ganian, Andrzej Proskurowski:
Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada. 1-2 - Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei
:
Enumeration of minimal connected dominating sets for chordal graphs. 3-11 - Bart M. P. Jansen, Jules J. H. M. Wulms:
Lower bounds for protrusion replacement by counting equivalence classes. 12-27 - Dimitris Chatzidimitriou, Dimitrios M. Thilikos, Dimitris Zoros:
Sparse obstructions for minor-covering parameters. 28-50 - Tomás Masarík, Tomás Toufar:
Parameterized complexity of fair deletion problems. 51-61 - Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul:
On independent set in B1-EPG graphs. 62-72 - Van Bang Le, Florian Pfender:
Color-line and proper color-line graphs. 73-82 - Andreas Brandstädt, Raffaele Mosca:
Dominating induced matchings in S1, 2, 4-free graphs. 83-92 - Bruno Courcelle:
Grammars and clique-width bounds from split decompositions. 93-117 - Bruno Courcelle:
On quasi-planar graphs: Clique-width and logical description. 118-135 - Philipp Klaus Krause, Lukas Larisch, Felix Salfelder:
The tree-width of C. 136-152 - Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Mim-Width I. Induced path problems. 153-168
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-04-24 23:22 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:
