default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 231
Volume 231, November 2017
- Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma
, Primoz Potocnik, Nicolas Trotignon:
Preface: Algorithmic Graph Theory on the Adriatic Coast. 1-3
- Vadim V. Lozin:
From matchings to independent sets. 4-14 - Sang-il Oum:
Rank-width: Algorithmic and structural results. 15-24 - Jean-Florent Raymond, Dimitrios M. Thilikos:
Recent techniques and results on the Erdős-Pósa property. 25-43
- M. P. Álvarez-Ruiz, T. Mediavilla-Gradolph, Seyed Mahmoud Sheikholeslami, Juan Carlos Valenzuela-Tripodoro, Ismael González Yero:
On the strong Roman domination number of graphs. 44-59 - Gabriela Araujo-Pardo, Christian Rubio-Montiel:
Pseudoachromatic and connected-pseudoachromatic indices of the complete graph. 60-66 - Arijit Bishnu, Arijit Ghosh, Subhabrata Paul:
Linear kernels for k-tuple and liar's domination in bounded genus graphs. 67-77 - Édouard Bonnet, Florian Sikora:
The Graph Motif problem parameterized by the structure of the input graph. 78-94 - Paul S. Bonsma:
Rerouting shortest paths in planar graphs. 95-112 - Christoph Brause:
A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs. 113-118 - Andrej Brodnik, Marko Grgurovic:
Solving all-pairs shortest path by single-source computations: Theory and practice. 119-130 - Csilla Bujtás, Zsolt Tuza:
F-WORM colorings: Results for 2-connected graphs. 131-138 - Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The shortest connection game. 139-154 - Ali Dehghan, Mohammad-Reza Sadeghi:
Colorful edge decomposition of graphs: Some polynomial cases. 155-165 - Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia:
Characterizations of (4K1, C4, C5)-free graphs. 166-174 - Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Two more characterizations of König-Egerváry graphs. 175-180 - Van Bang Le, Sheng-Lung Peng:
Good characterizations and linear time recognition for 2-probe block graphs. 181-189 - Nacho López, Hebert Pérez-Rosés, Jordi Pujolàs:
The Degree/Diameter Problem for mixed abelian Cayley graphs. 190-197 - Frédéric Maffray, Lucas Pastor:
4-coloring (P6, bull)-free graphs. 198-210 - Marcin Pilipczuk:
A tight lower bound for Vertex Planarization on graphs of bounded treewidth. 211-216 - Aleksander Vesel:
Regular coronoids and 4-tilings. 217-227 - Vera Weil, Oliver Schaudt:
On bounding the difference between the maximum degree and the chromatic number by a constant. 228-234
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-12-04 01:28 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:
