default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 168
Volume 168, May 2014
- Pinar Heggernes
, Jan Kratochvíl, Sang-il Oum:
Guest editors' foreword. 1-2
- Isolde Adler, Arthur M. Farley, Andrzej Proskurowski:
Obstructions for linear rank-width at most 1. 3-13 - Steven Chaplick, Juraj Stacho:
The vertex leafage of chordal graphs. 14-25 - Van Bang Le:
On opposition graphs, coalition graphs, and bipartite permutation graphs. 26-33 - Nestor V. Nestoridis, Dimitrios M. Thilikos:
Square roots of minor closed graph classes. 34-39
- Jérémie Chalopin, Daniël Paulusma:
Packing bipartite graphs with covers of complete bipartite graphs. 40-50 - Philipp Klaus Krause:
The complexity of register allocation. 51-59 - Mathieu Liedloff, Ioan Todinca, Yngve Villanger:
Solving Capacitated Dominating Set by using covering by subsets and maximum matching. 60-68 - Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki:
Approximating the path-distance-width for AT-free graphs and graphs in related classes. 69-77
- Henning Fernau, Daniel Meister:
Digraphs of bounded elimination width. 78-87 - Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith:
Digraph width measures in parameterized algorithmics. 88-107 - O-joung Kwon, Sang-il Oum:
Graphs of small rank-width are pivot-minors of graphs of small tree-width. 108-118 - Guillem Perarnau, Oriol Serra:
On the tree-depth of random graphs. 119-126
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 2026-08-29 00:18 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
