default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 199
Volume 199, January 2016
- Pinar Heggernes, Andrzej Proskurowski, Dimitrios M. Thilikos:
Foreword: Sixth Workshop on Graph Classes, Optimization, and Width Parameters, Santorini, Greece, October 2013. 1-2
- Flavia Bonomo
, Luciano N. Grippo, Martin Milanic, Martín Darío Safe:
Graph classes with and without powers of bounded clique-width. 3-15 - Robert Brignall, Vadim V. Lozin, Juraj Stacho:
Bichain graphs: Geometric model and universal graphs. 16-29 - Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger:
Enumerating minimal dominating sets in chordal bipartite graphs. 30-36 - Matsuo Konagaya, Yota Otachi, Ryuhei Uehara:
Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs. 37-45 - George B. Mertzios, Shmuel Zaks:
On the intersection of tolerance and cocomparability graphs. 46-88
- Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier:
A tie-break model for graph search. 89-100 - Pierluigi Crescenzi, Pierre Fraigniaud, Magnús M. Halldórsson, Hovhannes A. Harutyunyan, Chiara Pierucci, Andrea Pietracaprina, Geppino Pucci:
On the complexity of the shortest-path broadcast problem. 101-109 - B. S. Panda, Arti Pandey:
Complexity of total outer-connected domination problem in graphs. 110-122 - Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks:
On-line maximum matching in complete multi-partite graphs with an application to optical networks. 123-136 - Mingyu Xiao, Hiroshi Nagamochi:
An exact algorithm for maximum independent set in degree-5 graphs. 137-155
- Zhengbing Bian, Qian-Ping Gu, Mingzhe Zhu:
Practical algorithms for branch-decompositions of planar graphs. 156-171 - Katarína Cechlárová, Eva Potpinková, Ildikó Schlotter:
Refining the complexity of the sports elimination problem. 172-186 - Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer:
Directed elimination games. 187-198 - Itamar Hartstein, Mordechai Shalom, Shmuel Zaks:
On the complexity of the regenerator location problem treewidth and other parameters. 199-225
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-19 00:35 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:
